Pages that link to "Item:Q3608834"
From MaRDI portal
The following pages link to Quadratic Kernelization for Convex Recoloring of Trees (Q3608834):
Displaying 8 items.
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
- A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem (Q2379996) (← links)
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (Q3502673) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Convex Recoloring Revisited: Complexity and Exact Algorithms (Q5323087) (← links)
