Author of the publication

Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.

, , , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 160-169. Springer, (2002)

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

Exploring Subexponential Parameterized Complexity of Completion Problems., , , and . CoRR, (2013)Approximating acyclicity parameters of sparse hypergraphs, , and . CoRR, (2008)Interval Completion with the Smallest Max-degree., and . WG, volume 1517 of Lecture Notes in Computer Science, page 359-371. Springer, (1998)Approximation of Pathwidth of Outerplanar Graphs., and . WG, volume 2204 of Lecture Notes in Computer Science, page 166-176. Springer, (2001)Exact (Exponential) Algorithms for the Dominating Set Problem., , and . WG, volume 3353 of Lecture Notes in Computer Science, page 245-256. Springer, (2004)Parameterized Complexity of Superstring Problems., , , , , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 89-99. Springer, (2015)Exact Algorithms for Graph Homomorphisms., , and . FCT, volume 3623 of Lecture Notes in Computer Science, page 161-171. Springer, (2005)Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up., and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 581-592. Springer, (2004)Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In., , and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 568-580. Springer, (2004)Parameterized Algorithms for Directed Maximum Leaf Problems., , , , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 352-362. Springer, (2007)