Foundations

Solving Multiagent Path Finding on Highly Centralized Networks AAAI 2025 Solving QNP and FOND+ with Generating, Testing and Forbidding IJCAI 2025 Solving Satisfiability Modulo Counting Exactly with Probabilistic Circuits ICML 2025 Some easy optimization problems have the overlap-gap property COLT 2025 Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs ICML 2025 Sound Over-Approximation of Equational Reasoning with Variable-Preserving Rules Parameterized by Derivation Depth AAAI 2025 Spectral Sensitivity Estimation with an Uncalibrated Diffraction Grating ICCV 2025 Speedup Techniques for Switchable Temporal Plan Graph Optimization AAAI 2025 Streaming Algorithms For ℓ_p Flows and ℓ_p Regression ICLR 2025 Streaming Multi-agent Pathfinding IJCAI 2025 StutterCut: Uncertainty-Guided Normalised Cut for Dysfluency Segmentation Interspeech 2025 Suboptimal Search with Dynamic Distribution of Suboptimality AAAI 2025 SubSearch: Robust Estimation and Outlier Detection for Stochastic Block Models via Subgraph Search AISTATS 2025 Symbolic Functional Decomposition: A Reconfiguration Approach AAAI 2025 System-Aware Unlearning Algorithms: Use Lesser, Forget Faster ICML 2025 Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time AAAI 2025 Testing Juntas and Junta Subclasses with Relative Error COLT 2025 Testing Thresholds and Spectral Properties of High-Dimensional Random Toroidal Graphs via Edgeworth-Style Expansions COLT 2025 The Complexity of Extending Fair Allocations of Indivisible Goods AAAI 2025 The Computational Complexity of Positive Non-Clashing Teaching in Graphs ICLR 2025 The Fundamental Limits of Recovering Planted Subgraphs (extended abstract) COLT 2025 The Generalized Skew Spectrum of Graphs ICML 2025 The Impact of Literal Sorting on Cardinality Constraint Encodings AAAI 2025 The Limits of Tractable Marginalization ICML 2025 Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization AISTATS 2025