Pages that link to "Item:Q2291420"
From MaRDI portal
The following pages link to Extension of some edge graph problems: standard and parameterized complexity (Q2291420):
Displaying 10 items.
- On the complexity of some problems related to graph extensions (Q650325) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Invited talks (Q2692717) (← links)
- Parameterized Complexity of Edge Interdiction Problems (Q2920456) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
