Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMartin Grohe
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[c102]Martin Grohe, Daniel Neuen, Pascal Schweitzer:
A Faster Isomorphism Test for Graphs of Small Degree. FOCS 2018: 89-100- [c101]
- [c100]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An Improved Isomorphism Test for Bounded-Tree-Width Graphs. ICALP 2018: 67:1-67:14 - [c99]Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk:
Definable decompositions for graphs of bounded linear cliquewidth. LICS 2018: 135-144 - [c98]Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger:
Graph Similarity and Approximate Isomorphism. MFCS 2018: 20:1-20:16 - [c97]Martin Grohe, Nicole Schweikardt:
First-Order Query Evaluation with Cardinality Conditions. PODS 2018: 253-266 - [i53]Martin Grohe, Daniel Neuen, Pascal Schweitzer:
Towards faster isomorphism tests for bounded-degree graphs. CoRR abs/1802.04659 (2018) - [i52]Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger:
Graph Similarity and Approximate Isomorphism. CoRR abs/1802.08509 (2018) - [i51]Holger Dell, Martin Grohe, Gaurav Rattan:
Weisfeiler-Leman meets Homomorphisms. CoRR abs/1802.08876 (2018) - [i50]Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa:
A Finite-Model-Theoretic View on Propositional Proof Complexity. CoRR abs/1802.09377 (2018) - [i49]Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk:
Definable decompositions for graphs of bounded linear cliquewidth. CoRR abs/1803.05937 (2018) - [i48]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An improved isomorphism test for bounded-tree-width graphs. CoRR abs/1803.06858 (2018) - [i47]Martin Grohe, Peter Lindner:
Probabilistic Databases with an Infinite Open-World Assumption. CoRR abs/1807.00607 (2018) - [i46]Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, Martin Grohe:
Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks. CoRR abs/1810.02244 (2018) - 2017
- [j57]Martin Grohe, Stephan Kreutzer, Sebastian Siebertz:
Deciding First-Order Properties of Nowhere Dense Graphs. J. ACM 64(3): 17:1-17:32 (2017) - [j56]Christoph Berkholz, Paul S. Bonsma, Martin Grohe:
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. Theory Comput. Syst. 60(4): 581-614 (2017) - [c96]Martin Grohe, Christof Löding, Martin Ritzert:
Learning MSO-definable hypotheses on strings. ALT 2017: 434-451 - [c95]Martin Grohe, Wied Pakusa:
Descriptive complexity of linear equation systems and applications to propositional proof complexity. LICS 2017: 1-12 - [c94]Martin Grohe, Martin Ritzert:
Learning first-order definable concepts over structures of small degree. LICS 2017: 1-12 - [c93]Christoph Berkholz, Martin Grohe:
Linear Diophantine Equations, Group CSPs, and Graph Isomorphism. SODA 2017: 327-339 - [c92]
- [i45]Martin Grohe, Martin Ritzert:
Learning first-order definable concepts over structures of small degree. CoRR abs/1701.05487 (2017) - [i44]Yijia Chen, Martin Grohe, Bingkai Lin:
The Hardness of Embedding Grids and Walls. CoRR abs/1703.06423 (2017) - [i43]Martin Grohe, Nicole Schweikardt:
First-Order Query Evaluation with Cardinality Conditions. CoRR abs/1707.05945 (2017) - [i42]Martin Grohe, Christof Löding, Martin Ritzert:
Learning MSO-definable hypotheses on string. CoRR abs/1708.08081 (2017) - [i41]Albert Atserias, Martin Grohe, Dániel Marx:
Size bounds and query plans for relational joins. CoRR abs/1711.03860 (2017) - [i40]Martin Grohe, Dániel Marx:
Constraint Solving via Fractional Edge Covers. CoRR abs/1711.04506 (2017) - 2016
- [j55]Martin Grohe, Pascal Schweitzer:
Computing with Tangles. SIAM J. Discrete Math. 30(2): 1213-1247 (2016) - [j54]Michael Elberfeld, Martin Grohe, Till Tantau:
Where First-Order and Monadic Second-Order Logic Coincide. ACM Trans. Comput. Log. 17(4): 25:1-25:18 (2016) - [c91]
- [c90]
- [c89]Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe:
Order Invariance on Decomposable Structures. LICS 2016: 397-406 - [e5]Martin Grohe, Eric Koskinen, Natarajan Shankar:
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016. ACM 2016, ISBN 978-1-4503-4391-6 [contents] - [i39]
- [i38]
- [i37]Martin Grohe:
Tangled up in Blue (A Survey on Connectivity, Decompositions, and Tangles). CoRR abs/1605.06704 (2016) - [i36]Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe:
Order Invariance on Decomposable Structures. CoRR abs/1606.06557 (2016) - [i35]Christoph Berkholz, Martin Grohe:
Linear Diophantine Equations, Group CSPs, and Graph Isomorphism. CoRR abs/1607.04287 (2016) - 2015
- [j53]
- [j52]Martin Grohe, Dániel Marx:
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs. SIAM J. Comput. 44(1): 114-159 (2015) - [c88]Erich Grädel, Martin Grohe:
Is Polynomial Time Choiceless? Fields of Logic and Computation II 2015: 193-209 - [c87]Martin Grohe, Pascal Schweitzer:
Isomorphism Testing for Graphs of Bounded Rank Width. FOCS 2015: 1010-1029 - [c86]Christoph Berkholz, Martin Grohe:
Limitations of Algebraic Approaches to Graph Isomorphism Testing. ICALP (1) 2015: 155-166 - [c85]
- [c84]Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos Stavropoulos:
Colouring and Covering Nowhere Dense Graphs. WG 2015: 325-338 - [i34]Christoph Berkholz, Martin Grohe:
Limitations of Algebraic Approaches to Graph Isomorphism Testing. CoRR abs/1502.05912 (2015) - [i33]
- [i32]Martin Grohe, Pascal Schweitzer:
Isomorphism Testing for Graphs of Bounded Rank Width. CoRR abs/1505.03737 (2015) - [i31]Christoph Berkholz, Paul S. Bonsma, Martin Grohe:
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. CoRR abs/1509.08251 (2015) - [i30]Armin Biere, Vijay Ganesh, Martin Grohe, Jakob Nordström, Ryan Williams:
Theory and Practice of SAT Solving (Dagstuhl Seminar 15171). Dagstuhl Reports 5(4): 98-122 (2015) - 2014
- [j51]
- [j50]Martin Grohe, Dániel Marx:
Constraint Solving via Fractional Edge Covers. ACM Trans. Algorithms 11(1): 4:1-4:20 (2014) - [c83]Kristian Kersting, Martin Mladenov, Roman Garnett, Martin Grohe:
Power Iterated Color Refinement. AAAI 2014: 1904-1910 - [c82]
- [c81]
- [c80]Martin Grohe, Kristian Kersting, Martin Mladenov, Erkal Selman:
Dimension Reduction via Colour Refinement. ESA 2014: 505-516 - [c79]Martin Grohe:
Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk). FSTTCS 2014: 31-31 - [c78]Faried Abu Zaid, Erich Grädel, Martin Grohe, Wied Pakusa:
Choiceless Polynomial Time on Structures with Small Abelian Colour Classes. MFCS (1) 2014: 50-62 - [c77]Martin Grohe, Stephan Kreutzer, Sebastian Siebertz:
Deciding first-order properties of nowhere dense graphs. STOC 2014: 89-98 - [e4]Richard Hull, Martin Grohe:
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS'14, Snowbird, UT, USA, June 22-27, 2014. ACM 2014, ISBN 978-1-4503-2375-8 [contents] - [i29]André Frochaux, Martin Grohe, Nicole Schweikardt:
Monadic Datalog Containment on Trees. CoRR abs/1404.0606 (2014) - 2013
- [j49]Albert Atserias, Martin Grohe, Dániel Marx:
Size Bounds and Query Plans for Relational Joins. SIAM J. Comput. 42(4): 1737-1767 (2013) - [c76]Martin Grohe:
Bounds and Algorithms for Joins via Fractional Edge Covers. In Search of Elegance in the Theory and Practice of Computation 2013: 321-338 - [c75]Christoph Berkholz, Paul S. Bonsma, Martin Grohe:
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. ESA 2013: 145-156 - [c74]Martin Grohe, Stephan Kreutzer, Sebastian Siebertz:
Characterisations of Nowhere Dense Graphs (Invited Talk). FSTTCS 2013: 21-40 - [c73]
- [c72]Martin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed:
A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory. SODA 2013: 414-431 - [i28]Martin Grohe, Kristian Kersting, Martin Mladenov, Erkal Selman:
Dimension Reduction via Colour Refinement. CoRR abs/1307.5697 (2013) - [i27]Martin Grohe, Stephan Kreutzer, Sebastian Siebertz:
Deciding first-order properties of nowhere dense graphs. CoRR abs/1311.3899 (2013) - 2012
- [j48]Martin Grohe, Berit Grußien, André Hernich, Bastian Laubner:
L-Recursion and a new Logic for Logarithmic Space. Logical Methods in Computer Science 9(1) (2012) - [j47]Martin Grohe:
Fixed-point definability and polynomial time on graphs with excluded minors. J. ACM 59(5): 27:1-27:64 (2012) - [j46]Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx:
Enumerating homomorphisms. J. Comput. Syst. Sci. 78(2): 638-650 (2012) - [c71]
- [c70]Michael Elberfeld, Martin Grohe, Till Tantau:
Where First-Order and Monadic Second-Order Logic Coincide. LICS 2012: 265-274 - [c69]
- [c68]Martin Grohe, Dániel Marx:
Structure theorem and isomorphism test for graphs with excluded topological subgraphs. STOC 2012: 173-192 - [i26]
- [i25]Michael Elberfeld, Martin Grohe, Till Tantau:
Where First-Order and Monadic Second-Order Logic Coincide. CoRR abs/1204.6291 (2012) - 2011
- [j45]Martin Grohe:
From polynomial time queries to graph structure theory. Commun. ACM 54(6): 104-112 (2011) - [j44]Kord Eickmeyer, Martin Grohe:
Randomisation and Derandomisation in Descriptive Complexity Theory. Logical Methods in Computer Science 7(3) (2011) - [c67]Martin Grohe, Berit Grußien, André Hernich, Bastian Laubner:
L-Recursion and a new Logic for Logarithmic Space. CSL 2011: 277-291 - [c66]Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan:
Finding topological subgraphs is fixed-parameter tractable. STOC 2011: 479-488 - [i24]Martin Grohe, Marc Thurley:
Counting Homomorphisms and Partition Functions. CoRR abs/1104.0185 (2011) - [i23]Martin Grohe, Dániel Marx:
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs. CoRR abs/1111.1109 (2011) - [i22]Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). Dagstuhl Reports 1(3): 42-66 (2011) - 2010
- [j43]Hubie Chen, Martin Grohe:
Constraint satisfaction with succinctly specified relations. J. Comput. Syst. Sci. 76(8): 847-860 (2010) - [j42]Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley:
A Complexity Dichotomy for Partition Functions with Mixed Signs. SIAM J. Comput. 39(7): 3336-3402 (2010) - [c65]Martin Grohe:
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs. Fields of Logic and Computation 2010: 328-353 - [c64]Kord Eickmeyer, Martin Grohe:
Randomisation and Derandomisation in Descriptive Complexity Theory. CSL 2010: 275-289 - [c63]
- [c62]Martin Grohe:
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors. LICS 2010: 179-188 - [i21]Martin Grohe:
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs. CoRR abs/1001.2572 (2010) - [i20]Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan:
Finding topological subgraphs is fixed-parameter tractable. CoRR abs/1011.1827 (2010) - [i19]Kord Eickmeyer, Martin Grohe:
Randomisation and Derandomisation in Descriptive Complexity Theory. Electronic Colloquium on Computational Complexity (ECCC) 17: 56 (2010)
2000 – 2009
- 2009
- [j41]Martin Grohe, Götz Schwandtner:
The Complexity of Datalog on Linear Orders. Logical Methods in Computer Science 5(1) (2009) - [j40]Martin Grohe, André Hernich, Nicole Schweikardt:
Lower bounds for processing data with few random accesses to external memory. J. ACM 56(3): 12:1-12:58 (2009) - [j39]Martin Grohe, Dániel Marx:
On tree width, bramble size, and expansion. J. Comb. Theory, Ser. B 99(1): 218-228 (2009) - [j38]Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche:
Database Query Processing Using Finite Cursor Machines. Theory Comput. Syst. 44(4): 533-560 (2009) - [c61]
- [c60]Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner:
Logics with Rank Operators. LICS 2009: 113-122 - [c59]Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx:
Enumerating Homomorphisms. STACS 2009: 231-242 - [c58]Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley:
A Complexity Dichotomy for Partition Functions with Mixed Signs. STACS 2009: 493-504 - [e3]Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin:
The Constraint Satisfaction Problem: Complexity and Approximability, 25.10. - 30.10.2009. Dagstuhl Seminar Proceedings 09441, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i18]Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin:
09441 Abstracts Collection - The Constraint Satisfaction Problem: Complexity and Approximability. The Constraint Satisfaction Problem: Complexity and Approximability 2009 - [i17]Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin:
09441 Executive Summary - The Constraint Satisfaction Problem: Complexity and Approximability. The Constraint Satisfaction Problem: Complexity and Approximability 2009 - [i16]Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx:
Enumerating Homomorphisms. CoRR abs/0902.1256 (2009) - 2008
- [j37]Albert Atserias, Anuj Dawar, Martin Grohe:
Preservation under Extensions on Well-Behaved Finite Structures. SIAM J. Comput. 38(4): 1364-1381 (2008) - [c57]
- [c56]Kord Eickmeyer, Martin Grohe, Magdalena Grüber:
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. IEEE Conference on Computational Complexity 2008: 8-18 - [c55]Albert Atserias, Martin Grohe, Dániel Marx:
Size Bounds and Query Plans for Relational Joins. FOCS 2008: 739-748 - [c54]Manuel Bodirsky, Martin Grohe:
Non-dichotomies in Constraint Satisfaction Complexity. ICALP (2) 2008: 184-196 - [c53]
- [c52]
- [c51]
- [c50]
- [e2]Martin Grohe, Rolf Niedermeier:
Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings. Lecture Notes in Computer Science 5018, Springer 2008, ISBN 978-3-540-79722-7 [contents] - [i15]Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley:
A complexity dichotomy for partition functions with mixed signs. CoRR abs/0804.1932 (2008) - 2007
- [j36]Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer:
Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Logic 148(1-3): 1-19 (2007) - [j35]Isolde Adler, Georg Gottlob, Martin Grohe:
Hypertree width and related hypergraph invariants. Eur. J. Comb. 28(8): 2167-2181 (2007) - [j34]Martin Grohe:
The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54(1): 1:1-1:24 (2007) - [j33]Yijia Chen, Jörg Flum, Martin Grohe:
An analysis of the W*-hierarchy. J. Symb. Log. 72(2): 513-534 (2007) - [j32]Yijia Chen, Martin Grohe:
An Isomorphism Between Subexponential and Parameterized Complexity Theory. SIAM J. Comput. 37(4): 1228-1258 (2007) - [j31]Martin Grohe, Christoph Koch, Nicole Schweikardt:
Tight lower bounds for query processing on streaming and external memory data. Theor. Comput. Sci. 380(1-2): 199-217 (2007) - [c49]Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski:
The Ackermann Award 2007. CSL 2007: 589-597 - [c48]Martin Grohe, Magdalena Grüber:
Parameterized Approximability of the Disjoint Cycle Problem. ICALP 2007: 363-374 - [c47]Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt:
Model Theory Makes Formulas Large. ICALP 2007: 913-924 - [c46]Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche:
Database Query Processing Using Finite Cursor Machines. ICDT 2007: 284-298 - [c45]
- [i14]Martin Grohe, André Hernich, Nicole Schweikardt:
Randomized Computations on Large Data Sets: Tight Lower Bounds. CoRR abs/cs/0703081 (2007) - [i13]Martin Grohe:
Logic, Graphs, and Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 14(091) (2007) - [i12]Yijia Chen, Martin Grohe, Magdalena Grüber:
On Parameterized Approximability. Electronic Colloquium on Computational Complexity (ECCC) 14(106) (2007) - 2006
- [b1]Jörg Flum, Martin Grohe:
Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series, Springer 2006, ISBN 978-3-540-29952-3, pp. 1-495 - [j30]Jörg Flum, Martin Grohe, Mark Weyer:
Bounded fixed-parameter tractability and log2n nondeterministic bits. J. Comput. Syst. Sci. 72(1): 34-71 (2006) - [c44]Yijia Chen, Martin Grohe:
An Isomorphism between Subexponential and Parameterized Complexity Theory. IEEE Conference on Computational Complexity 2006: 314-330 - [c43]Martin Grohe, Oleg Verbitsky:
Testing Graph Isomorphism in Parallel by Playing a Game. ICALP (1) 2006: 3-14 - [c42]
- [c41]Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt:
Approximation Schemes for First-Order Definable Optimisation Problems. LICS 2006: 411-420 - [c40]