Combinatorics for smaller kernels: the differential of a graph (Q476877): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2014.10.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2042274748
@@ Property / OpenAlex ID: W2042274748 / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Approximation Bound for Spanning Star Forest and Color Saving
+Normal rank
@@ Property / cites work @@
+Lower bounds on the differential of a graph
@@ Property / cites work: Lower bounds on the differential of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the differential of a graph: hardness, approximability and exact algorithms
+Normal rank
@@ Property / cites work @@
+The differential and the roman domination number of a graph
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the test cover problem
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for the spanning star forest problem
+Normal rank
@@ Property / cites work @@
+Roman domination in graphs.
@@ Property / cites work: Roman domination in graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+SOFSEM 2006: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
+Normal rank
@@ Property / cites work @@
+Defending the Roman Empire---a new strategy
@@ Property / cites work: Defending the Roman Empire---a new strategy / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Set Covering and Vertex Cover Problems
+Normal rank
@@ Property / cites work @@
+On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
+Normal rank
@@ Property / cites work @@
+Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging
+Normal rank
@@ Property / cites work @@
+Q5488331
@@ Property / cites work: Q5488331 / rank @@
+Normal rank
@@ Property / cites work @@
+Domination in graphs with minimum degree two
@@ Property / cites work: Domination in graphs with minimum degree two / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
+Normal rank
@@ Property / cites work @@
+Paths, Stars and the Number Three
@@ Property / cites work: Paths, Stars and the Number Three / rank @@
+Normal rank
@@ Property / cites work @@
+Enclaveless sets and MK-Systems
@@ Property / cites work: Enclaveless sets and MK-Systems / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/tcs/BermudoF15
@@ Property / DBLP publication ID: journals/tcs/BermudoF15 / rank @@
+Normal rank