conftrace_
← Computer Science
Computer Science ›

Foundations

1,623 papers (0 classified directly here)

Subtopics

Algorithms (1,298) Graph Theory (190) Formal Languages (113) Programming Languages (46) Data Structures (39)

Papers per year

1
7
34
188
122
'05
'10
'15
'20
'25

Papers (including subtopics)

Satisfiability and Algorithms for Non-uniform Random k-SAT AAAI 2021
Extreme k-Center Clustering AAAI 2021
Rejection Sampling for Weighted Jaccard Similarity Revisited AAAI 2021
Hybrid-order Stochastic Block Model AAAI 2021
Persuading Voters in District-based Elections AAAI 2021
Proportional Representation under Single-Crossing Preferences Revisited AAAI 2021
Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable AAAI 2021
Present-Biased Optimization AAAI 2021
Facility’s Perspective to Fair Facility Location Problems AAAI 2021
Targeted Negative Campaigning: Complexity and Approximations AAAI 2021
Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility AAAI 2021
SMT-based Safety Checking of Parameterized Multi-Agent Systems AAAI 2021
Parameterized Logical Theories AAAI 2021
GENSYNTH: Synthesizing Datalog Programs without Language Bias AAAI 2021
The Parameterized Complexity of Clustering Incomplete Data AAAI 2021
Deep Graph Spectral Evolution Networks for Graph Topological Evolution AAAI 2021
Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization AAAI 2021
Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices AAAI 2021
Objective-Based Hierarchical Clustering of Deep Embedding Vectors AAAI 2021
Approximate Multiplication of Sparse Matrices with Limited Space AAAI 2021
Improving Continuous-time Conflict Based Search AAAI 2021
Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search AAAI 2021
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses AAAI 2021
Saturated Post-hoc Optimization for Classical Planning AAAI 2021
On the Optimal Efficiency of A* with Dominance Pruning AAAI 2021