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

NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord., and . CTW, page 55-59. (2009)Splitting Number is NP-complete, , and . WG, volume 1517 of Lecture Notes in Computer Science, page 285-297. Springer, (1998)On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions., , , and . BSB, volume 5167 of Lecture Notes in Computer Science, page 79-91. Springer, (2008)Clique Graph Recognition Is NP-Complete., , , and . WG, volume 4271 of Lecture Notes in Computer Science, page 269-277. Springer, (2006)The cost of perfection for matchings in graphs., , , and . Discret. Appl. Math., (2016)The total chromatic number of split-indifference graphs., , , and . Discret. Math., 312 (17): 2690-2693 (2012)A characterization of P4-comparability graphs., , and . Discret. Math., 306 (19-20): 2461-2472 (2006)On the computational difficulty of the terminal connection problem., , and . RAIRO Theor. Informatics Appl., (2023)On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time., , , and . BSB, volume 8213 of Lecture Notes in Computer Science, page 126-135. Springer, (2013)The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube., , , and . WG, volume 8165 of Lecture Notes in Computer Science, page 249-260. Springer, (2013)