Collection
Special Issue on Algorithms and Computation (ISAAC 2021)
- Submission status
- Closed
Guest Editors: Hee-Kap Ahn, Kunihiko Sadakane
Editors
-
Hee-Kap Ahn
University of Science and Technology (POSTECH), Korea
-
Kunihiko Sadakane
The University of Tokyo, Japan
Articles (8 in this collection)
-
-
Essentially Tight Kernels for (Weakly) Closed Graphs
Authors
- Tomohiro Koana
- Christian Komusiewicz
- Frank Sommer
- Content type: OriginalPaper
- Open Access
- Published: 09 January 2023
- Pages: 1706 - 1735
-
Shortest Beer Path Queries in Outerplanar Graphs
Authors
- Joyce Bacic
- Saeed Mehrabi
- Michiel Smid
- Content type: OriginalPaper
- Published: 15 December 2022
- Pages: 1679 - 1705
-
Clique-Based Separators for Geometric Intersection Graphs
Authors (first, second and last of 4)
- Mark de Berg
- Sándor Kisfaludi-Bak
- Leonidas Theocharous
- Content type: OriginalPaper
- Open Access
- Published: 15 October 2022
- Pages: 1652 - 1678
-
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
Authors
- Luciano Gualà
- Stefano Leucci
- Isabella Ziccardi
- Content type: OriginalPaper
- Open Access
- Published: 08 October 2022
- Pages: 1624 - 1651
-
Algorithms and Complexity on Indexing Founder Graphs
Authors (first, second and last of 6)
- Massimo Equi
- Tuukka Norri
- Veli Mäkinen
- Content type: OriginalPaper
- Open Access
- Published: 28 July 2022
- Pages: 1586 - 1623
-
Machine Covering in the Random-Order Model
Authors
- Susanne Albers
- Waldo Gálvez
- Maximilian Janke
- Content type: OriginalPaper
- Published: 23 July 2022
- Pages: 1560 - 1585
-
On the Kernel and Related Problems in Interval Digraphs
Authors
- Mathew C. Francis
- Pavol Hell
- Dalu Jacob
- Content type: OriginalPaper
- Published: 19 July 2022
- Pages: 1522 - 1559