Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)
ISSN:
1432-4350 (Print)
1433-0490 (Online)
In this topical collection (9 articles)
-
OriginalPaper
Parameterized Complexity of Min-Power Asymmetric Connectivity
Matthias Bentert, Roman Haag, Christian Hofer… Pages 1158-1182 -
OriginalPaper
Complexity of Fall Coloring for Restricted Graph Classes
Juho Lauri, Christodoulos Mitillos Pages 1183-1196 -
OriginalPaper
Complexity and Algorithms for Semipaired Domination in Graphs
Michael A. Henning, Arti Pandey, Vikash Tripathi Pages 1225-1241 -
OriginalPaper
Analyzing Clustering and Partitioning Problems in Selected VLSI Models
Z. Donovan, K. Subramani, V. Mkrtchyan Pages 1242-1272 -
OriginalPaper
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga… Pages 1273-1291 -
OriginalPaper
Computing the k-Visibility Region of a Point in a Polygon
Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher… Pages 1292-1306 -
OriginalPaper
Fixed-Parameter Tractability of (n − k) List Coloring
Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal… Pages 1307-1316
Continue reading...
To view the rest of this content please follow the download PDF link above.