Pages that link to "Item:Q3434568"
From MaRDI portal
The following pages link to Parameterized Algorithms for Hitting Set: The Weighted Case (Q3434568):
Displaying 13 items.
- Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover (Q456689) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Multiple hypernode hitting sets and smallest two-cores with targets (Q1041434) (← links)
- The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Improved FPT algorithm for feedback vertex set problem in bipartite tournament (Q2380045) (← links)
- Faster parameterized algorithms for two vertex deletion problems (Q2699960) (← links)
- Iterative Compression and Exact Algorithms (Q3599139) (← links)
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs (Q5452161) (← links)
- Fixed-Parameter Algorithms for Cluster Vertex Deletion (Q5458573) (← links)
- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets (Q5505641) (← links)
