Abstract is missing.
- On 1-Bend Upward Point-Set Embeddings of st-DigraphsEmilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu. 3-18 [doi]
- Decoding Tree Decompositions from PermutationsSamuel Eduardo da Silva, Uéverton S. Souza. 19-34 [doi]
- Enumerating m-Length Walks in Directed Graphs with Constant DelayDuncan Adamson, Pawel Gawrychowski, Florin Manea. 35-50 [doi]
- The Hardness of Local Certification of Finite-State DynamicsDiego Maldonado, Pedro Montealegre 0001, Martín Ríos Wilson. 51-65 [doi]
- Iterated Straight-Line ProgramsGonzalo Navarro 0001, Cristian Urbina. 66-80 [doi]
- Computing Largest Minimum Color-Spanning Intervals of Imprecise PointsAnkush Acharyya, Vahideh Keikha, Maria Saumell, Rodrigo I. Silveira. 81-96 [doi]
- Total Domination, Separated-Cluster, CD-Coloring: Algorithms and HardnessDhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob. 97-113 [doi]
- Generating Signed Permutations by Twisting Two-Sided RibbonsYuan Qiu, Aaron Williams. 114-129 [doi]
- A BWT-Based Algorithm for Random de Bruijn Sequence ConstructionZsuzsanna Lipták, Luca Parmigiani. 130-145 [doi]
- Space-Efficient Conversions from SLPsTravis Gagie, Adrián Goga, Artur Jez, Gonzalo Navarro 0001. 146-161 [doi]
- Sparse Suffix and LCP Array: Simple, Direct, Small, and FastLorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis, Hilde Verbeek. 162-177 [doi]
- Wheeler MapsAndrej Baláz, Travis Gagie, Adrián Goga, Simon Heumos, Gonzalo Navarro 0001, Alessia Petescia, Jouni Sirén. 178-192 [doi]
- Faster Combinatorial k-Clique AlgorithmsAmir Abboud, Nick Fischer, Yarin Shechter. 193-206 [doi]
- On Approximate Colored Path CountingYounan Gao, Meng He 0001. 209-224 [doi]
- Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in TournamentsSushmita Gupta, Sounak Modak, Saket Saurabh 0001, Sanjay Seetharaman. 225-240 [doi]
- Better Algorithms for Online Bin Stretching via Computer SearchMatej Lieskovský. 241-253 [doi]
- Competitive Searching over TerrainsSarita de Berg, Nathan van Beusekom, Max van Mulken, Kevin Verbeek, Jules Wulms. 254-269 [doi]
- Minimizing the Size of the Uncertainty Regions for Centers of Moving EntitiesWilliam S. Evans, Seyed Ali Tabatabaee. 273-287 [doi]
- Guarding Polyominoes Under k-Hop VisibilityOmrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt 0001. 288-302 [doi]
- Minimum-Width Double-Slabs and Widest Empty Slabs in High DimensionsTaehoon Ahn 0001, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Sang Duk Yoon. 303-317 [doi]
- The Complexity Classes of Hamming Distance Recoverable Robust ProblemsChristoph Grüne. 321-335 [doi]
- Geometric Thickness of Multigraphs is $\exists \mathbb {R}$-CompleteHenry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber. 336-349 [doi]