GROW 2019 – Workshop on Graph Classes, Optimization, and Width Parameters

Network of computer scientists and mathematicians

The Algorithms and Complexity Group of TU Wien hosted the 9th Workshop on Graph Classes, Optimization, and Width Parameters (GROW) on September 23-26, 2019.

GROW is a series of workshops that bring together experts from computer science and discrete mathematics to gain a deeper understanding of graph structures. Such insight can lead to efficient algorithms for hard computational problems, whose instances are modeled by graphs. Between the 16 contributed talks, the open problem session, and the invited talks by Martin Grohe (RWTH Aachen), Daniel Kral (Masaryk University), and Meirav Zehavi (Ben Gurion University), the workshop shed light on several of the “shadowy corners” of the research community rooted in discrete mathematics and algorithms.

The non-Academic program continued the tradition rooted in the motto “mens sana in corpore sano”, with a hike across the hills of Kahlenberg that ended with a dinner featuring typical regional cuisine in one of the hill-side Heurigen restaurants. 

GROW is an invitation-only workshop held every odd year, with previous editions in Europe, North America, and Asia. In 2019, GROW was chaired by Robert Ganian and Stefan Szeider of the Algorithms and Complexity Group at the Faculty of Informatics at TU Wien, co-organized by the Vienna Center for Logic and Algorithms (VCLA) and the Wolfgang Pauli Institute (WPI).

Comments are closed.