Abstract is missing.
- Succinct Data Structures for Families of Interval GraphsHüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti. 1-13 [doi]
- On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded FlowKaterina Altmanová, Petr Kolman, Jan Voborník. 14-27 [doi]
- Efficient Nearest-Neighbor Query and Clustering of Planar CurvesBoris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan. 28-42 [doi]
- Positive-Instance Driven Dynamic Programming for Graph SearchingMax Bannach, Sebastian Berndt. 43-56 [doi]
- How to Morph a Tree on a Small GridFidel Barrera-Cruz, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. 57-70 [doi]
- Approximating Robust Bin Packing with Budgeted UncertaintyAniket Basu Roy, Marin Bougeret, Noam Goldberg, Michael Poss. 71-84 [doi]
- Rank-Select Indices Without TearsTim Baumann, Torben Hagerup. 85-98 [doi]
- A PTAS for Bounded-Capacity Vehicle Routing in Planar GraphsAmariah Becker, Philip N. Klein, Aaron Schild. 99-111 [doi]
- A Framework for Vehicle Routing Approximation Schemes in TreesAmariah Becker, Alice Paul. 112-125 [doi]
- Avoidable Vertices and Edges in GraphsJesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius. 126-139 [doi]
- Plane Hop Spanners for Unit Disk GraphsAhmad Biniaz. 140-154 [doi]
- On the Minimum Consistent Subset ProblemAhmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi 0001, Michiel H. M. Smid. 155-167 [doi]
- Parameterized Complexity of Conflict-Free Graph ColoringHans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse. 168-180 [doi]
- 2)-Free Graphs: An Almost Complete DichotomyMarthe Bonamy, Konrad K. Dabrowski, Matthew Johnson 0002, Daniël Paulusma. 181-195 [doi]
- Hamiltonicity for Convex Shape Delaunay and Gabriel GraphsProsenjit Bose, Pilar Cano, Maria Saumell, Rodrigo I. Silveira. 196-210 [doi]
- Computing Maximum Independent Set on Outerstring Graphs and Their RelativesProsenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi 0001, Debajyoti Mondal, Michiel H. M. Smid. 211-224 [doi]
- Online Bin Covering with AdviceJoan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen. 225-238 [doi]
- Stackelberg Packing GamesToni Böhnlein, Oliver Schaudt, Joachim Schauer. 239-253 [doi]
- FRESH: Fréchet Similarity with HashingMatteo Ceccarello, Anne Driemel, Francesco Silvestri 0001. 254-268 [doi]
- Range Closest-Pair Search in Higher DimensionsTimothy M. Chan, Saladi Rahul, Jie Xue. 269-282 [doi]
- Orthogonal Range Reporting and Rectangle Stabbing for Fat RectanglesTimothy M. Chan, Yakov Nekrich, Michiel H. M. Smid. 283-295 [doi]
- Kernelization of Graph Hamiltonicity: Proper H-GraphsSteven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman 0001. 296-310 [doi]
- Weighted Throughput Maximization with CalibrationsVincent Chau, Shengzhong Feng, Minming Li, Yinling Wang, Guochuan Zhang, Yong Zhang 0001. 311-324 [doi]
- Maximizing Dominance in the Plane and Its ApplicationsJong Min Choi, Sergio Cabello, Hee-Kap Ahn. 325-338 [doi]
- Extending Upward Planar Graph DrawingsGiordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati. 339-352 [doi]
- Reconfiguring Undirected PathsErik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno. 353-365 [doi]
- Online Circle PackingSándor P. Fekete, Sven von Höveling, Christian Scheffer. 366-379 [doi]
- Guess Free Maximization of Submodular and Linear SumsMoran Feldman. 380-394 [doi]
- Efficient Second-Order Shape-Constrained Function FittingDavid Durfee, Yu Gao, Anup B. Rao, Sebastian Wild. 395-408 [doi]
- Dynamic Dictionary Matching in the Online ModelShay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat. 409-422 [doi]
- Balanced Stable Marriage: How Close Is Close Enough?Sushmita Gupta, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi. 423-437 [doi]
- Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack ConstraintChien-Chung Huang, Naonori Kakimura. 438-451 [doi]
- Inventory Routing Problem with Facility LocationYang Jiao, R. Ravi 0001. 452-465 [doi]
- A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric SpaceChristopher Johnson, Haitao Wang. 466-480 [doi]
- Geometric Firefighting in the Half-PlaneSang-Sub Kim 0003, Rolf Klein, David Kübel, Elmar Langetepe, Barbara Schwarzwald. 481-494 [doi]
- Most Vital Segment BarriersIrina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals. 495-509 [doi]
- Splaying Preorders and PostordersCaleb C. Levy, Robert E. Tarjan. 510-522 [doi]
- Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVSDaniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. 523-537 [doi]
- Discrete Morse Theory for Computing Zigzag PersistenceClément Maria, Hannah Schreiber. 538-552 [doi]
- Optimal Offline Dynamic 2, 3-Edge/Vertex ConnectivityRichard Peng, Bryce Sandlund, Daniel Dominic Sleator. 553-565 [doi]
- Zip TreesRobert E. Tarjan, Caleb C. Levy, Stephen Timmel. 566-577 [doi]
- Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of PointsHaitao Wang 0001, Jie Xue. 578-591 [doi]