دنبال کردن
Martin Grohe
Martin Grohe
Professor of Computer Science, RWTH Aachen University
ایمیل تأیید شده در informatik.rwth-aachen.de - صفحهٔ اصلی
عنوان
نقل شده توسط
نقل شده توسط
سال
Parameterized Complexity Theory, 1st edn. Texts in Theoretical Computer Science. An EATCS Series1 edition‏
J Flum, M Grohe‏
Springer (March 2006), 2006‏
3054*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‏
20162019
Size bounds and query plans for relational joins‏
A Atserias, M Grohe, D Marx‏
SIAM Journal on Computing 42 (4), 1737-1767, 2013‏
3992013
The complexity of homomorphism and constraint satisfaction problems seen from the other side‏
M Grohe‏
Journal of the ACM (JACM) 54 (1), 1, 2007‏
3572007
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‏
3402004
The parameterized complexity of counting problems‏
J Flum, M Grohe‏
SIAM Journal on Computing 33 (4), 892-922, 2004‏
3382004
Constraint solving via fractional edge covers‏
M Grohe, D Marx‏
ACM Transactions on Algorithms (TALG) 11 (1), 4, 2014‏
3252014
Deciding first-order properties of nowhere dense graphs‏
M Grohe, S Kreutzer, S Siebertz‏
Journal of the ACM (JACM) 64 (3), 1-32, 2017‏
3082017
Path queries on compressed XML‏
P Buneman, M Grohe, C Koch‏
Proceedings 2003 VLDB Conference, 141-152, 2003‏
2882003
The surprising power of graph neural networks with random node initialization‏
R Abboud, II Ceylan, M Grohe, T Lukasiewicz‏
arXiv preprint arXiv:2010.01179, 2020‏
2812020
Deciding first-order properties of locally tree-decomposable structures‏
M Frick, M Grohe‏
Journal of the ACM (JACM) 48 (6), 1184-1206, 2001‏
2772001
Query evaluation via tree-decompositions‏
J Flum, M Frick, M Grohe‏
Journal of the ACM (JACM) 49 (6), 716-752, 2002‏
2662002
Descriptive complexity, canonisation, and definable graph structure theory‏
M Grohe‏
Cambridge University Press, 2017‏
2292017
word2vec, node2vec, graph2vec, x2vec: Towards a theory of vector embeddings of structured data‏
M Grohe‏
proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI symposium on principles of …, 2020‏
2162020
The complexity of partition functions‏
A Bulatov, M Grohe‏
Theoretical Computer Science 348 (2-3), 148-186, 2005‏
2082005
Local tree-width, excluded minors, and approximation algorithms‏
M Grohe‏
arXiv preprint math/0001128, 2000‏
2002000
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‏
1862001
Hypertree width and related hypergraph invariants‏
I Adler, G Gottlob, M Grohe‏
European Journal of Combinatorics 28 (8), 2167-2181, 2007‏
1702007
Fixed-parameter tractability, definability, and model-checking‏
J Flum, M Grohe‏
SIAM Journal on Computing 31 (1), 113-145, 2001‏
1682001
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‏
1672011
سیستم در حال حاضر قادر به انجام عملکرد نیست. بعداً دوباره امتحان کنید.
مقاله‌ها 1–20