Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Grohe, Martin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dimension reduction via colour refinement
Martin Grohe
,
Kristian Kersting
,
Martin Mladenov
,
Erkal Selman
Lecture Notes in Computer Science
8737
, 2014, pp. 505-516
Colour refinement: A simple partitioning algorithm with applications from graph isomorphism testing to machine learning
Martin Grohe
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 31-31
Size bounds and query plans for relational joins
Albert Atserias
,
Martin Grohe
,
Dániel Marx
SIAM Journal on Computing
42
(4), 2013, pp. 1737-1767
Tight lower and upper bounds for the complexity of canonical colour refinement
Christoph Berkholz
,
Paul Bonsma
,
Martin Grohe
Lecture Notes in Computer Science
8125
, 2013, pp. 145-156
Characterisations of nowhere dense graphs
Martin Grohe
,
Stephan Kreutzer
,
Sebastian Siebertz
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 21-40
Logical and structural approaches to the graph isomorphism problem
Martin Grohe
Lecture Notes in Computer Science
8087
, 2013, pp. 42-42
Enumerating homomorphisms
Andrei A. Bulatov
,
Víctor Dalmau
,
Martin Grohe
,
Dániel Marx
Journal of Computer and System Sciences
78
(2), 2012, pp. 638-650
Structure theorem and isomorphism test for graphs with excluded topological subgraphs
Martin Grohe
,
Dániel Marx
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 173-192
Fixed-point definability and polynomial time on graphs with excluded minors
Martin Grohe
Journal of the ACM
59
(5), 2012, pp. 27: 1-64
Finding topological subgraphs is fixed-parameter tractable
Martin Grohe
,
Ken-ichi Kawarabayashi
,
Dániel Marx
,
Paul Wollan
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 479-488
Constraint satisfaction with succinctly specified relations
Hubie Chen
,
Martin Grohe
Journal of Computer and System Sciences
76
(8), 2010, pp. 847-860
A complexity dichotomy for partition functions with mixed signs
Leslie Ann Goldberg
,
Martin Grohe
,
Mark Jerrum
,
Marc Thurley
SIAM Journal on Computing
39
(7), 2010, pp. 3336-3402
Enumerating homomorphisms
Andrei A. Bulatov
,
Víctor Dalmau
,
Martin Grohe
,
Dániel Marx
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 231-242
A complexity dichotomy for partition functions with mixed signs
Leslie Ann Goldberg
,
Martin Grohe
,
Mark Jerrum
,
Marc Thurley
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 493-504
Database query processing using finite cursor machines
Martin Grohe
,
Yuri Gurevich
,
Dirk Leinders
,
Nicole Schweikardt
,
Jerzy Tyszkiewicz
,
Jan Van den Bussche
Theory of Computing Systems
44
(4), 2009, pp. 533-560
Lower bounds for processing data with few random accesses to external memory
Martin Grohe
,
André Hernich
,
Nicole Schweikardt
Journal of the ACM
56
(3), 2009, pp. 12: 1-58
On tree width, bramble size, and expansion
Martin Grohe
,
Dániel Marx
Journal of Combinatorial Theory Series B
99
(1), 2009, pp. 218-228
Preservation under extensions on well-behaved finite structures
Albert Atserias
,
Anuj Dawar
,
Martin Grohe
SIAM Journal on Computing
38
(4), 2008, pp. 1364-1381
Non-dichotomies in constraint satisfaction complexity
Manuel Bodirsky
,
Martin Grohe
Lecture Notes in Computer Science
5126
, 2008, pp. 184-196
Algorithmic meta theorems
Martin Grohe
Lecture Notes in Computer Science
5344
, 2008, pp. 30-30
An isomorphism between subexponential and parameterized complexity theory
Yijia Chen
,
Martin Grohe
SIAM Journal on Computing
37
(4), 2007, pp. 1228-1258
Model theory makes formulas large
Anuj Dawar
,
Martin Grohe
,
Stephan Kreutzer
,
Nicole Schweikardt
Lecture Notes in Computer Science
4596
, 2007, pp. 913-924
Parameterized approximability of the disjoint cycle problem
Martin Grohe
,
Magdalena Grüber
Lecture Notes in Computer Science
4596
, 2007, pp. 363-374
Tight lower bounds for query processing on streaming and external memory data
Martin Grohe
,
Christoph Koch
,
Nicole Schweikardt
Theoretical Computer Science
380
(1-2), 2007, pp. 199-217
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Martin Grohe
Journal of the ACM
54
(1), 2007, pp. 1: 1-24
Seiten 1
2
3
>