Discrete Mathematics
489 papers
Papers per year
1
1
2
1
1
4
7
5
7
10
2
29
33
50
55
60
44
58
63
44
12
'5
'10
'15
'20
'25
Papers
Robust Sequence Submodular Maximization
NeurIPS 2020
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems
IJCAI 2020
Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions
IJCAI 2020
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
IJCAI 2020
Stable Roommate Problem with Diversity Preferences
IJCAI 2020
Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization
AISTATS 2020
Temporal Relations Annotation and Extrapolation Based on Semi-intervals and Boundig Relations
COLING 2020
The Complexity of Election Problems with Group-Separable Preferences
IJCAI 2020
To compress or not to compress? A Finite-State approach to Nen verbal morphology
ACL 2020
Towards a Combinatorial Characterization of Bounded-Memory Learning
NeurIPS 2020
Variable Elimination in Binary CSPs (Extended Abstract)
IJCAI 2020
A Better Algorithm for Societal Tradeoffs
AAAI 2019
Action-Sensitive Phonological Dependencies
ACL 2019
Adaptive Sequence Submodularity
NeurIPS 2019
A Framework for Approval-Based Budgeting Methods
AAAI 2019
Aggregating Incomplete Pairwise Preferences by Weight
IJCAI 2019
An Ordinal Banzhaf Index for Social Ranking
IJCAI 2019
Answer Set Programming for Judgment Aggregation
IJCAI 2019
A Parameterized Perspective on Protecting Elections
IJCAI 2019
Approval-Based Elections and Distortion of Voting Rules
IJCAI 2019
Approximating the Permanent by Sampling from Adaptive Partitions
NeurIPS 2019
A Quantitative Analysis of Multi-Winner Rules
IJCAI 2019
A Recursive Algorithm for Projected Model Counting
AAAI 2019
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples
AAAI 2019
Best Answers over Incomplete Data : Complexity and First-Order Rewritings
IJCAI 2019