Author of the publication

Linear-Time Recognition of Double-Threshold Graphs.

, , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 286-297. Springer, (2020)

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

Fence patrolling by mobile agents with distinct speeds., and . CoRR, (2014)Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two., and . STOC, page 81-88. ACM, (2011)Minimum-Cost b -Edge Dominating Sets on Trees., , , , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 195-207. Springer, (2014)Fence Patrolling by Mobile Agents with Distinct Speeds., and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 598-608. Springer, (2012)A Weighted Linear Matroid Parity Algorithm., and . CoRR, (2019)Max-flow min-cut theorem and faster algorithms in a circular disk failure model., and . INFOCOM, page 1635-1643. IEEE, (2014)A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees., and . FAW, volume 10823 of Lecture Notes in Computer Science, page 54-67. Springer, (2018)Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid., and . STACS, volume 14 of LIPIcs, page 278-289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Shortest Reconfiguration of Colorings Under Kempe Changes., , , , , , , and . STACS, volume 154 of LIPIcs, page 35:1-35:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number., , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 327-338. Springer, (2019)