Author of the publication

Improved Approximation Algorithm for Convex Recoloring of Trees.

, , and . WAOA, volume 3879 of Lecture Notes in Computer Science, page 55-68. Springer, (2005)

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

Distributed Backup Placement in Networks., , , and . SPAA, page 274-283. ACM, (2015)Online Budgeted Maximum Coverage., and . ESA, volume 57 of LIPIcs, page 73:1-73:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Local Search Algorithms for Maximum Carpool Matching., and . ESA, volume 87 of LIPIcs, page 55:1-55:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Vertex-weighted realizations of graphs., , and . Theor. Comput. Sci., (2020)The Hardness of Cache Conscious Data Placement., and . Nord. J. Comput., 12 (3): 275-307 (2005)Distributed Approximation of Cellular Coverage., , and . OPODIS, volume 5401 of Lecture Notes in Computer Science, page 331-345. Springer, (2008)Approximation Algorithms for Capacitated Rectangle Stabbing., , and . CIAC, volume 3998 of Lecture Notes in Computer Science, page 18-29. Springer, (2006)Time-dependent multi-scheduling of multicast., , and . ACM Trans. Algorithms, 6 (1): 14:1-14:22 (2009)A Tale of Two Methods., and . Essays in Memory of Shimon Even, volume 3895 of Lecture Notes in Computer Science, page 196-217. Springer, (2006)Improved Approximation Algorithm for Convex Recoloring of Trees., , and . WAOA, volume 3879 of Lecture Notes in Computer Science, page 55-68. Springer, (2005)