Issue 7/2020
Special Issue on International Workshop on Combinatorial Algorithms
Content (9 Articles)
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)
Nadia Pisanti, Charles Colbourn, Roberto Grossi
Open Access
Parameterized Complexity of Min-Power Asymmetric Connectivity
Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
Complexity and Algorithms for Semipaired Domination in Graphs
Michael A. Henning, Arti Pandey, Vikash Tripathi
Analyzing Clustering and Partitioning Problems in Selected VLSI Models
Z. Donovan, K. Subramani, V. Mkrtchyan
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing the k-Visibility Region of a Point in a Polygon
Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer
Fixed-Parameter Tractability of (n − k) List Coloring
Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman