Search

Your search keyword '"Grohe, Martin"' showing total 80 results

Search Constraints

Start Over You searched for: Author "Grohe, Martin" Remove constraint Author: "Grohe, Martin" Publication Type eBooks Remove constraint Publication Type: eBooks
80 results on '"Grohe, Martin"'

Search Results

1. The Effects of Randomness on the Stability of Node Embeddings

2. The Hardness of Embedding Grids and Walls

3. Colouring and Covering Nowhere Dense Graphs

4. Tangles and Connectivity in Graphs

6. Limitations of Algebraic Approaches to Graph Isomorphism Testing

7. Is Polynomial Time Choiceless?

9. Dimension Reduction via Colour Refinement

10. Algorithmic Meta Theorems for Sparse Graph Classes

11. Bounds and Algorithms for Joins via Fractional Edge Covers

12. Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

13. Randomisation and Derandomisation in Descriptive Complexity Theory

14. Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs

15. Fixed-Point Definability and Polynomial Time

16. Non-dichotomies in Constraint Satisfaction Complexity

17. Model Theory Makes Formulas Large

18. Parameterized Approximability of the Disjoint Cycle Problem

19. The Ackermann Award 2007

20. Database Query Processing Using Finite Cursor Machines

21. On Parameterized Approximability

22. The Structure of Tractable Constraint Satisfaction Problems

23. Testing Graph Isomorphism in Parallel by Playing a Game

24. The Complexity of Querying External Memory and Streaming Data

25. The Expressive Power of Two-Variable Least Fixed-Point Logics

26. Preservation Under Extensions on Well-Behaved Finite Structures

27. Tight Lower Bounds for Query Processing on Streaming and External Memory Data

28. Hypertree Decompositions: Structure, Algorithms, and Applications

29. Bounded Fixed-Parameter Tractability and log2 n Nondeterministic Bits

30. The Complexity of Partition Functions

43. Logical and Structural Approaches to the Graph Isomorphism Problem

44. Algorithmic Meta Theorems

45. New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem

46. Capacitated Domination and Covering: A Parameterized Perspective

47. An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees

48. An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs

49. Fixed Structure Complexity

50. Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem

Catalog

Books, media, physical & digital resources