The following pages link to (Q3369936):
Displayed 28 items.
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- On the directed full degree spanning tree problem (Q456701) (← links)
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- Looking at the stars (Q820158) (← links)
- Representative families: a unified tradeoff-based approach (Q899582) (← links)
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- An approximation algorithm for maximum internal spanning tree (Q1743498) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- Approximating spanning trees with few branches (Q2344216) (← links)
- Better approximation algorithms for the maximum internal spanning tree problem (Q2350897) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496) (← links)
- A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem (Q2656175) (← links)
- Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem (Q3183476) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- Mixing Color Coding-Related Techniques (Q3452864) (← links)
- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← links)
- (Q5075762) (← links)
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem (Q5323046) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)