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:2009:30  Opening

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

  • Tea break

    Best papers
  • 11:1511:40Pratibha Choudhary. Polynomial Time Algorithms for Tracking Path Problems (Best student paper – shared)
  • 11:4512: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:1512:40Peter Damaschke. Two Robots Patrolling on a Line: Integer Version and Approximability (Best paper)

  • Lunch break

    Invited talk
  • 14:0015:00Sándor Fekete. Coordinating swarms of objects at extreme dimensions

  • Tea break

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

  • Tea break

    Dynamic and online algorithms 1
  • 17:0017:25Ananya Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold and Xinyue Xu. New Bounds for Maximizing Revenue in Online Dial-a-Ride
  • 17:3017:55  Victor Campos, Raul Lopes, Andrea Marino and Ana Silva. Edge-Disjoint Branchings in Temporal Graphs


Tuesday, June 9 – IWOCA Day 2

    Parameterized complexity
  • 09:3009:55  Kishen Gowda, Neeldhara Misra and Vraj Patel. A Parameterized Perspective on Attacking and Defending Elections
  • 10:0010:25  Gennaro Cordasco, Luisa Gargano and Adele Rescigno. Iterated Type Partitions

  • Tea break

    Graph matching
  • 10:4511:10  Koki Hamada, Shuichi Miyazaki and Kazuya Okamoto. Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
  • 11:1511:40  B S Panda and Juhi Chaudhary. Acyclic Matching in Some Subclasses of Graphs

  • Tea break

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

  • Lunch break

    Invited talk
  • 14:0015:00Dan Alistarh. Optimization by population: large-scale distributed optimization via population protocols

  • Tea break

    Graph algorithms 2
  • 15:1515: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:4516:10Ioannis Lamprou, Ioannis Sigalas and Vassilis Zissimopoulos. Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
  • 16:1516:40Peter Damaschke. Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
  • 16:4517:10Guy Kortsarz and Zeev Nutov. Bounded Degree Group Steiner problems

  • Tea break

  • 17:3018:00  Business meeting


Wednesday, June 10 – IWOCA Day 3

    Dynamic and online algorithms 2
  • 09:3009:55Toru Hasunuma. Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
  • 10:0010:25Alexandre Blanché, Haruka Mizuta, Paul Ouvrard and Akira Suzuki. Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
  • 10:3010: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
  • 11:1511: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:4512:10  Vahan Mkrtchyan, Garik Petrosyan, K. Subramani and Piotr Wojciechowski. Parameterized algorithms for partial vertex covers in bipartite graphs
  • 12:1512:40Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit and Saket Saurabh. On the Complexity of Singly Connected Vertex Deletion

  • Lunch break

    Invited talk
  • 14:0015:00Tatiana Starikovskaya. Algorithms for string processing in restricted-access models of computation

  • Tea break

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

  • Tea break

  • 17:0018:00  Open problems session

  • 18:0018:15  Conference closing and Tea


Thursday, June 11 – GraphMasters

  • 09:0018:00  Satellite event: GraphMasters (see here for more information)