Pages that link to "Item:Q3586492"
From MaRDI portal
The following pages link to Algorithmic Meta-theorems for Restrictions of Treewidth (Q3586492):
Displaying 8 items.
- Parameterized maximum path coloring (Q392021) (← links)
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Many-visits TSP revisited (Q2051856) (← links)
- Parameterized Compilation Lower Bounds for Restricted CNF-Formulas (Q2817997) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- Many Visits TSP Revisited (Q5874538) (← links)
