30 results on '"Grohe, Martin"'
Search Results
2. Generative Datalog with Continuous Distributions.
3. Independence in Infinite Probabilistic Databases.
4. Isomorphism, Canonization, and Definability for Graphs of Bounded Rank Width.
5. The Graph Isomorphism Problem.
6. Canonisation and Definability for Graphs of Bounded Rank Width.
7. Deciding First-Order Properties of Nowhere Dense Graphs.
8. Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors.
9. An Improved Isomorphism Test for Bounded-tree-width Graphs.
10. Lower Bounds for Processing Data with Few Random Accesses to External Memory.
11. The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side.
12. Query Evaluation via Tree-Decompositions.
13. Deciding First-Order Properties of Locally Tree-Decomposable Structures.
14. From Polynomial Time Queries to Graph Structure Theory.
15. Order Invariance on Decomposable Structures.
16. Where First-Order and Monadic Second-Order Logic Coincide.
17. Deciding first-order properties of nowhere dense graphs.
18. Where First-Order and Monadic Second-Order Logic Coincide.
19. Structure theorem and isomorphism test for graphs with excluded topological subgraphs.
20. Finding topological subgraphs is fixed-parameter tractable.
21. Computing excluded minors.
22. Constraint solving via fractional edge covers.
23. Lower bounds for sorting with few random accesses to external memory.
24. Computing crossing numbers in quadratic time.
25. The parameterized complexity of database queries.
26. Isomorphism testing for embeddable graphs through definability.
27. Reachability and connectivity queries in constraint databases.
28. On first-order topological queries.
29. Locality of order-invariant first-order formulas.
30. From polynomial time queries to graph structure theory.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.