Author of the publication

Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width.

, and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 348-359. Springer, (2012)

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

Distance constrained labeling on graphs with bounded neighborhood diversity., , , , and . CoRR, (2015)Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width., and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 348-359. Springer, (2012)Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity., and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 182-191. Springer, (2008)Distance Constrained Labelings of Graphs of Bounded Treewidth., , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 360-372. Springer, (2005)Parameterized Complexity of Generalized Domination Problems., , and . WG, volume 5911 of Lecture Notes in Computer Science, page 133-142. (2009)Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)., , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 294-305. Springer, (2008)Compatible 2-factors., and . Discret. Appl. Math., 36 (3): 253-266 (1992)Preface., , , and . Electron. Notes Discret. Math., (2007)On the Complexity of Reconstructing H -free Graphs from Their Star Systems., , , , and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 194-205. Springer, (2008)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)