Q5874480 (Q5874480): Difference between revisions

@@ Property / DOI @@
-.4230/LIPIcs.ESA.2020.14
@@ Property / DOI: 10.4230/LIPIcs.ESA.2020.14 / rank @@
-Normal rank
@@ Property / cites work @@
+Parameterized Power Vertex Cover
@@ Property / cites work: Parameterized Power Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+On the Grundy number of graphs with few \(P_4\)'s
@@ Property / cites work: On the Grundy number of graphs with few \(P_4\)'s / rank @@
+Normal rank
@@ Property / cites work @@
+Matchings with lower quotas: algorithms and complexity
+Normal rank
@@ Property / cites work @@
+New Results on Directed Edge Dominating Set
@@ Property / cites work: New Results on Directed Edge Dominating Set / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of safe set
@@ Property / cites work: Parameterized complexity of safe set / rank @@
+Normal rank
@@ Property / cites work @@
+Q3304104
@@ Property / cites work: Q3304104 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth governs the complexity of target set selection
+Normal rank
@@ Property / cites work @@
+On bounded-degree vertex deletion parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+On the complexity of restoring corrupted colorings
+Normal rank
@@ Property / cites work @@
+Complexity of Grundy coloring and its variants
@@ Property / cites work: Complexity of Grundy coloring and its variants / rank @@
+Normal rank
@@ Property / cites work @@
+Time-approximation trade-offs for inapproximable problems
+Normal rank
@@ Property / cites work @@
+Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
+Normal rank
@@ Property / cites work @@
+Some perfect coloring properties of graphs
@@ Property / cites work: Some perfect coloring properties of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5377224
@@ Property / cites work: Q5377224 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and approximability of parameterized MAX-CSPs
+Normal rank
@@ Property / cites work @@
+Capacitated Domination and Covering: A Parameterized Perspective
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of length-bounded cuts and multicuts
+Normal rank
@@ Property / cites work @@
+Counting linear extensions: parameterizations by treewidth
+Normal rank
@@ Property / cites work @@
+What Makes Equitable Connected Partition Easy
@@ Property / cites work: What Makes Equitable Connected Partition Easy / rank @@
+Normal rank
@@ Property / cites work @@
+On Routing Disjoint Paths in Bounded Treewidth Graphs
+Normal rank
@@ Property / cites work @@
+On the equality of the partial Grundy and upper ochromatic numbers of graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of some colorful problems parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of coloring problems: treewidth versus vertex cover
+Normal rank
@@ Property / cites work @@
+New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
+Normal rank
@@ Property / cites work @@
+Q5417642
@@ Property / cites work: Q5417642 / rank @@
+Normal rank
@@ Property / cites work @@
+Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
+Normal rank
@@ Property / cites work @@
+Clique-width III
@@ Property / cites work: Clique-width III / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Modular-Width
@@ Property / cites work: Parameterized Algorithms for Modular-Width / rank @@
+Normal rank
@@ Property / cites work @@
+On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
+Normal rank
@@ Property / cites work @@
+The complexity landscape of decompositional parameters for ILP
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+The Steiner forest problem revisited
@@ Property / cites work: The Steiner forest problem revisited / rank @@
+Normal rank
@@ Property / cites work @@
+The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth
+Normal rank
@@ Property / cites work @@
+On-line and first fit colorings of graphs
@@ Property / cites work: On-line and first fit colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Structurally parameterized \(d\)-Scattered Set
@@ Property / cites work: Structurally parameterized \(d\)-Scattered Set / rank @@
+Normal rank
@@ Property / cites work @@
+Structural parameters, tight bounds, and approximation for \((k, r)\)-center
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of spanning trees with small vertex covers
+Normal rank
@@ Property / cites work @@
+First-fit coloring of bounded tolerance graphs
@@ Property / cites work: First-fit coloring of bounded tolerance graphs / rank @@
+Normal rank
@@ Property / cites work @@
+First-fit coloring on interval graphs has performance ratio at least 5
+Normal rank
@@ Property / cites work @@
+Q5092394
@@ Property / cites work: Q5092394 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5387684
@@ Property / cites work: Q5387684 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic meta-theorems for restrictions of treewidth
+Normal rank
@@ Property / cites work @@
+Parameterized maximum path coloring
@@ Property / cites work: Parameterized maximum path coloring / rank @@
+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 @@
+Q5111886
@@ Property / cites work: Q5111886 / rank @@
+Normal rank
@@ Property / cites work @@
+Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
+Normal rank
@@ Property / cites work @@
+Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).
+Normal rank
@@ Property / cites work @@
+The parameterised complexity of list problems on graphs of bounded treewidth
+Normal rank
@@ Property / cites work @@
+The parameterised complexity of computing the maximum modularity of a graph
+Normal rank
@@ Property / cites work @@
+The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
+Normal rank
@@ Property / cites work @@
+A note on first-fit coloring of interval graphs
@@ Property / cites work: A note on first-fit coloring of interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+On Tractable Cases of Target Set Selection
@@ Property / cites work: On Tractable Cases of Target Set Selection / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability of acyclic and almost acyclic CNF formulas
+Normal rank
@@ Property / cites work @@
+Constraint satisfaction with bounded treewidth revisited
+Normal rank
@@ Property / cites work @@
+Tractable cases of the extended global cardinality constraint
+Normal rank
@@ Property / cites work @@
+Q3012402
@@ Property / cites work: Q3012402 / rank @@
+Normal rank
@@ Property / cites work @@
+More bounds for the Grundy number of graphs
@@ Property / cites work: More bounds for the Grundy number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
+Normal rank
@@ Property / cites work @@
+Q4659607
@@ Property / cites work: Q4659607 / rank @@
+Normal rank
@@ Property / cites work @@
+Results on the Grundy chromatic number of graphs
@@ Property / cites work: Results on the Grundy chromatic number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Inequalities for the Grundy chromatic number of graphs
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.ESA.2020.14
@@ Property / DOI: 10.4230/LIPICS.ESA.2020.14 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5874480