The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Grohe: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Markus Frick, Martin Grohe
    Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs. [Citation Graph (1, 0)][DBLP]
    ICALP, 1999, pp:331-340 [Conf]
  2. Martin Grohe
    Large Finite Structures with Few Lk-Types. [Citation Graph (1, 0)][DBLP]
    LICS, 1997, pp:216-227 [Conf]
  3. Martin Grohe
    Fixed-Point Logics on Planar Graphs. [Citation Graph (1, 0)][DBLP]
    LICS, 1998, pp:6-15 [Conf]
  4. Martin Grohe, Luc Segoufin
    On First-Order Topological Queries. [Citation Graph (1, 0)][DBLP]
    LICS, 2000, pp:349-360 [Conf]
  5. Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin
    Reachability and Connectivity Queries in Constraint Databases. [Citation Graph (1, 18)][DBLP]
    PODS, 2000, pp:104-115 [Conf]
  6. Martin Grohe, Thomas Schwentick
    Locality of order-invariant first-order formulas. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Comput. Log., 2000, v:1, n:1, pp:112-130 [Journal]
  7. Yijia Chen, Jörg Flum, Martin Grohe
    Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:13-29 [Conf]
  8. Yijia Chen, Martin Grohe
    An Isomorphism between Subexponential and Parameterized Complexity Theory. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:314-330 [Conf]
  9. Martin Grohe
    Bounded-Arity Hierarchies in Fixed-Point Logics. [Citation Graph (0, 0)][DBLP]
    CSL, 1993, pp:150-164 [Conf]
  10. Martin Grohe
    Canonization for Lk-equivalence is Hard. [Citation Graph (0, 0)][DBLP]
    CSL, 1997, pp:220-238 [Conf]
  11. Martin Grohe
    Descriptive and Parameterized Complexity. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:14-31 [Conf]
  12. Martin Grohe, Nicole Schweikardt
    Comparing the Succinctness of Monadic Query Languages over Finite Trees. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:226-240 [Conf]
  13. Martin Grohe, Stefan Wöhrle
    An Existential Locality Theorem. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:99-114 [Conf]
  14. Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
    05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. [Citation Graph (0, 0)][DBLP]
    Exact Algorithms and Fixed-Parameter Tractability, 2005, pp:- [Conf]
  15. Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
    05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. [Citation Graph (0, 0)][DBLP]
    Exact Algorithms and Fixed-Parameter Tractability, 2005, pp:- [Conf]
  16. Martin Grohe, Christoph Koch, Nicole Schweikardt
    The Complexity of Querying External Memory and Streaming Data. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:1-16 [Conf]
  17. Jörg Flum, Martin Grohe
    The Parameterized Complexity of Counting Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:538-0 [Conf]
  18. Martin Grohe
    The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:552-561 [Conf]
  19. Martin Grohe
    Equivalence in Finite-Variable Logics is Complete for Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:264-273 [Conf]
  20. Albert Atserias, Anuj Dawar, Martin Grohe
    Preservation Under Extensions on Well-Behaved Finite Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1437-1449 [Conf]
  21. Andrei A. Bulatov, Martin Grohe
    The Complexity of Partition Functions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:294-306 [Conf]
  22. Jörg Flum, Martin Grohe, Mark Weyer
    Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:555-567 [Conf]
  23. Martin Grohe, Christoph Koch, Nicole Schweikardt
    Tight Lower Bounds for Query Processing on Streaming and External Memory Data. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1076-1088 [Conf]
  24. Martin Grohe, Oleg Verbitsky
    Testing Graph Isomorphism in Parallel by Playing a Game. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:3-14 [Conf]
  25. Martin Grohe, Julian Mariño
    Definability and Descriptive Complexity on Databases of Bounded Tree-Width. [Citation Graph (0, 11)][DBLP]
    ICDT, 1999, pp:70-82 [Conf]
  26. Jörg Flum, Markus Frick, Martin Grohe
    Query Evaluation via Tree-Decompositions. [Citation Graph (0, 14)][DBLP]
    ICDT, 2001, pp:22-38 [Conf]
  27. Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche
    Database Query Processing Using Finite Cursor Machines. [Citation Graph (0, 0)][DBLP]
    ICDT, 2007, pp:284-298 [Conf]
  28. Yijia Chen, Martin Grohe, Magdalena Grüber
    On Parameterized Approximability. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:109-120 [Conf]
  29. Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
    Approximation Schemes for First-Order Definable Optimisation Problems. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:411-420 [Conf]
  30. Jörg Flum, Martin Grohe
    Model-Checking Problems as a Basis for Parameterized Intractability. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:388-397 [Conf]
  31. Markus Frick, Martin Grohe
    The Complexity of First-Order and Monadic Second-Order Logic Revisited. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:215-224 [Conf]
  32. Markus Frick, Martin Grohe, Christoph Koch
    Query Evaluation on Compressed Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:188-0 [Conf]
  33. Martin Grohe, Nicole Schweikardt
    The Succinctness of First-Order Logic on Linear Orders. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:438-447 [Conf]
  34. Martin Grohe
    The Structure of Tractable Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:58-72 [Conf]
  35. Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
    The Expressive Power of Two-Variable Least Fixed-Point Logics. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:422-434 [Conf]
  36. Martin Grohe, Thomas Schwentick
    Locality of Order-Invariant First-Order Formulas. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:437-445 [Conf]
  37. Martin Grohe
    The Parameterized Complexity of Database Queries. [Citation Graph (0, 0)][DBLP]
    PODS, 2001, pp:82-92 [Conf]
  38. Martin Grohe, André Hernich, Nicole Schweikardt
    Randomized computations on large data sets: tight lower bounds. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:243-252 [Conf]
  39. Martin Grohe, Nicole Schweikardt
    Lower bounds for sorting with few random accesses to external memory. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:238-249 [Conf]
  40. Martin Grohe, Dániel Marx
    Constraint solving via fractional edge covers. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:289-298 [Conf]
  41. Jörg Flum, Martin Grohe
    Describing Parameterized Complexity Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:359-371 [Conf]
  42. Martin Grohe
    Generalized Model-Checking Problems for First-Order Logic. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:12-26 [Conf]
  43. Martin Grohe, György Turán
    Learnability and Definability in Trees and Similar Structures. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:645-658 [Conf]
  44. Martin Grohe
    Isomorphism testing for embeddable graphs through definability. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:63-72 [Conf]
  45. Martin Grohe
    Computing crossing numbers in quadratic time. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:231-236 [Conf]
  46. Martin Grohe, Thomas Schwentick, Luc Segoufin
    When is the evaluation of conjunctive queries tractable? [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:657-666 [Conf]
  47. Peter Buneman, Martin Grohe, Christoph Koch
    Path Queries on Compressed XML. [Citation Graph (0, 0)][DBLP]
    VLDB, 2003, pp:141-152 [Conf]
  48. Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello
    Hypertree Decompositions: Structure, Algorithms, and Applications. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:1-15 [Conf]
  49. Markus Frick, Martin Grohe
    The complexity of first-order and monadic second-order logic revisited. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2004, v:130, n:1-3, pp:3-31 [Journal]
  50. Martin Grohe
    Arity Hierarchies. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:82, n:2, pp:103-163 [Journal]
  51. Martin Grohe, Stefan Wöhrle
    An existential locality theorem. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2004, v:129, n:1-3, pp:131-148 [Journal]
  52. Martin Grohe
    Finite variable logics in descriptive complexity theory. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1998, v:4, n:4, pp:345-398 [Journal]
  53. Martin Grohe
    Local Tree-Width, Excluded Minors, and Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:4, pp:613-632 [Journal]
  54. Martin Grohe
    Equivalence in Finite-Variable Logics is Complete for Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:4, pp:507-532 [Journal]
  55. Jörg Flum, Martin Grohe
    Fixed-parameter tractability, definability, and model checking [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  56. Markus Frick, Martin Grohe
    Deciding first-order properties of locally tree-decomposable structures [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  57. Martin Grohe
    Computing Crossing Numbers in Quadratic Time [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  58. Jörg Flum, Martin Grohe
    Parametrized Complexity and Subexponential Time (Column: Computational Complexity). [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2004, v:84, n:, pp:71-100 [Journal]
  59. Yijia Chen, Martin Grohe
    An Isomorphism between Subexponential and Parameterized Complexity Theory [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:011, pp:- [Journal]
  60. Jörg Flum, Martin Grohe
    Describing parameterized complexity classes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:187, n:2, pp:291-319 [Journal]
  61. Martin Grohe
    Large Finite Structures with Few Lk-Types. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:179, n:2, pp:250-278 [Journal]
  62. Jörg Flum, Markus Frick, Martin Grohe
    Query evaluation via tree-decompositions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:6, pp:716-752 [Journal]
  63. Markus Frick, Martin Grohe
    Deciding first-order properties of locally tree-decomposable structures. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:6, pp:1184-1206 [Journal]
  64. Martin Grohe
    The complexity of homomorphism and constraint satisfaction problems seen from the other side. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:1, pp:- [Journal]
  65. Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin
    Reachability and connectivity queries in constraint databases. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:1, pp:169-206 [Journal]
  66. Jörg Flum, Martin Grohe, Mark Weyer
    Bounded fixed-parameter tractability and log2n nondeterministic bits. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:1, pp:34-71 [Journal]
  67. Martin Grohe
    Computing crossing numbers in quadratic time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:285-302 [Journal]
  68. Jörg Flum, Martin Grohe
    On Fixed-Point Logic With Counting. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:2, pp:777-787 [Journal]
  69. Martin Grohe
    Complete Problems for Fixed-Point Logics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:2, pp:517-527 [Journal]
  70. Jörg Flum, Martin Grohe
    Model-checking problems as a basis for parameterized intractability. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2005, v:1, n:1, pp:- [Journal]
  71. Martin Grohe, Nicole Schweikardt
    The succinctness of first-order logic on linear orders. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2005, v:1, n:1, pp:- [Journal]
  72. Martin Grohe
    Existential Least Fixed-Point Logic and its Relatives. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1997, v:7, n:2, pp:205-228 [Journal]
  73. Martin Grohe
    Some Remarks on Finite Löwenheim-Skolem Theorems. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:569-571 [Journal]
  74. Martin Grohe, György Turán
    Learnability and Definability in Trees and Similar Structures. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:1, pp:193-220 [Journal]
  75. Jörg Flum, Martin Grohe
    Fixed-Parameter Tractability, Definability, and Model-Checking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:113-145 [Journal]
  76. Jörg Flum, Martin Grohe
    The Parameterized Complexity of Counting Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:4, pp:892-922 [Journal]
  77. Martin Grohe
    Parameterized Complexity for the Database Theorist. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2002, v:31, n:4, pp:86-96 [Journal]
  78. Andrei A. Bulatov, Martin Grohe
    The complexity of partition functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:148-186 [Journal]
  79. Yijia Chen, Jörg Flum, Martin Grohe
    Machine-based methods in parameterized complexity theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:2-3, pp:167-199 [Journal]
  80. Martin Grohe, Luc Segoufin
    On first-order topological queries. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2002, v:3, n:3, pp:336-358 [Journal]
  81. Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski
    The Ackermann Award 2007. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:589-597 [Conf]
  82. Martin Grohe, Magdalena Grüber
    Parameterized Approximability of the Disjoint Cycle Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:363-374 [Conf]
  83. Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
    Model Theory Makes Formulas Large. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:913-924 [Conf]
  84. Anuj Dawar, Martin Grohe, Stephan Kreutzer
    Locally Excluding a Minor. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:270-279 [Conf]
  85. Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer
    Bounded fixed-parameter tractability and reducibility. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2007, v:148, n:1-3, pp:1-19 [Journal]
  86. Martin Grohe, André Hernich, Nicole Schweikardt
    Randomized Computations on Large Data Sets: Tight Lower Bounds [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  87. Martin Grohe, Oleg Verbitsky
    Testing Graph Isomorphism in Parallel by Playing a Game [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  88. Jörg Flum, Martin Grohe
    Model-Checking Problems as a Basis for Parameterized Intractability [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  89. Martin Grohe, Nicole Schweikardt
    The succinctness of first-order logic on linear orders [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  90. Martin Grohe, Christoph Koch, Nicole Schweikardt
    Tight lower bounds for query processing on streaming and external memory data. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:199-217 [Journal]

  91. Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs. [Citation Graph (, )][DBLP]


  92. Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. [Citation Graph (, )][DBLP]


  93. Fixed-Point Definability and Polynomial Time. [Citation Graph (, )][DBLP]


  94. Randomisation and Derandomisation in Descriptive Complexity Theory. [Citation Graph (, )][DBLP]


  95. Constraint Satisfaction with Succinctly Specified Relations. [Citation Graph (, )][DBLP]


  96. Size Bounds and Query Plans for Relational Joins. [Citation Graph (, )][DBLP]


  97. Non-dichotomies in Constraint Satisfaction Complexity. [Citation Graph (, )][DBLP]


  98. From polynomial time queries to graph structure theory. [Citation Graph (, )][DBLP]


  99. Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors. [Citation Graph (, )][DBLP]


  100. The Quest for a Logic Capturing PTIME. [Citation Graph (, )][DBLP]


  101. Definable Tree Decompositions. [Citation Graph (, )][DBLP]


  102. Logics with Rank Operators. [Citation Graph (, )][DBLP]


  103. Computing excluded minors. [Citation Graph (, )][DBLP]


  104. Enumerating Homomorphisms. [Citation Graph (, )][DBLP]


  105. A Complexity Dichotomy for Partition Functions with Mixed Signs. [Citation Graph (, )][DBLP]


  106. Algorithmic Meta Theorems. [Citation Graph (, )][DBLP]


  107. Tight Lower Bounds for Query Processing on Streaming and External Memory Data [Citation Graph (, )][DBLP]


  108. A complexity dichotomy for partition functions with mixed signs [Citation Graph (, )][DBLP]


  109. The Complexity of Datalog on Linear Orders [Citation Graph (, )][DBLP]


  110. Enumerating Homomorphisms [Citation Graph (, )][DBLP]


  111. Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs [Citation Graph (, )][DBLP]


  112. Logic, Graphs, and Algorithms. [Citation Graph (, )][DBLP]


  113. On Parameterized Approximability. [Citation Graph (, )][DBLP]


  114. Hypertree width and related hypergraph invariants. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.033secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002