Collection
Special Issue on Combinatorial Algorithms (IWOCA 2020)
- Submission status
- Closed
This special issue is devoted to 10 selected papers presented at the 31st International Workshop on Combinatorial Algorithms (IWOCA 2020), all of which are expanded versions and have been fully reviewed to meet the journal standards.
Editors
-
Leszek GaÅŸieniec
University of Liverpool, United Kingdom
-
Ralf Klasing
CNRS and University of Bordeaux, France
-
Tomasz Radzik
King's College London, United Kingdom
Articles (11 in this collection)
-
-
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots
Authors (first, second and last of 4)
- Sándor P. Fekete
- Eike Niehs
- Arne Schmidt
- Content type: OriginalPaper
- Open Access
- Published: 24 June 2022
- Pages: 2954 - 2986
-
Polynomial Time Algorithms for Tracking Path Problems
Authors
- Pratibha Choudhary
- Content type: OriginalPaper
- Open Access
- Published: 08 February 2022
- Pages: 1548 - 1570
-
On Proper Labellings of Graphs with Minimum Label Sum
Authors
- Julien Bensmail
- Foivos Fioravantes
- Nicolas Nisse
- Content type: OriginalPaper
- Published: 13 January 2022
- Pages: 1030 - 1063
-
Dynamic Averaging Load Balancing on Cycles
Authors
- Dan Alistarh
- Giorgi Nadiradze
- Amirmojtaba Sabour
- Content type: OriginalPaper
- Open Access
- Published: 24 December 2021
- Pages: 1007 - 1029
-
Streaming Dictionary Matching with Mismatches
Authors
- Paweł Gawrychowski
- Tatiana Starikovskaya
- Content type: OriginalPaper
- Published: 17 October 2021
- Pages: 896 - 916
-
Parameterized Complexity of \((A,\ell )\)-Path Packing
Authors (first, second and last of 9)
- Rémy Belmonte
- Tesshu Hanaka
- Yota Otachi
- Content type: OriginalPaper
- Open Access
- Published: 15 October 2021
- Pages: 871 - 895
-
Online Node- and Edge-Deletion Problems with Advice
Authors (first, second and last of 4)
- Li-Hsuan Chen
- Ling-Ju Hung
- Peter Rossmanith
- Content type: OriginalPaper
- Open Access
- Published: 30 June 2021
- Pages: 2719 - 2753
-
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
Authors
- Toru Hasunuma
- Content type: OriginalPaper
- Published: 25 May 2021
- Pages: 2697 - 2718
-
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
Authors
- Koki Hamada
- Shuichi Miyazaki
- Kazuya Okamoto
- Content type: OriginalPaper
- Open Access
- Published: 15 May 2021
- Pages: 2678 - 2696
-
On the Complexity of Broadcast Domination and Multipacking in Digraphs
Authors (first, second and last of 4)
- Florent Foucaud
- Benjamin Gras
- Florian Sikora
- Content type: OriginalPaper
- Published: 26 April 2021
- Pages: 2651 - 2677