Skip to main content
  • Conference proceedings
  • © 2018

Combinatorial Algorithms

28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10765)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): IWOCA: International Workshop on Combinatorial Algorithms

Conference proceedings info: IWOCA 2017.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (34 papers)

  1. Front Matter

    Pages I-XII
  2. Invited Papers

    1. Front Matter

      Pages 1-1
    2. Entire H-irregularity Strength of Plane Graphs

      • Martin Bača, Nurdin Hinding, Aisha Javed, Andrea Semaničová-Feňovčíková
      Pages 3-12
    3. Combinatorial Questions: How Can Graph Labelling Help?

      • Diane Donovan, Thomas A. McCourt
      Pages 13-23
    4. Recent Advances of Palindromic Factorization

      • Mai Alzamel, Costas S. Iliopoulos
      Pages 37-46
    5. A Construction for \(\{0,1,-1\}\) Orthogonal Matrices Visualized

      • N. A. Balonin, Jennifer Seberry
      Pages 47-57
  3. Approximation Algorithms and Hardness

    1. Front Matter

      Pages 59-59
    2. On the Maximum Crossing Number

      • Markus Chimani, Stefan Felsner, Stephen Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
      Pages 61-74
    3. Approximation Results for the Incremental Knapsack Problem

      • Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
      Pages 75-87
  4. Computational Complexity

    1. Front Matter

      Pages 101-101
    2. Complexity Dichotomies for the Minimum \(\mathcal {F}\)-Overlay Problem

      • Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
      Pages 116-127
    3. Improved Complexity for Power Edge Set Problem

      • Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Matthias Weller
      Pages 128-141
    4. The Parameterized Complexity of Happy Colorings

      • Neeldhara Misra, I. Vinod Reddy
      Pages 142-153
  5. Computational Geometry

    1. Front Matter

      Pages 167-167
    2. Holes in 2-Convex Point Sets

      • Oswin Aichholzer, Martin Balko, Thomas Hackl, Alexander Pilz, Pedro Ramos, Pavel Valtr et al.
      Pages 169-181
  6. Graphs and Combinatorics

    1. Front Matter

      Pages 183-183

Other Volumes

  1. Combinatorial Algorithms

About this book

This book constitutes the refereed post-conference proceedings of the 28th International Workshop
on Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017.
The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named:  approximation algorithms and hardness; computational complexity; computational geometry; graphs and combinatorics; graph colourings, labellings and power domination; heuristics; mixed integer programming; polynomial algorithms; privacy; and string algorithms.


Editors and Affiliations

  • University of Newcastle Australia, Callaghan, Australia

    Ljiljana Brankovic, Joe Ryan

  • McMaster University, Hamilton, Canada

    William F. Smyth

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access