Pages that link to "Item:Q1704853"
From MaRDI portal
The following pages link to The many facets of upper domination (Q1704853):
Displayed 22 items.
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- Invited talks (Q2692717) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- Formalization of the Domination Chain with Weighted Parameters (Short Paper) (Q5875450) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
- Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
- Binary programming formulations for the upper domination problem (Q6080758) (← links)
- Minimum maximal acyclic matching in proper interval graphs (Q6132553) (← links)
- On the complexity of minimum maximal acyclic matchings (Q6168934) (← links)