GROW
The Workshop on Graph Classes, Optimization, and Width Parameters (GROW) series of workshops brings together experts in both theoretical and practical issues to design new strategies for dealing with intractable graph problems. GROW is an invitation only, grassroots organized workshop held every second year.

Venue
Cottbus
Cottbus is a university city and modern center of the Lusatia region of around 100,000 inhabitants. It is situated around 125 km southeast of Berlin on the southern edge of the famous Spreewald Forest and north of the developing man-made Lusatian Lake District. Spreewald Forest is a biosphere reserve of UNESCO where the river Spree branches out into hundreds of smaller streams making up a unique and mystical water maze in Central Europe. Cottbus is also one of the cultural centers of the Wends and Sorbs, a Slavic ethnic minority in Germany.
BTU Cottbus - Senftenberg
The conference is held at the Main Campus of BTU Cottbus - Senftenberg. The BTU is a technical university with campuses in Cottbus and Senftenberg.

Photo: A.Savin, Wikipedia

Photo: Sane, Creative Commons Licence BY-SA 3.0 Deed

Photo: Maja Dumat - Creative Commons Licence BY 2.0
Travel Information
Getting to Cottbus
Berlin Brandenburg Airport (BER) is the best option to reach Cottbus by plane. From that airport you can reach Cottbus train station (Cottbus Hbf) in at most 1.5 hours by train.
Other airports in the nearby area are Airport Leipzig/Halle (LEJ) and Airport Dresden (DRS). From these airports the train connections take longer and are more expensive than from Berlin.
Getting from Cottbus train station to BTU Cottbus - Senftenberg
The university campus can be reached easily via public transport in less than 15 minutes. If you like to walk, it is 30 minutes from the train station.
Venue Address
BTU Cottbus - Senftenberg
Großer Hörsaal
Konrad-Zuse-Straße 4
03046 Cottbus
Link to a map with the airports and the venue: OpenStreetMap.
Link to a map of the university: campus map.
Registration & Talk Submission
The registration prices below include the conference registration fee, coffee breaks, and entry to all social activities, such as a welcome reception (on September 8, 2024), a excursion to the Spreewald (planned for Tuesday September 10, 2024), and conference dinner (planned for Wednesday September 11, 2024). The registration fee does not include accommodation or any additional meals beside the conference dinner.
There are two options for the excursion (see below) and you have to choose between them during the registration.
There is also an option to have further tickets for the dinner including the excursion.
The registration fee has to be payed via bank transfer. The details are given to you after your registration.
Prices in EUR |
Regular |
Additional Ticket (dinner, excursion) |
---|---|---|
Early bird (until July 31) | 160 | 100 |
Late registration (from August 1) | 250 | 100 |
You have received the links to the registration page and to the submission page for talk abstracts via email. If you have lost this email, please contact the organizers.
Program
Sunday, September 8, 2024
till 18:00 | Arrival in Cottbus |
from 18:30 | Welcome reception at BTU |
Monday, September 9, 2024
9:15 ‒ 9:30 | Welcome |
Session 1 ‒ Chair: Jesse Beisegel | |
9:30 ‒ 10:30 | Invited lecture by Paloma T. Lima
Algorithmic aspects of Tree Independence Number and Induced Matching Treewidth |
10:30 ‒ 11:00 | Coffee break |
Session 2 ‒ Chair: Clément Dallard | |
11:00 ‒ 11:25 | Tara Abrishami, Marcin Briański, Jadwiga Czyżewska, Rose McCarty, Martin Milanič, Paweł Rzążewski and Bartosz Walczak
Excluding a clique or a biclique in graphs of bounded induced matching treewidth |
11:25 ‒ 11:50 | Esther Galby, Andrea Munaro and Shizhou Yang
Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs |
11:50 ‒ 12:15 | Vaishali Surianarayanan
New Approximation Algorithms for Fractional Hypertree Width: Theory and Practice |
12:15 ‒ 14:15 | Lunch break |
Session 3 ‒ Chair: Noleen Köhler | |
14:15 ‒ 14:40 | Petr Hlineny and Jan Jedelský
H-Clique-Width and a Hereditary Analogue of Product Structure |
14:40 ‒ 15:05 | Jakub Gajarský, Michał Pilipczuk, Marek Sokołowski, Giannos Stamoulis and Szymon Toruńczyk
Tree-rank and elementary First-Order model checking |
15:05 ‒ 15:30 | Benjamin Bergougnoux, Jan Dreier and Lars Jaffke
Mim-width and efficient algorithmic meta-theorems |
15:30 ‒ 16:00 | Coffee break |
16:00 ‒ 17:30 | Open Problem Session 1 ‒ Chair: Jan Kratochvíl |
Tuesday, September 10, 2024
Session 4 ‒ Chair: Ekkehard Köhler | |
9:30 ‒ 10:30 | Invited lecture by Eunjung Kim
A small-size local certification for treewidth |
10:30 ‒ 11:00 | Coffee break |
Session 5 ‒ Chair: Christophe Paul | |
11:00 ‒ 11:25 | Carl Feghali, Van Bang Le, Felicia Lucke, Daniel Paulusma and Bernard Ries
Matching Cut and Variants on H-free graphs |
11:25 ‒ 11:50 | Guillaume Ducoffe, Laurent Feuilloley, Michel Habib and François Pitois
Pattern detection in ordered graphs |
11:50 ‒ 13:30 | Lunch break |
13:30 ‒ 19:00 | Excursion to the Spreewald |
Wednesday, September 11, 2024
Session 6 ‒ Chair: Andrea Munaro | |
9:30 ‒ 9:55 | Maximilian Gorsky and Sebastian Wiederrecht
Polynomial bounds for the Graph Minor Structure Theorem |
9:55 ‒ 10:20 | James Davies, Meike Hatzel and Liana Yepremyan
Counterexample to Babai's lonely colour conjecture |
10:20 ‒ 10:30 | Group Photo |
10:30 ‒ 11:00 | Coffee break |
Session 7 ‒ Chair: Sang-il Oum | |
11:00 ‒ 11:25 | Liana Khazaliya, Fionn Mc Inerney, Florent Foucaud, Esther Galby, Shaohua Li, Roohani Sharma and Prafullkumar Tale
Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover |
11:25 ‒ 11:50 | Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani and Stefan Szeider
Learning Small Decision Trees for Data of Low Rank-Width |
11:50 ‒ 12:15 | Feodor Dragan
On the tree-length and path-length parameters |
12:15 ‒ 14:15 | Lunch break |
Session 8 ‒ Chair: Feodor Dragan | |
14:15 ‒ 14:40 | Marthe Bonamy, Édouard Bonnet, Hugues Depres, Louis Esperet, Colin Geniet, Claire Hilaire, Stephan Thomassé and Alexanda Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth |
14:40 ‒ 15:05 | Jungho Ahn, Pascal Gollin, Tony Huynh and O-Joung Kwon
A coarse Erdős–Pósa theorem |
15:05 ‒ 15:30 | Maximalian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer and Sebastian Wiederrecht
Packing even directed circuits quarter-integrally |
15:30 ‒ 16:00 | Coffee break |
16:00 ‒ 16:10 | Announcement of the next GROW 2026 |
16:10 ‒ 17:30 | Open Problem Session 2 ‒ Chair: Martin Milanič |
from 19:00 | Conference dinner in restaurant "Zelig" |
Thursday, September 12, 2024
Session 9 ‒ Chair: Robert Scheffler | |
9:30 ‒ 10:30 | Invited lecture by Ignaz Rutter
Partial and Simultaneous Representations of Geometric Intersection Graphs |
10:30 ‒ 11:00 | Coffee break |
Session 10 ‒ Chair: Meike Hatzel | |
11:00 ‒ 11:25 | Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanič, Peter Muršič and Robert Scheffler
Simultaneous Representations meet Graph Width Parameters: The Simultaneous Interval Number and the Simultaneous Chordal Number |
11:25 ‒ 11:50 | Svein Høgemo
Towards a Polynomial-Time Algorithm for the Leaf Rank of Proper Interval Graphs |
11:50 ‒ 12:15 | Jan Kratochvil, Sabine Cornelsen, Ignaz Rutter and Therese Biedl
Constrained Outerstring Graphs |
12:15 ‒ 12:40 | Christophe Paul, Michel Habib, Cyril Bouvier, Derek Corneil and Marc Tedder
A recursive linear time modular decomposition algorithm via LexBFS |
12:40 ‒ 12:50 | Farewell |
Excursion
We offer two options for the excursion to the Spreewald. In general, we suggest to bring weather-proof clothing with you.
Punt Trip
Just sit down in the punt and let the driver do the rest.
Paddling Tour
You like it more sportive? Then choose this option. You share a kayak with another participant. Together with the other participants and guided by the local organizers you explore the small canals of the Spreewald using your own muscles.

Photo: Thomas Kohler, Creative Commons Licence BY 2.0

Photo: CPiegert, Creative Commons Licence BY-SA 3.0 Deed
Invited Speakers

Paloma T. Lima
IT University of CopenhagenPaloma T. Lima is an assistant professor at the IT University of Copenhagen, working in the Algorithms group. Before coming to Denmark, she was a PhD student (2016–2019) and a postdoctoral researcher (2020–2021) at the University of Bergen, Norway. Her research interests revolve around structural graph theory and parameterized complexity.

Ignaz Rutter
University of PassauIgnaz Rutter is professor at the University of Passau. Beforehand, he was assistant professor at TU Eindhoven (2016–2018), deputy professor at Goethe University Frankfurt (2016) and postdoc at the Charles University in Prague (2013–2014) as well as at the KIT in Karlsruhe (2011–2016). In Karlsruhe, he also obtained his master's and PhD degree.

Eunjung Kim
KAISTEunjung Kim is an associate professor at School of Computing, KAIST in South Korea and a CNRS researcher. She was hosted at LAMSADE (2011–2023) and, beforehand, she was a postdoc at CNRS-LIRMM (2010–2011). She obtained the master's degree in industrial engineering at KAIST and a PhD degree in computer science at Royal Holloway, University of London.
Registered Participants
You can find a list of registered participants here.Local Organizers
- Jesse Beisegel
- Diana Hübner
- Ekkehard Köhler
- Fabienne Ratajczak
- Robert Scheffler
Contact
For questions about the conference or the website contact the organizers via grow2024 (at) b-tu.de
Previous GROW Workshops
-
GROW 2022 – Koper (Slovenia), September 19–22, 2022
-
GROW 2019 – Vienna (Austria), September 23–26, 2019
-
GROW 2017 – Toronto (Canada), October 10–13, 2017
-
GROW 2015 – Aussois (France), October 11–15, 2015
-
GROW 2013 – Santorini Island (Greece), October 9–11, 2013
-
GROW 2011 – Daejeon (South Korea), October 27–29, 2011
-
GROW 2009 – Bergen (Norway), October 15–17, 2009
-
GROW 2007 – Eugene (USA), October 18–20, 2007
-
GROW 2005 – Prague (Czech Republic), October 17–19, 2005
-
GROW 2001 – Barcelona (Spain) in November 15–17, 2001