Special Issue on Combinatorial Algorithms (IWOCA 2020)

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.

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...

Leszek Gaşieniec

University of Liverpool, United Kingdom
Ralf Klasing

CNRS and University of Bordeaux, France
Tomasz Radzik

King's College London, United Kingdom

Showing 1-11 of 11 articles

Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020
Leszek Gąsieniec
Ralf Klasing
Tomasz Radzik
EditorialNotes 05 September 2022 Pages: 3103 - 3106
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots
Sándor P. Fekete
Eike Niehs
Arne Schmidt
OriginalPaper Open access 24 June 2022 Pages: 2954 - 2986
Polynomial Time Algorithms for Tracking Path Problems
Pratibha Choudhary
OriginalPaper Open access 08 February 2022 Pages: 1548 - 1570
On Proper Labellings of Graphs with Minimum Label Sum
Julien Bensmail
Foivos Fioravantes
Nicolas Nisse
OriginalPaper 13 January 2022 Pages: 1030 - 1063
Dynamic Averaging Load Balancing on Cycles
Dan Alistarh
Giorgi Nadiradze
Amirmojtaba Sabour
OriginalPaper Open access 24 December 2021 Pages: 1007 - 1029
Streaming Dictionary Matching with Mismatches
Paweł Gawrychowski
Tatiana Starikovskaya
OriginalPaper 17 October 2021 Pages: 896 - 916
Parameterized Complexity of \((A,\ell )\)-Path Packing
Rémy Belmonte
Tesshu Hanaka
Yota Otachi
OriginalPaper Open access 15 October 2021 Pages: 871 - 895
Online Node- and Edge-Deletion Problems with Advice
Li-Hsuan Chen
Ling-Ju Hung
Peter Rossmanith
OriginalPaper Open access 30 June 2021 Pages: 2719 - 2753
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
Toru Hasunuma
OriginalPaper 25 May 2021 Pages: 2697 - 2718
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
Koki Hamada
Shuichi Miyazaki
Kazuya Okamoto
OriginalPaper Open access 15 May 2021 Pages: 2678 - 2696
On the Complexity of Broadcast Domination and Multipacking in Digraphs
Florent Foucaud
Benjamin Gras
Florian Sikora
OriginalPaper 26 April 2021 Pages: 2651 - 2677

Special Issue on Combinatorial Algorithms (IWOCA 2020)

Participating journal

Algorithmica

Editors

Leszek Gaşieniec

Ralf Klasing

Tomasz Radzik

Articles

Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020

Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots

Polynomial Time Algorithms for Tracking Path Problems

On Proper Labellings of Graphs with Minimum Label Sum

Dynamic Averaging Load Balancing on Cycles

Streaming Dictionary Matching with Mismatches

Parameterized Complexity of \((A,\ell )\)-Path Packing

Online Node- and Edge-Deletion Problems with Advice

Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions

Strongly Stable and Maximum Weakly Stable Noncrossing Matchings

On the Complexity of Broadcast Domination and Multipacking in Digraphs

Navigation

Special Issue on Combinatorial Algorithms (IWOCA 2020)

Participating journal

Editors

Leszek Gaşieniec

Ralf Klasing

Tomasz Radzik

Articles

Search

Navigation