Algorithms

Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable AAAI 2021 Computing Optimal Hypertree Decompositions with SAT IJCAI 2021 Connect Multi-Agent Path Finding: Generation and Visualization IJCAI 2021 Consensus Maximisation Using Influences of Monotone Boolean Functions CVPR 2021 Constraint-Driven Learning of Logic Programs AAAI 2021 Crossing Cuts Polygonal Puzzles: Models and Solvers CVPR 2021 Cyclically Equivariant Neural Decoders for Cyclic Codes ICML 2021 Deep Hough Voting for Robust Global Registration ICCV 2021 Deep Latent Graph Matching ICML 2021 DEEPSPLIT: An Efficient Splitting Method for Neural Network Verification via Indirect Effect Analysis IJCAI 2021 Dimensionality Reduction for the Sum-of-Distances Metric ICML 2021 Diversity in Kemeny Rank Aggregation: A Parameterized Approach IJCAI 2021 Dynamic Proportional Rankings IJCAI 2021 Dynamic Tensor Rematerialization ICLR 2021 Efficient and Local Parallel Random Walks NeurIPS 2021 Efficient Coreset Constructions via Sensitivity Sampling ACML 2021 Efficient Deformable Shape Correspondence via Multiscale Spectral Manifold Wavelets Preservation CVPR 2021 Efficient Large Scale Inlier Voting for Geometric Vision Problems ICCV 2021 Efficiently Explaining CSPs with Unsatisfiable Subset Optimization IJCAI 2021 Efficient Sampling of Dependency Structure EMNLP 2021 End-to-End Constrained Optimization Learning: A Survey IJCAI 2021 Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules IJCAI 2021 Exact Acceleration of K-Means++ and K-Means|| IJCAI 2021 Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries COLT 2021 Exponentially Improved Dimensionality Reduction for l1: Subspace Embeddings and Independence Testing COLT 2021