Author of the publication

Reducing the diameter of a unit disk graph via node addition.

, , and . Inf. Process. Lett., 115 (11): 845-850 (2015)

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

Coalition Resilient Outcomes in Max k-Cut Games., , , and . SOFSEM, volume 11376 of Lecture Notes in Computer Science, page 94-107. Springer, (2019)An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner., , , , and . ISAAC, volume 92 of LIPIcs, page 14:1-14:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Large Peg-Army Maneuvers., , , and . FUN, volume 49 of LIPIcs, page 18:1-18:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Locality-Based Network Creation Games., , , and . ACM Trans. Parallel Comput., 3 (1): 6:1-6:26 (2016)On the Parallel Undecided-State Dynamics with Two Colors., , , and . CoRR, (2017)Exact and approximate algorithms for movement problems on (special classes of) graphs., , , and . Theor. Comput. Sci., (2016)Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game., , , and . WINE, volume 6484 of Lecture Notes in Computer Science, page 75-86. Springer, (2010)Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems., , , and . WINE, volume 4858 of Lecture Notes in Computer Science, page 503-514. Springer, (2007)Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems., , and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 150-161. Springer, (2010)Cutting Bamboo down to Size., , , , and . FUN, volume 157 of LIPIcs, page 5:1-5:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)