← Mathematics
Mathematics & Optimization › Mathematics ›

Discrete Mathematics

458 directly classified papers

Papers per year

Papers

Exploiting Symmetries in MUS Computation AAAI 2025
The Proportional Veto Principle for Approval Ballots IJCAI 2025
Linear Equations with Min and Max Operators: Computational Complexity AAAI 2025
On Middle Grounds for Preference Statements IJCAI 2025
Finding Possible Winners in Spatial Voting with Incomplete Information IJCAI 2025
Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time AAAI 2025
EF1 and EFX Orientations IJCAI 2025
Proof Simulation via Round-based Strategy Extraction for QBF AAAI 2025
Verified Certificates via SAT and Computer Algebra Systems for the Ramsey R(3,8) and R(3,9) Problems IJCAI 2025
LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces IJCAI 2025
An Efficient Core-Guided Solver for Weighted Partial MaxSAT IJCAI 2025
A SAT-based Method for Counting All Singleton Attractors in Boolean Networks IJCAI 2025
Distances Between Top-Truncated Elections of Different Sizes AAAI 2025
Tensor Decomposition Meets Knowledge Compilation: A Study Comparing Tensor Trains with OBDDs AAAI 2025
Anchor Search: A Unified Framework for Suboptimal Bidirectional Search AAAI 2025
Epistemic EFX Allocations Exist for Monotone Valuations AAAI 2025
Towards Projected and Incremental Pseudo-Boolean Model Counting AAAI 2025
Improved Maximin Share Approximations for Chores by Bin Packing AAAI 2025
The Complexity of Extending Fair Allocations of Indivisible Goods AAAI 2025
Understanding EFX Allocations: Counting and Variants AAAI 2025
The (Exact) Price of Cardinality for Indivisible Goods: A Parametric Perspective AAAI 2025
40 Years of Research in Possibilistic Logic – a Survey IJCAI 2025
Complete Symmetry Breaking for Finite Models AAAI 2025
Shield Synthesis for LTL Modulo Theories AAAI 2025
Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking AAAI 2025