The following pages link to Algorithms and Data Structures (Q5900777):
Displayed 26 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)
- An approximation algorithm for maximum internal spanning tree (Q1743498) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
- Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q2232252) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← 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)
- (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)
- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← links)
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem (Q5323046) (← links)
- Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)
- On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves (Q6057351) (← links)