Skip to main content
SpringerLink
Log in

Combinatorial Algorithms

32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021, Proceedings

  • Conference proceedings
  • © 2021

Overview

Editors:
  1. Paola Flocchini

    1. University of Ottawa, Ottawa, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Lucia Moura

    1. University of Ottawa, Ottawa, 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 12757)

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

Included in the following conference series:

Conference proceedings info: IWOCA 2021.

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

  1. Contributed Papers

    1. On an Ordering Problem in Weighted Hypergraphs

      • Peter Damaschke
      Pages 252-264

    2. An Efficient Noisy Binary Search in Graphs via Median Approximation

      • Dariusz Dereniowski, Aleksander Łukasiewicz, Przemysław Uznański
      Pages 265-281

    3. A Study on the Existence of Null Labelling for 3-Hypergraphs

      • Niccolò Di Marco, Andrea Frosini, William Lawrence Kocay
      Pages 282-294

    4. Piercing All Translates of a Set of Axis-Parallel Rectangles

      • Adrian Dumitrescu, Josef Tkadlec
      Pages 295-309

    5. A Triangle Process on Regular Graphs

      • Colin Cooper, Martin Dyer, Catherine Greenhill
      Pages 310-323

    6. Complexity and Algorithms for MUL-Tree Pruning

      • Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk
      Pages 324-339

    7. Makespan Trade-Offs for Visiting Triangle Edges

      • Konstantinos Georgiou, Somnath Kundu, Paweł Prałat
      Pages 340-355

    8. Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k

      • Toru Hasunuma
      Pages 356-369

    9. Approximation Algorithms for Hitting Subgraphs

      • Noah Brüstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma
      Pages 370-384

    10. Isomorphic Unordered Labeled Trees up to Substitution Ciphering

      • Florian Ingels, Romain Azaïs
      Pages 385-399

    11. Intersecting Disks Using Two Congruent Disks

      • Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn
      Pages 400-413

    12. Disjoint Paths and Connected Subgraphs for H-Free Graphs

      • Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
      Pages 414-427

    13. Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property

      • Soh Kumabe, Takanori Maehara
      Pages 428-441

    14. Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters

      • Martin Kučera, Ondřej Suchý
      Pages 442-455Open Access

    15. Non-preemptive Tree Packing

      • Stefan Lendl, Gerhard Woeginger, Lasse Wulf
      Pages 456-468

    16. Card-Based Cryptographic Protocols for Three-Input Functions Using Private Operations

      • Yoshifumi Manabe, Hibiki Ono
      Pages 469-484

    17. Königsberg Sightseeing: Eulerian Walks in Temporal Graphs

      • Andrea Marino, Ana Silva
      Pages 485-500

    18. Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs

      • Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
      Pages 501-515

    19. New Approximations and Hardness Results for Submodular Partitioning Problems

      • Richard Santiago
      Pages 516-530

    20. An FPT Algorithm for Matching Cut and d-Cut

      • N. R. Aravind, Roopam Saxena
      Pages 531-543
Back to top

Other volumes

  1. Combinatorial Algorithms

Keywords

About this book

This book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format.

The 38 full papers included in this book together with 2 invited talks were carefully reviewed and selected from 107 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.

Chapter “Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.


Editors and Affiliations

  • University of Ottawa, Ottawa, Canada

    Paola Flocchini, Lucia Moura

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation