Volume 85, Issue 6

Search all Algorithmica articles

June 2023

Issue Editors:

Hee-Kap Ahn,
Kunihiko Sadakane,
Mohammad R Salavatipour,
Meng He,
Anna Lubiw

13 articles in this issue

Special Issue on Algorithms and Computation (ISAAC 2021)
Editor’s Note 16 May 2023 Pages: 1521 - 1521
Part of 2 collections:

Special Issue on Algorithms and Computation (ISAAC 2021)

Special Issue on Algorithms and Computation (ISAAC 2021)
On the Kernel and Related Problems in Interval Digraphs
Mathew C. Francis
Pavol Hell
Dalu Jacob
OriginalPaper 19 July 2022 Pages: 1522 - 1559
Part of 2 collections:

Special Issue on Algorithms and Computation (ISAAC 2021)

Special Issue on Algorithms and Computation (ISAAC 2021)
Machine Covering in the Random-Order Model
Susanne Albers
Waldo Gálvez
Maximilian Janke
OriginalPaper 23 July 2022 Pages: 1560 - 1585
Part of 2 collections:

Special Issue on Algorithms and Computation (ISAAC 2021)

Special Issue on Algorithms and Computation (ISAAC 2021)
Algorithms and Complexity on Indexing Founder Graphs
Massimo Equi
Tuukka Norri
Veli Mäkinen
OriginalPaper Open access 28 July 2022 Pages: 1586 - 1623
Part of 2 collections:

Special Issue on Algorithms and Computation (ISAAC 2021)

Special Issue on Algorithms and Computation (ISAAC 2021)
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
Luciano Gualà
Stefano Leucci
Isabella Ziccardi
OriginalPaper Open access 08 October 2022 Pages: 1624 - 1651
Part of 2 collections:

Special Issue on Algorithms and Computation (ISAAC 2021)

Special Issue on Algorithms and Computation (ISAAC 2021)
Clique-Based Separators for Geometric Intersection Graphs
Mark de Berg
Sándor Kisfaludi-Bak
Leonidas Theocharous
OriginalPaper Open access 15 October 2022 Pages: 1652 - 1678
Part of 2 collections:

Special Issue on Algorithms and Computation (ISAAC 2021)

Special Issue on Algorithms and Computation (ISAAC 2021)
Shortest Beer Path Queries in Outerplanar Graphs
Joyce Bacic
Saeed Mehrabi
Michiel Smid
OriginalPaper 15 December 2022 Pages: 1679 - 1705
Part of 2 collections:

Special Issue on Algorithms and Computation (ISAAC 2021)

Special Issue on Algorithms and Computation (ISAAC 2021)
Essentially Tight Kernels for (Weakly) Closed Graphs
Tomohiro Koana
Christian Komusiewicz
Frank Sommer
OriginalPaper Open access 09 January 2023 Pages: 1706 - 1735
Part of 2 collections:

Special Issue on Algorithms and Computation (ISAAC 2021)

Special Issue on Algorithms and Computation (ISAAC 2021)
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)
Meng He
Anna Lubiw
Mohammad Salavatipour
EditorialNotes 16 March 2023 Pages: 1736 - 1737
Part of 2 collections:

Special Issue on Algorithms and Data Structures (WADS 2021)

Special Issue on Algorithms and Data Structures (WADS 2021)
A Stronger Lower Bound on Parametric Minimum Spanning Trees
David Eppstein
OriginalPaper Open access 22 August 2022 Pages: 1738 - 1753
Part of 2 collections:

Special Issue on Algorithms and Data Structures (WADS 2021)

Special Issue on Algorithms and Data Structures (WADS 2021)
Constructing the first (and coolest) fixed-content universal cycle
Joe Sawada
Aaron Williams
OriginalPaper 04 November 2022 Pages: 1754 - 1785
Part of 2 collections:

Special Issue on Algorithms and Data Structures (WADS 2021)

Special Issue on Algorithms and Data Structures (WADS 2021)
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
Ioana O. Bercea
Guy Even
OriginalPaper 05 December 2022 Pages: 1786 - 1804
Part of 2 collections:

Special Issue on Algorithms and Data Structures (WADS 2021)

Special Issue on Algorithms and Data Structures (WADS 2021)
Better Distance Labeling for Unweighted Planar Graphs
Paweł Gawrychowski
Przemysław Uznański
OriginalPaper Open access 15 May 2023 Pages: 1805 - 1823
Part of 2 collections:

Special Issue on Algorithms and Data Structures (WADS 2021)

Special Issue on Algorithms and Data Structures (WADS 2021)

Volume 85, Issue 6

Search

Navigation