Workshop programs

GROW 2019 (Vienna, Austria)

• Invited speakers:
  • Martin Grohe (RWTH Aachen, Germany): Lovasz meets Weisfeiler and Leman
  • Daniel Král (Brno University, Czech Republic): Matroid Width Parameters and Integer Programming
  • Meirav Zehavi (Tel Aviv University, Israel): Contraction Decomposition in UDGs and Algorithmic Applications in Parameterized Complexity
• Full program
• Open problems

GROW 2017 (Toronto, Canada)

• Invited speakers:
  • Bruno Courcelle (Bordeaux University, France): Tree-width,clique-widthandfly-automata
  • Zdenek Dvorak (Charles University, Czech Republic): Structure of critical graphs and complexity of coloring
  • Anna Lubiw (University of Waterloo, Canada): Morphing and compatible triangulations of planar graph drawings
• Full program
• Open problems

GROW 2015 (Aussois, France)

• Invited speakers:
  • Julia Chuzhoy (Toyota Technological Institute, USA): Excluded Grid Theorem: Improved and Simplified
  • Jørgen Bang-Jensen (University of Southern Denmark, Denmark): Mixed structures in digraphs and completing orientations of par- tially oriented graphs
  • Gwenaël Joret (Université Libre de Bruxelles, Belgium): Sparsity and dimension
• Full program

GROW 2013 (Santorini, Greece)

• Invited speakers:
  • Susanne Albers (Humboldt-Universität zu Berlin, Germany): Algorithms for Online Bipartite Matching
  • Andreas Brandstädt (University of Rostock, Germany): On the complexity of some packing and covering problems in graphs and hypergraphs
  • Saket Saurabh (Institute of Mathematical Sciences, India & University of Bergen, Norway): Matroids, Randomness and FPT Algorithms
• Full program
• Open problems

GROW 2011 (Daejeon, Korea)

• Invited speakers:
  • Hans L. Bodlaender (Utrecht University, Netherlands): Preprocessing and Kernelizing Treewidth
  • Lorna Stewart (University of Alberta, Canada): The polygon number of a circle graph
  • Daniel Lokshtanov (University of California at San Diego, USA): Graphs of Truly Sublinear Treewidth
• Full program

GROW 2009 (Bergen, Norway)

• Invited Speakers:
  • Jaroslav Nesetril (Charles University, Czech Republic): Forbidden paths - universality and dualities
  • Ken-ichi Kawarabayashi (National Institute of Informatics, Japan): The disjoint paths problem - algorithms and structure
  • Kristina Vušković (University of Leeds, UK): The power of decomposition
• Full program

GROW 2007 (Eugene, USA)

• Invited speakers:
  • Pavol Hell (Simon Fraser University, Canada): Characterizations and dichotomies in homomorphism optimization
  • S.I. Oum (University of Waterloo, Canada): Introduction to rankwidth
  • J.A. Telle (Bergen University, Norway): Interval graph completion and P-time preprocessing
• Full program

GROW 2005 (Prague, Czech Republic)

• Invited speakers:
  • Maria Chudnovsky (Princeton/CMI, USA): The structure of clawfree graphs
  • Takao Nishizeki (Tohoku, Japan): Partitioning Graphs of Supply and Demand
  • Dimitrios Thilikos (Barcelona, Spain): Layout problems and related width parameters
• Full program
• Open problems