Martin Grohe - RankMe

357 papers A* 85A 23B 25C 1Misc 1Journal 191Unranked 25

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Amortized Molecular Optimization via Group Relative Policy Optimization. CoRR Muhammad bin Javaid, Hasham Hussain, Ashima Khanna, Berke Kisin, Jonathan Pirnay, Alexander Mitsos, Dominik G. Grimm, Martin Grohe
2026	J	`jnl`	How Expressive Are Graph Neural Networks in the Presence of Node Identifiers? CoRR Arie Soeteman, Michael Benedikt, Martin Grohe, Balder ten Cate
2026	J	`jnl`	Isomorphism for Tournaments of Small Twin Width. TheoretiCS Martin Grohe, Daniel Neuen
2026	A	`conf`	Query Languages for Machine-Learning Models (Invited Talk). STACS Martin Grohe
2026	J	`jnl`	Query Languages for Machine-Learning Models. CoRR Martin Grohe
2026	J	`jnl`	Recursive querying of neural networks via weighted structures. CoRR Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche
2026	A*	`conf`	Repetition Makes Perfect: Recurrent Graph Neural Networks Match Message Passing Limit. AAAI Eran Rosenbluth, Martin Grohe
2026	A	`conf`	The Complexity of Homomorphism Reconstruction Revisited. STACS Timo Gervens, Martin Grohe, Louis Härtel, Philipp da Silva Fonseca
2026	J	`jnl`	The Complexity of Homomorphism Reconstruction Revisited. CoRR Timo Gervens, Martin Grohe, Louis Härtel, Philipp da Silva Fonseca
2026	J	`jnl`	Tuple-Independent Representations of Infinite Probabilistic Databases. ACM Trans. Database Syst. Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke
2025	J	`jnl`	Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. J. ACM Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
2025	J	`jnl`	Exploring data augmentation: Multi-task methods for molecular property prediction. Comput. Chem. Eng. Muhammad bin Javaid, Timo Gervens, Alexander Mitsos, Martin Grohe, Jan G. Rittig
2025	J	`jnl`	Learning from Algorithm Feedback: One-Shot SAT Solver Guidance with GNNs. CoRR Jan Tönshoff, Martin Grohe
2025	J	`jnl`	Molecular Machine Learning in Chemical Process Design. CoRR Jan G. Rittig, Manuel Dahmen, Martin Grohe, Philippe Schwaller, Alexander Mitsos
2025	A	`conf`	Query Languages for Neural Networks. ICDT Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche
2025	J	`jnl`	Repetition Makes Perfect: Recurrent Sum-GNNs Match Message Passing Limit. CoRR Eran Rosenbluth, Martin Grohe
2025	J	`jnl`	The Iteration Number of the Weisfeiler-Leman Algorithm. ACM Trans. Comput. Log. Martin Grohe, Moritz Lichter, Daniel Neuen
2025	B	`conf`	The Parameterized Complexity of Learning Monadic Second-Order Logic. CSL Steffen van Bergerem, Martin Grohe, Nina Runde
2024	A*	`ed.`	51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, Tallinn, Estonia, July 8-12, 2024 ICALP Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson
2024	A*	`conf`	Are Targeted Messages More Effective? LICS Martin Grohe, Eran Rosenbluth
2024	J	`jnl`	Are Targeted Messages More Effective? CoRR Martin Grohe, Eran Rosenbluth
2024	J	`jnl`	Database Repairing with Soft Functional Dependencies. ACM Trans. Database Syst. Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi
2024	J	`jnl`	Distinguished In Uniform: Self Attention Vs. Virtual Nodes. CoRR Eran Rosenbluth, Jan Tönshoff, Martin Ritzert, Berke Kisin, Martin Grohe
2024	A*	`conf`	Distinguished In Uniform: Self-Attention Vs. Virtual Nodes. ICLR Eran Rosenbluth, Jan Tönshoff, Martin Ritzert, Berke Kisin, Martin Grohe
2024	—	`conf`	End-to-End Reinforcement Learning of Curative Curtailment with Partial Measurement Availability. ISGT EUROPE 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
2024	J	`jnl`	End-to-End Reinforcement Learning of Curative Curtailment with Partial Measurement Availability. CoRR 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
2024	J	`jnl`	Future Directions in Foundations of Graph Machine Learning. CoRR Christopher Morris, Nadav Dym, Haggai Maron, Ismail Ilkan Ceylan, Fabrizio Frasca, Ron Levie, Derek Lim, Michael M. Bronstein, Martin Grohe, Stefanie Jegelka
2024	J	`jnl`	GraphXForm: Graph transformer for computer-aided molecular design with application to extraction. CoRR Jonathan Pirnay, Jan G. Rittig, Alexander B. Wolf, Martin Grohe, Jakob Burger, Alexander Mitsos, Dominik G. Grimm
2024	A*	`conf`	Isomorphism for Tournaments of Small Twin Width. ICALP Martin Grohe, Daniel Neuen
2024	A*	`conf`	Position: Future Directions in the Theory of Graph Machine Learning. ICML Christopher Morris, Fabrizio Frasca, Nadav Dym, Haggai Maron, Ismail Ilkan Ceylan, Ron Levie, Derek Lim, Michael M. Bronstein, Martin Grohe, Stefanie Jegelka
2024	J	`jnl`	Query languages for neural networks. CoRR Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche
2024	J	`jnl`	Selecting Walk Schemes for Database Embedding. CoRR Yuval Lev Lubarsky, Jan Tönshoff, Martin Grohe, Benny Kimelfeld
2024	—	`conf`	Some Thoughts on Graph Similarity. Principles of Verification (1) Martin Grohe
2024	J	`jnl`	Some Thoughts on Graph Similarity. CoRR Martin Grohe
2024	—	`conf`	The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2024. PODS Companion Martin Grohe, Jan Van den Bussche, Ke Yi
2024	J	`jnl`	The Descriptive Complexity of Graph Neural Networks. TheoretiCS Martin Grohe
2024	A	`conf`	The Importance of Parameters in Database Queries. ICDT Martin Grohe, Benny Kimelfeld, Peter Lindner, Christoph Standke
2024	J	`jnl`	The Importance of Parameters in Database Queries. CoRR Martin Grohe, Benny Kimelfeld, Peter Lindner, Christoph Standke
2024	J	`jnl`	Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark. Trans. Mach. Learn. Res. Jan Tönshoff, Martin Ritzert, Eran Rosenbluth, Martin Grohe
2023	J	`jnl`	A Faster Isomorphism Test for Graphs of Small Degree. SIAM J. Comput. Martin Grohe, Daniel Neuen, Pascal Schweitzer
2023	J	`jnl`	Canonisation and Definability for Graphs of Bounded Rank Width. ACM Trans. Comput. Log. Martin Grohe, Daniel Neuen
2023	A*	`conf`	Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. FOCS Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
2023	J	`jnl`	Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. CoRR Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer
2023	J	`jnl`	Isomorphism Testing for Graphs Excluding Small Minors. SIAM J. Comput. Martin Grohe, Daniel Neuen, Daniel Wiebking
2023	J	`jnl`	Isomorphism for Tournaments of Small Twin Width. CoRR Martin Grohe, Daniel Neuen
2023	J	`jnl`	On the Parameterized Complexity of Learning Monadic Second-Order Formulas. CoRR Steffen van Bergerem, Martin Grohe, Nina Runde
2023	A*	`conf`	One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction. IJCAI Jan Tönshoff, Berke Kisin, Jakob Lindner, Martin Grohe
2023	J	`jnl`	Physical pooling functions in graph neural networks for molecular property prediction. Comput. Chem. Eng. Artur M. Schweidtmann, Jan G. Rittig, Jana M. Weber, Martin Grohe, Manuel Dahmen, Kai Leonhard, Alexander Mitsos
2023	A	`conf`	Probabilistic Query Evaluation with Bag Semantics. ICDT Martin Grohe, Peter Lindner, Christoph Standke
2023	A	`conf`	Selecting Walk Schemes for Database Embedding. CIKM Yuval Lev Lubarsky, Jan Tönshoff, Martin Grohe, Benny Kimelfeld
2023	A*	`conf`	Simulating Logspace-Recursion with Logarithmic Quantifier Depth. LICS Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus
2023	J	`jnl`	Simulating Logspace-Recursion with Logarithmic Quantifier Depth. CoRR Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus
2023	A*	`conf`	Some Might Say All You Need Is Sum. IJCAI Eran Rosenbluth, Jan Tönshoff, Martin Grohe
2023	J	`jnl`	Some Might Say All You Need Is Sum. CoRR Eran Rosenbluth, Jan Tönshoff, Martin Grohe
2023	A*	`conf`	Stable Tuple Embeddings for Dynamic Databases. ICDE Jan Tönshoff, Neta Friedman, Martin Grohe, Benny Kimelfeld
2023	J	`jnl`	Structural Node Embeddings with Homomorphism Counts. CoRR Hinrikus Wolf, Luca Oeljeklaus, Pascal Kühner, Martin Grohe
2023	A*	`conf`	The Descriptive Complexity of Graph Neural Networks. LICS Martin Grohe
2023	J	`jnl`	The Descriptive Complexity of Graph Neural Networks. CoRR Martin Grohe
2023	A*	`conf`	The Iteration Number of the Weisfeiler-Leman Algorithm. LICS Martin Grohe, Moritz Lichter, Daniel Neuen
2023	J	`jnl`	The Iteration Number of the Weisfeiler-Leman Algorithm. CoRR Martin Grohe, Moritz Lichter, Daniel Neuen
2023	A*	`conf`	WL meet VC. ICML Christopher Morris, Floris Geerts, Jan Tönshoff, Martin Grohe
2023	J	`jnl`	WL meet VC. CoRR Christopher Morris, Floris Geerts, Jan Tönshoff, Martin Grohe
2023	J	`jnl`	Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing. Trans. Mach. Learn. Res. Jan Tönshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe
2023	J	`jnl`	Weisfeiler and Leman go Machine Learning: The Story so far. J. Mach. Learn. Res. Christopher Morris, Yaron Lipman, Haggai Maron, Bastian Rieck, Nils M. Kriege, Martin Grohe, Matthias Fey, Karsten M. Borgwardt
2023	J	`jnl`	Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark. CoRR Jan Tönshoff, Martin Ritzert, Eran Rosenbluth, Martin Grohe
2022	J	`jnl`	Generative Datalog with Continuous Distributions. J. ACM Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner
2022	J	`jnl`	Graph Embeddings: Theory meets Practice (Dagstuhl Seminar 22132). Dagstuhl Reports Martin Grohe, Stephan Günnemann, Stefanie Jegelka, Christopher Morris
2022	J	`jnl`	Graph Machine Learning for Design of High-Octane Fuels. CoRR Jan G. Rittig, Martin Ritzert, Artur M. Schweidtmann, Stefanie Winkler, Jana M. Weber, Philipp Morsch, K. Alexander Heufer, Martin Grohe, Alexander Mitsos, Manuel Dahmen
2022	B	`conf`	Graph Similarity Based on Matrix Norms. MFCS Timo Gervens, Martin Grohe
2022	J	`jnl`	Graph Similarity Based on Matrix Norms. CoRR Timo Gervens, Martin Grohe
2022	A*	`conf`	Homomorphism Tensors and Linear Equations. ICALP Martin Grohe, Gaurav Rattan, Tim Seppelt
2022	J	`jnl`	Independence in Infinite Probabilistic Databases. J. ACM Martin Grohe, Peter Lindner
2022	J	`jnl`	Infinite Probabilistic Databases. Log. Methods Comput. Sci. Martin Grohe, Peter Lindner
2022	A*	`conf`	On the Parameterized Complexity of Learning First-Order Logic. PODS Steffen van Bergerem, Martin Grohe, Martin Ritzert
2022	J	`jnl`	One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction. CoRR Jan Tönshoff, Berke Kisin, Jakob Lindner, Martin Grohe
2022	J	`jnl`	Physical Pooling Functions in Graph Neural Networks for Molecular Property Prediction. CoRR Artur M. Schweidtmann, Jan G. Rittig, Jana M. Weber, Martin Grohe, Manuel Dahmen, Kai Leonhard, Alexander Mitsos
2022	J	`jnl`	Probabilistic Query Evaluation with Bag Semantics. CoRR Martin Grohe, Peter Lindner, Christoph Standke
2022	J	`jnl`	Solving AC Power Flow with Graph Neural Networks under Realistic Constraints. CoRR Luis Böttcher, Hinrikus Wolf, Bastian Jung, Philipp Lutat, Marc Trageser, Oliver Pohl, Andreas Ulbig, Martin Grohe
2022	J	`jnl`	The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201). Dagstuhl Reports Martin Grohe, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný
2021	B	`conf`	A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk). MFCS Martin Grohe
2021	A	`conf`	Database Repairing with Soft Functional Dependencies. ICDT Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi
2021	A*	`conf`	Deep Weisfeiler Leman. SODA Martin Grohe, Pascal Schweitzer, Daniel Wiebking
2021	J	`jnl`	Definable decompositions for graphs of bounded linear cliquewidth. Log. Methods Comput. Sci. Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
2021	J	`jnl`	Dynamic Database Embeddings with FoRWaRD. CoRR Jan Tönshoff, Neta Friedman, Martin Grohe, Benny Kimelfeld
2021	J	`jnl`	Graph Learning with 1D Convolutions on Random Walks. CoRR Jan Tönshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe
2021	J	`jnl`	Homomorphism Tensors and Linear Equations. CoRR Martin Grohe, Gaurav Rattan, Tim Seppelt
2021	J	`jnl`	Isomorphism, canonization, and definability for graphs of bounded rank width. Commun. ACM Martin Grohe, Daniel Neuen
2021	A*	`conf`	Logarithmic Weisfeiler-Leman Identifies All Planar Graphs. ICALP Martin Grohe, Sandra Kiefer
2021	J	`jnl`	Logarithmic Weisfeiler-Leman Identifies All Planar Graphs. CoRR Martin Grohe, Sandra Kiefer
2021	J	`jnl`	On the Parameterized Complexity of Learning Logic. CoRR Steffen van Bergerem, Martin Grohe, Martin Ritzert
2021	J	`jnl`	Probabilistic Data with Continuous Distributions. CoRR Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner
2021	J	`jnl`	Probabilistic Data with Continuous Distributions. SIGMOD Rec. Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner
2021	—	`conf`	Recent advances on the graph isomorphism problem. BCC Martin Grohe, Daniel Neuen
2021	—	`conf`	The Effects of Randomness on the Stability of Node Embeddings. PKDD/ECML Workshops (1) Tobias Schumacher, Hinrikus Wolf, Martin Ritzert, Florian Lemmerich, Martin Grohe, Markus Strohmaier
2021	A*	`conf`	The Logic of Graph Neural Networks. LICS Martin Grohe
2021	J	`jnl`	The Logic of Graph Neural Networks. CoRR Martin Grohe
2021	A*	`conf`	The Surprising Power of Graph Neural Networks with Random Node Initialization. IJCAI Ralph Abboud, Ismail Ilkan Ceylan, Martin Grohe, Thomas Lukasiewicz
2021	A*	`conf`	Tuple-Independent Representations of Infinite Probabilistic Databases. PODS Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke
2021	J	`jnl`	Weisfeiler and Leman go Machine Learning: The Story so far. CoRR Christopher Morris, Yaron Lipman, Haggai Maron, Bastian Rieck, Nils M. Kriege, Martin Grohe, Matthias Fey, Karsten M. Borgwardt
2020	J	`jnl`	An Improved Isomorphism Test for Bounded-tree-width Graphs. ACM Trans. Algorithms Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
2020	J	`jnl`	Automorphism groups of graphs of bounded Hadwiger number. CoRR Martin Grohe, Pascal Schweitzer, Daniel Wiebking
2020	A*	`conf`	Counting Bounded Tree Depth Homomorphisms. LICS Martin Grohe
2020	J	`jnl`	Counting Bounded Tree Depth Homomorphisms. CoRR Martin Grohe
2020	J	`jnl`	Database Repairing with Soft Functional Dependencies. CoRR Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi
2020	J	`jnl`	Deep Weisfeiler Leman. CoRR Martin Grohe, Pascal Schweitzer, Daniel Wiebking
2020	A*	`conf`	Generative Datalog with Continuous Distributions. PODS Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner
2020	J	`jnl`	Generative Datalog with Continuous Distributions. CoRR Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner
2020	J	`jnl`	Graph Neural Networks for Maximum Constraint Satisfaction. Frontiers Artif. Intell. Jan Tönshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe
2020	J	`jnl`	Independence in Infinite Probabilistic Databases. CoRR Martin Grohe, Peter Lindner
2020	A	`conf`	Infinite Probabilistic Databases. ICDT Martin Grohe, Peter Lindner
2020	A*	`conf`	Isomorphism Testing for Graphs Excluding Small Minors. FOCS Martin Grohe, Daniel Wiebking, Daniel Neuen
2020	J	`jnl`	Isomorphism Testing for Graphs Excluding Small Minors. CoRR Martin Grohe, Daniel Neuen, Daniel Wiebking
2020	J	`jnl`	Recent Advances on the Graph Isomorphism Problem. CoRR Martin Grohe, Daniel Neuen
2020	J	`jnl`	Standard Probabilistic Databases. CoRR Martin Grohe, Peter Lindner
2020	J	`jnl`	The Effects of Randomness on the Stability of Node Embeddings. CoRR Tobias Schumacher, Hinrikus Wolf, Martin Ritzert, Florian Lemmerich, Jan Bachmann, Florian Frantzen, Max Klabunde, Martin Grohe, Markus Strohmaier
2020	J	`jnl`	The Surprising Power of Graph Neural Networks with Random Node Initialization. CoRR Ralph Abboud, Ismail Ilkan Ceylan, Martin Grohe, Thomas Lukasiewicz
2020	J	`jnl`	The graph isomorphism problem. Commun. ACM Martin Grohe, Pascal Schweitzer
2020	J	`jnl`	Tuple-Independent Representations of Infinite Probabilistic Databases. CoRR Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke
2020	A	`conf`	Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk). STACS Martin Grohe
2020	A*	`conf`	word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data. PODS Martin Grohe
2020	J	`jnl`	word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data. CoRR Martin Grohe
2019	J	`jnl`	A Finite-Model-Theoretic View on Propositional Proof Complexity. Log. Methods Comput. Sci. Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa
2019	A*	`conf`	A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. ICALP Martin Grohe, Sandra Kiefer
2019	J	`jnl`	A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. CoRR Martin Grohe, Sandra Kiefer
2019	A*	`conf`	Canonisation and Definability for Graphs of Bounded Rank Width. LICS Martin Grohe, Daniel Neuen
2019	J	`jnl`	Canonisation and Definability for Graphs of Bounded Rank Width. CoRR Martin Grohe, Daniel Neuen
2019	J	`jnl`	Infinite Probabilistic Databases. CoRR Martin Grohe, Peter Lindner
2019	A*	`conf`	Probabilistic Databases with an Infinite Open-World Assumption. PODS Martin Grohe, Peter Lindner
2019	J	`jnl`	RUN-CSP: Unsupervised Learning of Message Passing Networks for Binary Constraint Satisfaction Problems. CoRR Jan Tönshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe
2019	A*	`conf`	Symmetry and Similarity (Invited Talk). ICALP Martin Grohe
2019	B	`conf`	The Complexity of Homomorphism Indistinguishability. MFCS Jan Böker, Yijia Chen, Martin Grohe, Gaurav Rattan
2019	A*	`conf`	Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks. AAAI Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, Martin Grohe
2018	A*	`conf`	A Faster Isomorphism Test for Graphs of Small Degree. FOCS Martin Grohe, Daniel Neuen, Pascal Schweitzer
2018	J	`jnl`	A Finite-Model-Theoretic View on Propositional Proof Complexity. CoRR Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa
2018	A*	`conf`	An Improved Isomorphism Test for Bounded-Tree-Width Graphs. ICALP Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
2018	J	`jnl`	An improved isomorphism test for bounded-tree-width graphs. CoRR Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking
2018	J	`jnl`	Coloring and Covering Nowhere Dense Graphs. SIAM J. Discret. Math. Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos
2018	A*	`conf`	Definable decompositions for graphs of bounded linear cliquewidth. LICS Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
2018	J	`jnl`	Definable decompositions for graphs of bounded linear cliquewidth. CoRR Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
2018	A*	`conf`	First-Order Query Evaluation with Cardinality Conditions. PODS Martin Grohe, Nicole Schweikardt
2018	B	`conf`	Graph Similarity and Approximate Isomorphism. MFCS Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger
2018	J	`jnl`	Graph Similarity and Approximate Isomorphism. CoRR Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger
2018	A*	`conf`	Lovász Meets Weisfeiler and Leman. ICALP Holger Dell, Martin Grohe, Gaurav Rattan
2018	J	`jnl`	Probabilistic Databases with an Infinite Open-World Assumption. CoRR Martin Grohe, Peter Lindner
2018	J	`jnl`	The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231). Dagstuhl Reports Martin Grohe, Venkatesan Guruswami, Stanislav Zivný
2018	J	`jnl`	Towards faster isomorphism tests for bounded-degree graphs. CoRR Martin Grohe, Daniel Neuen, Pascal Schweitzer
2018	J	`jnl`	Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks. CoRR Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, Martin Grohe
2018	J	`jnl`	Weisfeiler-Leman meets Homomorphisms. CoRR Holger Dell, Martin Grohe, Gaurav Rattan
2017	J	`jnl`	Constraint Solving via Fractional Edge Covers. CoRR Martin Grohe, Dániel Marx
2017	J	`jnl`	Deciding First-Order Properties of Nowhere Dense Graphs. J. ACM Martin Grohe, Stephan Kreutzer, Sebastian Siebertz
2017	—	`book`	Descriptive Complexity, Canonisation, and Definable Graph Structure Theory Martin Grohe
2017	A*	`conf`	Descriptive complexity of linear equation systems and applications to propositional proof complexity. LICS Martin Grohe, Wied Pakusa
2017	J	`jnl`	First-Order Query Evaluation with Cardinality Conditions. CoRR Martin Grohe, Nicole Schweikardt
2017	J	`jnl`	Learning MSO-definable hypotheses on string. CoRR Martin Grohe, Christof Löding, Martin Ritzert
2017	B	`conf`	Learning MSO-definable hypotheses on strings. ALT Martin Grohe, Christof Löding, Martin Ritzert
2017	A*	`conf`	Learning first-order definable concepts over structures of small degree. LICS Martin Grohe, Martin Ritzert
2017	J	`jnl`	Learning first-order definable concepts over structures of small degree. CoRR Martin Grohe, Martin Ritzert
2017	A*	`conf`	Linear Diophantine Equations, Group CSPs, and Graph Isomorphism. SODA Christoph Berkholz, Martin Grohe
2017	J	`jnl`	Size bounds and query plans for relational joins. CoRR Albert Atserias, Martin Grohe, Dániel Marx
2017	B	`conf`	The Hardness of Embedding Grids and Walls. WG Yijia Chen, Martin Grohe, Bingkai Lin
2017	J	`jnl`	The Hardness of Embedding Grids and Walls. CoRR Yijia Chen, Martin Grohe, Bingkai Lin
2017	J	`jnl`	Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. Theory Comput. Syst. Christoph Berkholz, Paul S. Bonsma, Martin Grohe
2016	J	`jnl`	Computing with Tangles. SIAM J. Discret. Math. Martin Grohe, Pascal Schweitzer
2016	J	`jnl`	Linear Diophantine Equations, Group CSPs, and Graph Isomorphism. CoRR Christoph Berkholz, Martin Grohe
2016	A*	`conf`	Order Invariance on Decomposable Structures. LICS Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe
2016	J	`jnl`	Order Invariance on Decomposable Structures. CoRR Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe
2016	A*	`ed.`	Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016 LICS Martin Grohe, Eric Koskinen, Natarajan Shankar
2016	A*	`conf`	Quasi-4-Connected Components. ICALP Martin Grohe
2016	J	`jnl`	Quasi-4-Connected Components. CoRR Martin Grohe
2016	J	`jnl`	Tangled up in Blue (A Survey on Connectivity, Decompositions, and Tangles). CoRR Martin Grohe
2016	C	`conf`	Tangles and Connectivity in Graphs. LATA Martin Grohe
2016	J	`jnl`	Tangles and Connectivity in Graphs. CoRR Martin Grohe
2016	J	`jnl`	Where First-Order and Monadic Second-Order Logic Coincide. ACM Trans. Comput. Log. Michael Elberfeld, Martin Grohe, Till Tantau
2015	B	`conf`	Colouring and Covering Nowhere Dense Graphs. WG Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos
2015	A*	`conf`	Computing with Tangles. STOC Martin Grohe, Pascal Schweitzer
2015	J	`jnl`	Computing with Tangles. CoRR Martin Grohe, Pascal Schweitzer
2015	—	`conf`	Is Polynomial Time Choiceless? Fields of Logic and Computation II Erich Grädel, Martin Grohe
2015	A*	`conf`	Isomorphism Testing for Graphs of Bounded Rank Width. FOCS Martin Grohe, Pascal Schweitzer
2015	J	`jnl`	Isomorphism Testing for Graphs of Bounded Rank Width. CoRR Martin Grohe, Pascal Schweitzer
2015	—	`conf`	Limitations of Algebraic Approaches to Graph Isomorphism Testing. ICALP (1) Christoph Berkholz, Martin Grohe
2015	J	`jnl`	Limitations of Algebraic Approaches to Graph Isomorphism Testing. CoRR Christoph Berkholz, Martin Grohe
2015	J	`jnl`	Pebble Games and linear equations. J. Symb. Log. Martin Grohe, Martin Otto
2015	J	`jnl`	Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs. SIAM J. Comput. Martin Grohe, Dániel Marx
2015	J	`jnl`	Theory and Practice of SAT Solving (Dagstuhl Seminar 15171). Dagstuhl Reports Armin Biere, Vijay Ganesh, Martin Grohe, Jakob Nordström, Ryan Williams
2015	J	`jnl`	Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. CoRR Christoph Berkholz, Paul S. Bonsma, Martin Grohe
2014	Misc	`conf`	Algorithmic Meta Theorems for Sparse Graph Classes. CSR Martin Grohe
2014	—	`conf`	Choiceless Polynomial Time on Structures with Small Abelian Colour Classes. MFCS (1) Faried Abu Zaid, Erich Grädel, Martin Grohe, Wied Pakusa
2014	—	`conf`	Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk). FSTTCS Martin Grohe
2014	J	`jnl`	Constraint Solving via Fractional Edge Covers. ACM Trans. Algorithms Martin Grohe, Dániel Marx
2014	J	`jnl`	Database Theory Column Report on PODS 2014. SIGACT News Martin Grohe
2014	A*	`conf`	Deciding first-order properties of nowhere dense graphs. STOC Martin Grohe, Stephan Kreutzer, Sebastian Siebertz
2014	A	`conf`	Dimension Reduction via Colour Refinement. ESA Martin Grohe, Kristian Kersting, Martin Mladenov, Erkal Selman
2014	—	`conf`	Monadic Datalog Containment on Trees. AMW André Frochaux, Martin Grohe, Nicole Schweikardt
2014	J	`jnl`	Monadic Datalog Containment on Trees. CoRR André Frochaux, Martin Grohe, Nicole Schweikardt
2014	A*	`conf`	Power Iterated Color Refinement. AAAI Kristian Kersting, Martin Mladenov, Roman Garnett, Martin Grohe
2014	A*	`ed.`	Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS'14, Snowbird, UT, USA, June 22-27, 2014 PODS Richard Hull, Martin Grohe
2013	A*	`conf`	A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. SODA Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed
2013	—	`conf`	Bounds and Algorithms for Joins via Fractional Edge Covers. In Search of Elegance in the Theory and Practice of Computation Martin Grohe
2013	—	`conf`	Characterisations of Nowhere Dense Graphs (Invited Talk). FSTTCS Martin Grohe, Stephan Kreutzer, Sebastian Siebertz
2013	J	`jnl`	Deciding first-order properties of nowhere dense graphs. CoRR Martin Grohe, Stephan Kreutzer, Sebastian Siebertz
2013	J	`jnl`	Dimension Reduction via Colour Refinement. CoRR Martin Grohe, Kristian Kersting, Martin Mladenov, Erkal Selman
2013	B	`conf`	Logical and Structural Approaches to the Graph Isomorphism Problem. MFCS Martin Grohe
2013	J	`jnl`	Size Bounds and Query Plans for Relational Joins. SIAM J. Comput. Albert Atserias, Martin Grohe, Dániel Marx
2013	A	`conf`	Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. ESA Christoph Berkholz, Paul S. Bonsma, Martin Grohe
2012	J	`jnl`	Enumerating homomorphisms. J. Comput. Syst. Sci. Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
2012	J	`jnl`	Fixed-point definability and polynomial time on graphs with excluded minors. J. ACM Martin Grohe
2012	J	`jnl`	L-Recursion and a new Logic for Logarithmic Space Log. Methods Comput. Sci. Martin Grohe, Berit Grußien, André Hernich, Bastian Laubner
2012	J	`jnl`	Pebble Games and Linear Equations CoRR Martin Grohe, Martin Otto
2012	B	`conf`	Pebble Games and Linear Equations. CSL Martin Grohe, Martin Otto
2012	A*	`conf`	Structural and logical approaches to the graph isomorphism problem. SODA Martin Grohe
2012	A*	`conf`	Structure theorem and isomorphism test for graphs with excluded topological subgraphs. STOC Martin Grohe, Dániel Marx
2012	J	`jnl`	Where First-Order and Monadic Second-Order Logic Coincide CoRR Michael Elberfeld, Martin Grohe, Till Tantau
2012	A*	`conf`	Where First-Order and Monadic Second-Order Logic Coincide. LICS Michael Elberfeld, Martin Grohe, Till Tantau
2011	J	`jnl`	Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). Dagstuhl Reports Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek
2011	J	`jnl`	Counting Homomorphisms and Partition Functions CoRR Martin Grohe, Marc Thurley
2011	A*	`conf`	Finding topological subgraphs is fixed-parameter tractable. STOC Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan
2011	J	`jnl`	From polynomial time queries to graph structure theory. Commun. ACM Martin Grohe
2011	B	`conf`	L-Recursion and a new Logic for Logarithmic Space. CSL Martin Grohe, Berit Grußien, André Hernich, Bastian Laubner
2011	—	`ed.`	Model Theoretic Methods in Finite Combinatorics - AMS-ASL Joint Special Session, Washington, DC, USA, January 5-8, 2009. AMS-ASL Joint Special Session Martin Grohe, Johann A. Makowsky
2011	J	`jnl`	Randomisation and Derandomisation in Descriptive Complexity Theory Log. Methods Comput. Sci. Kord Eickmeyer, Martin Grohe
2011	J	`jnl`	Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs CoRR Martin Grohe, Dániel Marx
2010	J	`jnl`	A Complexity Dichotomy for Partition Functions with Mixed Signs. SIAM J. Comput. Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley
2010	J	`jnl`	Constraint satisfaction with succinctly specified relations. J. Comput. Syst. Sci. Hubie Chen, Martin Grohe
2010	J	`jnl`	Finding topological subgraphs is fixed-parameter tractable CoRR Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan
2010	J	`jnl`	Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs CoRR Martin Grohe
2010	—	`conf`	Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs. Fields of Logic and Computation Martin Grohe
2010	A*	`conf`	Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors. LICS Martin Grohe
2010	A	`conf`	From polynomial time queries to graph structure theory. ICDT Martin Grohe
2010	B	`conf`	Randomisation and Derandomisation in Descriptive Complexity Theory. CSL Kord Eickmeyer, Martin Grohe
2010	J	`jnl`	Randomisation and Derandomisation in Descriptive Complexity Theory. Electron. Colloquium Comput. Complex. Kord Eickmeyer, Martin Grohe
2009	—	`conf`	09441 Abstracts Collection - The Constraint Satisfaction Problem: Complexity and Approximability. The Constraint Satisfaction Problem: Complexity and Approximability Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin
2009	—	`conf`	09441 Executive Summary - The Constraint Satisfaction Problem: Complexity and Approximability. The Constraint Satisfaction Problem: Complexity and Approximability Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin
2009	A	`conf`	A Complexity Dichotomy for Partition Functions with Mixed Signs. STACS Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley
2009	—	`conf`	Counting Homomorphisms and Partition Functions. AMS-ASL Joint Special Session Martin Grohe, Marc Thurley
2009	J	`jnl`	Database Query Processing Using Finite Cursor Machines. Theory Comput. Syst. Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche
2009	J	`jnl`	Enumerating Homomorphisms CoRR Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
2009	A	`conf`	Enumerating Homomorphisms. STACS Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
2009	B	`conf`	Fixed-Point Definability and Polynomial Time. CSL Martin Grohe
2009	A*	`conf`	Logics with Rank Operators. LICS Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner
2009	J	`jnl`	Lower bounds for processing data with few random accesses to external memory. J. ACM Martin Grohe, André Hernich, Nicole Schweikardt
2009	—	`conf`	Methods for Algorithmic Meta Theorems. AMS-ASL Joint Special Session Martin Grohe, Stephan Kreutzer
2009	J	`jnl`	On tree width, bramble size, and expansion. J. Comb. Theory B Martin Grohe, Dániel Marx
2009	J	`jnl`	The Complexity of Datalog on Linear Orders Log. Methods Comput. Sci. Martin Grohe, Götz Schwandtner
2009	—	`ed.`	The Constraint Satisfaction Problem: Complexity and Approximability, 25.10. - 30.10.2009 The Constraint Satisfaction Problem: Complexity and Approximability Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin
2008	J	`jnl`	A complexity dichotomy for partition functions with mixed signs CoRR Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley
2008	B	`conf`	Algorithmic Meta Theorems. WG Martin Grohe
2008	A	`conf`	Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. CCC Kord Eickmeyer, Martin Grohe, Magdalena Grüber
2008	A*	`conf`	Computing excluded minors. SODA Isolde Adler, Martin Grohe, Stephan Kreutzer
2008	A*	`conf`	Definable Tree Decompositions. LICS Martin Grohe
2008	—	`conf`	Logic, graphs, and algorithms. Logic and Automata Martin Grohe
2008	—	`conf`	Non-dichotomies in Constraint Satisfaction Complexity. ICALP (2) Manuel Bodirsky, Martin Grohe
2008	—	`ed.`	Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings IWPEC Martin Grohe, Rolf Niedermeier
2008	J	`jnl`	Preservation under Extensions on Well-Behaved Finite Structures. SIAM J. Comput. Albert Atserias, Anuj Dawar, Martin Grohe
2008	A*	`conf`	Size Bounds and Query Plans for Relational Joins. FOCS Albert Atserias, Martin Grohe, Dániel Marx
2008	A*	`conf`	The Quest for a Logic Capturing PTIME. LICS Martin Grohe
2007	J	`jnl`	An Isomorphism Between Subexponential and Parameterized Complexity Theory. SIAM J. Comput. Yijia Chen, Martin Grohe
2007	J	`jnl`	An analysis of the W J. Symb. Log. Yijia Chen, Jörg Flum, Martin Grohe
2007	J	`jnl`	Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Log. Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer
2007	A	`conf`	Database Query Processing Using Finite Cursor Machines. ICDT Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche
2007	J	`jnl`	Hypertree width and related hypergraph invariants. Eur. J. Comb. Isolde Adler, Georg Gottlob, Martin Grohe
2007	A*	`conf`	Locally Excluding a Minor. LICS Anuj Dawar, Martin Grohe, Stephan Kreutzer
2007	J	`jnl`	Logic, Graphs, and Algorithms. Electron. Colloquium Comput. Complex. Martin Grohe
2007	A*	`conf`	Model Theory Makes Formulas Large. ICALP Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
2007	J	`jnl`	On Parameterized Approximability. Electron. Colloquium Comput. Complex. Yijia Chen, Martin Grohe, Magdalena Grüber
2007	A*	`conf`	Parameterized Approximability of the Disjoint Cycle Problem. ICALP Martin Grohe, Magdalena Grüber
2007	J	`jnl`	Randomized Computations on Large Data Sets: Tight Lower Bounds CoRR Martin Grohe, André Hernich, Nicole Schweikardt
2007	B	`conf`	The Ackermann Award 2007. CSL Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski
2007	J	`jnl`	The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM Martin Grohe
2007	J	`jnl`	Tight lower bounds for query processing on streaming and external memory data. Theor. Comput. Sci. Martin Grohe, Christoph Koch, Nicole Schweikardt
2006	J	`jnl`	An Isomorphism between Subexponential and Parameterized Complexity Theory Electron. Colloquium Comput. Complex. Yijia Chen, Martin Grohe
2006	A	`conf`	An Isomorphism between Subexponential and Parameterized Complexity Theory. CCC Yijia Chen, Martin Grohe
2006	A*	`conf`	Approximation Schemes for First-Order Definable Optimisation Problems. LICS Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
2006	J	`jnl`	Bounded fixed-parameter tractability and log J. Comput. Syst. Sci. Jörg Flum, Martin Grohe, Mark Weyer
2006	—	`conf`	Constraint Satisfaction with Succinctly Specified Relations. Complexity of Constraints Hubie Chen, Martin Grohe
2006	A*	`conf`	Constraint solving via fractional edge covers. SODA Martin Grohe, Dániel Marx
2006	—	`ed.`	Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005 Exact Algorithms and Fixed-Parameter Tractability Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
2006	—	`conf`	On Parameterized Approximability. IWPEC Yijia Chen, Martin Grohe, Magdalena Grüber
2006	—	`book`	Parameterized Complexity Theory Jörg Flum, Martin Grohe
2006	A*	`conf`	Randomized computations on large data sets: tight lower bounds. PODS Martin Grohe, André Hernich, Nicole Schweikardt
2006	J	`jnl`	Testing Graph Isomorphism in Parallel by Playing a Game CoRR Martin Grohe, Oleg Verbitsky
2006	—	`conf`	Testing Graph Isomorphism in Parallel by Playing a Game. ICALP (1) Martin Grohe, Oleg Verbitsky
2006	B	`conf`	The Structure of Tractable Constraint Satisfaction Problems. MFCS Martin Grohe
2005	—	`conf`	05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
2005	—	`conf`	05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
2005	B	`conf`	Hypertree Decompositions: Structure, Algorithms, and Applications. WG Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello
2005	A*	`conf`	Lower bounds for sorting with few random accesses to external memory. PODS Martin Grohe, Nicole Schweikardt
2005	J	`jnl`	Machine-based methods in parameterized complexity theory. Theor. Comput. Sci. Yijia Chen, Jörg Flum, Martin Grohe
2005	J	`jnl`	Model-Checking Problems as a Basis for Parameterized Intractability CoRR Jörg Flum, Martin Grohe
2005	J	`jnl`	Model-checking problems as a basis for parameterized intractability. Log. Methods Comput. Sci. Jörg Flum, Martin Grohe
2005	A*	`conf`	Preservation Under Extensions on Well-Behaved Finite Structures. ICALP Albert Atserias, Anuj Dawar, Martin Grohe
2005	B	`conf`	The Complexity of Querying External Memory and Streaming Data. FCT Martin Grohe, Christoph Koch, Nicole Schweikardt
2005	B	`conf`	The Expressive Power of Two-Variable Least Fixed-Point Logics. MFCS Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
2005	J	`jnl`	The complexity of partition functions. Theor. Comput. Sci. Andrei A. Bulatov, Martin Grohe
2005	J	`jnl`	The succinctness of first-order logic on linear orders CoRR Martin Grohe, Nicole Schweikardt
2005	J	`jnl`	The succinctness of first-order logic on linear orders. Log. Methods Comput. Sci. Martin Grohe, Nicole Schweikardt
2005	J	`jnl`	Tight Lower Bounds for Query Processing on Streaming and External Memory Data CoRR Martin Grohe, Christoph Koch, Nicole Schweikardt
2005	A*	`conf`	Tight Lower Bounds for Query Processing on Streaming and External Memory Data. ICALP Martin Grohe, Christoph Koch, Nicole Schweikardt
2004	J	`jnl`	An existential locality theorem. Ann. Pure Appl. Log. Martin Grohe, Stefan Wöhrle
2004	A*	`conf`	Bounded Fixed-Parameter Tractability and log ICALP Jörg Flum, Martin Grohe, Mark Weyer
2004	J	`jnl`	Comparing the succinctness of monadic query languages over finite trees. RAIRO Theor. Informatics Appl. Martin Grohe, Nicole Schweikardt
2004	J	`jnl`	Computing crossing numbers in quadratic time. J. Comput. Syst. Sci. Martin Grohe
2004	J	`jnl`	Learnability and Definability in Trees and Similar Structures. Theory Comput. Syst. Martin Grohe, György Turán
2004	A*	`conf`	Model-Checking Problems as a Basis for Parameterized Intractability. LICS Jörg Flum, Martin Grohe
2004	J	`jnl`	Parametrized Complexity and Subexponential Time (Column: Computational Complexity). Bull. EATCS Jörg Flum, Martin Grohe
2004	A*	`conf`	The Complexity of Partition Functions. ICALP Andrei A. Bulatov, Martin Grohe
2004	J	`jnl`	The Parameterized Complexity of Counting Problems. SIAM J. Comput. Jörg Flum, Martin Grohe
2004	A*	`conf`	The Succinctness of First-Order Logic on Linear Orders. LICS Martin Grohe, Nicole Schweikardt
2004	J	`jnl`	The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Log. Markus Frick, Martin Grohe
2003	A	`conf`	Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. CCC Yijia Chen, Jörg Flum, Martin Grohe
2003	B	`conf`	Comparing the Succinctness of Monadic Query Languages over Finite Trees. CSL Martin Grohe, Nicole Schweikardt
2003	J	`jnl`	Describing parameterized complexity classes. Inf. Comput. Jörg Flum, Martin Grohe
2003	J	`jnl`	Local Tree-Width, Excluded Minors, and Approximation Algorithms. Comb. Martin Grohe
2003	—	`conf`	Monadic Datalog on Trees (Invited Talk). FICS Martin Grohe
2003	A*	`conf`	Path Queries on Compressed XML. VLDB Peter Buneman, Martin Grohe, Christoph Koch
2003	A*	`conf`	Query Evaluation on Compressed Trees (Extended Abstract). LICS Markus Frick, Martin Grohe, Christoph Koch
2003	J	`jnl`	Reachability and connectivity queries in constraint databases. J. Comput. Syst. Sci. Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin
2003	A*	`conf`	The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side. FOCS Martin Grohe
2002	A	`conf`	Describing Parameterized Complexity Classes. STACS Jörg Flum, Martin Grohe
2002	J	`jnl`	Large Finite Structures with Few Lk-Types. Inf. Comput. Martin Grohe
2002	A	`conf`	Learnability and Definability in Trees and Similar Structures. STACS Martin Grohe, György Turán
2002	J	`jnl`	On first-order topological queries. ACM Trans. Comput. Log. Martin Grohe, Luc Segoufin
2002	J	`jnl`	Parameterized Complexity for the Database Theorist. SIGMOD Rec. Martin Grohe
2002	J	`jnl`	Query evaluation via tree-decompositions. J. ACM Jörg Flum, Markus Frick, Martin Grohe
2002	A*	`conf`	The Complexity of First-Order and Monadic Second-Order Logic Revisited. LICS Markus Frick, Martin Grohe
2002	A*	`conf`	The Parameterized Complexity of Counting Problems. FOCS Jörg Flum, Martin Grohe
2001	B	`conf`	An Existential Locality Theorem. CSL Martin Grohe, Stefan Wöhrle
2001	A*	`conf`	Computing crossing numbers in quadratic time. STOC Martin Grohe
2001	J	`jnl`	Deciding first-order properties of locally tree-decomposable structures. J. ACM Markus Frick, Martin Grohe
2001	J	`jnl`	Fixed-Parameter Tractability, Definability, and Model-Checking. SIAM J. Comput. Jörg Flum, Martin Grohe
2001	A	`conf`	Generalized Model-Checking Problems for First-Order Logic. STACS Martin Grohe
2001	A	`conf`	Query Evaluation via Tree-Decompositions. ICDT Jörg Flum, Markus Frick, Martin Grohe
2001	A*	`conf`	The Parameterized Complexity of Database Queries. PODS Martin Grohe
2001	A*	`conf`	When is the evaluation of conjunctive queries tractable? STOC Martin Grohe, Thomas Schwentick, Luc Segoufin
2000	J	`jnl`	Computing Crossing Numbers in Quadratic Time CoRR Martin Grohe
2000	J	`jnl`	Deciding first-order properties of locally tree-decomposable structures CoRR Markus Frick, Martin Grohe
2000	A*	`conf`	Isomorphism testing for embeddable graphs through definability. STOC Martin Grohe
2000	J	`jnl`	Locality of order-invariant first-order formulas. ACM Trans. Comput. Log. Martin Grohe, Thomas Schwentick
2000	A*	`conf`	On First-Order Topological Queries. LICS Martin Grohe, Luc Segoufin
2000	J	`jnl`	On Fixed-Point Logic With Counting. J. Symb. Log. Jörg Flum, Martin Grohe
2000	A*	`conf`	Reachability and Connectivity Queries in Constraint Databases. PODS Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin
1999	A*	`conf`	Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs. ICALP Markus Frick, Martin Grohe
1999	A	`conf`	Definability and Descriptive Complexity on Databases of Bounded Tree-Width. ICDT Martin Grohe, Julian Mariño
1999	B	`conf`	Descriptive and Parameterized Complexity. CSL Martin Grohe
1999	J	`jnl`	Equivalence in Finite-Variable Logics is Complete for Polynomial Time. Comb. Martin Grohe
1999	J	`jnl`	Fixed-parameter tractability, definability, and model checking CoRR Jörg Flum, Martin Grohe
1998	J	`jnl`	Finite variable logics in descriptive complexity theory. Bull. Symb. Log. Martin Grohe
1998	A*	`conf`	Fixed-Point Logics on Planar Graphs. LICS Martin Grohe
1998	B	`conf`	Locality of Order-Invariant First-Order Formulas. MFCS Martin Grohe, Thomas Schwentick
1997	B	`conf`	Canonization for L CSL Martin Grohe
1997	J	`jnl`	Existential Least Fixed-Point Logic and its Relatives. J. Log. Comput. Martin Grohe
1997	A*	`conf`	Large Finite Structures with Few L LICS Martin Grohe
1996	J	`jnl`	A double arity hierarchy theorem for transitive closure logic. Arch. Math. Log. Martin Grohe, Lauri Hella
1996	J	`jnl`	Arity Hierarchies. Ann. Pure Appl. Log. Martin Grohe
1996	A*	`conf`	Equivalence in Finite-Variable Logics is Complete for Polynomial Time. FOCS Martin Grohe
1996	J	`jnl`	Some Remarks on Finite Löwenheim-Skolem Theorems. Math. Log. Q. Martin Grohe
1995	J	`jnl`	Complete Problems for Fixed-Point Logics. J. Symb. Log. Martin Grohe
1993	B	`conf`	Bounded-Arity Hierarchies in Fixed-Point Logics. CSL Martin Grohe