Author of the publication

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs.

, and . SIAM J. Discret. Math., 30 (3): 1685-1725 (2016)

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

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs., , and . Theor. Comput. Sci., (2017)Lean Tree-Cut Decompositions: Obstructions and Algorithms., , , and . STACS, volume 126 of LIPIcs, page 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Obstructions for Tree-depth., and . Electron. Notes Discret. Math., (2009)Neighborhood complexity and kernelization for nowhere dense classes of graphs., , , , , , and . CoRR, (2016)Excluding Single-Crossing Matching Minors in Bipartite Graphs., , and . SODA, page 2111-2121. SIAM, (2023)The canonical directed tree decomposition and its applications to the directed disjoint paths problem., , , and . CoRR, (2020)Excluding Graphs as Immersions in Surface Embedded Graphs., , and . WG, volume 8165 of Lecture Notes in Computer Science, page 274-285. Springer, (2013)Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation)., , , and . CoRR, (2013)New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs., and . CoRR, (2014)New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs., and . STACS, volume 30 of LIPIcs, page 354-366. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)