Follow
Martin Grohe
Martin Grohe
Professor of Computer Science, RWTH Aachen University
Verified email at informatik.rwth-aachen.de - Homepage
Title
Cited by
Cited by
Year
Parameterized Complexity Theory, 1st edn. Texts in Theoretical Computer Science. An EATCS Series1 edition
J Flum, M Grohe
Springer (March 2006), 2006
2811*2006
Weisfeiler and leman go neural: Higher-order graph neural networks
C Morris, M Ritzert, M Fey, WL Hamilton, JE Lenssen, G Rattan, M Grohe
Proceedings of the AAAI Conference on Artificial Intelligence 33, 4602-4609, 2019
7942019
The complexity of homomorphism and constraint satisfaction problems seen from the other side
M Grohe
Journal of the ACM (JACM) 54 (1), 1, 2007
3232007
The complexity of first-order and monadic second-order logic revisited
M Frick, M Grohe
Annals of pure and applied logic 130 (1-3), 3-31, 2004
3182004
The parameterized complexity of counting problems
J Flum, M Grohe
SIAM Journal on Computing 33 (4), 892-922, 2004
2902004
Constraint solving via fractional edge covers
M Grohe, D Marx
ACM Transactions on Algorithms (TALG) 11 (1), 4, 2014
2672014
Path queries on compressed XML
P Buneman, M Grohe, C Koch
Proceedings 2003 VLDB Conference, 141-152, 2003
2672003
Query evaluation via tree-decompositions
J Flum, M Frick, M Grohe
Journal of the ACM (JACM) 49 (6), 716-752, 2002
2492002
Deciding first-order properties of nowhere dense graphs
M Grohe, S Kreutzer, S Siebertz
Journal of the ACM (JACM) 64 (3), 1-32, 2017
2462017
Deciding first-order properties of locally tree-decomposable structures
M Frick, M Grohe
Journal of the ACM (JACM) 48 (6), 1184-1206, 2001
2422001
The complexity of partition functions
A Bulatov, M Grohe
Theoretical Computer Science 348 (2-3), 148-186, 2005
1852005
Local tree-width, excluded minors, and approximation algorithms
M Grohe
arXiv preprint math/0001128, 2000
1762000
When is the evaluation of conjunctive queries tractable?
M Grohe, T Schwentick, L Segoufin
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
1682001
Size bounds and query plans for relational joins
A Atserias, M Grohe, D Marx
Foundations of Computer Science, 2008. FOCS'08. IEEE 49th Annual IEEE …, 2008
1502008
Locally excluding a minor
A Dawar, M Grohe, S Kreutzer
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 270-279, 2007
1472007
Finding topological subgraphs is fixed-parameter tractable
M Grohe, K Kawarabayashi, D Marx, P Wollan
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
1452011
Fixed-parameter tractability, definability, and model-checking
J Flum, M Grohe
SIAM Journal on Computing 31 (1), 113-145, 2001
1432001
Size bounds and query plans for relational joins
A Atserias, M Grohe, D Marx
SIAM Journal on Computing 42 (4), 1737-1767, 2013
1332013
Logic, graphs, and algorithms.
M Grohe
Logic and automata 2, 357-422, 2008
1322008
Descriptive complexity, canonisation, and definable graph structure theory
M Grohe
Cambridge University Press, 2017
1312017
The system can't perform the operation now. Try again later.
Articles 1–20