| |
 |      |
                                |
Note: Links lead to the DBLP on the Web. Martin Grohe 17 Jörg Flum , Markus Frick , Martin Grohe: Query Evaluation via Tree-Decompositions. ICDT 2001 : 22-38 16 Martin Grohe, Luc Segoufin : On First-Order Topological Queries. LICS 2000 : 349-360 15 Michael Benedikt , Martin Grohe, Leonid Libkin , Luc Segoufin : Reachability and Connectivity Queries in Constraint Databases. PODS 2000 : 104-115 14 Martin Grohe: Isomorphism testing for embeddable graphs through definability. STOC 2000 : 63-72 13 Martin Grohe, Thomas Schwentick : Locality of order-invariant first-order formulas. TOCL 1 (1): 112-130 (2000) 12 Martin Grohe: Descriptive and Parameterized Complexity. CSL 1999 : 14-31 11 Markus Frick , Martin Grohe: Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs. ICALP 1999 : 331-340 10 Martin Grohe, Julian Mariño : Definability and Descriptive Complexity on Databases of Bounded Tree-Width. ICDT 1999 : 70-82 9 Martin Grohe: Fixed-Point Logics on Planar Graphs. LICS 1998 : 6-15 8 Martin Grohe, Thomas Schwentick : Locality of Order-Invariant First-Order Formulas. MFCS 1998 : 437-445 7 Martin Grohe: Canonization for L k -equivalence is Hard. CSL 1997 : 220-238 6 Martin Grohe: Large Finite Structures with Few L k -Types. LICS 1997 : 216-227 5 Martin Grohe: Existential Least Fixed-Point Logic and its Relatives. Journal of Logic and Computation 7 (2): 205-228 (1997) 4 Martin Grohe: Equivalence in Finite-Variable Logics is Complete for Polynomial Time. FOCS 1996 : 264-273 3 Martin Grohe: Arity Hierarchies. Annals of Pure and Applied Logic 82 (2): 103-163 (1996) 2 Martin Grohe: Complete Problems for Fixed-Point Logics. The Journal of Symbolic Logic 60 (2): 517-527 (1995) 1 Martin Grohe: Bounded-Arity Hierarchies in Fixed-Point Logics. CSL 1993 : 150-164 DiSC'01 Copyright ©2002 ACM Inc. |
