Pages that link to "Item:Q964386"
From MaRDI portal
The following pages link to Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386):
Displaying 8 items.
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing (Q392033) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
- Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing (Q2891340) (← links)
- BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES (Q2905308) (← links)
- A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
