1: Data-Dependent Coresets for Compressing Neural Networks with Applications to Generalization Bounds
2: An Algorithm for Generating Strongly Chordal Graphs
3: Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time
4: A Weighted Generalization of the Graham-Diaconis Inequality for Ranked List Similarity
5: Hidden Hamiltonian Cycle Recovery via Linear Programming
6: A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds
7: Adaptive MapReduce Similarity Joins
8: Multimodal Dynamic Journey Planning
9: Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors
10: Bend-minimum Orthogonal Drawings in Quadratic Time
11: k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler
12: An Efficient SIMD Implementation of Pseudo-Verlet Lists for Neighbour Interactions in Particle-Based Codes
13: An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
14: A time- and space-optimal algorithm for the many-visits TSP
15: Local Search is a PTAS for Feedback Vertex Set in Minor-free Graphs
16: Faster Evaluation of Subtraction Games
17: Improving information centrality of a node in complex networks by adding edges
18: Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
19: The Graph Exploration Problem with Advice
20: On Abelian Longest Common Factor with and without RLE
21: Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures
22: Distributed Simulation and Distributed Inference
23: Algorithms and Conditional Lower Bounds for Planning Problems
24: Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments
25: PURE: Scalable Phase Unwrapping with Spatial Redundant Arcs
26: Finding Cliques in Social Networks: A New Distribution-Free Model
27: Light Spanners for High Dimensional Norms via Stochastic Decompositions
28: Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
29: Planar Steiner Orientation is NP-complete
30: Optimal Sorting with Persistent Comparison Errors
31: Sherali-Adams Integrality Gaps Matching the Log-Density Threshold
32: Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs
33: Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT
34: Finer Tight Bounds for Coloring on Clique-Width