| 2026 | AAAI | Repetition Makes Perfect: Recurrent Graph Neural Networks Match Message Passing Limit. | Eran Rosenbluth, Martin Grohe |
| 2026 | STACS | The Complexity of Homomorphism Reconstruction Revisited. | Timo Gervens, Martin Grohe, Louis Hrtel, Philipp da Silva Fonseca |
| 2026 | STACS | Query Languages for Machine-Learning Models (Invited Talk). | Martin Grohe |
| 2025 | CSL | The Parameterized Complexity of Learning Monadic Second-Order Logic. | Steffen van Bergerem, Martin Grohe, Nina Runde |
| 2025 | ICDT | Query Languages for Neural Networks. | Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche |
| 2024 | ICALP | Isomorphism for Tournaments of Small Twin Width. | Martin Grohe, Daniel Neuen |
| 2024 | ICDT | The Importance of Parameters in Database Queries. | Martin Grohe, Benny Kimelfeld, Peter Lindner, Christoph Standke |
| 2024 | ICLR | Distinguished In Uniform: Self-Attention Vs. Virtual Nodes. | Eran Rosenbluth, Jan Tnshoff, Martin Ritzert, Berke Kisin, Martin Grohe |
| 2024 | ICML | Position: Future Directions in the Theory of Graph Machine Learning. | Christopher Morris, Fabrizio Frasca, Nadav Dym, Haggai Maron, Ismail Ilkan Ceylan, Ron Levie, Derek Lim, Michael M. Bronstein, Martin Grohe, Stefanie Jegelka |
| 2024 | LICS | Are Targeted Messages More Effective? | Martin Grohe, Eran Rosenbluth |
| 2024 | PODS | The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2024. | Martin Grohe, Jan Van den Bussche, Ke Yi |
| 2023 | CIKM | Selecting Walk Schemes for Database Embedding. | Yuval Lev Lubarsky, Jan Tnshoff, Martin Grohe, Benny Kimelfeld |
| 2023 | FOCS | Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. | Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer |
| 2023 | ICDE | Stable Tuple Embeddings for Dynamic Databases. | Jan Tnshoff, Neta Friedman, Martin Grohe, Benny Kimelfeld |
| 2023 | ICDT | Probabilistic Query Evaluation with Bag Semantics. | Martin Grohe, Peter Lindner, Christoph Standke |
| 2023 | ICML | WL meet VC. | Christopher Morris, Floris Geerts, Jan Tnshoff, Martin Grohe |
| 2023 | IJCAI | Some Might Say All You Need Is Sum. | Eran Rosenbluth, Jan Tnshoff, Martin Grohe |
| 2023 | IJCAI | One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction. | Jan Tnshoff, Berke Kisin, Jakob Lindner, Martin Grohe |
| 2023 | LICS | Simulating Logspace-Recursion with Logarithmic Quantifier Depth. | Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus |
| 2023 | LICS | The Descriptive Complexity of Graph Neural Networks. | Martin Grohe |
| 2023 | LICS | The Iteration Number of the Weisfeiler-Leman Algorithm. | Martin Grohe, Moritz Lichter, Daniel Neuen |
| 2022 | ICALP | Homomorphism Tensors and Linear Equations. | Martin Grohe, Gaurav Rattan, Tim Seppelt |
| 2022 | MFCS | Graph Similarity Based on Matrix Norms. | Timo Gervens, Martin Grohe |
| 2022 | PODS | On the Parameterized Complexity of Learning First-Order Logic. | Steffen van Bergerem, Martin Grohe, Martin Ritzert |
| 2021 | ICALP | Logarithmic Weisfeiler-Leman Identifies All Planar Graphs. | Martin Grohe, Sandra Kiefer |
| 2021 | ICDT | Database Repairing with Soft Functional Dependencies. | Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi |
| 2021 | IJCAI | The Surprising Power of Graph Neural Networks with Random Node Initialization. | Ralph Abboud, Ismail Ilkan Ceylan, Martin Grohe, Thomas Lukasiewicz |
| 2021 | LICS | The Logic of Graph Neural Networks. | Martin Grohe |
| 2021 | MFCS | A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk). | Martin Grohe |
| 2021 | PODS | Tuple-Independent Representations of Infinite Probabilistic Databases. | Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke |
| 2021 | SODA | Deep Weisfeiler Leman. | Martin Grohe, Pascal Schweitzer, Daniel Wiebking |
| 2020 | FOCS | Isomorphism Testing for Graphs Excluding Small Minors. | Martin Grohe, Daniel Wiebking, Daniel Neuen |
| 2020 | ICDT | Infinite Probabilistic Databases. | Martin Grohe, Peter Lindner |
| 2020 | LICS | Counting Bounded Tree Depth Homomorphisms. | Martin Grohe |
| 2020 | PODS | word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data. | Martin Grohe |
| 2020 | PODS | Generative Datalog with Continuous Distributions. | Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner |
| 2020 | STACS | Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk). | Martin Grohe |
| 2019 | AAAI | Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks. | Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, Martin Grohe |
| 2019 | ICALP | Symmetry and Similarity (Invited Talk). | Martin Grohe |
| 2019 | ICALP | A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. | Martin Grohe, Sandra Kiefer |
| 2019 | LICS | Canonisation and Definability for Graphs of Bounded Rank Width. | Martin Grohe, Daniel Neuen |
| 2019 | MFCS | The Complexity of Homomorphism Indistinguishability. | Jan Bker, Yijia Chen, Martin Grohe, Gaurav Rattan |
| 2019 | PODS | Probabilistic Databases with an Infinite Open-World Assumption. | Martin Grohe, Peter Lindner |
| 2018 | FOCS | A Faster Isomorphism Test for Graphs of Small Degree. | Martin Grohe, Daniel Neuen, Pascal Schweitzer |
| 2018 | ICALP | Lovsz Meets Weisfeiler and Leman. | Holger Dell, Martin Grohe, Gaurav Rattan |
| 2018 | ICALP | An Improved Isomorphism Test for Bounded-Tree-Width Graphs. | Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking |
| 2018 | LICS | Definable decompositions for graphs of bounded linear cliquewidth. | Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk |
| 2018 | MFCS | Graph Similarity and Approximate Isomorphism. | Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger |
| 2018 | PODS | First-Order Query Evaluation with Cardinality Conditions. | Martin Grohe, Nicole Schweikardt |
| 2017 | ALT | Learning MSO-definable hypotheses on strings. | Martin Grohe, Christof Lding, Martin Ritzert |
| 2017 | LICS | Descriptive complexity of linear equation systems and applications to propositional proof complexity. | Martin Grohe, Wied Pakusa |
| 2017 | LICS | Learning first-order definable concepts over structures of small degree. | Martin Grohe, Martin Ritzert |
| 2017 | SODA | Linear Diophantine Equations, Group CSPs, and Graph Isomorphism. | Christoph Berkholz, Martin Grohe |
| 2017 | WG | The Hardness of Embedding Grids and Walls. | Yijia Chen, Martin Grohe, Bingkai Lin |
| 2016 | ICALP | Quasi-4-Connected Components. | Martin Grohe |
| 2016 | LATA | Tangles and Connectivity in Graphs. | Martin Grohe |
| 2016 | LICS | Order Invariance on Decomposable Structures. | Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe |
| 2015 | FOCS | Isomorphism Testing for Graphs of Bounded Rank Width. | Martin Grohe, Pascal Schweitzer |
| 2015 | ICALP | Limitations of Algebraic Approaches to Graph Isomorphism Testing. | Christoph Berkholz, Martin Grohe |
| 2015 | STOC | Computing with Tangles. | Martin Grohe, Pascal Schweitzer |
| 2015 | WG | Colouring and Covering Nowhere Dense Graphs. | Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos |
| 2014 | AAAI | Power Iterated Color Refinement. | Kristian Kersting, Martin Mladenov, Roman Garnett, Martin Grohe |
| 2014 | CSR | Algorithmic Meta Theorems for Sparse Graph Classes. | Martin Grohe |
| 2014 | ESA | Dimension Reduction via Colour Refinement. | Martin Grohe, Kristian Kersting, Martin Mladenov, Erkal Selman |
| 2014 | MFCS | Choiceless Polynomial Time on Structures with Small Abelian Colour Classes. | Faried Abu Zaid, Erich Grdel, Martin Grohe, Wied Pakusa |
| 2014 | STOC | Deciding first-order properties of nowhere dense graphs. | Martin Grohe, Stephan Kreutzer, Sebastian Siebertz |
| 2013 | ESA | Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. | Christoph Berkholz, Paul S. Bonsma, Martin Grohe |
| 2013 | MFCS | Logical and Structural Approaches to the Graph Isomorphism Problem. | Martin Grohe |
| 2013 | SODA | A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. | Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed |
| 2012 | CSL | Pebble Games and Linear Equations. | Martin Grohe, Martin Otto |
| 2012 | LICS | Where First-Order and Monadic Second-Order Logic Coincide. | Michael Elberfeld, Martin Grohe, Till Tantau |
| 2012 | SODA | Structural and logical approaches to the graph isomorphism problem. | Martin Grohe |
| 2012 | STOC | Structure theorem and isomorphism test for graphs with excluded topological subgraphs. | Martin Grohe, Dniel Marx |
| 2011 | CSL | L-Recursion and a new Logic for Logarithmic Space. | Martin Grohe, Berit Gruien, Andr Hernich, Bastian Laubner |
| 2011 | STOC | Finding topological subgraphs is fixed-parameter tractable. | Martin Grohe, Ken-ichi Kawarabayashi, Dniel Marx, Paul Wollan |
| 2010 | CSL | Randomisation and Derandomisation in Descriptive Complexity Theory. | Kord Eickmeyer, Martin Grohe |
| 2010 | ICDT | From polynomial time queries to graph structure theory. | Martin Grohe |
| 2010 | LICS | Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors. | Martin Grohe |
| 2009 | CSL | Fixed-Point Definability and Polynomial Time. | Martin Grohe |
| 2009 | LICS | Logics with Rank Operators. | Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner |
| 2009 | STACS | Enumerating Homomorphisms. | Andrei A. Bulatov, Vctor Dalmau, Martin Grohe, Dniel Marx |
| 2009 | STACS | A Complexity Dichotomy for Partition Functions with Mixed Signs. | Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley |
| 2008 | FOCS | Size Bounds and Query Plans for Relational Joins. | Albert Atserias, Martin Grohe, Dniel Marx |
| 2008 | ICALP | Non-dichotomies in Constraint Satisfaction Complexity. | Manuel Bodirsky, Martin Grohe |
| 2008 | LICS | The Quest for a Logic Capturing PTIME. | Martin Grohe |
| 2008 | LICS | Definable Tree Decompositions. | Martin Grohe |
| 2008 | SODA | Computing excluded minors. | Isolde Adler, Martin Grohe, Stephan Kreutzer |
| 2008 | WG | Algorithmic Meta Theorems. | Martin Grohe |
| 2007 | CSL | The Ackermann Award 2007. | Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski |
| 2007 | ICALP | Model Theory Makes Formulas Large. | Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt |
| 2007 | ICALP | Parameterized Approximability of the Disjoint Cycle Problem. | Martin Grohe, Magdalena Grber |
| 2007 | ICDT | Database Query Processing Using Finite Cursor Machines. | Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche |
| 2007 | LICS | Locally Excluding a Minor. | Anuj Dawar, Martin Grohe, Stephan Kreutzer |
| 2006 | ICALP | Testing Graph Isomorphism in Parallel by Playing a Game. | Martin Grohe, Oleg Verbitsky |
| 2006 | LICS | Approximation Schemes for First-Order Definable Optimisation Problems. | Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt |
| 2006 | MFCS | The Structure of Tractable Constraint Satisfaction Problems. | Martin Grohe |
| 2006 | PODS | Randomized computations on large data sets: tight lower bounds. | Martin Grohe, Andr Hernich, Nicole Schweikardt |
| 2006 | SODA | Constraint solving via fractional edge covers. | Martin Grohe, Dniel Marx |
| 2005 | FCT | The Complexity of Querying External Memory and Streaming Data. | Martin Grohe, Christoph Koch, Nicole Schweikardt |
| 2005 | ICALP | Preservation Under Extensions on Well-Behaved Finite Structures. | Albert Atserias, Anuj Dawar, Martin Grohe |
| 2005 | ICALP | Tight Lower Bounds for Query Processing on Streaming and External Memory Data. | Martin Grohe, Christoph Koch, Nicole Schweikardt |
| 2005 | MFCS | The Expressive Power of Two-Variable Least Fixed-Point Logics. | Martin Grohe, Stephan Kreutzer, Nicole Schweikardt |
| 2005 | PODS | Lower bounds for sorting with few random accesses to external memory. | Martin Grohe, Nicole Schweikardt |
| 2005 | WG | Hypertree Decompositions: Structure, Algorithms, and Applications. | Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello |
| 2004 | ICALP | The Complexity of Partition Functions. | Andrei A. Bulatov, Martin Grohe |
| 2004 | ICALP | Bounded Fixed-Parameter Tractability and log | Jrg Flum, Martin Grohe, Mark Weyer |
| 2004 | LICS | Model-Checking Problems as a Basis for Parameterized Intractability. | Jrg Flum, Martin Grohe |
| 2004 | LICS | The Succinctness of First-Order Logic on Linear Orders. | Martin Grohe, Nicole Schweikardt |
| 2003 | CSL | Comparing the Succinctness of Monadic Query Languages over Finite Trees. | Martin Grohe, Nicole Schweikardt |
| 2003 | FOCS | The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side. | Martin Grohe |
| 2003 | LICS | Query Evaluation on Compressed Trees (Extended Abstract). | Markus Frick, Martin Grohe, Christoph Koch |
| 2003 | VLDB | Path Queries on Compressed XML. | Peter Buneman, Martin Grohe, Christoph Koch |
| 2002 | FOCS | The Parameterized Complexity of Counting Problems. | Jrg Flum, Martin Grohe |
| 2002 | LICS | The Complexity of First-Order and Monadic Second-Order Logic Revisited. | Markus Frick, Martin Grohe |
| 2002 | STACS | Describing Parameterized Complexity Classes. | Jrg Flum, Martin Grohe |
| 2002 | STACS | Learnability and Definability in Trees and Similar Structures. | Martin Grohe, Gyrgy Turn |
| 2001 | CSL | An Existential Locality Theorem. | Martin Grohe, Stefan Whrle |
| 2001 | ICDT | Query Evaluation via Tree-Decompositions. | Jrg Flum, Markus Frick, Martin Grohe |
| 2001 | PODS | The Parameterized Complexity of Database Queries. | Martin Grohe |
| 2001 | STOC | Computing crossing numbers in quadratic time. | Martin Grohe |
| 2001 | STOC | When is the evaluation of conjunctive queries tractable? | Martin Grohe, Thomas Schwentick, Luc Segoufin |
| 2001 | STACS | Generalized Model-Checking Problems for First-Order Logic. | Martin Grohe |
| 2000 | LICS | On First-Order Topological Queries. | Martin Grohe, Luc Segoufin |
| 2000 | PODS | Reachability and Connectivity Queries in Constraint Databases. | Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin |
| 2000 | STOC | Isomorphism testing for embeddable graphs through definability. | Martin Grohe |
| 1999 | CSL | Descriptive and Parameterized Complexity. | Martin Grohe |
| 1999 | ICALP | Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs. | Markus Frick, Martin Grohe |
| 1999 | ICDT | Definability and Descriptive Complexity on Databases of Bounded Tree-Width. | Martin Grohe, Julian Mario |
| 1998 | LICS | Fixed-Point Logics on Planar Graphs. | Martin Grohe |
| 1998 | MFCS | Locality of Order-Invariant First-Order Formulas. | Martin Grohe, Thomas Schwentick |
| 1997 | CSL | Canonization for L | Martin Grohe |
| 1997 | LICS | Large Finite Structures with Few L | Martin Grohe |
| 1996 | FOCS | Equivalence in Finite-Variable Logics is Complete for Polynomial Time. | Martin Grohe |
| 1993 | CSL | Bounded-Arity Hierarchies in Fixed-Point Logics. | Martin Grohe |