Author of the publication

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

Special Issue on "Theory and Applications of Graph Searching Problems"., , , and . Theor. Comput. Sci., 412 (24): 2699 (2011)Contracting planar graphs to contractions of triangulations., , and . J. Discrete Algorithms, 9 (3): 299-306 (2011)D-cores: measuring collaboration of directed graphs based on degeneracy., , and . Knowl. Inf. Syst., 35 (2): 311-343 (2013)Partiality and Approximation Schemes for Local Consistency in Networks of Constraints., , , and . FSTTCS, volume 1026 of Lecture Notes in Computer Science, page 210-224. Springer, (1995)Smaller Kernels for Hitting Set Problems of Constant Arity., , and . IWPEC, volume 3162 of Lecture Notes in Computer Science, page 121-126. Springer, (2004)A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth., , and . IPEC, volume 115 of LIPIcs, page 2:1-2:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Cutwidth: Obstructions and Algorithmic Aspects., , , , and . IPEC, volume 63 of LIPIcs, page 15:1-15:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Contractions of Planar Graphs in Polynomial Time., , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 122-133. Springer, (2010)Fast Minor Testing in Planar Graphs., , , , and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 97-109. Springer, (2010)FPT Algorithms for Plane Completion Problems., , , , , and . MFCS, volume 58 of LIPIcs, page 26:1-26:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)