Pages that link to "Item:Q1044023"
From MaRDI portal
The following pages link to The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023):
Displaying 6 items.
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing (Q392033) (← links)
- Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover (Q456689) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover (Q714786) (← links)
- Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing (Q2891340) (← links)
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms (Q3656854) (← links)
