Abstract is missing.
- On the Spanning and Routing Ratios of the Directed $\varTheta _6$-GraphHugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose. 1-14 [doi]
- The Minimum Moving Spanning Tree ProblemHugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid. 15-28 [doi]
- Scheduling with Testing on Multiple Identical Parallel MachinesSusanne Albers, Alexander Eckl. 29-42 [doi]
- Online Makespan Minimization with Budgeted UncertaintySusanne Albers, Maximilian Janke. 43-56 [doi]
- Pattern Matching in Doubling SpacesCorentin Allair, Antoine Vigneron. 57-70 [doi]
- Reachability Problems for Transmission GraphsShinwoo An, Eunjin Oh 0001. 71-84 [doi]
- On Minimum Generalized Manhattan ConnectionsAntonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase. 85-100 [doi]
- HalftimeHash: Modern Hashing Without 64-Bit Multipliers or Finite FieldsJim Apple. 101-114 [doi]
- Generalized Disk GraphsÍvar Marrow Arnþórsson, Steven Chaplick, Jökull Snær Gylfason, Magnús M. Halldórsson, Jökull Máni Reynisson, Tigran Tonoyan. 115-128 [doi]
- A 4-Approximation of the $\frac{2\pi }{3}$-MSTStav Ashur, Matthew J. Katz. 129-143 [doi]
- Dynamic Dictionaries for Multisets and Counting Filters with Constant Time OperationsIoana O. Bercea, Guy Even. 144-157 [doi]
- The Neighborhood Polynomial of Chordal GraphsHelena Bergold, Winfried Hochstättler, Uwe Mayer. 158-171 [doi]
- Incomplete Directed Perfect Phylogeny in Linear TimeGiulia Bernardini 0001, Paola Bonizzoni, Pawel Gawrychowski. 172-185 [doi]
- Euclidean Maximum Matchings in the Plane - Local to GlobalAhmad Biniaz, Anil Maheshwari, Michiel Smid. 186-199 [doi]
- Solving Problems on Generalized Convex Graphs via Mim-WidthFlavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma. 200-214 [doi]
- Improved Bounds on the Spanning Ratio of the Theta-5-GraphProsenjit Bose, Darryl Hill, Aurélien Ooms. 215-228 [doi]
- Computing Weighted Subset Transversals in H-Free GraphsNick Brettell, Matthew Johnson 0002, Daniël Paulusma. 229-242 [doi]
- Computing the Fréchet Distance Between Uncertain Curves in One DimensionKevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov 0001, Jérôme Urhausen, Kevin Verbeek. 243-257 [doi]
- Finding a Largest-Area Triangle in a Terrain in Near-Linear TimeSergio Cabello, Arun Kumar Das, Sandip Das 0001, Joydeep Mukherjee. 258-270 [doi]
- Planar Drawings with Few Slopes of Halin Graphs and Nested PseudotreesSteven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani. 271-285 [doi]
- An APTAS for Bin Packing with Clique-Graph ConflictsIlan Doron Arad, Ariel Kulik, Hadas Shachnai. 286-299 [doi]
- Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly GraphsFeodor F. Dragan, Guillaume Ducoffe , Heather M. Guarnera. 300-314 [doi]
- ANN for Time Series Under the Fréchet DistanceAnne Driemel, Ioannis Psarros. 315-328 [doi]
- Strictly In-Place Algorithms for Permuting and Inverting PermutationsBartlomiej Dudek 0001, Pawel Gawrychowski, Karol Pokorski. 329-342 [doi]
- A Stronger Lower Bound on Parametric Minimum Spanning TreesDavid Eppstein. 343-356 [doi]
- Online Bin Packing of Squares and CubesLeah Epstein, Loay Mualem. 357-370 [doi]
- Exploration of k-Edge-Deficient Temporal GraphsThomas Erlebach, Jakob T. Spooner. 371-384 [doi]
- Parameterized Complexity of Categorical Clustering with Size ConstraintsFedor V. Fomin, Petr A. Golovach, Nidhi Purohit. 385-398 [doi]
- Graph Pricing with Limited SupplyZachary Friggstad, Maryam Mahboub. 399-413 [doi]
- Fair Correlation Clustering with Global and Local GuaranteesZachary Friggstad, Ramin Mousavi. 414-427 [doi]
- Better Distance Labeling for Unweighted Planar GraphsPawel Gawrychowski, Przemyslaw Uznanski. 428-441 [doi]
- How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking PathsMichael T. Goodrich, Siddharth Gupta 0002, Hadi Khodabandeh, Pedro Matias. 442-456 [doi]
- Algorithms for Radius-Optimally Augmenting Trees in a Metric SpaceJoachim Gudmundsson, Yuan Sha. 457-470 [doi]
- Upper and Lower Bounds for Fully Retroactive Graph ProblemsMonika Henzinger, Xiaowei Wu 0001. 471-484 [doi]
- Characterization of Super-Stable MatchingsChangyong Hu, Vijay K. Garg. 485-498 [doi]
- Uniform Embeddings for Robinson Similarity MatricesJeannette Janssen, Zhiyuan Zhang. 499-512 [doi]
- Particle-Based Assembly Using Precise Global ControlJakob Keller, Christian Rieck, Christian Scheffer, Arne Schmidt 0001. 513-527 [doi]
- Independent Sets in Semi-random HypergraphsYash Khanna, Anand Louis, Rameesh Paul. 528-542 [doi]
- A Query-Efficient Quantum Algorithm for Maximum Matching on General GraphsShelby Kimmel, R. Teal Witter. 543-555 [doi]
- Support Optimality and Adaptive Cuckoo FiltersTsvi Kopelowitz, Samuel McCauley, Ely Porat. 556-570 [doi]
- Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic TimeArne Leitert. 571-584 [doi]
- Algorithms for the Line-Constrained Disk Coverage and Related ProblemsLogan Pedersen, Haitao Wang 0001. 585-598 [doi]
- A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations)J. Sawada, A. Williams. 599-612 [doi]
- Routing on Heavy-Path WSPD-SpannersProsenjit Bose, Tyler Tuttle. 613-626 [doi]
- Mapping Multiple Regions to the Grid with Bounded Hausdorff DistanceIvor van der Hoog, Mees van de Kerkhof, Marc J. van Kreveld, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen. 627-640 [doi]
- Diverse Partitions of Colored PointsMarc van Kreveld, Bettina Speckmann, Jérôme Urhausen. 641-654 [doi]
- Reverse Shortest Path Problem for Unit-Disk GraphsHaitao Wang 0001, Yiming Zhao. 655-668 [doi]