Special Issue on Algorithms and Computation (ISAAC 2021)

Guest Editors: Hee-Kap Ahn, Kunihiko Sadakane

Journal

Algorithmica

Algorithmica is an international journal which publishes theoretical papers on algorithms that address problems arising in practical areas, and experimental papers of general appeal...

Hee-Kap Ahn

University of Science and Technology (POSTECH), Korea
Kunihiko Sadakane

The University of Tokyo, Japan

Showing 1-8 of 8 articles

Special Issue on Algorithms and Computation (ISAAC 2021)

Editor’s Note 16 May 2023 Pages: 1521 - 1521
Essentially Tight Kernels for (Weakly) Closed Graphs
Tomohiro Koana
Christian Komusiewicz
Frank Sommer
OriginalPaper Open access 09 January 2023 Pages: 1706 - 1735
Shortest Beer Path Queries in Outerplanar Graphs
Joyce Bacic
Saeed Mehrabi
Michiel Smid
OriginalPaper 15 December 2022 Pages: 1679 - 1705
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
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
Algorithms and Complexity on Indexing Founder Graphs
Massimo Equi
Tuukka Norri
Veli Mäkinen
OriginalPaper Open access 28 July 2022 Pages: 1586 - 1623
Machine Covering in the Random-Order Model
Susanne Albers
Waldo Gálvez
Maximilian Janke
OriginalPaper 23 July 2022 Pages: 1560 - 1585
On the Kernel and Related Problems in Interval Digraphs
Mathew C. Francis
Pavol Hell
Dalu Jacob
OriginalPaper 19 July 2022 Pages: 1522 - 1559

Special Issue on Algorithms and Computation (ISAAC 2021)

Participating journal

Algorithmica

Editors

Hee-Kap Ahn

Kunihiko Sadakane

Articles

Special Issue on Algorithms and Computation (ISAAC 2021)

Essentially Tight Kernels for (Weakly) Closed Graphs

Shortest Beer Path Queries in Outerplanar Graphs

Clique-Based Separators for Geometric Intersection Graphs

Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees

Algorithms and Complexity on Indexing Founder Graphs

Machine Covering in the Random-Order Model

On the Kernel and Related Problems in Interval Digraphs