Q5136270 (Q5136270): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and approximation algorithms for clustering
@@ Property / cites work: Exact and approximation algorithms for clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Q3044360
@@ Property / cites work: Q3044360 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Power Vertex Cover
@@ Property / cites work: Parameterized Power Vertex Cover / rank @@
+Normal rank
@@ Property / cites work @@
+Fourier meets M\"{o}bius: fast subset convolution
@@ Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth: Characterizations, Applications, and Computations
+Normal rank
@@ Property / cites work @@
+Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
+Normal rank
@@ Property / cites work @@
+Parallel Algorithms with Optimal Speedup for Bounded Treewidth
+Normal rank
@@ Property / cites work @@
+Faster Algorithms on Branch and Clique Decompositions
+Normal rank
@@ Property / cites work @@
+Optimal dynamic program for r-domination problems over tree decompositions
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
+Normal rank
@@ Property / cites work @@
+The \(k\)-hop connected dominating set problem: hardness and polyhedra
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for (             <i>k</i>             ,             <i>r</i>             )-center in planar graphs and map graphs
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating <i>k</i>-center in planar graphs
@@ Property / cites work: Approximating <i>k</i>-center in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity for Domination Problems on Degenerate Graphs
+Normal rank
@@ Property / cites work @@
+Q2766682
@@ Property / cites work: Q2766682 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Fault tolerant \(K\)-center problems
@@ Property / cites work: Fault tolerant \(K\)-center problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Capacitated <i>K</i>-Center Problem
@@ Property / cites work: The Capacitated <i>K</i>-Center Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Approximation Schemes Using Graph Widths
+Normal rank
@@ Property / cites work @@
+Parameterized edge Hamiltonicity
@@ Property / cites work: Parameterized edge Hamiltonicity / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized approximation algorithms for some location problems in graphs
+Normal rank
@@ Property / cites work @@
+Q5365080
@@ Property / cites work: Q5365080 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of r-dominating set on Graphs of Diameter (r + 1)
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2941638
@@ Property / cites work: Q2941638 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+Faster algorithms for vertex partitioning problems parameterized by clique-width
+Normal rank
@@ Property / cites work @@
+AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
+Normal rank
@@ Property / cites work @@
+<i>R</i>             -Domination in Graphs
@@ Property / cites work: <i>R</i> -Domination in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Practical algorithms on partial k-trees with an application to domination-like problems
+Normal rank
@@ Property / cites work @@
+Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5136270