| 2026 | ICALP | Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width. | Dario Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2026 | SODA | The Directed Disjoint Paths Problem with Congestion. | Matthias Bentert, Dario Cavallaro, Amelie Heindl, Ken-ichi Kawarabayashi, Stephan Kreutzer, Johannes Schrder |
| 2024 | FOCS | Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem. | Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi |
| 2024 | STOC | Edge-Disjoint Paths in Eulerian Digraphs. | Dario Giuliano Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2024 | STOC | Packing Even Directed Circuits Quarter-Integrally. | Maximilian Gorsky, Ken-ichi Kawarabayashi, Stephan Kreutzer, Sebastian Wiederrecht |
| 2023 | SODA | A half-integral Erdős-Psa theorem for directed odd cycles. | Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie |
| 2022 | CSL | Differential Games, Locality, and Model Checking for FO Logic of Graphs. | Jakub Gajarsk, Maximilian Gorsky, Stephan Kreutzer |
| 2022 | LICS | Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. | douard Bonnet, Jan Dreier, Jakub Gajarsk, Stephan Kreutzer, Nikolas Mhlmann, Pierre Simon, Szymon Torunczyk |
| 2022 | SODA | Directed Tangle Tree-Decompositions and Applications. | Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon |
| 2020 | SODA | The Directed Flat Wall Theorem. | Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon |
| 2020 | STACS | Computing Shrub-Depth Decompositions. | Jakub Gajarsk, Stephan Kreutzer |
| 2019 | SODA | Polynomial Planar Directed Grid Theorem. | Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2019 | STACS | Algorithmic Properties of Sparse Digraphs. | Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz |
| 2018 | ICALP | On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface. | Albert Atserias, Stephan Kreutzer, Marc Noy |
| 2018 | ICALP | First-Order Interpretations of Bounded Expansion Classes. | Jakub Gajarsk, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
| 2017 | CSL | Current Trends and New Perspectives for First-Order Model Checking (Invited Talk). | Stephan Kreutzer |
| 2017 | ICALP | Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. | Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz |
| 2017 | LICS | Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. | Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz |
| 2017 | SODA | Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. | Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz |
| 2017 | STACS | Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs. | Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Grischa Weberstdt |
| 2016 | MFCS | Routing with Congestion in Acyclic Digraphs. | Saeed Akhoondian Amiri, Stephan Kreutzer, Dniel Marx, Roman Rabinovich |
| 2016 | MFCS | The Generalised Colouring Numbers on Classes of Bounded Expansion. | Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz |
| 2016 | STACS | Kernelization and Sparseness: the Case of Dominating Set. | Pl Grns Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Snchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar |
| 2015 | ICALP | Towards the Graph Minor Theorems for Directed Graphs. | Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2015 | STOC | The Directed Grid Theorem. | Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2015 | STACS | Graph Searching Games and Width Measures for Directed Graphs. | Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz |
| 2015 | WG | Colouring and Covering Nowhere Dense Graphs. | Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos |
| 2014 | CSL | Decomposition theorems and model-checking for the modal | Mikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer |
| 2014 | CSL | On Hanf-equivalence and the number of embeddings of small induced subgraphs. | Stephan Kreutzer, Nicole Schweikardt |
| 2014 | CSR | Vertex Disjoint Paths in Upward Planar Graphs. | Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz |
| 2014 | SODA | An Excluded Grid Theorem for Digraphs with Forbidden Minors. | Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2014 | STOC | Deciding first-order properties of nowhere dense graphs. | Martin Grohe, Stephan Kreutzer, Sebastian Siebertz |
| 2014 | STOC | An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem. | Ken-ichi Kawarabayashi, Yusuke Kobayashi, Stephan Kreutzer |
| 2013 | LICS | Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes. | Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2013 | LICS | Quantitative Monadic Second-Order Logic. | Stephan Kreutzer, Cristian Riveros |
| 2013 | SODA | Packing directed cycles through a specified vertex set. | Ken-ichi Kawarabayashi, Daniel Krl', Marek Krcl, Stephan Kreutzer |
| 2012 | LICS | First-Order and Monadic Second-Order Model-Checking on Ordered Structures. | Viktor Engelmann, Stephan Kreutzer, Sebastian Siebertz |
| 2012 | SODA | Directed nowhere dense classes of graphs. | Stephan Kreutzer, Siamak Tazari |
| 2010 | LICS | Lower Bounds for the Complexity of Monadic Second-Order Logic. | Stephan Kreutzer, Siamak Tazari |
| 2010 | LPAR | Extended Computation Tree Logic. | Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte |
| 2010 | SODA | On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. | Stephan Kreutzer, Siamak Tazari |
| 2009 | CONCUR | Reachability in Succinct and Parametric One-Counter Automata. | Christoph Haase, Stephan Kreutzer, Jol Ouaknine, James Worrell |
| 2009 | CSL | On the Parameterised Intractability of Monadic Second-Order Logic. | Stephan Kreutzer |
| 2009 | WG | Distance | Stephan Kreutzer, Sebastian Ordyniak |
| 2008 | ICALP | On Datalog vs. LFP. | Anuj Dawar, Stephan Kreutzer |
| 2008 | SODA | Computing excluded minors. | Isolde Adler, Martin Grohe, Stephan Kreutzer |
| 2008 | WG | Digraph Decompositions and Monotonicity in Digraph Searching. | Stephan Kreutzer, Sebastian Ordyniak |
| 2007 | ICALP | Model Theory Makes Formulas Large. | Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt |
| 2007 | ICALP | Boundedness of Monadic FO over Acyclic Structures. | Stephan Kreutzer, Martin Otto, Nicole Schweikardt |
| 2007 | LICS | Locally Excluding a Minor. | Anuj Dawar, Martin Grohe, Stephan Kreutzer |
| 2007 | SODA | Digraph measures: Kelly decompositions, games, and orderings. | Paul Hunter, Stephan Kreutzer |
| 2006 | LICS | Approximation Schemes for First-Order Definable Optimisation Problems. | Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt |
| 2006 | STACS | DAG-Width and Parity Games. | Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer |
| 2005 | CSL | The Complexity of Independence-Friendly Fixpoint Logic. | Julian C. Bradfield, Stephan Kreutzer |
| 2005 | MFCS | The Expressive Power of Two-Variable Least Fixed-Point Logics. | Martin Grohe, Stephan Kreutzer, Nicole Schweikardt |
| 2004 | ICALP | Backtracking Games and Inflationary Fixed Points. | Anuj Dawar, Erich Grdel, Stephan Kreutzer |
| 2003 | LICS | Will Deflation Lead to Depletion? On Non-Monotone Fixed Point Inductions. | Erich Grdel, Stephan Kreutzer |
| 2003 | LPAR | Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games. | Dietmar Berwanger, Erich Grdel, Stephan Kreutzer |
| 2002 | CSL | Partial Fixed-Point Logic on Infinite Structures. | Stephan Kreutzer |
| 2002 | LICS | Expressive Equivalence of Least and Inflationary Fixed-Point Logic. | Stephan Kreutzer |
| 2001 | CSL | Inflationary Fixed Points in Modal Logic. | Anuj Dawar, Erich Grdel, Stephan Kreutzer |
| 2001 | ICDT | Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls. | Stephan Kreutzer |
| 2001 | LPAR | Operational Semantics for Fixed-Point Logics on Constraint Databases. | Stephan Kreutzer |
| 2000 | PODS | Fixed-Point Query Languages for Linear Constraint Databases. | Stephan Kreutzer |
| 1999 | CSL | Descriptive Complexity Theory for Constraint Databases. | Erich Grdel, Stephan Kreutzer |