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

On the Ordered List Subgraph Embedding Problems., , , and . CoRR, (2014)The inapproximability of non-NP-hard optimization problems., , and . Theor. Comput. Sci., 289 (1): 553-571 (2002)Parameterized and subexponential-time complexity of satisfiability problems and applications., and . Theor. Comput. Sci., (2015)On the Ordered List Subgraph Embedding Problems., , , and . Algorithmica, 74 (3): 992-1018 (2016)Degree Four Plane Spanners: Simpler and Better., , and . SoCG, volume 51 of LIPIcs, page 45:1-45:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications., and . COCOA, volume 8881 of Lecture Notes in Computer Science, page 637-651. Springer, (2014)On Spanners of Geometric Graphs.. TAMC, volume 5532 of Lecture Notes in Computer Science, page 49-58. Springer, (2009)Improved Results for Minimum Constraint Removal., , , and . AAAI, page 6477-6484. AAAI Press, (2018)3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size., and . Discret. Math. Algorithms Appl., 7 (2): 1550011:1-1550011:17 (2015)How to navigate through obstacles?, and . CoRR, (2017)