( en | de | ru )

 

Disambiguation of "Bose, Prosenjit"

Author of the publication

copydeleteadd this publication to your clipboard
Fast approximations for sums of distances, clustering and the Fermat-Weber problem.

, , and . Comput. Geom., 24 (3): 135-146 (2003)

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.

Michael Böse

Peter Bose

Michael Böse

Michael Bose

Olaf Böse

 

Other publications of authors with the same name

Maximum Plane Trees in Multipartite Geometric Graphs., , , , , , and . Algorithmica, 81 (4): 1512-1534 (2019)Constrained generalized Delaunay graphs are plane spanners., , and . Comput. Geom., (2018)Continuous Yao graphs., , , , , , , , , and . Comput. Geom., (2018)Asymmetric Communication Protocols via Hotlink Assignments., , , and . Theory Comput. Syst., 36 (6): 655-661 (2003)Efficient Algorithms for Petersen's Matching Theorem., , , and . J. Algorithms, 38 (1): 110-134 (2001)Guest Editors' Foreword., and . Algorithmica, 42 (1): 1-2 (2005)Routing with guaranteed delivery in ad hoc wireless networks., , , and . DIAL-M, page 48-55. ACM, (1999)Computing the k-Crossing Visibility Region of a Point in a Polygon., , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 10-21. Springer, (2019)Online Routing in Triangulations., and . ISAAC, volume 1741 of Lecture Notes in Computer Science, page 113-122. Springer, (1999)Essential Constraints of Edge-Constrained Proximity Graphs., , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 55-67. Springer, (2016)