Skip to main content
  • Conference proceedings
  • © 2020

Combinatorial Algorithms

31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings

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

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

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

  1. Front Matter

    Pages i-xix
  2. Invited Paper

    1. Front Matter

      Pages 1-1
  3. Contributed Papers

    1. Front Matter

      Pages 15-15
    2. A Family of Tree-Based Generators for Bubbles in Directed Graphs

      • Vicente Acuña, Leandro Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot, Blerina Sinaimeri
      Pages 17-29
    3. The Micro-world of Cographs

      • Bogdan Alecu, Vadim Lozin, Dominique de Werra
      Pages 30-42
    4. Parameterized Complexity of \((A,\ell )\)-Path Packing

      • Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi et al.
      Pages 43-55
    5. On Proper Labellings of Graphs with Minimum Label Sum

      • Julien Bensmail, Foivos Fioravantes, Nicolas Nisse
      Pages 56-68
    6. Decremental Optimization of Dominating Sets Under the Reconfiguration Framework

      • Alexandre Blanché, Haruka Mizuta, Paul Ouvrard, Akira Suzuki
      Pages 69-82
    7. On the Complexity of Stackelberg Matroid Pricing Problems

      • Toni Böhnlein, Oliver Schaudt
      Pages 83-96
    8. Nonexistence Certificates for Ovals in a Projective Plane of Order Ten

      • Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias Kotsireas, Vijay Ganesh
      Pages 97-111
    9. Edge-Disjoint Branchings in Temporal Graphs

      • Victor Campos, Raul Lopes, Andrea Marino, Ana Silva
      Pages 112-125
    10. Optimal In-place Algorithms for Basic Graph Problems

      • Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
      Pages 126-139
    11. Further Results on Online Node- and Edge-Deletion Problems with Advice

      • Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith
      Pages 140-153
    12. Fair Packing of Independent Sets

      • Nina Chiarelli, Matjaž Krnc, Martin Milanič, Ulrich Pferschy, Nevena Pivač, Joachim Schauer
      Pages 154-165
    13. New Bounds for Maximizing Revenue in Online Dial-a-Ride

      • Ananya Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu et al.
      Pages 180-194
    14. Iterated Type Partitions

      • Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno
      Pages 195-210

Other Volumes

  1. Combinatorial Algorithms

About this book

This book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8–10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual format. 

The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.


Editors and Affiliations

  • University of Liverpool, Liverpool, UK

    Leszek Gąsieniec

  • CNRS and University of Bordeaux, Talence, France

    Ralf Klasing

  • King's College London, London, UK

    Tomasz Radzik

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