Grohe is the author of Descriptive Complexity, Canonisation, and Definable Graph Structure Theory (Lecture Notes in Logic 47, Cambridge University Press, 2017).[6] In 2011, Grohe and Johann A. Makowsky published as editors the 558th proceedings of the AMS-ASL special session on Model Theoretic Methods in Finite Combinatorics, which was held on January 5-8 2009 in Washington, DC. With Jörg Flum, he is the co-author of Parameterized Complexity Theory (Springer, 2006).[7]
Grohe, Martin; Makowsky, Johann A. (2011). Model Theoretic Methods in Finite Combinatorics: AMS-ASL Joint Special Session, January 5-8, 2009, Washington, DC. Vol. 558. Washington, DC: American Mathematical Soc. ISBN978-0-8218-4943-9.
Grohe won the Heinz Maier–Leibnitz Prize awarded by the German Research Foundation in 1999,[4] and he was elected as an ACM Fellow in 2017 for "contributions to logic in computer science, database theory, algorithms, and computational complexity".[8] In 2022, he was awarded an ERC Advanced Grant "Symmetry and Similarity".[9]