Proceedings: The proceedings are published by Springer in the ARCoSS subline of the LNCS series, and are available here: link.

Program

Times are in local Bordeaux time (Central European Summer Time, CEST, or UTC+2). You can click on a time to convert it into your local time (external website).
Underlined author names correspond to speakers.

 

Monday, June 8 – IWOCA Day 1

    • 09:15 – 09:30  Opening – Florent Foucaud and Ralf Klasing

Graph algorithms 1 – Session chair: Florent Foucaud

    • 09:30 – 09:55  Sankardeep Chakraborty, Kunihiko Sadakane and Srinivasa Rao Satti. Optimal In-place Algorithms for Basic Graph Problems
    • 10:00 – 10:25  Julien Bensmail, Foivos Fioravantes and Nicolas Nisse. On Proper Labellings of Graphs with Minimum Label Sum [slides]
    • 10:30 – 10:55  Nina Chiarelli, Matjaž Krnc, Martin Milanič, Ulrich Pferschy, Nevena Pivač and Joachim Schauer. Fair packing of independent sets

Tea break

Best papers – Session chairs: Program committee chairs

    • 11:15 – 11:40  Pratibha Choudhary. Polynomial Time Algorithms for Tracking Path Problems (Best student paper – shared)
    • 11:45 – 12:10  Florent Foucaud, Benjamin Gras, Anthony Perez and Florian Sikora. On the complexity of Broadcast Domination and Multipacking in digraphs (Best student paper – shared)
    • 12:15 – 12:40  Peter Damaschke. Two Robots Patrolling on a Line: Integer Version and Approximability (Best paper)

Lunch break

Invited talk – Session chair: Ralf Klasing

Tea break

Combinatorial algorithms – Session chair: Luisa Gargano

    • 15:15 – 15:40  Benoît Groz, Frederik Mallmann-Trenn, Claire Mathieu and Victor Verdugo. Skyline Computation with Noisy Comparisons
    • 15:45 – 16:10  Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias Kotsireas and Vijay Ganesh. Nonexistence Certificates for Ovals in a Projective Plane of Order Ten (Video)  [slides]
    • 16:15 – 16:40  Erin Lanus and Charles Colbourn. Algorithms for Constructing Anonymizing Arrays

Tea break

Dynamic and online algorithms 1 – Session chair: Thomas Erlebach

    • 17:00 – 17:25  Ananya Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold and Xinyue Xu. New Bounds for Maximizing Revenue in Online Dial-a-Ride [slides]
    • 17:30 – 17:55  Victor Campos, Raul Lopes, Andrea Marino and Ana Silva. Edge-Disjoint Branchings in Temporal Graphs

 
 

Tuesday, June 9 – IWOCA Day 2

Parameterized complexity – Session chair: Aris Pagourtzis

    • 09:30 – 09:55  Kishen Gowda, Neeldhara Misra and Vraj Patel. A Parameterized Perspective on Attacking and Defending Elections (Video)
    • 10:00 – 10:25  Gennaro Cordasco, Luisa Gargano and Adele Rescigno. Iterated Type Partitions [slides]

Tea break

Graph matching – Session chair: Petra Berenbrink

    • 10:45 – 11:10  Koki Hamada, Shuichi Miyazaki and Kazuya Okamoto. Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
    • 11:15 – 11:40  B S Panda and Juhi Chaudhary. Acyclic Matching in Some Subclasses of Graphs [slides]

Tea break

Matroids – Session chair: Amihood Amir

    • 12:00 – 12:25  Tibor Jordan, Yusuke Kobayashi, Ryoga Mahara and Kazuhisa Makino. The Steiner problem for count matroids
    • 12:30 – 12:55  Toni Böhnlein and Oliver Schaudt. On the Complexity of Stackelberg Matroid Pricing Problems

Lunch break

Invited talk – Session chair: Tomasz Radzik

    • 14:00 – 15:00  Dan Alistarh. Optimization by population: large-scale distributed optimization via population protocols

Tea break

Graph algorithms 2 – Session chair: Ian Munro

    • 15:15 – 15:40  Vicente Acuña, Leandro I. S. De Lima, Giuseppe F. Italiano, Luca Pepè Sciarria, Marie-France Sagot and Blerina Sinaimeri. A family of tree-based generators for bubbles in directed graphs
    • 15:45 – 16:10  Ioannis Lamprou, Ioannis Sigalas and Vassilis Zissimopoulos. Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
    • 16:15 – 16:40  Peter Damaschke. Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
    • 16:45 – 17:10  Guy Kortsarz and Zeev Nutov. Bounded Degree Group Steiner problems

Tea break

    • 17:30 – 18:15  Business meeting – Session chair: Tomasz Radzik
      including:
      Ralf Klasing. Program committee report. [slides]
      Florent Foucaud. Organizing committee report. [slides]
      Lucia Moura.       Presentation of IWOCA 2021 in Ottawa [slides]
      Henning Fernau.       Presentation of IWOCA 2022 in Trier

Wednesday, June 10 – IWOCA Day 3

Dynamic and online algorithms 2 – Session chair: Hans-Joachim Böckenhauer

    • 09:30 – 09:55  Toru Hasunuma. Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
    • 10:00 – 10:25  Alexandre Blanché, Haruka Mizuta, Paul Ouvrard and Akira Suzuki. Decremental Optimization of Dominating Sets Under the Reconfiguration Framework [slides]
    • 10:30 – 10:55  Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze and Peter Rossmanith. Further Results on Online Node- and Edge-Deletion Problems with Advice

Tea break

Parameterized graph algorithms – Session chair: Marthe Bonamy

    • 11:15 – 11:40  Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono and Yota Otachi. Parameterized Complexity of (A,l)-Path Packing
    • 11:45 – 12:10  Vahan Mkrtchyan, Garik Petrosyan, K. Subramani and Piotr Wojciechowski. Parameterized algorithms for partial vertex covers in bipartite graphs
    • 12:15 – 12:40  Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit and Saket Saurabh. On the Complexity of Singly Connected Vertex Deletion [slides]

Lunch break

Invited talk – Session chair: Leszek Gąsieniec

    • 14:00 – 15:00  Tatiana Starikovskaya. Algorithms for string processing in restricted-access models of computation (Video)

Tea break

Graph theory – Session chair: Xavier Muñoz

    • 15:15 – 15:40  Hervé Hocquard, Dimitri Lajou and Borut Lužar. Between proper and strong edge-colorings of subcubic graphs [slides]
    • 15:45 – 16:10  Bogdan Alecu, Vadim Lozin and Dominique de Werra. The micro-world of cographs [slides]
    • 16:15 – 16:40  Ewa Drgas-Burchardt, Hanna Furmańczyk and Elżbieta Sidorowicz. Equitable d-degenerate choosability of graphs

Tea break

 

Thursday, June 11 – GraphMasters

    • 10:00 – 18:00  Satellite event: GraphMasters (see here for more information) – Organizer: Alessio Conte