Discrete Mathematics

Geometric All-way Boolean Tensor Decomposition NeurIPS 2020 Hard Examples for Common Variable Decision Heuristics AAAI 2020 It’s Not What Machines Can Learn, It’s What We Cannot Teach ICML 2020 Knowing-How under Uncertainty (Extended Abstract) IJCAI 2020 Learning Selection Strategies in Buchberger’s Algorithm ICML 2020 Lifting Preferences over Alternatives to Preferences over Sets of Alternatives: The Complexity of Recognizing Desirable Families of Sets AAAI 2020 Lower Bounds and Faster Algorithms for Equality Constraints IJCAI 2020 Maximum Nash Welfare and Other Stories About EFX IJCAI 2020 On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness AISTATS 2020 On Swap Convexity of Voting Rules AAAI 2020 On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules IJCAI 2020 On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank AAAI 2020 On the Splitting Property for Epistemic Logic Programs (Extended Abstract) IJCAI 2020 Optimal approximation for unconstrained non-submodular minimization ICML 2020 Parameterized Algorithms for Finding a Collective Set of Items AAAI 2020 Parameterized Complexity of Envy-Free Resource Allocation in Social Networks AAAI 2020 Polytime Decomposition of Generalized Submodular Base Polytopes with Efficient Sampling ACML 2020 Poset Representations for Sets of Elementary Triplets PGM 2020 Pure-Past Linear Temporal and Dynamic Logic on Finite Traces IJCAI 2020 Quadratic Decomposable Submodular Function Minimization: Theory and Practice JMLR 2020 Ranking-Based Semantics for Sets of Attacking Arguments AAAI 2020 Ranking Semantics for Argumentation Systems With Necessities IJCAI 2020 Rational Closure For All Description Logics (Extended Abstract) IJCAI 2020 Recent Developments in Boolean Matrix Factorization IJCAI 2020 Reducibility and Statistical-Computational Gaps from Secret Leakage COLT 2020