Special Issue on Algorithms and Computation (ISAAC 2021) Editor’s Note 16 May 2023 Pages: 1521 - 1521
On the Kernel and Related Problems in Interval Digraphs Mathew C. FrancisPavol HellDalu Jacob OriginalPaper 19 July 2022 Pages: 1522 - 1559
Machine Covering in the Random-Order Model Susanne AlbersWaldo GálvezMaximilian Janke OriginalPaper 23 July 2022 Pages: 1560 - 1585
Algorithms and Complexity on Indexing Founder Graphs Massimo EquiTuukka NorriVeli Mäkinen OriginalPaper Open access 28 July 2022 Pages: 1586 - 1623
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees Luciano GualàStefano LeucciIsabella Ziccardi OriginalPaper Open access 08 October 2022 Pages: 1624 - 1651
Clique-Based Separators for Geometric Intersection Graphs Mark de BergSándor Kisfaludi-BakLeonidas Theocharous OriginalPaper Open access 15 October 2022 Pages: 1652 - 1678
Shortest Beer Path Queries in Outerplanar Graphs Joyce BacicSaeed MehrabiMichiel Smid OriginalPaper 15 December 2022 Pages: 1679 - 1705
Essentially Tight Kernels for (Weakly) Closed Graphs Tomohiro KoanaChristian KomusiewiczFrank Sommer OriginalPaper Open access 09 January 2023 Pages: 1706 - 1735
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021) Meng HeAnna LubiwMohammad Salavatipour EditorialNotes 16 March 2023 Pages: 1736 - 1737
A Stronger Lower Bound on Parametric Minimum Spanning Trees David Eppstein OriginalPaper Open access 22 August 2022 Pages: 1738 - 1753
Constructing the first (and coolest) fixed-content universal cycle Joe SawadaAaron Williams OriginalPaper 04 November 2022 Pages: 1754 - 1785
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations Ioana O. BerceaGuy Even OriginalPaper 05 December 2022 Pages: 1786 - 1804
Better Distance Labeling for Unweighted Planar Graphs Paweł GawrychowskiPrzemysław Uznański OriginalPaper Open access 15 May 2023 Pages: 1805 - 1823