Author of the publication

On the Efficiency of the Hamming C-Centerstring Problems.

, , , and . CPM, volume 8486 of Lecture Notes in Computer Science, page 1-10. 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

Fault-tolerant spanners for general graphs., , , and . STOC, page 435-444. ACM, (2009)Fault Tolerant Reachability for Directed Graphs., , and . DISC, volume 9363 of Lecture Notes in Computer Science, page 528-543. Springer, (2015)A faster and simpler fully dynamic transitive closure.. SODA, page 404-412. ACM/SIAM, (2003)Roundtrip spanners and roundtrip routing in directed graphs., , and . SODA, page 844-851. ACM/SIAM, (2002)A near-linear time algorithm for computing replacement paths in planar directed graphs., , and . SODA, page 428-435. SIAM, (2008)SINR diagrams: towards algorithmically usable SINR models of wireless networks., , , , , and . PODC, page 200-209. ACM, (2009)Dynamic and static algorithms for path problems in graphs. Tel Aviv University, Israel, (2006)Tel Aviv University Library.Approximating the Girth., and . SODA, page 1446-1454. SIAM, (2011)Better Approximation Algorithms for the Graph Diameter., , , , , and . SODA, page 1041-1052. SIAM, (2014)Dynamic Connectivity in Disk Graphs., , , , , , and . SoCG, volume 224 of LIPIcs, page 49:1-49:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)