Bounded-Arity Hierarchies in Fixed-Point Logics. - Martin Grohe (CSL, 1993)

Complete Problems for Fixed-Point Logics. - Martin Grohe (J. Symb. Log., 1995)

A double arity hierarchy theorem for transitive closure logic. - Martin Grohe; Lauri Hella (Arch. Math. Log., 1996)

Arity Hierarchies. - Martin Grohe (Ann. Pure Appl. Log., 1996)

Some Remarks on Finite Löwenheim-Skolem Theorems. - Martin Grohe (Math. Log. Q., 1996)

Canonization for Lk-equivalence is Hard. - Martin Grohe (CSL, 1997)

Large Finite Structures with Few Lk-Types. - Martin Grohe (LICS, 1997)

Existential Least Fixed-Point Logic and its Relatives. - Martin Grohe (J. Log. Comput., 1997)

Fixed-Point Logics on Planar Graphs. - Martin Grohe (LICS, 1998)

Finite variable logics in descriptive complexity theory. - Martin Grohe (Bull. Symb. Log., 1998)

Descriptive and Parameterized Complexity. - Martin Grohe (CSL, 1999)

Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs. - Markus Frick; Martin Grohe (ICALP, 1999)

Definability and Descriptive Complexity on Databases of Bounded Tree-Width. - Martin Grohe; Julian Mariño (ICDT, 1999)

Equivalence in Finite-Variable Logics is Complete for Polynomial Time. - Martin Grohe (Comb., 1999)

Isomorphism testing for embeddable graphs through definability. - Martin Grohe (STOC, 2000)

On Fixed-Point Logic With Counting. - Jörg Flum; Martin Grohe (J. Symb. Log., 2000)

Locality of order-invariant first-order formulas. - Martin Grohe; Thomas Schwentick (ACM Trans. Comput. Log., 2000)

The Parameterized Complexity of Database Queries. - Martin Grohe (PODS, 2001)

Generalized Model-Checking Problems for First-Order Logic. - Martin Grohe (STACS, 2001)

When is the evaluation of conjunctive queries tractable? - Martin Grohe; Thomas Schwentick; Luc Segoufin (STOC, 2001)

Deciding first-order properties of locally tree-decomposable structures. - Markus Frick; Martin Grohe (J. ACM, 2001)

Fixed-Parameter Tractability, Definability, and Model-Checking. - Jörg Flum; Martin Grohe (SIAM J. Comput., 2001)

Large Finite Structures with Few Lk-Types. - Martin Grohe (Inf. Comput., 2002)

Query evaluation via tree-decompositions. - Jörg Flum; Markus Frick; Martin Grohe (J. ACM, 2002)

Parameterized Complexity for the Database Theorist. - Martin Grohe (SIGMOD Rec., 2002)

On first-order topological queries. - Martin Grohe; Luc Segoufin (ACM Trans. Comput. Log., 2002)

Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. - Yijia Chen 001; Jörg Flum; Martin Grohe (CCC, 2003)

Monadic Datalog on Trees (Invited Talk). - Martin Grohe (FICS, 2003)

Query Evaluation on Compressed Trees (Extended Abstract). - Markus Frick; Martin Grohe; Christoph Koch 001 (LICS, 2003)

Path Queries on Compressed XML. - Peter Buneman; Martin Grohe; Christoph Koch 001 (VLDB, 2003)

Local Tree-Width, Excluded Minors, and Approximation Algorithms. - Martin Grohe (Comb., 2003)

Describing parameterized complexity classes. - Jörg Flum; Martin Grohe (Inf. Comput., 2003)

Reachability and connectivity queries in constraint databases. - Michael Benedikt; Martin Grohe; Leonid Libkin; Luc Segoufin (J. Comput. Syst. Sci., 2003)

Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits. - Jörg Flum; Martin Grohe; Mark Weyer (ICALP, 2004)

The complexity of first-order and monadic second-order logic revisited. - Markus Frick; Martin Grohe (Ann. Pure Appl. Log., 2004)

An existential locality theorem. - Martin Grohe; Stefan Wöhrle (Ann. Pure Appl. Log., 2004)

Parametrized Complexity and Subexponential Time (Column: Computational Complexity). - Jörg Flum; Martin Grohe (Bull. EATCS, 2004)

Comparing the succinctness of monadic query languages over finite trees. - Martin Grohe; Nicole Schweikardt (RAIRO Theor. Informatics Appl., 2004)

Computing crossing numbers in quadratic time. - Martin Grohe (J. Comput. Syst. Sci., 2004)

Learnability and Definability in Trees and Similar Structures. - Martin Grohe; György Turán (Theory Comput. Syst., 2004)

The Parameterized Complexity of Counting Problems. - Jörg Flum; Martin Grohe (SIAM J. Comput., 2004)

05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. - Rodney G. Downey; Martin Grohe; Gerhard J. Woeginger (Exact Algorithms and Fixed-Parameter Tractability, 2005)

05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. - Rodney G. Downey; Martin Grohe; Gerhard J. Woeginger (Exact Algorithms and Fixed-Parameter Tractability, 2005)

The Complexity of Querying External Memory and Streaming Data. - Martin Grohe; Christoph Koch 001; Nicole Schweikardt (FCT, 2005)

The Expressive Power of Two-Variable Least Fixed-Point Logics. - Martin Grohe; Stephan Kreutzer; Nicole Schweikardt (MFCS, 2005)

Lower bounds for sorting with few random accesses to external memory. - Martin Grohe; Nicole Schweikardt (PODS, 2005)

Hypertree Decompositions: Structure, Algorithms, and Applications. - Georg Gottlob; Martin Grohe; Nysret Musliu; Marko Samer; Francesco Scarcello (WG, 2005)

Model-checking problems as a basis for parameterized intractability. - Jörg Flum; Martin Grohe (Log. Methods Comput. Sci., 2005)

The succinctness of first-order logic on linear orders. - Martin Grohe; Nicole Schweikardt (Log. Methods Comput. Sci., 2005)

The complexity of partition functions. - Andrei A. Bulatov; Martin Grohe (Theor. Comput. Sci., 2005)

Machine-based methods in parameterized complexity theory. - Yijia Chen 001; Jörg Flum; Martin Grohe (Theor. Comput. Sci., 2005)

Testing Graph Isomorphism in Parallel by Playing a Game. - Martin Grohe; Oleg Verbitsky 001 (ICALP (1), 2006)

Approximation Schemes for First-Order Definable Optimisation Problems. - Anuj Dawar; Martin Grohe; Stephan Kreutzer; Nicole Schweikardt (LICS, 2006)

The Structure of Tractable Constraint Satisfaction Problems. - Martin Grohe (MFCS, 2006)

Randomized computations on large data sets: tight lower bounds. - Martin Grohe; André Hernich; Nicole Schweikardt (PODS, 2006)

Bounded fixed-parameter tractability and log2n nondeterministic bits. - Jörg Flum; Martin Grohe; Mark Weyer (J. Comput. Syst. Sci., 2006)

Parameterized Complexity Theory - Jörg Flum; Martin Grohe (Springer, 2006)

The Ackermann Award 2007. - Martin Grohe; Martin Hyland; Johann A. Makowsky; Damian Niwinski (CSL, 2007)

Model Theory Makes Formulas Large. - Anuj Dawar; Martin Grohe; Stephan Kreutzer; Nicole Schweikardt (ICALP, 2007)

Parameterized Approximability of the Disjoint Cycle Problem. - Martin Grohe; Magdalena Grüber (ICALP, 2007)

Locally Excluding a Minor. - Anuj Dawar; Martin Grohe; Stephan Kreutzer (LICS, 2007)

Bounded fixed-parameter tractability and reducibility. - Rod Downey; Jörg Flum; Martin Grohe; Mark Weyer (Ann. Pure Appl. Log., 2007)

On Parameterized Approximability. - Yijia Chen 001; Martin Grohe; Magdalena Grüber (Electron. Colloquium Comput. Complex., 2007)

Logic, Graphs, and Algorithms. - Martin Grohe (Electron. Colloquium Comput. Complex., 2007)

Hypertree width and related hypergraph invariants. - Isolde Adler; Georg Gottlob; Martin Grohe (Eur. J. Comb., 2007)

The complexity of homomorphism and constraint satisfaction problems seen from the other side. - Martin Grohe (J. ACM, 2007)

An analysis of the W*-hierarchy. - Yijia Chen 001; Jörg Flum; Martin Grohe (J. Symb. Log., 2007)

An Isomorphism Between Subexponential and Parameterized Complexity Theory. - Yijia Chen 001; Martin Grohe (SIAM J. Comput., 2007)

Tight lower bounds for query processing on streaming and external memory data. - Martin Grohe; Christoph Koch 001; Nicole Schweikardt (Theor. Comput. Sci., 2007)

Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. - Kord Eickmeyer; Martin Grohe; Magdalena Grüber (CCC, 2008)

Non-dichotomies in Constraint Satisfaction Complexity. - Manuel Bodirsky; Martin Grohe (ICALP (2), 2008)

The Quest for a Logic Capturing PTIME. - Martin Grohe (LICS, 2008)

Definable Tree Decompositions. - Martin Grohe (LICS, 2008)

Computing excluded minors. - Isolde Adler; Martin Grohe; Stephan Kreutzer (SODA, 2008)

Algorithmic Meta Theorems. - Martin Grohe (WG, 2008)

Preservation under Extensions on Well-Behaved Finite Structures. - Albert Atserias; Anuj Dawar; Martin Grohe (SIAM J. Comput., 2008)

Methods for Algorithmic Meta Theorems. - Martin Grohe; Stephan Kreutzer (AMS-ASL Joint Special Session, 2009)

Counting Homomorphisms and Partition Functions. - Martin Grohe; Marc Thurley (AMS-ASL Joint Special Session, 2009)

Fixed-Point Definability and Polynomial Time. - Martin Grohe (CSL, 2009)

09441 Abstracts Collection - The Constraint Satisfaction Problem: Complexity and Approximability. - Andrei A. Bulatov; Martin Grohe; Phokion G. Kolaitis; Andrei A. Krokhin (The Constraint Satisfaction Problem: Complexity and Approximability, 2009)

09441 Executive Summary - The Constraint Satisfaction Problem: Complexity and Approximability. - Andrei A. Bulatov; Martin Grohe; Phokion G. Kolaitis; Andrei A. Krokhin (The Constraint Satisfaction Problem: Complexity and Approximability, 2009)

Logics with Rank Operators. - Anuj Dawar; Martin Grohe; Bjarki Holm; Bastian Laubner (LICS, 2009)

The Complexity of Datalog on Linear Orders - Martin Grohe; Götz Schwandtner (Log. Methods Comput. Sci., 2009)

Lower bounds for processing data with few random accesses to external memory. - Martin Grohe; André Hernich; Nicole Schweikardt (J. ACM, 2009)

On tree width, bramble size, and expansion. - Martin Grohe; Dániel Marx (J. Comb. Theory B, 2009)

Database Query Processing Using Finite Cursor Machines. - Martin Grohe; Yuri Gurevich; Dirk Leinders; Nicole Schweikardt; Jerzy Tyszkiewicz; Jan Van den Bussche (Theory Comput. Syst., 2009)

Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs. - Martin Grohe (Fields of Logic and Computation, 2010)

Randomisation and Derandomisation in Descriptive Complexity Theory. - Kord Eickmeyer; Martin Grohe (Electron. Colloquium Comput. Complex., 2010)

Constraint satisfaction with succinctly specified relations. - Hubie Chen; Martin Grohe (J. Comput. Syst. Sci., 2010)

A Complexity Dichotomy for Partition Functions with Mixed Signs. - Leslie Ann Goldberg; Martin Grohe; Mark Jerrum; Marc Thurley (SIAM J. Comput., 2010)

Finding topological subgraphs is fixed-parameter tractable. - Martin Grohe; Ken-ichi Kawarabayashi; Dániel Marx; Paul Wollan (STOC, 2011)

From polynomial time queries to graph structure theory. - Martin Grohe (Commun. ACM, 2011)

Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). - Martin Grohe; Michal Koucký 001; Rüdiger Reischuk; Dieter van Melkebeek (Dagstuhl Reports, 2011)

Structural and logical approaches to the graph isomorphism problem. - Martin Grohe (SODA, 2012)

L-Recursion and a new Logic for Logarithmic Space - Martin Grohe; Berit Grußien; André Hernich; Bastian Laubner (Log. Methods Comput. Sci., 2012)

Fixed-point definability and polynomial time on graphs with excluded minors. - Martin Grohe (J. ACM, 2012)

Enumerating homomorphisms. - Andrei A. Bulatov; Víctor Dalmau; Martin Grohe; Dániel Marx (J. Comput. Syst. Sci., 2012)

Bounds and Algorithms for Joins via Fractional Edge Covers. - Martin Grohe (In Search of Elegance in the Theory and Practice of Computation, 2013)

Characterisations of Nowhere Dense Graphs (Invited Talk). - Martin Grohe; Stephan Kreutzer; Sebastian Siebertz (FSTTCS, 2013)

Logical and Structural Approaches to the Graph Isomorphism Problem. - Martin Grohe (MFCS, 2013)

A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. - Martin Grohe; Ken-ichi Kawarabayashi; Bruce A. Reed (SODA, 2013)

Size Bounds and Query Plans for Relational Joins. - Albert Atserias; Martin Grohe; Dániel Marx (SIAM J. Comput., 2013)

Power Iterated Color Refinement. - Kristian Kersting; Martin Mladenov; Roman Garnett; Martin Grohe (AAAI, 2014)

Monadic Datalog Containment on Trees. - André Frochaux; Martin Grohe; Nicole Schweikardt (AMW, 2014)

Algorithmic Meta Theorems for Sparse Graph Classes. - Martin Grohe (CSR, 2014)

Dimension Reduction via Colour Refinement. - Martin Grohe; Kristian Kersting; Martin Mladenov; Erkal Selman (ESA, 2014)

Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk). - Martin Grohe (FSTTCS, 2014)

Choiceless Polynomial Time on Structures with Small Abelian Colour Classes. - Faried Abu Zaid; Erich Grädel; Martin Grohe; Wied Pakusa (MFCS (1), 2014)

Database Theory Column Report on PODS 2014. - Martin Grohe (SIGACT News, 2014)

Constraint Solving via Fractional Edge Covers. - Martin Grohe; Dániel Marx (ACM Trans. Algorithms, 2014)

Is Polynomial Time Choiceless? - Erich Grädel; Martin Grohe (Fields of Logic and Computation II, 2015)

Isomorphism Testing for Graphs of Bounded Rank Width. - Martin Grohe; Pascal Schweitzer (FOCS, 2015)

Limitations of Algebraic Approaches to Graph Isomorphism Testing. - Christoph Berkholz; Martin Grohe (ICALP (1), 2015)

Colouring and Covering Nowhere Dense Graphs. - Martin Grohe; Stephan Kreutzer; Roman Rabinovich 001; Sebastian Siebertz; Konstantinos S. Stavropoulos (WG, 2015)

Theory and Practice of SAT Solving (Dagstuhl Seminar 15171). - Armin Biere; Vijay Ganesh 001; Martin Grohe; Jakob Nordström; Ryan Williams 001 (Dagstuhl Reports, 2015)

Pebble Games and linear equations. - Martin Grohe; Martin Otto 001 (J. Symb. Log., 2015)

Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs. - Martin Grohe; Dániel Marx (SIAM J. Comput., 2015)

Quasi-4-Connected Components. - Martin Grohe (ICALP, 2016)

Tangles and Connectivity in Graphs. - Martin Grohe (LATA, 2016)

Order Invariance on Decomposable Structures. - Michael Elberfeld; Marlin Frickenschmidt; Martin Grohe (LICS, 2016)

Tangled up in Blue (A Survey on Connectivity, Decompositions, and Tangles). - Martin Grohe (CoRR, 2016)

Computing with Tangles. - Martin Grohe; Pascal Schweitzer (SIAM J. Discret. Math., 2016)

Where First-Order and Monadic Second-Order Logic Coincide. - Michael Elberfeld; Martin Grohe; Till Tantau (ACM Trans. Comput. Log., 2016)

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory - Martin Grohe (Cambridge University Press, 2017)

Learning MSO-definable hypotheses on strings. - Martin Grohe; Christof Löding; Martin Ritzert (ALT, 2017)

Descriptive complexity of linear equation systems and applications to propositional proof complexity. - Martin Grohe; Wied Pakusa (LICS, 2017)

Learning first-order definable concepts over structures of small degree. - Martin Grohe; Martin Ritzert (LICS, 2017)

Linear Diophantine Equations, Group CSPs, and Graph Isomorphism. - Christoph Berkholz; Martin Grohe (SODA, 2017)

The Hardness of Embedding Grids and Walls. - Yijia Chen 001; Martin Grohe; Bingkai Lin (WG, 2017)

Learning MSO-definable hypotheses on string. - Martin Grohe; Christof Löding; Martin Ritzert (CoRR, 2017)

Deciding First-Order Properties of Nowhere Dense Graphs. - Martin Grohe; Stephan Kreutzer; Sebastian Siebertz (J. ACM, 2017)

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. - Christoph Berkholz; Paul S. Bonsma; Martin Grohe (Theory Comput. Syst., 2017)

Lovász Meets Weisfeiler and Leman. - Holger Dell; Martin Grohe; Gaurav Rattan (ICALP, 2018)

Graph Similarity and Approximate Isomorphism. - Martin Grohe; Gaurav Rattan; Gerhard J. Woeginger (MFCS, 2018)

First-Order Query Evaluation with Cardinality Conditions. - Martin Grohe; Nicole Schweikardt (PODS, 2018)

Towards faster isomorphism tests for bounded-degree graphs. - Martin Grohe; Daniel Neuen; Pascal Schweitzer (CoRR, 2018)

Weisfeiler-Leman meets Homomorphisms. - Holger Dell; Martin Grohe; Gaurav Rattan (CoRR, 2018)

The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231). - Martin Grohe; Venkatesan Guruswami; Stanislav Zivný (Dagstuhl Reports, 2018)

Coloring and Covering Nowhere Dense Graphs. - Martin Grohe; Stephan Kreutzer; Roman Rabinovich 001; Sebastian Siebertz; Konstantinos S. Stavropoulos (SIAM J. Discret. Math., 2018)

Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks. - Christopher Morris 001; Martin Ritzert; Matthias Fey; William L. Hamilton; Jan Eric Lenssen; Gaurav Rattan; Martin Grohe (AAAI, 2019)

Symmetry and Similarity (Invited Talk). - Martin Grohe (ICALP, 2019)

A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. - Martin Grohe; Sandra Kiefer (ICALP, 2019)

The Complexity of Homomorphism Indistinguishability. - Jan Böker; Yijia Chen 001; Martin Grohe; Gaurav Rattan (MFCS, 2019)

Probabilistic Databases with an Infinite Open-World Assumption. - Martin Grohe; Peter Lindner 001 (PODS, 2019)

RUN-CSP: Unsupervised Learning of Message Passing Networks for Binary Constraint Satisfaction Problems. - Jan Tönshoff; Martin Ritzert; Hinrikus Wolf; Martin Grohe (CoRR, 2019)

A Finite-Model-Theoretic View on Propositional Proof Complexity. - Erich Grädel; Martin Grohe; Benedikt Pago; Wied Pakusa (Log. Methods Comput. Sci., 2019)

Counting Bounded Tree Depth Homomorphisms. - Martin Grohe (LICS, 2020)

word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data. - Martin Grohe (PODS, 2020)

Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk). - Martin Grohe (STACS, 2020)

The graph isomorphism problem. - Martin Grohe; Pascal Schweitzer (Commun. ACM, 2020)

The Effects of Randomness on the Stability of Node Embeddings. - Tobias Schumacher 002; Hinrikus Wolf; Martin Ritzert; Florian Lemmerich; Jan Bachmann; Florian Frantzen; Max Klabunde; Martin Grohe; Markus Strohmaier (CoRR, 2020)

Standard Probabilistic Databases. - Martin Grohe; Peter Lindner 001 (CoRR, 2020)

Automorphism groups of graphs of bounded Hadwiger number. - Martin Grohe; Pascal Schweitzer; Daniel Wiebking (CoRR, 2020)

Graph Neural Networks for Maximum Constraint Satisfaction. - Jan Tönshoff; Martin Ritzert; Hinrikus Wolf; Martin Grohe (Frontiers Artif. Intell., 2020)

An Improved Isomorphism Test for Bounded-tree-width Graphs. - Martin Grohe; Daniel Neuen; Pascal Schweitzer; Daniel Wiebking (ACM Trans. Algorithms, 2020)

Recent advances on the graph isomorphism problem. - Martin Grohe; Daniel Neuen (BCC, 2021)

Logarithmic Weisfeiler-Leman Identifies All Planar Graphs. - Martin Grohe; Sandra Kiefer (ICALP, 2021)

The Surprising Power of Graph Neural Networks with Random Node Initialization. - Ralph Abboud; Ismail Ilkan Ceylan; Martin Grohe; Thomas Lukasiewicz (IJCAI, 2021)

The Logic of Graph Neural Networks. - Martin Grohe (LICS, 2021)

A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk). - Martin Grohe (MFCS, 2021)

The Effects of Randomness on the Stability of Node Embeddings. - Tobias Schumacher 002; Hinrikus Wolf; Martin Ritzert; Florian Lemmerich; Martin Grohe; Markus Strohmaier (PKDD/ECML Workshops (1), 2021)

Tuple-Independent Representations of Infinite Probabilistic Databases. - Nofar Carmeli; Martin Grohe; Peter Lindner 001; Christoph Standke (PODS, 2021)

Deep Weisfeiler Leman. - Martin Grohe; Pascal Schweitzer; Daniel Wiebking (SODA, 2021)

Isomorphism, canonization, and definability for graphs of bounded rank width. - Martin Grohe; Daniel Neuen (Commun. ACM, 2021)

Graph Learning with 1D Convolutions on Random Walks. - Jan Tönshoff; Martin Ritzert; Hinrikus Wolf; Martin Grohe (CoRR, 2021)

On the Parameterized Complexity of Learning Logic. - Steffen van Bergerem; Martin Grohe; Martin Ritzert (CoRR, 2021)

Dynamic Database Embeddings with FoRWaRD. - Jan Tönshoff; Neta Friedman; Martin Grohe; Benny Kimelfeld (CoRR, 2021)

Definable decompositions for graphs of bounded linear cliquewidth. - Mikolaj Bojanczyk; Martin Grohe; Michal Pilipczuk (Log. Methods Comput. Sci., 2021)

Probabilistic Data with Continuous Distributions. - Martin Grohe; Benjamin Lucien Kaminski; Joost-Pieter Katoen; Peter Lindner 001 (SIGMOD Rec., 2021)

Homomorphism Tensors and Linear Equations. - Martin Grohe; Gaurav Rattan; Tim Seppelt (ICALP, 2022)

Graph Similarity Based on Matrix Norms. - Timo Gervens; Martin Grohe (MFCS, 2022)

On the Parameterized Complexity of Learning First-Order Logic. - Steffen van Bergerem; Martin Grohe; Martin Ritzert (PODS, 2022)

Solving AC Power Flow with Graph Neural Networks under Realistic Constraints. - Luis Böttcher; Hinrikus Wolf; Bastian Jung; Philipp Lutat; Marc Trageser; Oliver Pohl; Andreas Ulbig; Martin Grohe (CoRR, 2022)

Graph Machine Learning for Design of High-Octane Fuels. - Jan G. Rittig; Martin Ritzert; Artur M. Schweidtmann; Stefanie Winkler; Jana M. Weber; Philipp Morsch; K. Alexander Heufer; Martin Grohe; Alexander Mitsos; Manuel Dahmen (CoRR, 2022)

Graph Embeddings: Theory meets Practice (Dagstuhl Seminar 22132). - Martin Grohe; Stephan Günnemann; Stefanie Jegelka; Christopher Morris 001 (Dagstuhl Reports, 2022)

The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201). - Martin Grohe; Venkatesan Guruswami; Dániel Marx; Stanislav Zivný (Dagstuhl Reports, 2022)

Generative Datalog with Continuous Distributions. - Martin Grohe; Benjamin Lucien Kaminski; Joost-Pieter Katoen; Peter Lindner 001 (J. ACM, 2022)

Independence in Infinite Probabilistic Databases. - Martin Grohe; Peter Lindner 001 (J. ACM, 2022)

Infinite Probabilistic Databases. - Martin Grohe; Peter Lindner 001 (Log. Methods Comput. Sci., 2022)

Selecting Walk Schemes for Database Embedding. - Yuval Lev Lubarsky; Jan Tönshoff; Martin Grohe; Benny Kimelfeld (CIKM, 2023)

Stable Tuple Embeddings for Dynamic Databases. - Jan Tönshoff; Neta Friedman; Martin Grohe; Benny Kimelfeld (ICDE, 2023)

Probabilistic Query Evaluation with Bag Semantics. - Martin Grohe; Peter Lindner 001; Christoph Standke (ICDT, 2023)

WL meet VC. - Christopher Morris 001; Floris Geerts; Jan Tönshoff; Martin Grohe (ICML, 2023)

Some Might Say All You Need Is Sum. - Eran Rosenbluth; Jan Tönshoff; Martin Grohe (IJCAI, 2023)

One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction. - Jan Tönshoff; Berke Kisin; Jakob Lindner; Martin Grohe (IJCAI, 2023)

Simulating Logspace-Recursion with Logarithmic Quantifier Depth. - Steffen van Bergerem; Martin Grohe; Sandra Kiefer; Luca Oeljeklaus (LICS, 2023)

Structural Node Embeddings with Homomorphism Counts. - Hinrikus Wolf; Luca Oeljeklaus; Pascal Kühner; Martin Grohe (CoRR, 2023)

On the Parameterized Complexity of Learning Monadic Second-Order Formulas. - Steffen van Bergerem; Martin Grohe; Nina Runde (CoRR, 2023)

Weisfeiler and Leman go Machine Learning: The Story so far. - Christopher Morris 001; Yaron Lipman; Haggai Maron; Bastian Rieck; Nils M. Kriege; Martin Grohe; Matthias Fey; Karsten M. Borgwardt (J. Mach. Learn. Res., 2023)

Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing. - Jan Tönshoff; Martin Ritzert; Hinrikus Wolf; Martin Grohe (Trans. Mach. Learn. Res., 2023)

Software for "Physical Pooling Functions in Graph Neural Networks for Molecular Property Prediction". - Artur M. Schweidtmann; Jan G. Rittig; Jana M. Weber; Martin Grohe; Manuel Dahmen; Kai Leonhard; Alexander Mitsos (Zenodo, 2023)

Canonisation and Definability for Graphs of Bounded Rank Width. - Martin Grohe; Daniel Neuen (ACM Trans. Comput. Log., 2023)

Isomorphism Testing for Graphs Excluding Small Minors. - Martin Grohe; Daniel Neuen; Daniel Wiebking (SIAM J. Comput., 2023)

Physical pooling functions in graph neural networks for molecular property prediction. - Artur M. Schweidtmann; Jan G. Rittig; Jana M. Weber; Martin Grohe; Manuel Dahmen; Kai Leonhard; Alexander Mitsos (Comput. Chem. Eng., 2023)

A Faster Isomorphism Test for Graphs of Small Degree. - Martin Grohe; Daniel Neuen; Pascal Schweitzer (SIAM J. Comput., 2023)

Some Thoughts on Graph Similarity. - Martin Grohe (Principles of Verification (1), 2024)

Isomorphism for Tournaments of Small Twin Width. - Martin Grohe; Daniel Neuen (ICALP, 2024)

The Importance of Parameters in Database Queries. - Martin Grohe; Benny Kimelfeld; Peter Lindner 001; Christoph Standke (ICDT, 2024)

Distinguished In Uniform: Self-Attention Vs. Virtual Nodes. - Eran Rosenbluth; Jan Tönshoff; Martin Ritzert; Berke Kisin; Martin Grohe (ICLR, 2024)

Position: Future Directions in the Theory of Graph Machine Learning. - Christopher Morris 001; Fabrizio Frasca; Nadav Dym; Haggai Maron; Ismail Ilkan Ceylan; Ron Levie; Derek Lim; Michael M. Bronstein; Martin Grohe; Stefanie Jegelka (ICML, 2024)

End-to-End Reinforcement Learning of Curative Curtailment with Partial Measurement Availability. - Hinrikus Wolf; Luis Böttcher; Sarra Bouchkati; Philipp Lutat; Jens Breitung; Bastian Jung; Tina Möllemann; Viktor Todosijevic; Jan Schiefelbein-Lach; Oliver Pohl; Andreas Ulbig; Martin Grohe (ISGT EUROPE, 2024)

Are Targeted Messages More Effective? - Martin Grohe; Eran Rosenbluth (LICS, 2024)

The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2024. - Martin Grohe; Jan Van den Bussche; Ke Yi 001 (PODS Companion, 2024)

Future Directions in Foundations of Graph Machine Learning. - Christopher Morris 001; Nadav Dym; Haggai Maron; Ismail Ilkan Ceylan; Fabrizio Frasca; Ron Levie; Derek Lim; Michael M. Bronstein; Martin Grohe; Stefanie Jegelka (CoRR, 2024)

GraphXForm: Graph transformer for computer-aided molecular design with application to extraction. - Jonathan Pirnay; Jan G. Rittig; Alexander B. Wolf; Martin Grohe; Jakob Burger; Alexander Mitsos; Dominik G. Grimm (CoRR, 2024)

The Descriptive Complexity of Graph Neural Networks. - Martin Grohe (TheoretiCS, 2024)

Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark. - Jan Tönshoff; Martin Ritzert; Eran Rosenbluth; Martin Grohe (Trans. Mach. Learn. Res., 2024)

Database Repairing with Soft Functional Dependencies. - Nofar Carmeli; Martin Grohe; Benny Kimelfeld; Ester Livshits; Muhammad Tibi (ACM Trans. Database Syst., 2024)

The Parameterized Complexity of Learning Monadic Second-Order Logic. - Steffen van Bergerem; Martin Grohe; Nina Runde (CSL, 2025)

Query Languages for Neural Networks. - Martin Grohe; Christoph Standke; Juno Steegmans; Jan Van den Bussche (ICDT, 2025)

Exploring data augmentation: Multi-task methods for molecular property prediction. - Muhammad bin Javaid; Timo Gervens; Alexander Mitsos; Martin Grohe; Jan G. Rittig (Comput. Chem. Eng., 2025)

The Iteration Number of the Weisfeiler-Leman Algorithm. - Martin Grohe; Moritz Lichter; Daniel Neuen (ACM Trans. Comput. Log., 2025)

Repetition Makes Perfect: Recurrent Sum-GNNs Match Message Passing Limit. - Eran Rosenbluth; Martin Grohe (CoRR, 2025)

Learning from Algorithm Feedback: One-Shot SAT Solver Guidance with GNNs. - Jan Tönshoff; Martin Grohe (CoRR, 2025)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. - Martin Grohe; Moritz Lichter; Daniel Neuen; Pascal Schweitzer (J. ACM, 2025)