Skip to main content
  • Conference proceedings
  • © 2019

Combinatorial Algorithms

30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings

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

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

Buy it now

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 79.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 (36 papers)

  1. Front Matter

    Pages i-xix
  2. A Note on Handicap Incomplete Tournaments

    • Appattu Vallapil Prajeesh, Krishnan Paramasivam, Nainarraj Kamatchi
    Pages 1-9
  3. Computing the k-Crossing Visibility Region of a Point in a Polygon

    • Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas Shermer
    Pages 10-21
  4. An Improved Scheme in the Two Query Adaptive Bitprobe Model

    • Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani
    Pages 22-34
  5. On Erdős–Szekeres-Type Problems for k-convex Point Sets

    • Martin Balko, Sujoy Bhore, Leonardo Martínez Sandoval, Pavel Valtr
    Pages 35-47
  6. Fixed-Parameter Tractability of \((n-k)\) List Coloring

    • Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman
    Pages 61-69
  7. Finding Periods in Cartesian Tree Matching

    • Magsarjav Bataa, Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park
    Pages 70-84
  8. Parameterized Complexity of Min-Power Asymmetric Connectivity

    • Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein
    Pages 85-96
  9. Solving Group Interval Scheduling Efficiently

    • Arindam Biswas, Venkatesh Raman, Saket Saurabh
    Pages 97-107
  10. Call Admission Problems on Trees with Advice

    • Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm
    Pages 108-121
  11. Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs

    • Pierre Cazals, Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
    Pages 122-135
  12. Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs

    • Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
    Pages 148-159
  13. Dual Domination

    • Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno
    Pages 160-174
  14. Reaching 3-Connectivity via Edge-Edge Additions

    • Giordano Da Lozzo, Ignaz Rutter
    Pages 175-187
  15. Cops and Robber on Some Families of Oriented Graphs

    • Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen
    Pages 188-200
  16. Disjoint Clustering in Combinatorial Circuits

    • Zola Donovan, K. Subramani, Vahan Mkrtchyan
    Pages 201-213
  17. The Hull Number in the Convexity of Induced Paths of Order 3

    • Mitre C. Dourado, Lucia D. Penso, Dieter Rautenbach
    Pages 214-228
  18. Supermagic Graphs with Many Odd Degrees

    • Dalibor Froncek, Jiangyi Qiu
    Pages 229-236

Other Volumes

  1. Combinatorial Algorithms

About this book

This book constitutes the refereed post-conference proceedings of the 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, held in Pisa, Italy, in July 2019. The 36 regular papers presented in this volume were carefully reviewed and selected from 73 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 randomized algorithms, algorithms for big data analytics, and new paradigms of computation.

Editors and Affiliations

  • Arizona State University, Tempe, USA

    Charles J. Colbourn

  • University of Pisa, Pisa, Italy

    Roberto Grossi, Nadia Pisanti

Bibliographic Information

Buy it now

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 79.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