- Describing Parameterized Complexity Classes Jorg Flum Martin Grohe y
- Martin Grohe Descriptive Complexity,
- Local tree-width, excluded minors, and approximation algorithms Martin Grohe
- From Polynomial Time Queries to Graph Structure eory Martin Grohe
- Approximation Schemes for First-Order Definable Optimisation Problems Anuj Dawar Martin Grohe Stephan Kreutzer Nicole Schweikardt
- Decompositions of Almost Embeddable Graphs . e Combination Lemma
- Quasi--Connected Components Recall that a k-hinge, or hinge of order k, of a graph G is a k-separator S of G satisfying the following
- Fixed-Point Definability and Polynomial Time Martin Grohe
- LARGE FINITE STRUCTURES WITH FEW L k TYPES MARTIN GROHE
- Existential Least Fixed{Point Logic and its Martin Grohe
- EQUIVALENCE IN FINITEVARIABLE LOGICS IS COMPLETE FOR POLYNOMIAL TIME
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The Structure of Fixed--Point Logics
- Complete Problems for FixedPoint Logics Martin Grohe
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
- Almost Embeddable Graphs . Arrangements in a Surface
- Parameterized complexity theory provides a framework for a refined analysis of hard algorithmic problems.
- Almost Planar Graphs . Relaxations of Planarity
- Parameterized Approximability of the Disjoint Cycle Problem
- The Parameterized Complexity of Database Queries Martin Grohe
- On First-Order Topological Queries Martin Grohe
- Logics with Rank Operators Anuj Dawar Martin Grohe Bjarki Holm Bastian Laubner
- Preservation under Extensions on Well-Behaved Finite Structures
- Size bounds and query plans for relational joins Albert Atserias
- Non-dichotomies in Constraint Satisfaction Complexity
- The Quest for a Logic Capturing PTIME Martin Grohe
- Logic, Graphs, and Algorithms Martin Grohe
- Bounded Fixed-Parameter Tractability and Reducibility Rod Downey Jorg Flum Martin Grohe Mark Weyer
- The structure of tractable constraint satisfaction Martin Grohe
- f(k) nO(1) f n
- The parameterized complexity of counting problems Martin Grohe
- An Existential Locality Theorem Martin Grohe and Stefan Wohrle
- Comparing the succinctness of monadic query languages over finite trees
- Background from Graph eory and Logic . Preliminaries
- Descriptive Complexity . e Immerman-Vardi eorem
- Graphs of Bounded Tree Width . Decompositions of Graphs of Bounded Tree Width
- -Connected Components In this short chapter, we shall prove that the decomposition of a graph into its -connected components
- K -free graphs As a rst application of the Q C Li ing Lemma . . , in this chapter we prove that the class X(K )
- Completions of Pre-Decompositions . Pre-Decompositions and Completions
- Almost Planar Completions . From Almost Planar to Ordered Completions
- Graphs with Excluded Minors In this chapter we prove the main theorem of this book: Every class of graphs with excluded minors
- 1 Fixed-Parameter Tractability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
- Fixed-Parameter Tractability In this chapter, we introduce parameterized problems and the notion of
- Finding Topological Subgraphs is Fixed-Parameter Martin Grohe
- SIAM J. COMPUT. c 2010 Society for Industrial and Applied Mathematics Vol. 39, No. 7, pp. 33363402
- Constraint Satisfaction with Succinctly Specified Relations Hubie Chena
- Definable Tree Decompositions Martin Grohe
- Approximation of Natural W[P]-complete Minimisation Problems is Hard Kord Eickmeyer, Martin Grohe, Magdalena Gruber
- An analysis of the W Yijia Chen
- On Parameterized Approximability Yijia Chen Martin Grohe Magdalena Gruber
- Constraint Solving via Fractional Edge Covers Martin Grohe
- Bounded fixed-parameter tractability and log2 n nondeterministic
- The complexity of first-order and monadic second-order logic revisited Markus Frick Martin Grohe
- Learnability and Definability in Trees and Similar Structures M. Grohe Gy. Turan
- Some remarks on finite Lowenheim-Skolem theorems Martin Grohe
- A Double Arity Hierarchy Theorem for Transitive Closure Logic
- Query Evaluation on Compressed Trees Markus Frick
- Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
- Machine-based Methods in Parameterized Complexity Theory Yijia Chen Jorg Flum Martin Grohe
- Isomorphism testing for embeddable graphs through definability
- When is the evaluation of conjunctive queries tractable ? Martin Grohe
- Parameterized Complexity for the Database Theorist Martin Grohe
- Definability and descriptive complexity on databases of bounded treewidth
- Generalized modelchecking problems for firstorder logic
- Descriptive and Parameterized Complexity Martin Grohe
- Martin Grohe The complexity of finite variable theories
- Canonization for L k equivalence is hard Martin Grohe
- From Polynomial Time Queries to Graph Structure Theory
- Query evaluation via tree-decompositions Jorg Flum Markus Frick Martin Grohe
- Computing Crossing Numbers in Quadratic Time Martin Grohe
- Treelike Decompositions . Tree Decompositions
- Fixed-Point Definability and Polynomial Time Martin Grohe
- Ordered Treelike Decompositions . De nitions and Basic Results
- FINITE VARIABLE LOGICS IN DESCRIPTIVE COMPLEXITY THEORY MARTIN GROHE
- Fixed-Parameter Tractability, Definability, and Model Checking Jorg Flum Martin Grohe
- Chapter VIII Hinges and K5-free Graphs
- Reachability and Connectivity Queries in Constraint Databases #
- Path Queries on Compressed XML Peter Buneman Martin Grohe Christoph Koch
- Randomisation and Derandomisation in Descriptive Complexity Theory
- On fixedpoint logic with counting Jorg Flum and Martin Grohe
- Deciding firstorder properties of locally treedecomposable structures Markus Frick # Martin Grohe +
- Boundedarity hierarchies in fixedpoint logics Martin Grohe
- e Q C Completion Lemma Our goal in this chapter is to prove a generalisation of the Q C Li ing eorem that lets us de ne
- Hypertree Decompositions: Structure, Algorithms, and Applications
- Fixedpoint logics on planar graphs Martin Grohe
- Locality of Order-Invariant First-Order Formulas Martin Grohe
- Graphs Embeddable into a Surface . Surfaces and Embeddings of Graphs
- Contemporary Mathematics Methods for Algorithmic Meta Theorems
- L-Recursion and a new Logic for Logarithmic Martin Grohe, Berit Gruien, Andr Hernich, and Bastian Laubner
- De nable Decompositions e main advantage treelike decompositions have over tree decomositions is that they can be made
- Introduction In this book, we develop a de nable structure theory for nite graphs. e goal is to decompose graphs
- Martin Grohe Descriptive Complexity,
