Pages that link to "Item:Q456689"
From MaRDI portal
The following pages link to Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover (Q456689):
Displaying 5 items.
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints (Q2383757) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- On the complexity of minimum maximal acyclic matchings (Q6621851) (← links)
