Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933): Difference between revisions

← Older edit

@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 7147441
@@ Property / zbMATH Open document ID @@
+.68125
@@ Property / zbMATH Open document ID: 1427.68125 / rank @@
+Normal rank
@@ Property / publication date @@
+January 2020Timestamp +2020-01-03T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2020-01-03T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 3 January 2020 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7147441
@@ Property / zbMATH DE Number: 7147441 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00544
@@ Property / arXiv ID: 1703.00544 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+MSO extensions
@@ Property / zbMATH Keywords: MSO extensions / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+metatheorem
@@ Property / zbMATH Keywords: metatheorem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized complexity
@@ Property / zbMATH Keywords: parameterized complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+neighborhood diversity
@@ Property / zbMATH Keywords: neighborhood diversity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+treewidth
@@ Property / zbMATH Keywords: treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of computing balanced partitions in graphs
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for finding tree-decompositions of small treewidth
+Normal rank
@@ Property / cites work @@
+Treewidth: Characterizations, Applications, and Computations
+Normal rank
@@ Property / cites work @@
+The graph motif problem parameterized by the structure of the input graph
+Normal rank
@@ Property / cites work @@
+Elections with Few Candidates: Prices, Weights, and Covering Problems
+Normal rank
@@ Property / cites work @@
+Extended formulations in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Monadic second-order evaluations on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5091008
@@ Property / cites work: Q5091008 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper and lower bounds for finding connected motifs in vertex-colored graphs
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of distance labeling and uniform channel assignment problems
+Normal rank
@@ Property / cites work @@
+The complexity of first-order and monadic second-order logic revisited
+Normal rank
@@ Property / cites work @@
+Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
+Normal rank
@@ Property / cites work @@
+Complexity of conflict-free colorings of graphs
@@ Property / cites work: Complexity of conflict-free colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic datalog over finite structures of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q3118384
@@ Property / cites work: Q3118384 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Courcelle's theorem -- a game-theoretic approach
@@ Property / cites work: Courcelle's theorem -- a game-theoretic approach / rank @@
+Normal rank
@@ Property / cites work @@
+Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
+Normal rank
@@ Property / cites work @@
+Q5092394
@@ Property / cites work: Q5092394 / rank @@
+Normal rank
@@ Property / cites work @@
+Conjunctive-query containment and constraint satisfaction
+Normal rank
@@ Property / cites work @@
+Extension Complexity, MSO Logic, and Treewidth
@@ Property / cites work: Extension Complexity, MSO Logic, and Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic meta-theorems for restrictions of treewidth
+Normal rank
@@ Property / cites work @@
+Model Checking Lower Bounds for Simple Graphs
@@ Property / cites work: Model Checking Lower Bounds for Simple Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of fair deletion problems
+Normal rank
@@ Property / cites work @@
+Q3539854
@@ Property / cites work: Q3539854 / rank @@
+Normal rank
@@ Property / cites work @@
+Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
+Normal rank
@@ Property / cites work @@
+Monadic Second Order Logic on Graphs with Local Cardinality Constraints
+Normal rank
@@ Property / DBLP publication ID @@
+conf/wg/KnopKMT17
@@ Property / DBLP publication ID: conf/wg/KnopKMT17 / rank @@
+Normal rank