Prosenjit Bose spends much of his time researching Combinatorics, Discrete mathematics, Planar graph, Time complexity and Delaunay triangulation. Prosenjit Bose has included themes like Routing and Plane in his Combinatorics study. The various areas that Prosenjit Bose examines in his Discrete mathematics study include Upper and lower bounds and Optimal binary search tree.
His work deals with themes such as Graph embedding, Outerplanar graph and Degree, which intersect with Planar graph. The concepts of his Delaunay triangulation study are interwoven with issues in Shortest path problem and Euclidean distance. His studies deal with areas such as Distributed algorithm, Wireless network, Adaptive quality of service multi-hop routing and Greedy embedding as well as Destination-Sequenced Distance Vector routing.
Prosenjit Bose mainly investigates Combinatorics, Discrete mathematics, Plane, Upper and lower bounds and Time complexity. His Combinatorics research includes themes of Point and Regular polygon. His study looks at the relationship between Plane and fields such as Degree, as well as how they intersect with chemical problems.
His Time complexity study frequently links to related topics such as Computational geometry. His work carried out in the field of Delaunay triangulation brings together such families of science as Routing, Shortest path problem and Euclidean distance. His Planar graph research is multidisciplinary, relying on both Geometric graph theory and Outerplanar graph.
Prosenjit Bose focuses on Combinatorics, Point, Line segment, Binary logarithm and Euclidean distance. His Combinatorics research is multidisciplinary, incorporating elements of Plane and Boundary. As a part of the same scientific family, he mostly works in the field of Point, focusing on Visibility polygon and, on occasion, Boolean satisfiability problem, Reduction, Computational complexity theory and Time complexity.
His work in Line segment covers topics such as Visibility graph which are related to areas like Routing and Upper and lower bounds. His Delaunay triangulation study integrates concerns from other disciplines, such as Regular polygon, Point set and Vertex. His research in Vertex focuses on subjects like Routing algorithm, which are connected to Discrete mathematics.
Combinatorics, Line segment, Plane, Graph and Upper and lower bounds are his primary areas of study. Prosenjit Bose has researched Combinatorics in several fields, including Regular polygon and Euclidean distance. Prosenjit Bose studied Regular polygon and Time complexity that intersect with Polygon.
His biological study spans a wide range of topics, including Discrete mathematics, Path, Graph drawing and Planar graph. His work in Graph tackles topics such as Spatial network which are related to areas like Delaunay triangulation and Bipartite graph. His Upper and lower bounds study incorporates themes from Line, Mathematical optimization, Online algorithm and Position.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Routing with guaranteed delivery in ad hoc wireless networks
Prosenjit Bose;Pat Morin;Ivan Stojmenović;Jorge Urrutia.
Wireless Networks (2001)
Routing with guaranteed delivery in ad hoc wireless networks
Prosenjit Bose;Pat Morin;Ivan Stojmenović;Jorge Urrutia.
Wireless Networks (2001)
Online Routing in Triangulations
Prosenjit Bose;Pat Morin.
SIAM Journal on Computing (2004)
Online Routing in Triangulations
Prosenjit Bose;Pat Morin.
SIAM Journal on Computing (2004)
Pattern matching for permutations
Prosenjit Bose;Jonathan F. Buss;Anna Lubiw.
Information Processing Letters (1998)
Pattern matching for permutations
Prosenjit Bose;Jonathan F. Buss;Anna Lubiw.
Information Processing Letters (1998)
On the Spanning Ratio of Gabriel Graphs and beta -Skeletons
Prosenjit Bose;Luc Devroye;William Evans;David Kirkpatrick.
SIAM Journal on Discrete Mathematics (2006)
On the false-positive rate of Bloom filters
Prosenjit Bose;Hua Guo;Evangelos Kranakis;Anil Maheshwari.
Information Processing Letters (2008)
On the false-positive rate of Bloom filters
Prosenjit Bose;Hua Guo;Evangelos Kranakis;Anil Maheshwari.
Information Processing Letters (2008)
On embedding an outer-planar graph in a point set
Prosenjit Bose.
Computational Geometry: Theory and Applications (2002)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Carleton University
New York University Abu Dhabi
Monash University
Carleton University
McGill University
University of North Carolina at Chapel Hill
MIT
University of Sydney
Utrecht University
Smith College
Bar-Ilan University
University of Warwick
IBM (United States)
Technical University of Munich
Polytechnic University of Milan
University of Malaya
Hokkaido University
The University of Texas at Austin
Durham University
Russian Academy of Sciences
National Oceanic and Atmospheric Administration
Max Delbrück Center for Molecular Medicine
University of Tübingen
University of Zurich
Brigham and Women's Hospital
University of Michigan–Ann Arbor