The following pages link to Algorithms – ESA 2004 (Q5464578):
Displaying 28 items.
- A decidability result for the dominating set problem (Q410736) (← links)
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- Inapproximability of dominating set on power law graphs (Q476891) (← links)
- On approximating the minimum independent dominating set (Q750159) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- The hub number of a graph (Q975457) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- APX-hardness of domination problems in circle graphs (Q1045943) (← links)
- Tight approximation bounds for dominating set on graphs of bounded arboricity (Q1675919) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- On the approximability of positive influence dominating set in social networks (Q2015789) (← links)
- On the complexity of independent dominating set with obligations in graphs (Q2072059) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- Hardness of fully dense problems (Q2643075) (← links)
- Approximating the domatic number (Q3191980) (← links)
- (Q4680214) (← links)
- Approximating theDomatic Number (Q4785636) (← links)
- On the Parameterized Complexity of Approximating Dominating Set (Q5215462) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- Approximation Algorithms and Hardness for Domination with Propagation (Q5901134) (← links)
