The many facets of upper domination
From MaRDI portal
Publication:1704853
Recommendations
Cites work
- scientific article; zbMATH DE number 4049086 (Why is no real title available?)
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- A boundary property for upper domination
- A dichotomy for upper domination in monogenic classes
- A faster algorithm for dominating set analyzed by the potential method
- A fine-grained analysis of a simple independent set algorithm
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- A partial k-arboretum of graphs with bounded treewidth
- A special planar satisfiability problem and a consequence of its NP- completeness
- Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
- Approximating minimum independent dominating sets in wireless networks
- Approximating the minimum maximal independence number
- Approximation algorithms for NP-complete problems on planar graphs
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Chordal graphs and upper irredundance, upper domination and independence
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Combinatorial bounds via measure and conquer
- Contributions to the theory of domination, independence and irredundance in graphs
- Data reductions and combinatorial bounds for improved approximation algorithms
- Dual subimplicants of positive Boolean functions
- Exact algorithms for dominating set
- Fast algorithms for \textsc{min independent dominating set}
- Fast algorithms for min independent dominating set
- Fundamentals of parameterized complexity
- Improved upper bounds for vertex cover
- Inequalities relating domination parameters in cubic graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Maximum minimal vertex cover parameterized by vertex cover
- On the computational complexity of upper fractional domination
- On the computational complexity of upper total domination
- On the enumeration of minimal dominating sets and related notions
- On the max min vertex cover problem
- On the parameterized complexity of multiple-interval graph problems
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- Optimization, approximation, and complexity classes
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
- Pathwidth of cubic graphs and exact algorithms
- Scheduling algorithms for procrastinators
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The Turing way to parameterized complexity
- The complexity of irredundant sets parameterized by size
- The lazy bureaucrat scheduling problem
- Three short proofs in graph theory
- Upper domination: complexity and approximation
Cited in
(36)- Minimum maximal acyclic matching in proper interval graphs
- On the complexity of solution extension of optimization problems
- Computing the largest bond and the maximum connected cut of a graph
- Extension and its price for the connected vertex cover problem
- The diversity of domination
- Minimal Roman dominating functions: extensions and enumeration
- Algorithmic aspects of upper paired-domination in graphs
- Upper domination: towards a dichotomy through boundary properties
- Topics on domination
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
- In)approximability of Maximum Minimal FVS
- On the complexity landscape of the domination chain
- Algorithmic aspects of upper edge domination
- On the complexity of minimum maximal acyclic matchings
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- Recognizing well-dominated graphs is coNP-complete
- A boundary property for upper domination
- Upper domination: complexity and approximation
- Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
- Weighted upper edge cover: complexity and approximability
- Binary programming formulations for the upper domination problem
- (In)approximability of maximum minimal FVS
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- Minimum maximal acyclic matching in proper interval graphs
- Formalization of the Domination Chain with Weighted Parameters (Short Paper)
- Minimal zero forcing sets
- Weighted upper domination number
- Upper Clique Transversals in Graphs
- Parameterized complexity of computing maximum minimal blocking and hitting sets
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
- A dichotomy for upper domination in monogenic classes
- Invited talks
- Extension of some edge graph problems: standard, parameterized and approximation complexity
- Minimal Roman dominating functions: extensions and enumeration
- On the complexity of minimum maximal acyclic matchings
This page was built for publication: The many facets of upper domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704853)
