Optimal broadcast domination of arbitrary graphs in polynomial timeHEGGERNES, Pinar; LOKSHTANOV, Daniel.Lecture notes in computer science. 2005, pp 187-198, issn 0302-9743, isbn 3-540-31000-2, 1Vol, 12 p.Conference Paper

Optimal broadcast domination in polynomial timeHEGGERNES, Pinar; LOKSHTANOV, Daniel.Discrete mathematics. 2006, Vol 306, Num 24, pp 3267-3280, issn 0012-365X, 14 p.Article

An exact algorithm for minimum distortion embeddingFOMIN, Fedor V; LOKSHTANOV, Daniel; SAURABH, Saket et al.Theoretical computer science. 2011, Vol 412, Num 29, pp 3530-3536, issn 0304-3975, 7 p.Article

Finding the longest isometric cycle in a graphLOKSHTANOV, Daniel.Discrete applied mathematics. 2009, Vol 157, Num 12, pp 2670-2674, issn 0166-218X, 5 p.Conference Paper

Guard games on graphs: Keep the intruder out!FOMIN, Fedor V; GOLOVACH, Petr A; LOKSHTANOV, Daniel et al.Theoretical computer science. 2011, Vol 412, Num 46, pp 6484-6497, issn 0304-3975, 14 p.Article

On the complexity of computing treelengthLOKSHTANOV, Daniel.Discrete applied mathematics. 2010, Vol 158, Num 7, pp 820-827, issn 0166-218X, 8 p.Article

INTRACTABILITY OF CLIQUE-WIDTH PARAMETERIZATIONSFOMIN, Fedor V; GOLOVACH, Petr A; LOKSHTANOV, Daniel et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1941-1956, issn 0097-5397, 16 p.Article

On Cutwidth Parameterized by Vertex CoverCYGAN, Marek; LOKSHTANOV, Daniel; PILIPCZUK, Marcin et al.Algorithmica. 2014, Vol 68, Num 4, pp 940-953, issn 0178-4617, 14 p.Article

Subexponential algorithms for partial cover problemsFOMIN, Fedor V; LOKSHTANOV, Daniel; RAMAN, Venkatesh et al.Information processing letters. 2011, Vol 111, Num 16, pp 814-818, issn 0020-0190, 5 p.Article

A linear kernel for a planar connected dominating setLOKSHTANOV, Daniel; MNICH, Matthias; SAURABH, Saket et al.Theoretical computer science. 2011, Vol 412, Num 23, pp 2536-2543, issn 0304-3975, 8 p.Article

Computing Optimal Steiner Trees in Polynomial SpaceFOMIN, Fedor V; GRANDONI, Fabrizio; KRATSCH, Dieter et al.Algorithmica. 2013, Vol 65, Num 3, pp 584-604, issn 0178-4617, 21 p.Article

Sharp Separation and Applications to Exact and Parameterized AlgorithmsFOMIN, Fedor V; GRANDONI, Fabrizio; LOKSHTANOV, Daniel et al.Algorithmica. 2012, Vol 63, Num 3, pp 692-706, issn 0178-4617, 15 p.Article

Contracting Graphs to Paths and TreesHEGGERNES, Pinar; VAN 'T HOF, Pim; LEVEQUE, Benjamin et al.Algorithmica. 2014, Vol 68, Num 1, pp 109-132, issn 0178-4617, 24 p.Article

BANDWIDTH on AT-free graphsGOLOVACH, Petr; HEGGERNES, Pinar; KRATSCH, Dieter et al.Theoretical computer science. 2011, Vol 412, Num 50, pp 7001-7008, issn 0304-3975, 8 p.Article

Characterizing and computing minimal cograph completionsLOKSHTANOV, Daniel; MANCINI, Federico; PAPADOPOULOS, Charis et al.Discrete applied mathematics. 2010, Vol 158, Num 7, pp 755-764, issn 0166-218X, 10 p.Article

On the complexity of some colorful problems parameterized by treewidthFELLOWS, Michael R; FOMIN, Fedor V; LOKSHTANOV, Daniel et al.Information and computation (Print). 2011, Vol 209, Num 2, pp 143-153, issn 0890-5401, 11 p.Article