The many facets of upper domination
type: Item
instance of: scholarly article
title: The many facets of upper domination
zbMATH Open document ID: 1388.68099
author: Cristina Bazgan
author: Ljiljana Brankovic
author: Katrin Casel
author: Henning Fernau
author: Klaus Jansen
author: Kim-Manuel Klein
author: Michael Lampis
author: Mathieu Liedloff
author: Jérôme Monnot
author: Vangelis Th. Paschos
published in: Theoretical Computer Science
publication date: 2018-03-13T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6849497
zbMATH Keywords: dominating set
zbMATH Keywords: (in)approximability
zbMATH Keywords: fixed parameter (in)tractability
zbMATH Keywords: extension problems
zbMATH Keywords: bounded-degree graphs
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.05.042
OpenAlex ID: W2625060274
cites work: A Dichotomy for Upper Domination in Monogenic Classes
cites work: A Boundary Property for Upper Domination
cites work: Data reductions and combinatorial bounds for improved approximation algorithms
cites work: The lazy bureaucrat scheduling problem
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: Algorithmic Aspects of Upper Domination: A Parameterised Perspective
cites work: Upper Domination: Complexity and Approximation
cites work: Scheduling algorithms for procrastinators
cites work: Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: On the max min vertex cover Problem
cites work: Dual subimplicants of positive Boolean functions
cites work: Fast algorithms for min independent dominating set
cites work: Fast Algorithms for min independent dominating set
cites work: A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
cites work: The Turing way to parameterized complexity
cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
cites work: Improved upper bounds for vertex cover
cites work: On the computational complexity of upper fractional domination
cites work: Contributions to the theory of domination, independence and irredundance in graphs
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Q4027320
cites work: Fundamentals of parameterized complexity
cites work: The complexity of irredundant sets parameterized by size
cites work: On the computational complexity of upper total domination
cites work: On the parameterized complexity of multiple-interval graph problems
cites work: Combinatorial bounds via measure and conquer
cites work: Pathwidth of cubic graphs and exact algorithms
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Approximating the minimum maximal independence number
cites work: Q3785978
cites work: Q4368728
cites work: Inequalities relating domination parameters in cubic graphs
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: Approximating minimum independent dominating sets in wireless networks
cites work: A Faster Algorithm for Dominating Set Analyzed by the Potential Method
cites work: Chordal graphs and upper irredundance, upper domination and independence
cites work: On the Enumeration of Minimal Dominating Sets and Related Notions
cites work: A fine-grained analysis of a simple independent set algorithm
cites work: A special planar satisfiability problem and a consequence of its NP- completeness
cites work: Three short proofs in graph theory
cites work: Optimization, approximation, and complexity classes
cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
cites work: Exact algorithms for dominating set
cites work: Maximum Minimal Vertex Cover Parameterized by Vertex Cover
DOI: 10.1016/J.TCS.2017.05.042
Recommended article: The diversity of domination
Recommended article: Multiple Domination
Recommended article: Some remarks on domination
Recommended article: On dominance
Recommended article: Topics on domination
Recommended article: Stratified Domination

The many facets of upper domination (Recommended article)
Recommended article: A new domination conception
Similarity Score: 0.7875957
Recommender Run: Recommender Run 3

The many facets of upper domination (Recommended article)
Recommended article: Q3581885
Similarity Score: 0.78355086
Recommender Run: Recommender Run 3

The many facets of upper domination (Recommended article)
Recommended article: Pervasive domination
Similarity Score: 0.78089833
Recommender Run: Recommender Run 3

The many facets of upper domination (Recommended article)
Recommended article: Q4017197
Similarity Score: 0.7770378
Recommender Run: Recommender Run 3