( en | de | ru )

 

Disambiguation of "Bose, Prosenjit"

Author of the publication

copydeleteadd this publication to your clipboard
Competitive Routing on a Bounded-Degree Plane Spanner.

, , , and . CCCG, page 285-290. (2012)

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.

Peter Bose

Michael Böse

Tarit Bose

Peter Böse

Detlef Böse

 

Other publications of authors with the same name

Competitive Online Routing in Geometric Graphs., and . SIROCCO, volume 8 of Proceedings in Informatics, page 35-44. Carleton Scientific, (2001)Efficient Algorithms for Petersen's Matching Theorem., , , and . SODA, page 130-139. ACM/SIAM, (1999)Routing with guaranteed delivery in ad hoc wireless networks., , , and . DIAL-M, page 48-55. ACM, (1999)Constrained generalized Delaunay graphs are plane spanners., , and . Comput. Geom., (2018)Plane Bichromatic Trees of Low Degree., , , and . Discret. Comput. Geom., 59 (4): 864-885 (2018)A Plane 1.88-Spanner for Points in Convex Position., , , , , and . SWAT, volume 53 of LIPIcs, page 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Spanners of Complete k -Partite Geometric Graphs., , , , , and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 170-181. Springer, (2008)Computing the Greedy Spanner in Near-Quadratic Time., , , , and . SWAT, volume 5124 of Lecture Notes in Computer Science, page 390-401. Springer, (2008)Spanners of Additively Weighted Point Sets., , and . SWAT, volume 5124 of Lecture Notes in Computer Science, page 367-377. Springer, (2008)An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times., , , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 38-49. Springer, (2010)