The following pages link to (Q5743379):
Displaying 15 items.
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- (Q5090497) (← links)
- (Q5092402) (← links)
- (Q5111296) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- (Q6089655) (← links)
- Computing paths of large rank in planar frameworks deterministically (Q6668350) (← links)
