2013
52Coverage with k-transmitters in the presence of obstacles. Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara. J. Comb. Optim. (25): 208-233 (2013). Web SearchBibTeXDownload
2011
51Almost all Delaunay triangulations have stretch factor greater than pi/2. Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma. Comput. Geom. (44): 121-127 (2011). Web SearchBibTeXDownload
50Computing Signed Permutations of Polygons. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint. Int. J. Comput. Geometry Appl. (21): 87-100 (2011). Web SearchBibTeXDownload
2010
49Common Unfoldings of Polyominoes and Polycubes. Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin. CGGA 2010, 44-54. Web SearchBibTeXDownload
48Coverage with k-Transmitters in the Presence of Obstacles. Brad Ballinger, Nadia Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara. COCOA (2) 2010, 1-15. Web SearchBibTeXDownload
47Filling Holes in Triangular Meshes Using Digital Images by Curve Unfolding. Alan Brunton, Stefanie Wuhrer, Chang Shu, Prosenjit Bose, Erik D. Demaine. International Journal of Shape Modeling (16): 151-171 (2010). Web SearchBibTeXDownload
2009
46Relaxed Gabriel Graphs. Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh. CCCG 2009, 169-172. Web SearchBibTeXDownload
45The spanning ratio of the Delaunay triangulation is greater than pi/2. Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma. CCCG 2009, 165-167. Web SearchBibTeXDownload
44Geometric spanners with small chromatic number. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh. Comput. Geom. (42): 134-146 (2009). Web SearchBibTeXDownload
43Filling holes in triangular meshes by curve unfolding. Alan Brunton, Stefanie Wuhrer, Chang Shu, Prosenjit Bose, Erik D. Demaine. Shape Modeling International 2009, 66-72. Web SearchBibTeXDownload
2008
42Coarse grained parallel algorithms for graph matching. Albert Chan, Frank K. H. A. Dehne, Prosenjit Bose, Markus Latzel. Parallel Computing (34): 47-62 (2008). Web SearchBibTeXDownload
2007
41Vertex Pops and Popturns. Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Perouz Taslakian, Godfried T. Toussaint. CCCG 2007, 137-140. Web SearchBibTeX
40Space-efficient geometric divide-and-conquer algorithms. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold. Comput. Geom. (37): 209-227 (2007). Web SearchBibTeXDownload
39Geometric Spanners With Small Chromatic Number. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh. CoRR (abs/0711.0114) (2007). Web SearchBibTeXDownload
38Geodesic Ham-Sandwich Cuts. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin. Discrete & Computational Geometry (37): 325-339 (2007). Web SearchBibTeXDownload
37Geometric Spanners with Small Chromatic Number. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh. WAOA 2007, 75-88. Web SearchBibTeXDownload
2006
36Equitable subdivisions within polygonal regions. Sergey Bereg, Prosenjit Bose, David G. Kirkpatrick. Comput. Geom. (34): 20-27 (2006). Web SearchBibTeXDownload
35Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid. LATIN 2006, 80-92. Web SearchBibTeXDownload
34On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick. SIAM J. Discrete Math. (20): 412-427 (2006). Web SearchBibTeXDownload
2005
33Guest Editors' Foreword. Peter Gritzmann, Peter Bro Miltersen, Dorothea Wagner, Attila Sali, Ivan Porres. Algorithmica (42): 1-2 (2005). Web SearchBibTeXDownload
32Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid. CoRR (abs/cs/0512091) (2005). Web SearchBibTeXDownload
31Optimizing a constrained convex polygonal annulus. Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich. J. Discrete Algorithms (3): 1-26 (2005). Web SearchBibTeXDownload
2004
30On simplifying dot maps. Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin. Comput. Geom. (27): 43-62 (2004). Web SearchBibTeXDownload
29Approximating geometric bottleneck shortest paths. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh. Comput. Geom. (29): 233-249 (2004). Web SearchBibTeXDownload
28Geodesic ham-sandwich cuts. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin. Symposium on Computational Geometry 2004, 1-9. Web SearchBibTeXDownload
2003
27Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li. Comput. Geom. (26): 209-219 (2003). Web SearchBibTeXDownload
26Approximating Geometric Bottleneck Shortest Paths. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh. STACS 2003, 38-49. Web SearchBibTeXDownload
2002
25Some Aperture-Angle Optimization Problems. Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint. Algorithmica (33): 411-435 (2002). Web SearchBibTeXDownload
24Computing signed permutations of polygons. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint. CCCG 2002, 68-71. Web SearchBibTeXDownload
23Separating an object from its cast. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf. Computer-Aided Design (34): 547-559 (2002). Web SearchBibTeXDownload
22Efficient visibility queries in simple polygons. Prosenjit Bose, Anna Lubiw, J. Ian Munro. Comput. Geom. (23): 313-335 (2002). Web SearchBibTeXDownload
21Online Routing in Convex Subdivisions. Prosenjit Bose, Andrej Brodnik, Andrej Brodnik, Svante Carlsson, Rudolf Fleischer, Alejandro López-Ortiz, J. Ian Munro, Alejandro López-Ortiz. Int. J. Comput. Geometry Appl. (12): 283-296 (2002). Web SearchBibTeXDownload
20On the Spanning Ratio of Gabriel Graphs and beta-skeletons. Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick. LATIN 2002, 479-493. Web SearchBibTeXDownload
2001
19Every Set of Disjoint Line Segments Admits a Binary Tree. Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint. Discrete & Computational Geometry (26): 387-410 (2001). Web SearchBibTeXDownload
18Efficient Algorithms for Petersen's Matching Theorem. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw. J. Algorithms (38): 110-134 (2001). Web SearchBibTeXDownload
2000
17Flipping your Lid. Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin. CCCG 2000. Web SearchBibTeXDownload
16Online Routing in Convex Subdivisions. Prosenjit Bose, Andrej Brodnik, Andrej Brodnik, Svante Carlsson, Rudolf Fleischer, Alejandro López-Ortiz, J. Ian Munro, Alejandro López-Ortiz. ISAAC 2000, 47-59. Web SearchBibTeXDownload
1999
15Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs. Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne, Markus Latzel. IPPS/SPDP 1999, 125-129. Web SearchBibTeXDownload
14Efficient Algorithms for Petersen's Matching Theorem. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw. SODA 1999, 130-139. Web SearchBibTeXDownload
1998
13Recovering lines with fixed linear probes. Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan. CCCG 1998. Web SearchBibTeXDownload
12Computing constrained minimum-width annuli of point sets. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong. Computer-Aided Design (30): 267-275 (1998). Web SearchBibTeXDownload
11A Visibility Representation for Graphs in Three Dimensions. Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle. J. Graph Algorithms Appl. (2) (1998). Web SearchBibTeXDownload
1997
10Optimal Algorithms to Embed Trees in a Point Set. Prosenjit Bose, Michael McAllister, Jack Snoeyink. J. Graph Algorithms Appl. (1) (1997). Web SearchBibTeXDownload
9Separating an Object from its Cast. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf. Symposium on Computational Geometry 1997, 221-230. Web SearchBibTeXDownload
8Computing Constrained Minimum-Width Annuli of Point Sets. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong. WADS 1997, 392-401. Web SearchBibTeXDownload
1996
7Approximating Shortest Paths in Arrangements of Lines. Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink. CCCG 1996, 143-148. Web SearchBibTeX
6Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li. CCCG 1996, 217-222. Web SearchBibTeX
5The Complexity of Rivers in Triangulated Terrains. Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu. CCCG 1996, 325-330. Web SearchBibTeX
4On the Sectional Area of Convex Polytopes. David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink. Symposium on Computational Geometry 1996, C-11-C-12. Web SearchBibTeXDownload
1995
3Optimal Algorithms to Embed Trees in a Point Set. Prosenjit Bose, Michael McAllister, Jack Snoeyink. Graph Drawing 1995, 64-75. Web SearchBibTeXDownload
1994
2Proximity Constraints and Representable Trees. Prosenjit Bose, Giuseppe Di Battista, William Lenhart, Giuseppe Liotta. Graph Drawing 1994, 340-351. Web SearchBibTeXDownload
1Every Set of Disjoint Line Segments Admits a Binary Tree. Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint. ISAAC 1994, 20-28. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research