The following pages link to Algorithms and Data Structures (Q5900777):
Displayed 15 items.
- Improved upper bounds for vertex cover (Q708228) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← 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)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
- (Q2861557) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem (Q3183476) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem (Q5323046) (← links)