Skip to main content
SpringerLink
Log in

Combinatorial Algorithms

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

  • Conference proceedings
  • © 2018

Overview

Editors:
  1. Ljiljana Brankovic

    1. University of Newcastle Australia, Callaghan, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Joe Ryan

    1. University of Newcastle Australia, Callaghan, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. William F. Smyth

    1. McMaster University, Hamilton, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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)

Included in the following conference series:

Conference proceedings info: IWOCA 2017.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (34 papers)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Invited Papers

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    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. Extremal Kernelization: A Commemorative Paper

      • Henning Fernau
      Pages 24-36

    5. Recent Advances of Palindromic Factorization

      • Mai Alzamel, Costas S. Iliopoulos
      Pages 37-46

    6. 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
      Download chapter PDF

    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. Derandomization for k-Submodular Maximization

      • Hiroki Oshima
      Pages 88-99

  4. Computational Complexity

    1. Front Matter

      Pages 101-101
      Download chapter PDF

    2. On the Parameterized Complexity of Happy Vertex Coloring

      • Akanksha Agrawal
      Pages 103-115

    3. 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

    4. Improved Complexity for Power Edge Set Problem

      • Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Matthias Weller
      Pages 128-141

    5. The Parameterized Complexity of Happy Colorings

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

    6. Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction

      • Narayan Vikas
      Pages 154-166

  5. Computational Geometry

    1. Front Matter

      Pages 167-167
      Download chapter PDF

    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
      Download chapter PDF
Back to top

Other volumes

  1. Combinatorial Algorithms

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation