Special Issue on Combinatorial Algorithms (IWOCA 2020)
ISSN:
0178-4617 (Print)
1432-0541 (Online)
In this topical collection (11 articles)
-
OriginalPaper
Parameterized Complexity of \((A,\ell )\) -Path Packing
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi… Pages 871-895 -
OriginalPaper
Streaming Dictionary Matching with Mismatches
Paweł Gawrychowski, Tatiana Starikovskaya Pages 896-916 -
OriginalPaper
Dynamic Averaging Load Balancing on Cycles
Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour Pages 1007-1029 -
OriginalPaper
On Proper Labellings of Graphs with Minimum Label Sum
Julien Bensmail, Foivos Fioravantes, Nicolas Nisse Pages 1030-1063 -
OriginalPaper
Polynomial Time Algorithms for Tracking Path Problems
Pratibha Choudhary Pages 1548-1570 -
OriginalPaper
On the Complexity of Broadcast Domination and Multipacking in Digraphs
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora Pages 2651-2677 -
OriginalPaper
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto Pages 2678-2696 -
OriginalPaper
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
Toru Hasunuma Pages 2697-2718 -
OriginalPaper
Online Node- and Edge-Deletion Problems with Advice
Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith Pages 2719-2753
Continue reading...
To view the rest of this content please follow the download PDF link above.