Pages that link to "Item:Q2040028"
From MaRDI portal
The following pages link to Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028):
Displaying 7 items.
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- Positive-instance driven dynamic programming for treewidth (Q2424727) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs (Q5071096) (← links)
- Embedding phylogenetic trees in networks of low treewidth (Q6599789) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)