Skip to main content
SpringerLink
Log in

Combinatorial Algorithms

29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings

  • Conference proceedings
  • © 2018

Overview

Editors:
  1. Costas Iliopoulos

    1. Department of Informatics, King’s College London, London, United Kingdom

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hon Wai Leong

    1. Department of Computer Science, School of Computing, National University of Singapore, Singapore, Singapore

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Wing-Kin Sung

    1. Department of Computer Science, School of Computing, National University of Singapore, Singapore, Singapore

    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 10979)

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

Included in the following conference series:

Conference proceedings info: IWOCA 2018.

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 (31 papers)

  1. Front Matter

    Pages I-XIX
    Download chapter PDF

  2. Collision-Free Routing Problem with Restricted L-Path

    • Jammigumpula Ajay, Sasanka Roy
    Pages 1-13

  3. Linear Clique-Width of Bi-complement Reducible Graphs

    • Bogdan Alecu, Vadim Lozin, Viktor Zamaraev
    Pages 14-25

  4. Linear Ramsey Numbers

    • Aistis Atminas, Vadim Lozin, Viktor Zamaraev
    Pages 26-38

  5. Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract)

    • Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
    Pages 39-51

  6. Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families

    • Thais Bardini Idalino, Lucia Moura
    Pages 52-64

  7. Minimum Polygons for Fixed Visibility VC-Dimension

    • Moritz Beck, Sabine Storandt
    Pages 65-77

  8. Minsum k-Sink Problem on Dynamic Flow Path Networks

    • Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
    Pages 78-89

  9. Fully Leafed Induced Subtrees

    • Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme
    Pages 90-101

  10. Pattern Matching for k-Track Permutations

    • Laurent Bulteau, Romeo Rizzi, Stéphane Vialette
    Pages 102-114

  11. Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs

    • Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
    Pages 115-127

  12. On the Area Requirements of Straight-Line Orthogonal Drawings of Ternary Trees

    • Barbara Covella, Fabrizio Frati, Maurizio Patrignani
    Pages 128-140

  13. A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs

    • Christine Dahn, Nils M. Kriege, Petra Mutzel
    Pages 141-152

  14. Covering with Clubs: Complexity and Approximability

    • Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis
    Pages 153-164

  15. On the Expected Number of Distinct Gapped Palindromic Factors

    • Philippe Duchon, Cyril Nicaud
    Pages 165-176

  16. Computational Complexity of Robot Arm Simulation Problems

    • Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno et al.
    Pages 177-188

  17. Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array Generation

    • Kristoffer Kleine, Ilias Kotsireas, Dimitris E. Simos
    Pages 189-200

  18. Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth

    • Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura
    Pages 201-213

  19. An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest

    • Christine Markarian
    Pages 214-223

  20. Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem

    • Robin Milosz, Sylvie Hamel, Adeline Pierrot
    Pages 224-236
Back to top

Other volumes

  1. Combinatorial Algorithms

Keywords

About this book

This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomised algorithms, algorithms for big data analytics, and new paradigms of computation.

Editors and Affiliations

  • Department of Informatics, King’s College London, London, United Kingdom

    Costas Iliopoulos

  • Department of Computer Science, School of Computing, National University of Singapore, Singapore, Singapore

    Hon Wai Leong, Wing-Kin Sung

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation