Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063): Difference between revisions

@@ Property / author @@
-Cristina Bazgan
@@ Property / author: Cristina Bazgan / rank @@
-Normal rank
@@ Property / author @@
-Klaus Jansen
@@ Property / author: Klaus Jansen / rank @@
-Normal rank
@@ Property / author @@
+Cristina Bazgan
@@ Property / author: Cristina Bazgan / rank @@
+Normal rank
@@ Property / author @@
+Klaus Jansen
@@ Property / author: Klaus Jansen / rank @@
+Normal rank
@@ 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.1007/978-3-319-41168-2_10
+Normal rank
@@ Property / OpenAlex ID @@
+W2488352127
@@ Property / OpenAlex ID: W2488352127 / rank @@
+Normal rank
@@ Property / cites work @@
+Data reductions and combinatorial bounds for improved approximation algorithms
+Normal rank
@@ Property / cites work @@
+Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
+Normal rank
@@ Property / cites work @@
+A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
+Normal rank
@@ Property / cites work @@
+The Turing way to parameterized complexity
@@ Property / cites work: The Turing way to parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of upper fractional domination
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4027320
@@ Property / cites work: Q4027320 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of irredundant sets parameterized by size
+Normal rank
@@ Property / cites work @@
+On the computational complexity of upper total domination
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Combinatorial bounds via measure and conquer
@@ Property / cites work: Combinatorial bounds via measure and conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Pathwidth of cubic graphs and exact algorithms
@@ Property / cites work: Pathwidth of cubic graphs and exact algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Total Domination in Graphs
@@ Property / cites work: Total Domination in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for Dominating Set Analyzed by the Potential Method
+Normal rank
@@ Property / cites work @@
+A Fine-grained Analysis of a Simple Independent Set Algorithm
+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 @@
+Exact algorithms for dominating set
@@ Property / cites work: Exact algorithms for dominating set / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2830063