conftrace_
← Mathematics
Mathematics & Optimization › Mathematics ›

Discrete Mathematics

484 papers

Papers per year

1
1
10
55
42
'05
'10
'15
'20
'25

Papers

The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood COLT 2021
Calculating the optimal step of arc-eager parsing for non-projective trees EACL 2021
A New Representation for Span-based CCG Parsing EMNLP 2021
Unitary Branching Programs: Learnability and Lower Bounds ICML 2021
Efficient Message Passing for 0–1 ILPs with Binary Decision Diagrams ICML 2021
Diversity in Kemeny Rank Aggregation: A Parameterized Approach IJCAI 2021
PROPm Allocations of Indivisible Goods to Multiple Agents IJCAI 2021
Kemeny Consensus Complexity IJCAI 2021
New Algorithms for Japanese Residency Matching IJCAI 2021
Improved CP-Based Lagrangian Relaxation Approach with an Application to the TSP IJCAI 2021
Decomposition Strategies to Count Integer Solutions over Linear Constraints IJCAI 2021
Computing Optimal Hypertree Decompositions with SAT IJCAI 2021
Best-Effort Synthesis: Doing Your Best Is Not Harder Than Giving Up IJCAI 2021
Choice Logics and Their Computational Properties IJCAI 2021
Budget-Constrained Coalition Strategies with Discounting IJCAI 2021
How Hard to Tell? Complexity of Belief Manipulation Through Propositional Announcements IJCAI 2021
Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach IJCAI 2021
Decomposition-Guided Reductions for Argumentation and Treewidth IJCAI 2021
Updating the Belief Promotion Operator IJCAI 2021
Compressing Exact Cover Problems with Zero-suppressed Binary Decision Diagrams IJCAI 2021
Ranking Extensions in Abstract Argumentation IJCAI 2021
Skeptical Reasoning with Preferred Semantics in Abstract Argumentation without Computing Preferred Extensions IJCAI 2021
Minimization of Limit-Average Automata IJCAI 2021
Fast Algorithms for Relational Marginal Polytopes IJCAI 2021
Tournaments in Computational Social Choice: Recent Developments IJCAI 2021