Abstract is missing.
- Geometric Spanning Trees Minimizing the Wiener IndexA. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell. 1-14 [doi]
- The Mutual Visibility Problem for Fat RobotsRusul J. Alsaedi, Joachim Gudmundsson, André van Renssen. 15-28 [doi]
- Faster Algorithms for Cycle Hitting Problems on Disk GraphsShinwoo An, Kyungjin Cho, Eunjin Oh 0001. 29-42 [doi]
- Tight Analysis of the Lazy Algorithm for Open Online Dial-a-RideJúlia Baligács, Yann Disser, Farehe Soheil, David Weckbecker. 43-64 [doi]
- Online TSP with Known LocationsEvripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris. 65-78 [doi]
- Socially Fair Matching: Exact and Approximation AlgorithmsSayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar 0002, Fahad Panolan, Kirill Simonov. 79-92 [doi]
- A Parameterized Approximation Scheme for Generalized Partial Vertex CoverSayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi. 93-105 [doi]
- Dominator Coloring and CD Coloring in Almost Cluster GraphsAritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman 0001. 106-119 [doi]
- Tight Approximation Algorithms for Ordered CoveringJatin Batra, Syamantak Das, Agastya Vibhuti Jha. 120-135 [doi]
- Online Minimum Spanning Trees with Weight PredictionsMagnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen. 136-148 [doi]
- Compact Distance Oracles with Large Sensitivity and Low StretchDavide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich 0001, Simon Krogmann, Martin Schirneck. 149-163 [doi]
- Finding Diameter-Reducing Shortcuts in TreesDavide Bilò, Luciano Gualà, Stefano Leucci 0001, Luca Pepè Sciarria. 164-178 [doi]
- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple PolygonProsenjit Bose, Anthony D'Angelo, Stephane Durocher. 179-192 [doi]
- Online Interval Scheduling with PredictionsJoan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen. 193-207 [doi]
- On Length-Sensitive Fréchet SimilarityKevin Buchin, Brittany Terese Fasy, Erfan Hosseini Sereshgi, Carola Wenk. 208-231 [doi]
- Hardness of Graph-Structured Algebraic and Symbolic ProblemsJingbang Chen, Yu Gao 0001, Yufan Huang, Richard Peng, Runze Wang. 232-246 [doi]
- Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse GraphsXiuge Chen, Rajesh Chitnis, Patrick Eades, Anthony Wirth. 247-261 [doi]
- Efficient k-Center Algorithms for Planar Points in Convex PositionJongmin Choi, Jaegun Lee, Hee-Kap Ahn. 262-274 [doi]
- Classification via Two-Way Comparisons (Extended Abstract)Marek Chrobak, Neal E. Young. 275-290 [doi]
- Improved Bounds for Discrete Voronoi GamesMark de Berg, Geert van Wordragen. 291-308 [doi]
- General Space-Time Tradeoffs via Relational QueriesShaleen Deep, Xiao Hu 0005, Paraschos Koutris. 309-325 [doi]
- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal GraphsIan DeHaan, Zachary Friggstad. 326-339 [doi]
- Differentially Private Range Query on Shortest PathsChengyuan Deng, Jie Gao, Jalaj Upadhyay, Chen Wang. 340-370 [doi]
- Revisiting Graph Persistence for Updates and EfficiencyTamal K. Dey, Tao Hou, Salman Parsa. 371-385 [doi]
- Block Crossings in One-Sided TanglegramsAlexander Dobler, Martin Nöllenburg. 386-400 [doi]
- Observation Routes and External Watchman RoutesAdrian Dumitrescu, Csaba D. Tóth. 401-415 [doi]
- Lower Bounds for Non-adaptive Shortest Path RelaxationDavid Eppstein. 416-429 [doi]
- Shortest Coordinated Motion for Square RobotsGuillermo Esteban, Dan Halperin, Víctor Ruíz, Vera Sacristán, Rodrigo I. Silveira. 430-443 [doi]
- Linear Layouts of Bipartite Planar GraphsHenry Förster, Michael Kaufmann 0001, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou. 444-459 [doi]
- Adaptive Data Structures for 2D Dominance Colored Range CountingYounan Gao. 460-473 [doi]
- Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or PersistentOfek Gila, Michael T. Goodrich, Robert E. Tarjan. 474-492 [doi]
- External-Memory Sorting with Comparison ErrorsMichael T. Goodrich, Evrim Ozel. 493-506 [doi]
- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small SubgraphsWing-Kai Hon, Meng-Tsung Tsai, Hung-Lung Wang. 507-520 [doi]
- Reconfiguration of Time-Respecting ArborescencesTakehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Akira Suzuki. 521-532 [doi]
- Algorithmic Theory of Qubit RoutingTakehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi 0001, Yoshio Okamoto. 533-546 [doi]
- 3-Free Diameter Two GraphsTereza Klimosová, Vibha Sahlot. 547-560 [doi]
- Colored Constrained Spanning Tree on Directed GraphsHung-Yeh Lee, Hsuan-Yu Liao, Wing-Kai Hon. 561-573 [doi]
- Geometric Hitting Set for Line-Constrained DisksGang Liu, Haitao Wang. 574-587 [doi]
- An ETH-Tight Algorithm for Bidirected Steiner ConnectivityDaniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. 588-604 [doi]
- From Curves to Words and Back Again: Geometric Computation of Minimum-Area HomotopyHsien-Chih Chang, Brittany Terese Fasy, Bradley McCoy, David L. Millman, Carola Wenk. 605-619 [doi]
- Fully Dynamic Clustering and Diversity Maximization in Doubling MetricsPaolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci. 620-636 [doi]
- Quick Minimization of Tardy Processing Time on a Single MachineBaruch Schieber, Pranav Sitaraman. 637-643 [doi]
- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point LocationGerth Stølting Brodal, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Rolf Svenning. 644-659 [doi]
- Approximating the Discrete Center Line Segment in Linear TimeJoachim Gudmundsson, Yuan Sha. 660-674 [doi]
- Density Approximation for Moving GroupsMax van Mulken, Bettina Speckmann, Kevin Verbeek. 675-688 [doi]
- Dynamic Convex Hulls Under Window-Sliding UpdatesHaitao Wang. 689-703 [doi]
- Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOsSimon Weber 0001, Joel Widmer. 704-718 [doi]