Lokshtanov Daniel

Daniel Lokshtanov

Information about the author Daniel Lokshtanov will soon be added to the site.
Found 6 papers in total
Quick but Odd Growth of Cacti
Quick but Odd Growth of Cacti
2017
Let F be a family of graphs. Given an n ‐vertex input graph G and a positive...
Computing Optimal Steiner Trees in Polynomial Space
Computing Optimal Steiner Trees in Polynomial Space
2013
Given an n ‐node edge‐weighted graph and a subset of k terminal nodes,...
Contracting Graphs to Paths and Trees
Contracting Graphs to Paths and Trees
2014
Vertex deletion and edge deletion problems play a central role in parameterized...
Sharp Separation and Applications to Exact and Parameterized Algorithms
Sharp Separation and Applications to Exact and Parameterized Algorithms
2012
Many divide‐and‐conquer algorithms employ the fact that the vertex set...
On the directed Full Degree Spanning Tree problem
On the directed Full Degree Spanning Tree problem
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning...
Treewidth governs the complexity of target set selection
Treewidth governs the complexity of target set selection
2011
In this paper we study the Target Set Selection problem proposed by Kempe, Kleinberg,...
Papers per page: