Author of the publication

Tight Lower Bounds for Certain Parameterized NP-Hard Problems.

, , , , , , and . Computational Complexity Conference, page 150-160. IEEE Computer Society, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Finding k Disjoint Triangles in an Arbitrary Graph., , , , and . WG, volume 3353 of Lecture Notes in Computer Science, page 235-244. Springer, (2004)Milling a Graph with Turn Costs: A Parameterized Complexity Perspective., , , , , , and . WG, volume 6410 of Lecture Notes in Computer Science, page 123-134. (2010)Computer Science unplugged, , and . (December 2006)http://csunplugged.org/ -- last visitied $1^th$~November~2008.Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps., , and . WG, volume 3353 of Lecture Notes in Computer Science, page 257-269. Springer, (2004)