Foundations

Complete Symmetry Breaking for Finite Models AAAI 2025 Computational Explorations of Total Variation Distance ICLR 2025 Computationally Hard Problems Are Hard for QBF Proof Systems Too AAAI 2025 Computing Voting Rules with Improvement Feedback ICML 2025 Coreset Spectral Clustering ICLR 2025 Correspondence-Free Fast and Robust Spherical Point Pattern Registration ICCV 2025 Counting Graphlets of Size k under Local Differential Privacy AISTATS 2025 CRANE: Reasoning with constrained LLM generation ICML 2025 Curriculum Coarse-to-Fine Selection for High-IPC Dataset Distillation CVPR 2025 Decentralized, Epoch-based F2FS Journaling with Fine-grained Crash Recovery OSDI 2025 Densest k-Subgraph Mining via a Provably Tight Relaxation AAAI 2025 Density-Dependent Group Testing AISTATS 2025 Detecting Arbitrary Planted Subgraphs in Random Graphs COLT 2025 Differentiable Quadratic Optimization For the Maximum Independent Set Problem ICML 2025 Differentially Private Graph Data Release: Inefficiencies & Unfairness AISTATS 2025 Discrepancy Minimization in Input-Sparsity Time ICML 2025 DiskVPS: Vanishing Point Detector via Hough Transform in a Disk Region CVPR 2025 Distance Estimation for High-Dimensional Discrete Distributions AISTATS 2025 Dynamic angular synchronization under smoothness constraints JMLR 2025 Dynamic DBSCAN with Euler Tour Sequences AISTATS 2025 Dynamic Maintenance of Kernel Density Estimation Data Structure: From Practice to Theory UAI 2025 Dynamic Seed-GrowthCM: A Dynamic Benefit-Oriented Algorithm for Core Maximization on Large Graphs IJCAI 2025 Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges ICML 2025 Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation ICLR 2025 Efficient and Rigorous Model-Agnostic Explanations IJCAI 2025