Q5094135 (Q5094135): Difference between revisions

@@ Property / cites work @@
+MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
+Normal rank
@@ Property / cites work @@
+Q4649543
@@ Property / cites work: Q4649543 / rank @@
+Normal rank
@@ Property / cites work @@
+On Acyclic Conjunctive Queries and Constant Delay Enumeration
+Normal rank
@@ Property / cites work @@
+Linear delay enumeration and monadic second-order logic
+Normal rank
@@ Property / cites work @@
+First-order queries on structures of bounded degree are computable with constant delay
+Normal rank
@@ Property / cites work @@
+Model Theory Makes Formulas Large
@@ Property / cites work: Model Theory Makes Formulas Large / rank @@
+Normal rank
@@ Property / cites work @@
+Testing first-order properties for subclasses of sparse graphs
+Normal rank
@@ Property / cites work @@
+The complexity of first-order and monadic second-order logic revisited
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3666827
@@ Property / cites work: Q3666827 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding First-Order Properties of Nowhere Dense Graphs
+Normal rank
@@ Property / cites work @@
+Graph properties checkable in linear time in the number of vertices
+Normal rank
@@ Property / cites work @@
+Q2762493
@@ Property / cites work: Q2762493 / rank @@
+Normal rank
@@ Property / cites work @@
+Domination Problems in Nowhere-Dense Classes
@@ Property / cites work: Domination Problems in Nowhere-Dense Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of monadic second-order queries on trees
+Normal rank
@@ Property / cites work @@
+Algorithmic uses of the Feferman-Vaught theorem
@@ Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank @@
+Normal rank