Abstract is missing.
- Isotonic Regression by Dynamic ProgrammingGünter Rote. [doi]
- Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate MatchingMohsen Ghaffari, David Wajc. [doi]
- Asymmetric Convex Intersection TestingLuis Barba, Wolfgang Mulzer. [doi]
- On Primal-Dual Circle RepresentationsStefan Felsner, Günter Rote. [doi]
- A Framework for Searching in Graphs in the Presence of ErrorsDariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, Daniel Wolleb-Graf. [doi]
- Simple Contention Resolution via Multiplicative Weight UpdatesYi-Jun Chang, Wenyu Jin, Seth Pettie. [doi]
- Towards a Unified Theory of Sparsification for Matching ProblemsSepehr Assadi, Aaron Bernstein. [doi]
- LP Relaxation and Tree Packing for Minimum k-cutsChandra Chekuri, Kent Quanrud, Chao Xu 0002. [doi]
- A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset SumCe Jin, Hongxun Wu. [doi]
- Compressed Sensing with Adversarial Sparse Noise via L1 RegressionSushrut Karmalkar, Eric Price. [doi]
- Approximating Maximin Share AllocationsJugal Garg, Peter McGlaughlin, Setareh Taki. [doi]
- A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved ApproximationPasin Manurangsi. [doi]
- Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft HeapsHaim Kaplan, László Kozma 0002, Or Zamir, Uri Zwick. [doi]
- Relaxed Voronoi: A Simple Framework for Terminal-Clustering ProblemsArnold Filtser, Robert Krauthgamer, Ohad Trabelsi. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Approximating Optimal Transport With Linear ProgramsKent Quanrud. [doi]
- Simple Concurrent Labeling Algorithms for Connected ComponentsSixue Liu, Robert E. Tarjan. [doi]
- Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a GraphMichal Kotrbcík, Martin Skoviera. [doi]
- An Illuminating Algorithm for the Light Bulb ProblemJosh Alman. [doi]
- Submodular Optimization in the MapReduce ModelPaul Liu, Jan Vondrák. [doi]
- A New Application of Orthogonal Range Searching for Computing Giant Graph DiametersGuillaume Ducoffe . [doi]