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

ISSN: 1432-4350 (Print) 1433-0490 (Online)

In this topical collection (9 articles)

  1. EditorialNotes

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

    Nadia Pisanti, Charles Colbourn, Roberto Grossi Pages 1155-1157
    Download PDF (93KB) View Article

  2. OriginalPaper

    Parameterized Complexity of Min-Power Asymmetric Connectivity

    Matthias Bentert, Roman Haag, Christian Hofer… Pages 1158-1182
    Download PDF (1249KB) View Article

  3. No Access

    OriginalPaper

    Complexity of Fall Coloring for Restricted Graph Classes

    Juho Lauri, Christodoulos Mitillos Pages 1183-1196

  4. OriginalPaper

    On the Average Case of MergeInsertion

    Florian Stober, Armin Weiß Pages 1197-1224
    Download PDF (1949KB) View Article

  5. No Access

    OriginalPaper

    Complexity and Algorithms for Semipaired Domination in Graphs

    Michael A. Henning, Arti Pandey, Vikash Tripathi Pages 1225-1241

  6. No Access

    OriginalPaper

    Analyzing Clustering and Partitioning Problems in Selected VLSI Models

    Z. Donovan, K. Subramani, V. Mkrtchyan Pages 1242-1272

  7. No Access

    OriginalPaper

    Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings

    Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga… Pages 1273-1291

  8. No Access

    OriginalPaper

    Computing the k-Visibility Region of a Point in a Polygon

    Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher… Pages 1292-1306

  9. No Access

    OriginalPaper

    Fixed-Parameter Tractability of (n − k) List Coloring

    Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal… Pages 1307-1316