Pages that link to "Item:Q2322693"
From MaRDI portal
The following pages link to Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693):
Displaying 8 items.
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
- Parameterized and Exact Computation (Q5311519) (← links)
- Algorithms and Data Structures (Q5900777) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)