Advertisement

Combinatorial Algorithms

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

  • Ljiljana Brankovic
  • Joe Ryan
  • William F. Smyth
Conference proceedings IWOCA 2017

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10765)

Table of contents

  1. Front Matter
    Pages I-XII
  2. Invited Papers

    1. Front Matter
      Pages 1-1
    2. Martin Bača, Nurdin Hinding, Aisha Javed, Andrea Semaničová-Feňovčíková
      Pages 3-12
    3. Diane Donovan, Thomas A. McCourt
      Pages 13-23
    4. Mai Alzamel, Costas S. Iliopoulos
      Pages 37-46
    5. N. A. Balonin, Jennifer Seberry
      Pages 47-57
  3. Approximation Algorithms and Hardness

    1. Front Matter
      Pages 59-59
    2. Markus Chimani, Stefan Felsner, Stephen Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff
      Pages 61-74
    3. Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
      Pages 75-87
  4. Computational Complexity

    1. Front Matter
      Pages 101-101
    2. Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant
      Pages 116-127
    3. Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Matthias Weller
      Pages 128-141
    4. Neeldhara Misra, I. Vinod Reddy
      Pages 142-153
  5. Computational Geometry

    1. Front Matter
      Pages 167-167
    2. 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
    2. Vadim Lozin
      Pages 185-194
    3. Bogdan Alecu, Vadim Lozin, Viktor Zamaraev, Dominique de Werra
      Pages 195-205
    4. Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Maxime Samson
      Pages 206-218
    5. Hovhannes A. Harutyunyan, Zhiyuan Li
      Pages 219-230
  7. Graph Colourings, Labelings and Power Domination

    1. Front Matter
      Pages 231-231
    2. Michel Vasquez, Yannick Vimont
      Pages 244-251
    3. Matěj Konečný, Stanislav Kučera, Jana Novotná, Jakub Pekárek, Štěpán Šimsa, Martin Töpfer
      Pages 252-263
    4. Cyriac Grigorious, Thomas Kalinowski, Sudeep Stephen
      Pages 264-272
  8. Heuristics

    1. Front Matter
      Pages 273-273
    2. Sergiu Carpov, Pascal Aubry, Renaud Sirdey
      Pages 275-286
    3. Rhydian Lewis, Kate Smith-Miles, Kyle Phillips
      Pages 287-298
  9. Mixed Integer Programming

  10. Polynomial Algorithms

    1. Front Matter
      Pages 341-341
    2. Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis
      Pages 343-355
  11. Privacy

    1. Front Matter
      Pages 369-369
  12. String Algorithms

    1. Front Matter
      Pages 395-395
    2. Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
      Pages 397-408
    3. Tatsuya Ohno, Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto
      Pages 409-419
    4. Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
      Pages 420-431
  13. Back Matter
    Pages 433-434

About these proceedings

Introduction

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.

Keywords

Complexity Theory Graph Theory Combinatorics Combinatorial Optimization Cryptography Information Security Strings Algorithms Graph Algorithms Graph Drawing Graph Labelling Computational Algebra Computational Geometry Computational Biology Probabilistic and Randomised Algorithms Algorithms for Big Data Analytics New Paradigms of Computation problem solving approximation algorithms coloring artificial intelligence

Editors and affiliations

  1. 1.University of Newcastle AustraliaCallaghanAustralia
  2. 2.University of Newcastle AustraliaCallaghanAustralia
  3. 3.McMaster UniversityHamiltonCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-78825-8
  • Copyright Information Springer International Publishing AG, part of Springer Nature 2018
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-78824-1
  • Online ISBN 978-3-319-78825-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site