← Mathematics
Mathematics & Optimization › Mathematics ›

Discrete Mathematics

458 directly classified papers

Papers per year

Papers

Kemeny Consensus Complexity IJCAI 2021
Ranking Extensions in Abstract Argumentation IJCAI 2021
Fast Algorithms for Relational Marginal Polytopes IJCAI 2021
An Improved Upper Bound for SAT AAAI 2021
Improved CP-Based Lagrangian Relaxation Approach with an Application to the TSP IJCAI 2021
Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components NIPS 2021
Proportional Representation under Single-Crossing Preferences Revisited AAAI 2021
Updating the Belief Promotion Operator IJCAI 2021
On the Complexity of Sum-of-Products Problems over Semirings AAAI 2021
Network Satisfaction for Symmetric Relation Algebras with a Flexible Atom AAAI 2021
On the Complexity of Finding Justifications for Collective Decisions AAAI 2021
The Power of Literal Equivalence in Model Counting AAAI 2021
Decomposition-Guided Reductions for Argumentation and Treewidth IJCAI 2021
A SAT-based Resolution of Lam's Problem AAAI 2021
Cluster Trellis: Data Structures & Algorithms for Exact Inference in Hierarchical Clustering AISTATS 2021
Unitary Branching Programs: Learnability and Lower Bounds ICML 2021
Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach IJCAI 2021
On Swap Convexity of Voting Rules AAAI 2020
Maximum Nash Welfare and Other Stories About EFX IJCAI 2020
Early and Efficient Identification of Useless Constraint Propagation for Alldifferent Constraints IJCAI 2020
Fast and Parallel Decomposition of Constraint Satisfaction Problems IJCAI 2020
Deductive Module Extraction for Expressive Description Logics IJCAI 2020
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems IJCAI 2020
Lower Bounds and Faster Algorithms for Equality Constraints IJCAI 2020
Recent Developments in Boolean Matrix Factorization IJCAI 2020