Author of the publication

Efficient Oracles and Routing Schemes for Replacement Paths.

, , , , , and . STACS, volume 96 of LIPIcs, page 13:1-13:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

Probabilistic models for images and quadtrees: differences and equivalences., and . Image Vis. Comput., 17 (9): 659-665 (1999)An Improved Upper Bound for Scalable Distributed Search Trees., , and . WDAS, volume 14 of Proceedings in Informatics, page 15-28. Carleton Scientific, (2002)Finding single-source shortest p-disjoint paths: fast computation and sparse preservers., , , , , and . CoRR, (2021)An efficient spatial access method for spatial images containing multiple non-overlapping features., and . Inf. Syst., 25 (8): 553-568 (2000)MOF-Tree: A Spatial Access Method to Manipulate Multiple Overlapping Features., , , and . Inf. Syst., 22 (8): 465-481 (1997)Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game., , and . Algorithms, 14 (1): 8 (2021)An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks.. Acta Informatica, 36 (4): 257-266 (1999)Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor., and . Theor. Comput. Sci., 383 (1): 23-33 (2007)On the complexity of minimizing interference in ad-hoc and sensor networks., and . Theor. Comput. Sci., 402 (1): 43-55 (2008)Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem., and . Algorithmica, 49 (3): 171-191 (2007)