Algorithms

Fully Dynamic Submodular Maximization over Matroids ICML 2023 Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization COLT 2023 GNN&GBDT-Guided Fast Optimizing Framework for Large-scale Integer Programming ICML 2023 GRACE-C: Generalized Rate Agnostic Causal Estimation via Constraints ICLR 2023 Graphs, Constraints, and Search for the Abstraction and Reasoning Corpus AAAI 2023 Harnessing the power of choices in decision tree learning NeurIPS 2023 Improved Algorithms for Maximum Satisfiability and Its Special Cases AAAI 2023 Improved Algorithms for White-Box Adversarial Streams ICML 2023 Improved Frequency Estimation Algorithms with and without Predictions NeurIPS 2023 Incremental Event Calculus for Run-Time Reasoning (Extended Abstract) IJCAI 2023 Intelligent Planning for Large-Scale Multi-Robot Coordination AAAI 2023 Intersection Coordination with Priority-Based Search for Autonomous Vehicles AAAI 2023 Is Planted Coloring Easier than Planted Clique? COLT 2023 KwikBucks: Correlation Clustering with Cheap-Weak and Expensive-Strong Signals ICLR 2023 LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding AAAI 2023 LambdaBeam: Neural Program Search with Higher-Order Functions and Lambdas NeurIPS 2023 Learning Program Synthesis for Integer Sequences from Scratch AAAI 2023 Learning the Positions in CountSketch ICLR 2023 Learning to Configure Separators in Branch-and-Cut NeurIPS 2023 Learning to Count Isomorphisms with Graph Neural Networks AAAI 2023 Local Vertex Colouring Graph Neural Networks ICML 2023 Mini-batch k-means terminates within O(d/ε) iterations ICLR 2023 Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints ICML 2023 Minimal Solutions to Uncalibrated Two-view Geometry with Known Epipoles ICCV 2023 Minimizing Reachability Times on Temporal Graphs via Shifting Labels IJCAI 2023