Author of the publication

Recognizing Threshold Tolerance Graphs in O(n2) Time.

, , , , , and . WG, volume 8747 of Lecture Notes in Computer Science, page 214-224. Springer, (2014)

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

Parameterized Complexity of Superstring Problems., , , , , and . Algorithmica, 79 (3): 798-813 (2017)Modification to Planarity is Fixed Parameter Tractable., , and . STACS, volume 126 of LIPIcs, page 28:1-28:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Parameterized Complexity of Graph Modification to First-Order Logic Properties., , and . Theory Comput. Syst., 64 (2): 251-271 (2020)Enumeration and maximum number of maximal irredundant sets for chordal graphs., , , and . Discret. Appl. Math., (2019)Metric Dimension of Bounded Tree-length Graphs., , , and . SIAM J. Discret. Math., 31 (2): 1217-1243 (2017)Metric Dimension of Bounded Width Graphs., , , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 115-126. Springer, (2015)Going Far from Degeneracy., , , , , and . SIAM J. Discret. Math., 34 (3): 1587-1601 (2020)Three complexity results on coloring Pk-free graphs., , , and . Eur. J. Comb., 34 (3): 609-619 (2013)Editing to a planar graph of given degrees., , , , and . J. Comput. Syst. Sci., (2017)The capture time of a graph., , , and . Discret. Math., 309 (18): 5588-5595 (2009)