1: Stable marriage and roommates problems with restricted edges: complexity and approximability
2: Bounded Quadrant System: Error-bounded Trajectory Compression on the Go
3: Matchings with lower quotas: Algorithms and complexity
4: Approximate MAP Estimation for Pairwise Potentials via Baker’s Technique
5: Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
6: Strategic deployment in graphs
7: $\ell_p$ Row Sampling by Lewis Weights
8: Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism
9: Computationally-efficient stochastic cluster dynamics method for modeling damage accumulation in irradiated materials
10: Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs
11: On the Induced Matching Problem in Hamiltonian Bipartite Graphs
12: Queries on LZ-Bounded Encodings
13: Optimization Algorithms for Faster Computational Geometry
14: It’s Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems
15: The Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSP
16: Matrix Multiplication, Trilinear Decompositions, APA Algorithms, and Summation
17: Combinatorial Redundancy Detection
18: Longest Common Extensions in Trees
19: On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
20: Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
21: Mining Rooted Ordered Trees under Subtree Homeomorphism
22: Searching and Indexing Genomic Databases via Kernelization
23: On testing single connectedness in directed graphs and some related problems
24: Hashing Pursuit for Online Identification of Heavy-Hitters in High-Speed Network Streams
25: Tracking the Frequency Moments at All Times
26: ERGMs are Hard
27: Beyond the Euler characteristic: Approximating the genus of general graphs
28: A New Single-Source Shortest Path Algorithm for Nonnegative Weight Graph
29: Algebrisation in Distributed Graph Algorithms: Fast Matrix Multiplication in the Congested Clique
30: Distributed Multi-Depot Routing without Communications
31: Minimizing the Aggregate Movements for Interval Coverage
32: $\ell_p$ Testing and Learning of Discrete Distributions
33: Generalized cofactors and decomposition of Boolean satisfiability problems