| 2019 | A Framework for Vehicle Routing Approximation Schemes in Trees. Amariah Becker, Alice Paul |
| 2019 | A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space. Christopher Johnson, Haitao Wang |
| 2019 | A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs. Amariah Becker, Philip N. Klein, Aaron Schild |
| 2019 | Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour |
| 2019 | Approximating Robust Bin Packing with Budgeted Uncertainty. Aniket Basu Roy, Marin Bougeret, Noam Goldberg, Michael Poss |
| 2019 | Avoidable Vertices and Edges in Graphs. Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius |
| 2019 | Balanced Stable Marriage: How Close Is Close Enough? Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi |
| 2019 | Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid |
| 2019 | Discrete Morse Theory for Computing Zigzag Persistence. Clément Maria, Hannah Schreiber |
| 2019 | Dynamic Dictionary Matching in the Online Model. Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat |
| 2019 | Efficient Nearest-Neighbor Query and Clustering of Planar Curves. Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan |
| 2019 | Efficient Second-Order Shape-Constrained Function Fitting. David Durfee, Yu Gao, Anup B. Rao, Sebastian Wild |
| 2019 | Extending Upward Planar Graph Drawings. Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati |
| 2019 | FRESH: Fréchet Similarity with Hashing. Matteo Ceccarello, Anne Driemel, Francesco Silvestri |
| 2019 | Geometric Firefighting in the Half-Plane. Sang-Sub Kim, Rolf Klein, David Kübel, Elmar Langetepe, Barbara Schwarzwald |
| 2019 | Graph Isomorphism for (H Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma |
| 2019 | Guess Free Maximization of Submodular and Linear Sums. Moran Feldman |
| 2019 | Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs. Prosenjit Bose, Pilar Cano, Maria Saumell, Rodrigo I. Silveira |
| 2019 | How to Morph a Tree on a Small Grid. Fidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli |
| 2019 | Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. Haitao Wang, Jie Xue |
| 2019 | Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. Chien-Chung Huang, Naonori Kakimura |
| 2019 | Inventory Routing Problem with Facility Location. Yang Jiao, R. Ravi |
| 2019 | Kernelization of Graph Hamiltonicity: Proper H-Graphs. Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman |
| 2019 | Maximizing Dominance in the Plane and Its Applications. Jong Min Choi, Sergio Cabello, Hee-Kap Ahn |
| 2019 | Most Vital Segment Barriers. Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals |
| 2019 | On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow. Katerina Altmanová, Petr Kolman, Jan Voborník |
| 2019 | On the Minimum Consistent Subset Problem. Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid |
| 2019 | Online Bin Covering with Advice. Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen |
| 2019 | Online Circle Packing. Sándor P. Fekete, Sven von Höveling, Christian Scheffer |
| 2019 | Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity. Richard Peng, Bryce Sandlund, Daniel Dominic Sleator |
| 2019 | Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles. Timothy M. Chan, Yakov Nekrich, Michiel H. M. Smid |
| 2019 | Parameterized Complexity of Conflict-Free Graph Coloring. Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse |
| 2019 | Plane Hop Spanners for Unit Disk Graphs. Ahmad Biniaz |
| 2019 | Positive-Instance Driven Dynamic Programming for Graph Searching. Max Bannach, Sebastian Berndt |
| 2019 | Range Closest-Pair Search in Higher Dimensions. Timothy M. Chan, Saladi Rahul, Jie Xue |
| 2019 | Rank-Select Indices Without Tears. Tim Baumann, Torben Hagerup |
| 2019 | Reconfiguring Undirected Paths. Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno |
| 2019 | Splaying Preorders and Postorders. Caleb C. Levy, Robert E. Tarjan |
| 2019 | Stackelberg Packing Games. Toni Böhnlein, Oliver Schaudt, Joachim Schauer |
| 2019 | Succinct Data Structures for Families of Interval Graphs. Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti |
| 2019 | Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2019 | Weighted Throughput Maximization with Calibrations. Vincent Chau, Shengzhong Feng, Minming Li, Yinling Wang, Guochuan Zhang, Yong Zhang |
| 2019 | Zip Trees. Robert E. Tarjan, Caleb C. Levy, Stephen Timmel |