Volume 64, Issue 7

Search all Theory of Computing Systems articles

October 2020

Special Issue on International Workshop on Combinatorial Algorithms

Issue Editors:

Nadia Pisanti,
Charles J. Colbourn,
Roberto Grossi

9 articles in this issue

Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)
Nadia Pisanti
Charles Colbourn
Roberto Grossi
EditorialNotes 23 October 2020 Pages: 1155 - 1157
Part of 2 collections:

Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)

International Workshop on Combinatorial Algorithms (IWOCA 2019)
Parameterized Complexity of Min-Power Asymmetric Connectivity
Matthias Bentert
Roman Haag
André Nichterlein
OriginalPaper Open access 23 May 2020 Pages: 1158 - 1182
Part of 2 collections:

Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)

International Workshop on Combinatorial Algorithms (IWOCA 2019)
Complexity of Fall Coloring for Restricted Graph Classes
Juho Lauri
Christodoulos Mitillos
OriginalPaper 08 April 2020 Pages: 1183 - 1196
Part of 2 collections:

Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)

International Workshop on Combinatorial Algorithms (IWOCA 2019)
On the Average Case of MergeInsertion
Florian Stober
Armin Weiß
OriginalPaper Open access 30 June 2020 Pages: 1197 - 1224
Part of 2 collections:

Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)

International Workshop on Combinatorial Algorithms (IWOCA 2019)
Complexity and Algorithms for Semipaired Domination in Graphs
Michael A. Henning
Arti Pandey
Vikash Tripathi
OriginalPaper 06 June 2020 Pages: 1225 - 1241
Part of 2 collections:

Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)

International Workshop on Combinatorial Algorithms (IWOCA 2019)
Analyzing Clustering and Partitioning Problems in Selected VLSI Models
Z. Donovan
K. Subramani
V. Mkrtchyan
OriginalPaper 22 August 2020 Pages: 1242 - 1272
Part of 2 collections:

Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)

International Workshop on Combinatorial Algorithms (IWOCA 2019)
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings
Kiichi Watanabe
Yuto Nakashima
Masayuki Takeda
OriginalPaper 09 May 2020 Pages: 1273 - 1291
Part of 2 collections:

Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)

International Workshop on Combinatorial Algorithms (IWOCA 2019)
Computing the k-Visibility Region of a Point in a Polygon
Yeganeh Bahoo
Prosenjit Bose
Thomas C. Shermer
OriginalPaper 11 August 2020 Pages: 1292 - 1306
Part of 2 collections:

Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)

International Workshop on Combinatorial Algorithms (IWOCA 2019)
Fixed-Parameter Tractability of (n − k) List Coloring
Aritra Banik
Ashwin Jacob
Venkatesh Raman
OriginalPaper 07 November 2020 Pages: 1307 - 1316
Part of 2 collections:

Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)

International Workshop on Combinatorial Algorithms (IWOCA 2019)

Volume 64, Issue 7

Search

Navigation