| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michael Elberfeld, Martin Grohe, Till Tantau |
Where First-Order and Monadic Second-Order Logic Coincide  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Martin Otto |
Pebble Games and Linear Equations |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating homomorphisms. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
Structural and logical approaches to the graph isomorphism problem. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Dániel Marx |
Structure theorem and isomorphism test for graphs with excluded topological subgraphs. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
From polynomial time queries to graph structure theory. |
Commun. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Dániel Marx |
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Marc Thurley |
Counting Homomorphisms and Partition Functions |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kord Eickmeyer, Martin Grohe |
Randomisation and Derandomisation in Descriptive Complexity Theory |
Logical Methods in Computer Science |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). |
Dagstuhl Reports |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Berit Grußien, André Hernich, Bastian Laubner |
L-Recursion and a new Logic for Logarithmic Space. |
CSL |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan |
Finding topological subgraphs is fixed-parameter tractable. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kord Eickmeyer, Martin Grohe |
Randomisation and Derandomisation in Descriptive Complexity Theory. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, Paul Wollan |
Finding topological subgraphs is fixed-parameter tractable |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe |
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hubie Chen, Martin Grohe |
Constraint satisfaction with succinctly specified relations. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley |
A Complexity Dichotomy for Partition Functions with Mixed Signs. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
From polynomial time queries to graph structure theory. |
ICDT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs. |
Fields of Logic and Computation |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors. |
LICS |
2010 |
DBLP DOI BibTeX RDF |
graph minor theory, fixed-point logic, graph canonisation, descriptive complexity |
| 1 | Kord Eickmeyer, Martin Grohe |
Randomisation and Derandomisation in Descriptive Complexity Theory. |
CSL |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Dániel Marx |
On tree width, bramble size, and expansion. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, André Hernich, Nicole Schweikardt |
Lower bounds for processing data with few random accesses to external memory. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
real-time data, XML, Complexity, query processing, data streams, query optimization, semi-structured data |
| 1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating Homomorphisms |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Götz Schwandtner |
The Complexity of Datalog on Linear Orders |
Logical Methods in Computer Science |
2009 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche |
Database Query Processing Using Finite Cursor Machines. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Database, Query processing, Relational algebra, Semijoin |
| 1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating Homomorphisms. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley |
A Complexity Dichotomy for Partition Functions with Mixed Signs. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner |
Logics with Rank Operators. |
LICS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
Fixed-Point Definability and Polynomial Time. |
CSL |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley |
A complexity dichotomy for partition functions with mixed signs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Albert Atserias, Anuj Dawar, Martin Grohe |
Preservation under Extensions on Well-Behaved Finite Structures. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
Algorithmic Meta Theorems. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Isolde Adler, Martin Grohe, Stephan Kreutzer |
Computing excluded minors. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Martin Grohe |
Non-dichotomies in Constraint Satisfaction Complexity. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Rolf Niedermeier (eds.) |
Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings |
IWPEC |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe |
Logic, graphs, and algorithms. |
Logic and Automata |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe |
Definable Tree Decompositions. |
LICS |
2008 |
DBLP DOI BibTeX RDF |
fixed point logic, descriptive complexity, tree decomposition |
| 1 | Martin Grohe |
The Quest for a Logic Capturing PTIME. |
LICS |
2008 |
DBLP DOI BibTeX RDF |
query languages, descriptive complexity, finite model theory |
| 1 | Albert Atserias, Martin Grohe, Dániel Marx |
Size Bounds and Query Plans for Relational Joins. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kord Eickmeyer, Martin Grohe, Magdalena Grüber |
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
derandomisation, parameterized complexity, inapproximability |
| 1 | Yijia Chen, Martin Grohe, Magdalena Grüber |
On Parameterized Approximability. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe |
Logic, Graphs, and Algorithms. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Christoph Koch, Nicole Schweikardt |
Tight lower bounds for query processing on streaming and external memory data. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Isolde Adler, Georg Gottlob, Martin Grohe |
Hypertree width and related hypergraph invariants. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yijia Chen, Jörg Flum, Martin Grohe |
An analysis of the W*-hierarchy. |
J. Symb. Log. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer |
Bounded fixed-parameter tractability and reducibility. |
Ann. Pure Appl. Logic |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
The complexity of homomorphism and constraint satisfaction problems seen from the other side. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
Complexity, constraint satisfaction, conjunctive queries, homomorphisms, parameterized complexity |
| 1 | Martin Grohe, André Hernich, Nicole Schweikardt |
Randomized Computations on Large Data Sets: Tight Lower Bounds |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Yijia Chen, Martin Grohe |
An Isomorphism Between Subexponential and Parameterized Complexity Theory. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Magdalena Grüber |
Parameterized Approximability of the Disjoint Cycle Problem. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
parameterized complexity theory, approximation algorithms, fixed-parameter tractability |
| 1 | Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt |
Model Theory Makes Formulas Large. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche |
Database Query Processing Using Finite Cursor Machines. |
ICDT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anuj Dawar, Martin Grohe, Stephan Kreutzer |
Locally Excluding a Minor. |
LICS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski |
The Ackermann Award 2007. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yijia Chen, Martin Grohe |
An Isomorphism between Subexponential and Parameterized Complexity Theory |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Oleg Verbitsky |
Testing Graph Isomorphism in Parallel by Playing a Game |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jörg Flum, Martin Grohe, Mark Weyer |
Bounded fixed-parameter tractability and log2n nondeterministic bits. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Dániel Marx |
Constraint solving via fractional edge covers. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Oleg Verbitsky |
Testing Graph Isomorphism in Parallel by Playing a Game. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
The Structure of Tractable Constraint Satisfaction Problems. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yijia Chen, Martin Grohe, Magdalena Grüber |
On Parameterized Approximability. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubie Chen, Martin Grohe |
Constraint Satisfaction with Succinctly Specified Relations. |
Complexity of Constraints |
2006 |
DBLP BibTeX RDF |
|
| 1 | Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger (eds.) |
Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005 |
Exact Algorithms and Fixed-Parameter Tractability |
2006 |
DBLP BibTeX RDF |
|
| 1 | Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt |
Approximation Schemes for First-Order Definable Optimisation Problems. |
LICS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, André Hernich, Nicole Schweikardt |
Randomized computations on large data sets: tight lower bounds. |
PODS |
2006 |
DBLP DOI BibTeX RDF |
data streams/real-time data, query processing/query optimization, XML, complexity, semi-structured data |
| 1 | Yijia Chen, Martin Grohe |
An Isomorphism between Subexponential and Parameterized Complexity Theory. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin Grohe |
The complexity of partition functions. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yijia Chen, Jörg Flum, Martin Grohe |
Machine-based methods in parameterized complexity theory. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Flum, Martin Grohe |
Model-checking problems as a basis for parameterized intractability. |
Logical Methods in Computer Science |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Nicole Schweikardt |
The succinctness of first-order logic on linear orders. |
Logical Methods in Computer Science |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Flum, Martin Grohe |
Model-Checking Problems as a Basis for Parameterized Intractability |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Christoph Koch, Nicole Schweikardt |
Tight Lower Bounds for Query Processing on Streaming and External Memory Data |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Nicole Schweikardt |
The succinctness of first-order logic on linear orders |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello |
Hypertree Decompositions: Structure, Algorithms, and Applications. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Anuj Dawar, Martin Grohe |
Preservation Under Extensions on Well-Behaved Finite Structures. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Christoph Koch, Nicole Schweikardt |
Tight Lower Bounds for Query Processing on Streaming and External Memory Data. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Stephan Kreutzer, Nicole Schweikardt |
The Expressive Power of Two-Variable Least Fixed-Point Logics. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger |
05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. |
Exact Algorithms and Fixed-Parameter Tractability |
2005 |
DBLP BibTeX RDF |
|
| 1 | Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger |
05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. |
Exact Algorithms and Fixed-Parameter Tractability |
2005 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, Christoph Koch, Nicole Schweikardt |
The Complexity of Querying External Memory and Streaming Data. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Nicole Schweikardt |
Lower bounds for sorting with few random accesses to external memory. |
PODS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Nicole Schweikardt |
Comparing the succinctness of monadic query languages over finite trees. |
ITA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Stefan Wöhrle |
An existential locality theorem. |
Ann. Pure Appl. Logic |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Frick, Martin Grohe |
The complexity of first-order and monadic second-order logic revisited. |
Ann. Pure Appl. Logic |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Flum, Martin Grohe |
Parametrized Complexity and Subexponential Time (Column: Computational Complexity). |
Bulletin of the EATCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Martin Grohe, György Turán |
Learnability and Definability in Trees and Similar Structures. |
Theory Comput. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
Computing crossing numbers in quadratic time. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Flum, Martin Grohe |
The Parameterized Complexity of Counting Problems. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin Grohe |
The Complexity of Partition Functions. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Flum, Martin Grohe, Mark Weyer |
Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Nicole Schweikardt |
The Succinctness of First-Order Logic on Linear Orders. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Flum, Martin Grohe |
Model-Checking Problems as a Basis for Parameterized Intractability. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Flum, Martin Grohe |
Describing parameterized complexity classes. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
Local Tree-Width, Excluded Minors, and Approximation Algorithms. |
Combinatorica |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C83, 05C85, 68W25 |
| 1 | Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin |
Reachability and connectivity queries in constraint databases. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Buneman, Martin Grohe, Christoph Koch |
Path Queries on Compressed XML. |
VLDB |
2003 |
DBLP BibTeX RDF |
|
| 1 | Markus Frick, Martin Grohe, Christoph Koch |
Query Evaluation on Compressed Trees (Extended Abstract). |
LICS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Nicole Schweikardt |
Comparing the Succinctness of Monadic Query Languages over Finite Trees. |
CSL |
2003 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")