Program

  • 8:00–8:50
    Registration
  • 8:50–9:00
    Opening
  • 9:00–10:00
    Invited Talk 1
    Session chair: Philipp Kindermann

    From planar to 1-planar... or not?

    Therese Biedl

  • 10:00–10:40
    Session 1: Matchings
    Session chair: Jonathan Rollin
  • 10:00-10:20

    Matchings of five directions in hypercube extends to Hamilton cycles and paths with prescribed ends

    Vojtěch Hotmar and Jiří Fink

  • 10:20-10:40

    On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs

    Babak Ghanbari and Robert Samal

  • 10:40–11:10
    Coffee Break
  • 11:10–12:50
    Session 2: Graph Drawing
    Session chair: Jan Kratochvil
  • 11:10-11:30

    Unbent Collections of Orthogonal Drawings

    Todor Antić, Giuseppe Liotta, Tomáš Masařík, Giacomo Ortali, Matthias Pfretzschner, Peter Stumpf, Alexander Wolff and Johannes Zink

  • 11:30-11:50

    Segment Intersection Representations, Level Planarity and Constrained Ordering Problems

    Simon D. Fink, Matthias Pfretzschner and Peter Stumpf

  • 11:50-12:10

    On plane cycles in geometric multipartite graphs

    Marco Ricci, Jonathan Rollin, André Schulz and Alexandra Weinberger

  • 12:10-12:30

    Subgraph-Universal Planar Graphs for Trees

    Helena Bergold, Vesna Iršič Chenoweth, Robert Lauff, Joachim Orthaber, Manfred Scheucher and Alexandra Wesolek

  • 12:30-12:50

    The Peculiarities of Extending Queue Layouts

    Thomas Depian, Simon D. Fink, Robert Ganian and Martin Nöllenburg

  • 12:50–14:20
    Lunch
  • 14:20–15:40
    Session 3: Graph Structures
    Session chair: Meike Hatzel
  • 14:20-14:40

    Connectivity-Preserving Minimum Separator in AT-free Graphs

    Batya Kenig

  • 14:40-15:00

    Excluding an induced wheel minor in graphs without large induced stars

    Mujin Choi, Claire Hilaire, Martin Milanič and Sebastian Wiederrecht

  • 15:00-15:20

    A structural description of Zykov and Blanche Descartes graphs

    Malory Marin, Stéphan Thomassé, Nicolas Trotignon and Rémi Watrigant

  • 15:20-15:40

    Expanders in Models of Social Networks

    Marc Kaufmann, Johannes Lengler, Ulysse Schaller and Konstantin Sturm

  • 15:40–16:10
    Coffee break
  • 16:10–17:30
    Session 4: Tree- & Pathwidth
    Session chair: Haiko Müller
  • 16:10-16:30

    Concurrency Constrained Scheduling with Tree-Like Constraints

    Hans Bodlaender, Danny Hermelin and Erik Jan van Leeuwen

  • 16:30-16:50

    On graphs coverable by chubby shortest paths

    Meike Hatzel and Michał Pilipczuk

  • 16:50-17:10

    A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees

    Lars Jaffke, Paloma de Lima, Wojciech Nadara and Emmanuel Sam

  • 17:10-17:30

    Bounding Width on Graph Classes of Constant Diameter

    Konrad K. Dabrowski, Tala Eagling-Vose, Noleen Köhler, Sebastian Ordyniak and Daniel Paulusma

  • 17:30-17:30

    Chromatic Index under Parameterized Settings

    Sriram Bhyravarapu, Soumen Mandal, Ashutosh Rai, Saket Saurabh and Shaily Verma

    [Video]

  • 17:30–18:45
    Short break
  • 17:45–19:00
    Business Meeting
  • 19:00–21:00
    Dinner
  • 08:40–09:40
    Test of Time Award
    Session chair: Daniel Paulusma

    Asteroidal Triple-Free Graphs

    Derek G. Corneil, Stephan Olariu and Lorna Stewart

  • 09:40–10:20
    Session 5: Best (student) paper
    Session chair: Philipp Kindermann
  • 09:40-10:00

    Polynomial-time recognition and maximum independent set in Burling graphs

    Paweł Rzążewski and Bartosz Walczak

  • 10:00-10:20

    Structural Parameterizations for Induced and Acyclic Matching

    Michael Lampis and Manolis Vasilakis

  • 10:20–10:50
    Coffee Break
  • 10:50–11:50
    Session 6: Kernelization
    Session chair: Hans Bodlaender
  • 10:50-11:10

    Polynomial-Size Enumeration Kernelizations for Long Path Enumeration

    Christian Komusiewicz, Diptapriyo Majumdar and Frank Sommer

  • 11:10-11:30

    Boundaried Kernelization

    Leonid Antipov and Stefan Kratsch

  • 11:30-11:50

    A simple quadratic kernel for Token Jumping on surfaces

    Daniel Cranston, Moritz Mühlenthaler and Benjamin Peyrille

  • 11:50–12:00
    Short break
  • 12:00–13:00
    Session 7: H-graphs & Succinctness
    Session chair: Bartosz Walczak
  • 12:00-12:20

    Non-crossing H-graphs: a generalization of proper interval graphs admitting FPT algorithms

    Flavia Bonomo, Nick Brettell, Andrea Munaro and Daniel Paulusma

  • 12:20-12:40

    Interval k-graphs : Recognition and forbidden obstructions

    Haiko Müller and Arash Rafiey

  • 12:40-13:00

    Succinct Preferential-Attachment Graphs

    Ziad Ismaili Alaoui, Namrata and Sebastian Wild

  • 13:00–14:20
    Lunch
  • 14:30–18:00
    Excursion to Villa Borg
  • 18:00–20:30
    Conference dinner at Taverne Borg
  • 20:30–21:30
    Return trip to Otzenhausen
  • 08:40–09:40
    Invited Talk 2
    Session chair: Henning Fernau

    Some Tools from Formal Language Theory for Graph Theory

    Mamadou Kanté

  • 09:40–10:40
    Session 8: Temporal Graphs & Games
    Session chair: Simon D. Fink
  • 09:40-10:00

    Realizing temporal transportation trees

    George Mertzios, Hendrik Molter, Nils Morawietz and Paul Spirakis

  • 10:00-10:20

    Canadian Traveler Problems in Temporal Graphs

    Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh Hang Nguyen and Mikaël Rabie

  • 10:20-10:40

    Playing Snake on a Graph

    Denise Graafsma, Bodo Manthey and Alexander Skopalik

  • 10:40–11:10
    Coffee Break
  • 11:10–12:30
    Session 9: Parameterized Complexity
    Session chair: Michał Pilipczuk
  • 11:10-11:30

    Faster Algorithms for Graph Monopolarity

    Geevarghese Philip and Shrinidhi Teganahally Sridhara

  • 11:30-11:50

    Reductions in local certification

    Louis Esperet and Sébastien Zeitoun

  • 11:50-12:10

    Efficient parameterized approximation

    Stefan Kratsch and Pascal Kunz

  • 12:10-12:30

    When does FTP become FPT?

    Matthias Bentert, Fedor Fomin, Petr Golovach and Laure Morelle

  • 12:30-12:30

    Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT

    Sriram Bhyravarapu, Shashanka Kulamarva, Pritesh Kumar, Shivesh K. Roy and Saket Saurabh

    [Video]

  • 12:30–12:45
    Closing & Farewell
  • 12:45–14:00
    Lunch