Welcome to DiSC 2002
SIGMOD 2001
PODS 2001
SIGMOD RECORD 2001
CIKM 2001
CoopIS 2001
DASFAA 2001
DASFAA 2000
DBPL 2001
Data Engineering Bul
DEXA_EC-WEB 2001
DMKD 2001
DPDJ 2001
HYPERTEXT 2001
ICDE 2001
ICDM 2001
ICDT 2001
JCDL 2001
KDD 2001
KDD_EXPLORATIONS 20
KRDB 2001
MDM 2001
MIR 2001
MIS 2001
RIDE 2001
SBBD 2001
SIGIR 2001
SIGIR FORUM 2001
SSDBM 2001
SSTD 2001
TODS 2001
TIME 2001
VLDB 2001
VLDBJ 2001
About DiSC 2002
Editorial Board
Acknowledgements
DiSC 2002 Production
ADVIS
DiSC'02 Feedback
DiSC'02 Sitemap
Search DiSC'02
<<<Author Index>>>
Copyright Notice

Martin Grohe

Papers on DiSC'02


The Parameterized Complexity of Database Queries

Query Evaluation via Tree-Decompositions

Publications


Note: Links lead to the DBLP on the Web.

Martin Grohe

28 Jörg Flum , Martin Grohe: Describing Parameterized Complexity Classes. STACS 2002 : 359-371

27 Martin Grohe, György Turán : Learnability and Definability in Trees and Similar Structures. STACS 2002 : 645-658

26 Martin Grohe, Luc Segoufin : On first-order topological queries. TOCL 3 (3): 336-358 (2002)

25 Martin Grohe, Stefan Wöhrle : An Existential Locality Theorem. CSL 2001 : 99-114

24 Jörg Flum , Markus Frick , Martin Grohe: Query Evaluation via Tree-Decompositions. ICDT 2001 : 22-38

23 Martin Grohe: The Parameterized Complexity of Database Queries. PODS 2001

22 Martin Grohe: Generalized Model-Checking Problems for First-Order Logic. STACS 2001 : 12-26

21 Martin Grohe: Computing crossing numbers in quadratic time. STOC 2001 : 231-236

20 Martin Grohe, Thomas Schwentick , Luc Segoufin : When is the evaluation of conjunctive queries tractable? STOC 2001 : 657-666

19 Markus Frick , Martin Grohe: Deciding first-order properties of locally tree-decomposable structures. JACM 48 (6): 1184-1206 (2001)

18 Jörg Flum , Martin Grohe: Fixed-Parameter Tractability, Definability, and Model-Checking. SIAM J. Comput. 31 (1): 113-145 (2001)

17 Martin Grohe, Luc Segoufin : On First-Order Topological Queries. LICS 2000 : 349-360

16 Michael Benedikt , Martin Grohe, Leonid Libkin , Luc Segoufin : Reachability and Connectivity Queries in Constraint Databases. PODS 2000 : 104-115

15 Martin Grohe: Isomorphism testing for embeddable graphs through definability. STOC 2000 : 63-72

14 Martin Grohe, Thomas Schwentick : Locality of order-invariant first-order formulas. TOCL 1 (1): 112-130 (2000)

13 Martin Grohe: Descriptive and Parameterized Complexity. CSL 1999 : 14-31

12 Markus Frick , Martin Grohe: Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs. ICALP 1999 : 331-340

11 Martin Grohe, Julian Mariño : Definability and Descriptive Complexity on Databases of Bounded Tree-Width. ICDT 1999 : 70-82

10 Martin Grohe: Equivalence in Finite-Variable Logics is Complete for Polynomial Time. Combinatorica 19 (4): 507-532 (1999)

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'02 © 2003 Association for Computing Machinery