Martin Grohe
Martin Grohe
Professor of Computer Science, RWTH Aachen University
Verifierad e-postadress på informatik.rwth-aachen.de - Startsida
Titel
Citeras av
Citeras av
År
Parameterized Complexity Theory
M Grohe, J Flum
2494*2006
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
2862004
The complexity of homomorphism and constraint satisfaction problems seen from the other side
M Grohe
Journal of the ACM (JACM) 54 (1), 1, 2007
2652007
Path queries on compressed XML
P Buneman, M Grohe, C Koch
Proceedings 2003 VLDB Conference, 141-152, 2003
2542003
The parameterized complexity of counting problems
J Flum, M Grohe
SIAM Journal on Computing 33 (4), 892-922, 2004
2332004
Query evaluation via tree-decompositions
J Flum, M Frick, M Grohe
Journal of the ACM (JACM) 49 (6), 716-752, 2002
2302002
Deciding first-order properties of locally tree-decomposable structures
M Frick, M Grohe
Journal of the ACM (JACM) 48 (6), 1184-1206, 2001
2262001
Constraint solving via fractional edge covers
M Grohe, D Marx
ACM Transactions on Algorithms (TALG) 11 (1), 4, 2014
2242014
Deciding first-order properties of nowhere dense graphs
M Grohe, S Kreutzer, S Siebertz
Journal of the ACM (JACM) 64 (3), 1-32, 2017
1852017
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
1782019
The complexity of partition functions
A Bulatov, M Grohe
Theoretical Computer Science 348 (2-3), 148-186, 2005
1692005
Local tree-width, excluded minors, and approximation algorithms
M Grohe
Combinatorica 23 (4), 613-632, 2003
1682003
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
1442001
Locally excluding a minor
A Dawar, M Grohe, S Kreutzer
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 270-279, 2007
1332007
Fixed-parameter tractability, definability, and model-checking
J Flum, M Grohe
SIAM Journal on Computing 31 (1), 113-145, 2001
1252001
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
1172011
Computing crossing numbers in quadratic time
M Grohe
Journal of Computer and System Sciences 68 (2), 285-302, 2004
1152004
Logic, graphs, and algorithms.
M Grohe
Logic and automata 2, 357-422, 2008
1132008
Query evaluation on compressed trees
M Frick, M Grohe, C Koch
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings …, 2003
1122003
Structure theorem and isomorphism test for graphs with excluded topological subgraphs
M Grohe, D Marx
SIAM Journal on Computing 44 (1), 114-159, 2015
1092015
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20