Wed | May 25 | 07:30 | Sebastian Siebertz | Transducing paths in graph classes with unbounded shrubdepth | |

Wed | May 18 | 07:30 | Jan Kurkofka | Canonical Graph Decompositions via Coverings | |

Wed | Apr 27 | 07:30 | Michael Savery | TBA | |

Wed | Apr 13 | 07:30 | Jakub Gajarský | Model Checking on Interpretations of Classes of Bounded Local Clique-Width | |

Wed | Mar 30 | 07:30 | Jean-Florent Raymond | Long induced paths in minor-closed graph classes and beyond | |

Thu | Mar 10 | 07:30 | Fedor Fomin | Long cycles in graphs: Extremal Combinatorics meets Parameterized Algorithms | |

Fri | Feb 18 | 01:00 | Manuel Lafond | Recognizing k-leaf powers in polynomial time, for constant k | |

Thu | Feb 10 | 07:30 | James Davies | Separating polynomial χ-boundedness from χ-boundedness | |

Thu | Jan 27 | 07:30 | Bo Ning | Substructures and eigenvalues of graphs: Triangles and quadrilaterals | |

Thu | Jan 20 | 07:30 | Ken-ichi Kawarabayashi | Toward Directed Graph Minor Theory | |

Thu | Jan 13 | 07:30 | Ron Aharoni | A strong version of the Caccetta-Haggkvist conjecture | |

Thu | Dec 09 | 07:30 | David Munhá Correia | Rainbow matchings | |

Thu | Nov 25 | 07:30 | Tuukka Korhonen | Fast FPT-Approximation of Branchwidth | |

Thu | Nov 11 | 07:30 | Sebastian Wiederrecht | Matching Minors in Bipartite Graphs | |

Fri | Nov 05 | 07:30 | Martin Milanič | Tree Decompositions with Bounded Independence Number | |

Fri | Oct 08 | 01:00 | Paul Seymour | Polynomial bounds for chromatic number | |

Thu | Sep 30 | 07:30 | Péter Pál Pach | The Alon-Jaeger-Tarsi conjecture via group ring identities | |

Wed | Aug 18 | 08:00 | Petr Hliněný | Twin-width is linear in the poset width | |

Wed | Jul 28 | 06:00 | Maria Chudnovsky | Induced subgraphs and tree decompositions | |

Wed | Jul 14 | 08:00 | Stefan Weltge | Integer programs with bounded subdeterminants and two nonzeros per row | |

Wed | Jun 30 | 08:00 | Florian Gut and Attila Joó | Large vertex-flames in uncountable digraphs | |

Wed | Jun 16 | 08:00 | Alan Lew | Representability and boxicity of simplicial complexes | |

Wed | Jun 02 | 08:00 | Adam Zsolt Wagner | Constructions in combinatorics via neural networks | |

Wed | May 26 | 08:00 | Dimitrios M. Thilikos | Bounding Obstructions sets: the cases of apices of minor closed classes | |

Fri | May 21 | 08:00 | Benjamin Bumpus | Directed branch-width: A directed analogue of tree-width | |

Wed | May 12 | 08:00 | Johannes Carmesin | A Whitney type theorem for surfaces: characterising graphs with locally planar embeddings | |

Thu | May 06 | 01:00 | Raul Lopes | Adapting the Directed Grid Theorem into an FPT Algorithm | |

Wed | Apr 21 | 08:00 | Reinhard Diestel | Tangles of set separations: a novel clustering method and type recognition in machine learning | |

Wed | Apr 14 | 08:00 | István Tomon | Ramsey properties of semilinear graphs | |

Wed | Apr 07 | 08:00 | Michał Pilipczuk | Structural properties of powers of sparse graphs | |

Thu | Apr 01 | 01:00 | Sophie Spirkl | Pure pairs in ordered graphs | |

Wed | Mar 24 | 08:00 | Édouard Bonnet | Twin-width and ordered binary structures | |

Wed | Mar 17 | 08:00 | Yixin Cao | Recognizing (unit) interval graphs by zigzag graph searches | |

Wed | Feb 17 | 01:00 | David Wood | Tree densities of sparse graph classes | |

Wed | Feb 10 | 07:30 | Jie Ma | Non-repeated cycle lengths and Sidon sequences | |

Wed | Feb 03 | 07:30 | Ron Aharoni | Colorful KKM and multiple cakes division | |

Wed | Jan 27 | 01:00 | Dong Yeap Kang | A proof of the Erdős-Faber-Lovász conjecture | |

Wed | Jan 20 | 07:30 | Yusuke Kobayashi | An FPT Algorithm for Minimum Additive Spanner Problem | |

Wed | Jan 13 | 01:00 | Rose McCarty | TBA | |

Wed | Dec 30 | 01:00 | Paul Seymour | The Erdős-Hajnal conjecture is true for excluding a five-cycle | |

Thu | Dec 17 | 01:00 | Jaiung Jun | On the Hopf algebra of multi-complexes | |

Wed | Dec 09 | 07:30 | Karl Heuer | Even Circuits in Oriented Matroids | |

Thu | Dec 03 | 07:30 | Deniz Sarikaya | What means Hamiltonicity for infinite graphs and how to force it via forbidden induced subgraphs | |

Thu | Nov 26 | 01:00 | Da Qi Chen | Bipartite saturation | |

Thu | Nov 19 | 07:30 | Yijia Chen | Graphs of bounded shrub-depth, through a logic lens | |

Wed | Nov 11 | 07:30 | Meike Hatzel | Constant congestion bramble | |

Thu | Nov 05 | 01:00 | Daniel Cranston | Vertex Partitions into an Independent Set and a Forest with Each Component Small | |

Thu | Oct 22 | 01:00 | Chun-Hung Liu | Asymptotic dimension of minor-closed families and beyond | |

Thu | Sep 24 | 01:00 | Zihan Tan | Towards Tight(er) Bounds for the Excluded Grid Theorem | |

Thu | Sep 17 | 01:00 | Luke Postle | Further progress towards Hadwiger’s conjecture | |

Thu | Sep 10 | 08:10 | Sebastian Siebertz | Rank-width meets stability | |

Wed | Aug 26 | 01:30 | Nick Brettell | On the graph width parameter mim-width | |

Wed | Aug 19 | 07:30 | Gwenaël Joret | Packing and covering balls in graphs excluding a minor | |

Wed | Aug 05 | 07:30 | Robert Ganian | Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions | |

Wed | Jul 29 | 07:30 | Akanksha Agrawal | Polynomial Kernel for Interval Vertex Deletion | |

Wed | Jul 22 | 07:30 | Paloma T. Lima | Graph square roots of small distance from degree one graphs | |