Skip to content
conftrace_

Discrete Mathematics

489 papers

1
1
10
55
44
'5
'10
'15
'20
'25

Papers

Cost-Free Neutrality for the River Method AAAI 2026 Discounted Cuts: A Stackelberg Approach to Network Disruption AAAI 2026 EFX and PO Allocation Exists for Two Types of Goods AAAI 2026 Exclusion Zones of Instant Runoff Voting AAAI 2026 Faster Symmetry Breaking Constraints for Abstract Structures AAAI 2026 Higher-Order Responsibility AAAI 2026 Identifying Imperfect Clones in Elections AAAI 2026 Multiple-Interval Coverage for Resource Management of Passive Surveillance Systems AAAI 2026 Private Frequency Estimation via Residue Number Systems AAAI 2026 The River Voting Method AAAI 2026 Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming AAAI 2026 What Voting Rules Actually Do: A Data-Driven Analysis of Multi-Winner Voting AAAI 2026 40 Years of Research in Possibilistic Logic – a Survey IJCAI 2025 Adaptive Manipulation for Coalitions in Knockout Tournaments AAAI 2025 A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds IJCAI 2025 A Game-Theoretic Perspective on Inconsistency Handling IJCAI 2025 Analyzing and generating English phrases with finite-state methods to match and translate inflected Plains Cree word-forms NAACL 2025 An And-Sum Circuit with Signed Edges That Is More Succinct than SDD AAAI 2025 Anchor Search: A Unified Framework for Suboptimal Bidirectional Search AAAI 2025 An Efficient Core-Guided Solver for Weighted Partial MaxSAT IJCAI 2025 An Extension-Based Argument-Ranking Semantics: Social Rankings in Abstract Argumentation AAAI 2025 A SAT-based Method for Counting All Singleton Attractors in Boolean Networks IJCAI 2025 Cirbo: A New Tool for Boolean Circuit Analysis and Synthesis AAAI 2025 Complete Symmetry Breaking for Finite Models AAAI 2025 Computationally Hard Problems Are Hard for QBF Proof Systems Too AAAI 2025