| 0 | -- | 0 | Sampath Kannan, Claire Mathieu, Hang Zhou 0001. Graph Reconstruction and Verification |
| 0 | -- | 0 | T.-H. Hubert Chan, Zhiyi Huang 0002, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang. Online Submodular Maximization with Free Disposal |
| 0 | -- | 0 | Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter. Windrose Planarity: Embedding Graphs with Direction-Constrained Edges |
| 0 | -- | 0 | Aris Anagnostopoulos, Fabrizio Grandoni 0001, Stefano Leonardi, Andreas Wiese. A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path |
| 0 | -- | 0 | Robert Krauthgamer, Ohad Trabelsi. Conditional Lower Bounds for All-Pairs Max-Flow |
| 0 | -- | 0 | Amos Korman, Yoav Rodeh. The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback |
| 0 | -- | 0 | Edith Cohen. Stream Sampling Framework and Application for Frequency Cap Statistics |
| 0 | -- | 0 | Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen. Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs |
| 0 | -- | 0 | Suguru Tamaki, Yuichi Yoshida. Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues |
| 0 | -- | 0 | Omer Gold, Micha Sharir. Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier |
| 0 | -- | 0 | Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak. Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond |
| 0 | -- | 0 | Lin Chen, Guochuan Zhang. Packing Groups of Items into Multiple Knapsacks |
| 0 | -- | 0 | Jean-Daniel Boissonnat, Karthik C. S.. An Efficient Representation for Filtrations of Simplicial Complexes |
| 0 | -- | 0 | David G. Harris. Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local Lemma |
| 0 | -- | 0 | Pankaj K. Agarwal, Kyle Fox, Oren Salzman. An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles |
| 0 | -- | 0 | Boris Aronov, Matthew J. Katz. Batched Point Location in SINR Diagrams via Algebraic Tools |
| 0 | -- | 0 | Jérémy Barbay, Pablo Pérez-Lantero. Adaptive Computation of the Swap-Insert Correction Distance |