1: Mix and Match: Markov Chains & Mixing Times for Matching in Rideshare
2: Spectral Alignment of Correlated Gaussian matrices
3: Scalable Graph Algorithms
4: On Multi-Cascade Influence Maximization: Model, Hardness and Algorithmic Framework
5: Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
6: Noisy, Greedy and Not So Greedy k-means++
7: An improved approximation algorithm for ATSP
8: PTAS for Steiner Tree on Map Graphs
9: Concave connection cost Facility Location and the Star Inventory Routing problem
10: On Clearing Prices in Matching Markets: A Simple Characterization without Duality
11: Improved Algorithm for Tolerant Junta Testing
12: GGNN: Graph-based GPU Nearest Neighbor Search
13: On the query complexity of estimating the distance to hereditary graph properties
14: The Polynomial Transform
15: Approximating Star Cover Problems
16: Faster Lattice Enumeration
17: Soft robust solutions to possibilistic optimization problems
18: Learning Multi-dimensional Indexes
19: Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization
20: Popular Branchings and Their Dual Certificates
21: Mining Top-k Trajectory-Patterns from Anonymized Data
22: A New Paradigm for Identifying Reconciliation-Scenario Altering Mutations Conferring Environmental Adaptation
23: On Computing the Hamiltonian Index of Graphs
24: Assessing the best edit in perturbation-based iterative refinement algorithms to compute the median string
25: Smoothing the gap between NP and ER
26: Sub-linear RACE Sketches for Approximate Kernel Density Estimation on Streaming Data
27: Power of Pre-Processing: Production Scheduling with Variable Energy Pricing and Power-Saving States
28: Complexity of a Root Clustering Algorithm
29: Algorithm for Finding the Maximum Clique Based on Continuous Time Quantum Walk
30: Efficient Deterministic Distributed Coloring with Small Bandwidth
31: Settling the relationship between Wilber’s bounds for dynamic optimality
32: Pinning Down the Strong Wilber 1 Bound for Binary Search Trees
33: Lower Bounds for Compressed Sensing with Generative Models
34: On the Complexity of the Stability Problem of Binary Freezing Totalistic Cellular Automata
35: Constructive derandomization of query algorithms
36: Scheduling on Hybrid Platforms: Improved Approximability Window
37: Parameterized Complexity of Partial Scheduling
38: General Multi-State Rework Network and Reliability Algorithm
39: Online Vector Balancing and Geometric Discrepancy
40: Parameterized Algorithms for MILPs with Small Treedepth