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
Linear-Time Verification of Data-Aware Dynamic Systems with Arithmetic
AAAI 2022
Liquid Democracy with Ranked Delegations
AAAI 2022
Locally Fair Partitioning
AAAI 2022
LTL on Weighted Finite Traces: Formal Foundations and Algorithms
IJCAI 2022
Modeling Abstract Algebra as an OWL Ontology (Student Abstract)
AAAI 2022
Multi-winner approval voting goes epistemic
UAI 2022
On the Complexity of Inductively Learning Guarded Clauses
AAAI 2022
On the Ordinal Invariance of Power Indices on Coalitional Games
IJCAI 2022
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs
AAAI 2022
Proportional Budget Allocations: Towards a Systematization
IJCAI 2022
Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination
AAAI 2022
Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach
AAAI 2022
Resolving the data ambiguity for periodic crystals
NeurIPS 2022
Search Strategies for Topological Network Optimization
AAAI 2022
SIGMORPHON 2022 Shared Task on Morpheme Segmentation Submission Description: Sequence Labelling for Word-Level Morpheme Segmentation
NAACL 2022
Sparsification of Decomposable Submodular Functions
AAAI 2022
The Egocentric Logic of Preferences
IJCAI 2022
The Query Complexity of Cake Cutting
NeurIPS 2022
The Triangle-Densest-K-Subgraph Problem: Hardness, Lovász Extension, and Application to Document Summarization
AAAI 2022
Trees probe deeper than strings: an argument from allomorphy
NAACL 2022
Voting in Two-Crossing Elections
IJCAI 2022
A Complexity-theoretic Analysis of Green Pickup-and-Delivery Problems
AAAI 2021
A New Representation for Span-based CCG Parsing
EMNLP 2021
An FST morphological analyzer for the Gitksan language
ACL 2021
An Improved Upper Bound for SAT
AAAI 2021