Mim-width. III. Graph powers and generalized distance domination problems (Q2333800): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2019.09.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2972989051
@@ Property / OpenAlex ID: W2972989051 / rank @@
+Normal rank
@@ Property / cites work @@
+Powers of geometric intersection graphs and dispersion algorithms
+Normal rank
@@ Property / cites work @@
+Q4634386
@@ Property / cites work: Q4634386 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph classes with structured neighborhoods and algorithmic applications
+Normal rank
@@ Property / cites work @@
+Perfect codes in graphs
@@ Property / cites work: Perfect codes in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Characterising \((k,\ell )\)-leaf powers
@@ Property / cites work: Characterising \((k,\ell )\)-leaf powers / rank @@
+Normal rank
@@ Property / cites work @@
+Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
+Normal rank
@@ Property / cites work @@
+Pairwise Compatibility Graphs: A Survey
@@ Property / cites work: Pairwise Compatibility Graphs: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+On \(H\)-topological intersection graphs
@@ Property / cites work: On \(H\)-topological intersection graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+On powers of \(m\)-trapezoid graphs
@@ Property / cites work: On powers of \(m\)-trapezoid graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5009589
@@ Property / cites work: Q5009589 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-width of path powers
@@ Property / cites work: Clique-width of path powers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4029974
@@ Property / cites work: Q4029974 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5009468
@@ Property / cites work: Q5009468 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5111880
@@ Property / cites work: Q5111880 / rank @@
+Normal rank
@@ Property / cites work @@
+Mim-width. III. Graph powers and generalized distance domination problems
+Normal rank
@@ Property / cites work @@
+Mim-width. II. The feedback vertex set problem
@@ Property / cites work: Mim-width. II. The feedback vertex set problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3304141
@@ Property / cites work: Q3304141 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+On strongly chordal graphs that are not leaf powers
+Normal rank
@@ Property / cites work @@
+Lower bounds on the mim-width of some graph classes
+Normal rank
@@ Property / cites work @@
+Towards a characterization of leaf powers by clique arrangements
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs
+Normal rank
@@ Property / cites work @@
+Q4032992
@@ Property / cites work: Q4032992 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of computing width parameters based on branch decompositions over the vertex set
+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 @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+The point-set embeddability problem for plane graphs
+Normal rank