Minimal interval completion through graph explorationSUCHAN, Karol; TODINCA, Loan.Theoretical computer science. 2009, Vol 410, Num 1, pp 35-43, issn 0304-3975, 9 p.Article

Minimal Interval Completion Through Graph ExplorationSUCHAN, Karol; TODINCA, Ioan.Lecture notes in computer science. 2006, pp 517-526, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

Minimal proper interval completionsRAPAPORT, Ivan; SUCHAN, Karol; TODINCA, Loan et al.Information processing letters. 2008, Vol 106, Num 5, pp 195-202, issn 0020-0190, 8 p.Article

Minimal interval completionsHEGGERNES, Pinar; SUCHAN, Karol; TODINCA, Ioan et al.Lecture notes in computer science. 2005, pp 403-414, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

Minimal proper interval completionsRAPAPORT, Ivan; SUCHAN, Karol; TODINCA, Ioan et al.Lecture notes in computer science. 2006, pp 217-228, issn 0302-9743, isbn 3-540-48381-0, 12 p.Conference Paper

Pursuing a fast robber on a graphFOMIN, Fedor V; GOLOVACH, Petr A; KRATOCHVIL, Jan et al.Theoretical computer science. 2010, Vol 411, Num 7-9, pp 1167-1181, issn 0304-3975, 15 p.Article

On powers of graphs of bounded NLC-width (Clique-width)SUCHAN, Karol; TODINCA, Ioan.Discrete applied mathematics. 2007, Vol 155, Num 14, pp 1885-1893, issn 0166-218X, 9 p.Conference Paper