The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Prosenjit Bose: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Prosenjit Bose, Marc J. van Kreveld
    Computing nice sweeps for polyhedra and polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:108-111 [Conf]
  2. Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin
    Flipping your Lid. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  3. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
    Computing signed permutations of polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:68-71 [Conf]
  4. Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan
    Recovering lines with fixed linear probes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  5. Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu
    The Complexity of Rivers in Triangulated Terrains. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:325-330 [Conf]
  6. Prosenjit Bose, David Bremner, Godfried T. Toussaint
    All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:344-349 [Conf]
  7. Prosenjit Bose, Jean-Denis Caron, Kilani Ghoudi
    Detection of text-line orientation. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  8. Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Dominic Lessard
    Near optimal-partitioning of rectangles and prisms. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  9. Prosenjit Bose, Jurek Czyzowicz, Dominic Lessard
    Cutting rectangles in equal area pieces. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  10. Prosenjit Bose, Luc Devroye, William S. Evans
    Diamonds Are Not a Minimum Weight Triangulation's Best Friend. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:68-73 [Conf]
  11. Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink
    Approximating Shortest Paths in Arrangements of Lines. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:143-148 [Conf]
  12. Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia
    The Floodlight Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:399-404 [Conf]
  13. Patrice Belleville, Prosenjit Bose, Jurek Czyzowicz, Jorge Urrutia, Joseph Zaks
    K-Guarding Polygons on the Plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:381-386 [Conf]
  14. Prosenjit Bose, Joachim Gudmundsson, Pat Morin
    Ordered theta graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:17-21 [Conf]
  15. Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint
    Finding specified sections of arrangements: 2d results. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  16. Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li
    Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:217-222 [Conf]
  17. Prosenjit Bose, Jason Morrison
    Translating a Star over a Point Set. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:179-182 [Conf]
  18. Prosenjit Bose, Carlos Seara, Saurabh Sethia
    On computing enclosing isosceles triangles and related problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:120-123 [Conf]
  19. Prosenjit Bose, Michiel H. M. Smid, David R. Wood
    Light edges in degree-constrained graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:142-145 [Conf]
  20. Prosenjit Bose, Godfried T. Toussaint
    Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application. [Citation Graph (0, 0)][DBLP]
    Computer Graphics International, 1996, pp:102-110 [Conf]
  21. Anthony Whitehead, Prosenjit Bose, Robert Laganière
    Feature Based Cut Detection with Automatic Threshold Selection. [Citation Graph (0, 0)][DBLP]
    CIVR, 2004, pp:410-418 [Conf]
  22. Prosenjit Bose, Pat Morin, Antoine Vigneron
    Packing Two Disks into a Polygonal Environment. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:142-149 [Conf]
  23. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
    Separating an Object from its Cast. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:221-230 [Conf]
  24. David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink
    On the Sectional Area of Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-11 [Conf]
  25. Prosenjit Bose, David Bremner, Marc J. van Kreveld
    Determining the Castability of Simple Polyhedra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:123-131 [Conf]
  26. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
    Geodesic ham-sandwich cuts. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:1-9 [Conf]
  27. Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr
    Traversing a set of points with a minimum number of turns. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:46-55 [Conf]
  28. Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia
    Routing with guaranteed delivery in ad hoc wireless networks. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 1999, pp:48-55 [Conf]
  29. Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid
    Constructing Plane Spanners of Bounded Degree and Low Weight. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:234-246 [Conf]
  30. Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu
    Feasability of Design in Stereolithography. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:228-237 [Conf]
  31. Greg Aloupis, Prosenjit Bose, Pat Morin
    Reconfiguring Triangulations with Edge Flips and Point Moves. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:1-11 [Conf]
  32. Prosenjit Bose
    On Embedding an Outer-Planar Graph in a Point Set. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:25-36 [Conf]
  33. Prosenjit Bose, Giuseppe Di Battista, William Lenhart, Giuseppe Liotta
    Proximity Constraints and Representable Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:340-351 [Conf]
  34. Prosenjit Bose, Alice M. Dean, Joan P. Hutchinson, Thomas C. Shermer
    On Rectangle Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:25-44 [Conf]
  35. Prosenjit Bose, Francisco Gómez, Pedro A. Ramos, Godfried T. Toussaint
    Drawing Nice Projections of Objects in Space. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:52-63 [Conf]
  36. Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
    Partitions of Complete Geometric Graphs into Plane Trees. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:71-81 [Conf]
  37. Prosenjit Bose, Michael McAllister, Jack Snoeyink
    Optimal Algorithms to Embed Trees in a Point Set. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:64-75 [Conf]
  38. Manuel Abellanas, Prosenjit Bose, Alfredo García Olaverri, Ferran Hurtado, Pedro A. Ramos, Eduardo Rivera-Campo, Javier Tejel
    On Local Transformations in Plane Geometric Graphs Embedded on Small Grids. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2004, pp:22-31 [Conf]
  39. Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne, M. Latzel
    Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:125-129 [Conf]
  40. Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint
    Every Set of Disjoint Line Segments Admits a Binary Tree. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:20-28 [Conf]
  41. Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg
    Station Layouts in the Presence of Location Constraints. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:269-278 [Conf]
  42. Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec
    Strategies for Hotlink Assignments. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:23-34 [Conf]
  43. Prosenjit Bose, Pat Morin
    An Improved Algorithm for Subdivision Traversal without Extra Storage. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:444-455 [Conf]
  44. Prosenjit Bose, Pat Morin
    Testing the Quality of Manufactured Disks and Cylinders. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:129-138 [Conf]
  45. Prosenjit Bose, Pat Morin
    Online Routing in Triangulations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:113-122 [Conf]
  46. Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz
    Online Routing in Convex Subdivisions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:47-59 [Conf]
  47. Prosenjit Bose, Michiel H. M. Smid, Daming Xu
    Diamond Triangulations Contain Spanners of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:173-182 [Conf]
  48. Prosenjit Bose, Godfried T. Toussaint
    No Quadrangulation is Extremely Odd. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:372-381 [Conf]
  49. Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari
    Polygon Cutting: Revisited. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:81-92 [Conf]
  50. Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari
    Algorithms for Packing Two Circles in a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:93-103 [Conf]
  51. Prosenjit Bose, Luc Devroye, Pat Morin
    Succinct Data Structures for Approximating Convex Functions with Applications. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:97-107 [Conf]
  52. Prosenjit Bose, Stefan Langerman
    Weighted Ham-Sandwich Cuts. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:48-53 [Conf]
  53. Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
    Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:80-92 [Conf]
  54. Prosenjit Bose, Qingda Wang
    Facility Location Constrained to a Polygonal Domain. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:153-164 [Conf]
  55. Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick
    On the Spanning Ratio of Gabriel Graphs and beta-skeletons. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:479-493 [Conf]
  56. Mathieu Couture, Michel Barbeau, Prosenjit Bose, Evangelos Kranakis
    Incremental Construction of k-Dominating Sets in Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:202-214 [Conf]
  57. Anthony Whitehead, Prosenjit Bose, Veronique Audet
    High-speed texture-preserving digital image inpainting. [Citation Graph (0, 0)][DBLP]
    SIP, 2005, pp:526-531 [Conf]
  58. Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin
    Asymmetric Communication Protocols via Hotlink Assignments. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:33-39 [Conf]
  59. Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang
    Bounds for Frequency Estimation of Packet Streams. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:33-42 [Conf]
  60. Prosenjit Bose, Pat Morin
    Competitive Online Routing in Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:35-44 [Conf]
  61. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw
    Efficient Algorithms for Petersen's Matching Theorem. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:130-139 [Conf]
  62. Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood
    Simultaneous diagonal flips in plane triangulations. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:212-221 [Conf]
  63. Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang
    Approximate Range Mode and Range Median Queries. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:377-388 [Conf]
  64. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
    Approximating Geometric Bottleneck Shortest Paths. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:38-49 [Conf]
  65. Anthony Whitehead, Robert Laganière, Prosenjit Bose
    Temporal Synchronization of Video Sequences in Theory and in Practice. [Citation Graph (0, 0)][DBLP]
    WACV/MOTION, 2005, pp:132-137 [Conf]
  66. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
    Computing Constrained Minimum-Width Annuli of Point Sets. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:392-401 [Conf]
  67. Prosenjit Bose, Jonathan F. Buss, Anna Lubiw
    Pattern Matching for Permutations. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:200-209 [Conf]
  68. Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint
    Filling Polyhedral Molds. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:210-221 [Conf]
  69. Prosenjit Bose, Pat Morin
    Testing the Quality of Manufactured Balls. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:145-156 [Conf]
  70. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison
    The Grid Placement Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:180-191 [Conf]
  71. Gill Barequet, Prosenjit Bose, Matthew Dickerson
    Optimizing Constrained Offset and Scaled Polygonal Annuli. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:62-73 [Conf]
  72. Prosenjit Bose, Vida Dujmovic, David R. Wood
    Induced Subgraphs of Bounded Degree and Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:175-186 [Conf]
  73. Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu
    Feasibility of Design in Stereolithography. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:1/2, pp:61-83 [Journal]
  74. Prosenjit Bose, David Bremner, Marc J. van Kreveld
    Determining the Castability of Simple Polyhedra. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:1/2, pp:84-113 [Journal]
  75. Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid
    Constructing Plane Spanners of Bounded Degree and Low Weight. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:3-4, pp:249-264 [Journal]
  76. Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint
    Some Aperture-Angle Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:4, pp:411-435 [Journal]
  77. Prosenjit Bose, William Lenhart, Giuseppe Liotta
    Characterizing Proximity Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:1, pp:83-110 [Journal]
  78. Prosenjit Bose, Pat Morin
    Testing the Quality of Manufactured Disks and Balls. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:1, pp:161-177 [Journal]
  79. Prosenjit Bose, Pat Morin
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:1, pp:1-2 [Journal]
  80. Prosenjit Bose, Godfried T. Toussaint
    Geometric and computational aspects of gravity casting. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1995, v:27, n:6, pp:455-464 [Journal]
  81. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
    Separating an object from its cast. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2002, v:34, n:8, pp:547-559 [Journal]
  82. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
    Computing constrained minimum-width annuli of point sets. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1998, v:30, n:4, pp:267-275 [Journal]
  83. Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint
    Filling polyhedral molds. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1998, v:30, n:4, pp:245-254 [Journal]
  84. Prosenjit Bose, Suneeta Ramaswami, Godfried T. Toussaint, Alain Turki
    Experimental results on quadrangulations of sets of fixed points. [Citation Graph (0, 0)][DBLP]
    Computer Aided Geometric Design, 2002, v:19, n:7, pp:533-552 [Journal]
  85. Prosenjit Bose, Godfried T. Toussaint
    Characterizing and efficiently computing quadrangulations of planar point sets. [Citation Graph (0, 0)][DBLP]
    Computer Aided Geometric Design, 1997, v:14, n:8, pp:763-785 [Journal]
  86. Prosenjit Bose, Godfried T. Toussaint
    Geometric and computational aspects of manufacturing processes. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 1994, v:18, n:4, pp:487-497 [Journal]
  87. Sergey Bereg, Prosenjit Bose, J. David Kirkpatrick
    Equitable subdivisions within polygonal regions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:20-27 [Journal]
  88. Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin
    On simplifying dot maps. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:43-62 [Journal]
  89. Prosenjit Bose
    On embedding an outer-planar graph in a point set. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:3, pp:303-312 [Journal]
  90. Prosenjit Bose, David Bremner, Godfried T. Toussaint
    All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:291-302 [Journal]
  91. Prosenjit Bose, Luc Devroye
    Intersections with random geometric objects. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:3, pp:139-154 [Journal]
  92. Prosenjit Bose, Joachim Gudmundsson, Pat Morin
    Ordered theta graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:1, pp:11-18 [Journal]
  93. Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
    Partitions of complete geometric graphs into plane trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:116-125 [Journal]
  94. Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li
    Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:3, pp:209-219 [Journal]
  95. Prosenjit Bose, Marc J. van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison
    Translating a regular grid over a point set. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:21-34 [Journal]
  96. Prosenjit Bose, Anna Lubiw, J. Ian Munro
    Efficient visibility queries in simple polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:3, pp:313-335 [Journal]
  97. Prosenjit Bose, Anil Maheshwari, Pat Morin
    Fast approximations for sums of distances, clustering and the Fermat-Weber problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:3, pp:135-146 [Journal]
  98. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
    Approximating geometric bottleneck shortest paths. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:3, pp:233-249 [Journal]
  99. Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu
    Guarding Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:173-185 [Journal]
  100. Prosenjit Bose, Luc Devroye
    On the stabbing number of a random Delaunay triangulation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:2, pp:89-105 [Journal]
  101. Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint
    Every Set of Disjoint Line Segments Admits a Binary Tree. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:387-410 [Journal]
  102. Prosenjit Bose, Michiel H. M. Smid, David R. Wood
    Light edges in degree-constrained graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:35-41 [Journal]
  103. Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro
    Online Routing in Convex Subdivisions. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:4, pp:283-296 [Journal]
  104. Prosenjit Bose, Luc Devroye, William S. Evans
    Diamonds are Not a Minimum Weight Triangulation's Best Friend. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:6, pp:445-454 [Journal]
  105. Prosenjit Bose, Hazel Everett, Stephen K. Wismath
    Properties of Arrangement Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:6, pp:447-462 [Journal]
  106. Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia
    The Floodlight Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:1/2, pp:153-163 [Journal]
  107. Prosenjit Bose, Marc J. van Kreveld
    Generalizing Monotonicity: on Recognizing Special Classes of Polygons and Polyhedra. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:6, pp:591-608 [Journal]
  108. Prosenjit Bose, Pat Morin
    An Improved Algorithm for Subdivision Traversal without Extra Storage. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:4, pp:297-308 [Journal]
  109. Prosenjit Bose, Jonathan F. Buss, Anna Lubiw
    Pattern Matching for Permutations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:5, pp:277-283 [Journal]
  110. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw
    Efficient Algorithms for Petersen's Matching Theorem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:110-134 [Journal]
  111. Prosenjit Bose, Godfried T. Toussaint
    Growing a Tree from Its Branches. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:1, pp:86-103 [Journal]
  112. Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich
    Optimizing a constrained convex polygonal annulus. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:1, pp:1-26 [Journal]
  113. Prosenjit Bose, Pat Morin, Antoine Vigneron
    Packing two disks into a polygonal environment. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:3, pp:373-380 [Journal]
  114. Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann
    Area-preserving approximations of polygonal paths. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:554-566 [Journal]
  115. Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David R. Wood
    The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:, pp:21-26 [Journal]
  116. 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
    A Visibility Representation for Graphs in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  117. Prosenjit Bose, Michael McAllister, Jack Snoeyink
    Optimal Algorithms to Embed Trees in a Point Set. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1997, v:1, n:, pp:- [Journal]
  118. Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristan, Thomas C. Shermer, Godfried T. Toussaint
    Finding Specified Sections of Arrangements: 2D Results. [Citation Graph (0, 0)][DBLP]
    J. Math. Model. Algorithms, 2002, v:1, n:1, pp:3-16 [Journal]
  119. Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Krizanc, David Peleg
    Station Layouts in the Presence of Location Constraints. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2002, v:3, n:1-2, pp:1-17 [Journal]
  120. Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin
    Asymmetric Communication Protocols via Hotlink Assignments. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:6, pp:655-661 [Journal]
  121. Prosenjit Bose, Pat Morin
    Online Routing in Triangulations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:4, pp:937-951 [Journal]
  122. Prosenjit Bose, Pat Morin
    Competitive online routing in geometric graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:273-288 [Journal]
  123. Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia
    Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2001, v:7, n:6, pp:609-616 [Journal]
  124. Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood
    Simultaneous diagonal flips in plane triangulations. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:4, pp:307-330 [Journal]
  125. Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer
    Linear-Space Algorithms for Distance Preserving Embedding. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:185-188 [Conf]
  126. Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer
    Rotationally Monotone Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  127. Prosenjit Bose, Jason Morrison
    Optimal Polygon Placement. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  128. Prosenjit Bose, David Bremner, Diane L. Souvaine
    Computing the Tool Path of an Externally Monotone Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  129. 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
    Vertex Pops and Popturns. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:137-140 [Conf]
  130. Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stefanie Wuhrer
    Approximations of Geodesic Distances for Incomplete Triangular Manifolds. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:177-180 [Conf]
  131. Prosenjit Bose, Jason Morrison
    Optimal Point Set Partitioning using Rigid Motion Star Placement. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:49-52 [Conf]
  132. Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis
    Location Oblivious Distributed Unit Disk Graph Coloring. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:222-233 [Conf]
  133. Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
    On a Family of Strong Geometric Spanners That Admit Local Routing Strategies. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:300-311 [Conf]
  134. Prosenjit Bose, Aaron Lee, Michiel H. M. Smid
    On Generalized Diamond Spanners. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:325-336 [Conf]
  135. Evan Hahn, Prosenjit Bose, Anthony Whitehead
    Lazy Generation of Building Interiors in Realtime. [Citation Graph (0, 0)][DBLP]
    CCECE, 2006, pp:2441-2444 [Conf]
  136. Greg Aloupis, Prosenjit Bose, Pat Morin
    Reconfiguring Triangulations with Edge Flips and Point Moves. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:4, pp:367-378 [Journal]
  137. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold
    Space-efficient geometric divide-and-conquer algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:3, pp:209-227 [Journal]
  138. Prosenjit Bose, Thomas Fevens
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:1- [Journal]
  139. Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
    On a family of strong geometric spanners that admit local routing strategies [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  140. Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer
    A Characterization of the Degree Sequences of 2-Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  141. Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood
    A polynomial bound for untangling geometric planar graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  142. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
    Geodesic Ham-Sandwich Cuts. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:3, pp:325-339 [Journal]

  143. Isometric Morphing of Triangular Meshes. [Citation Graph (, )][DBLP]


  144. Triangulating and Guarding Realistic Polygons. [Citation Graph (, )][DBLP]


  145. Smallest enclosing circle centered on a query line segment. [Citation Graph (, )][DBLP]


  146. Relaxed Gabriel Graphs. [Citation Graph (, )][DBLP]


  147. Some properties of higher order delaunay and gabriel graphs. [Citation Graph (, )][DBLP]


  148. On the perimeter of fat objects. [Citation Graph (, )][DBLP]


  149. Fast local searches and updates in bounded universes. [Citation Graph (, )][DBLP]


  150. Minimum enclosing area triangle with a fixed angle. [Citation Graph (, )][DBLP]


  151. The spanning ratio of the Delaunay triangulation is greater than pi/2. [Citation Graph (, )][DBLP]


  152. Every Large Point Set contains Many Collinear Points or an Empty Pentagon. [Citation Graph (, )][DBLP]


  153. On properties of higher-order Delaunay graphs with applications. [Citation Graph (, )][DBLP]


  154. On the Stretch Factor of Convex Delaunay Graphs. [Citation Graph (, )][DBLP]


  155. Layered Working-Set Trees. [Citation Graph (, )][DBLP]


  156. Communication-Efficient Construction of the Plane Localized Delaunay Graph. [Citation Graph (, )][DBLP]


  157. Spanners of Complete k -Partite Geometric Graphs. [Citation Graph (, )][DBLP]


  158. Bounding the locality of distributed routing algorithms. [Citation Graph (, )][DBLP]


  159. Dynamic optimality for skip lists and B-trees. [Citation Graph (, )][DBLP]


  160. Succinct geometric indexes supporting point location queries. [Citation Graph (, )][DBLP]


  161. Computing the Greedy Spanner in Near-Quadratic Time. [Citation Graph (, )][DBLP]


  162. Spanners of Additively Weighted Point Sets. [Citation Graph (, )][DBLP]


  163. An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. [Citation Graph (, )][DBLP]


  164. Improved Methods For Generating Quasi-gray Codes. [Citation Graph (, )][DBLP]


  165. Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. [Citation Graph (, )][DBLP]


  166. Efficient Construction of Near-Optimal Binary and Multiway Search Trees. [Citation Graph (, )][DBLP]


  167. A Distribution-Sensitive Dictionary with Low Space Overhead. [Citation Graph (, )][DBLP]


  168. Geometric Spanners with Small Chromatic Number. [Citation Graph (, )][DBLP]


  169. On the Stretch Factor of the Constrained Delaunay Triangulation. [Citation Graph (, )][DBLP]


  170. Clamshell Casting. [Citation Graph (, )][DBLP]


  171. On local transformations in plane geometric graphs embedded on small grids. [Citation Graph (, )][DBLP]


  172. A linear-space algorithm for distance preserving graph embedding. [Citation Graph (, )][DBLP]


  173. Flips in planar graphs. [Citation Graph (, )][DBLP]


  174. Geometric spanners with small chromatic number. [Citation Graph (, )][DBLP]


  175. Rotationally monotone polygons. [Citation Graph (, )][DBLP]


  176. Editorial CCCG 2005. [Citation Graph (, )][DBLP]


  177. A note on the perimeter of fat objects. [Citation Graph (, )][DBLP]


  178. Geometric Spanners With Small Chromatic Number [Citation Graph (, )][DBLP]


  179. Simultaneous Diagonal Flips in Plane Triangulations [Citation Graph (, )][DBLP]


  180. Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams [Citation Graph (, )][DBLP]


  181. Spanners of Complete $k$-Partite Geometric Graphs [Citation Graph (, )][DBLP]


  182. Spanners of Additively Weighted Point Sets [Citation Graph (, )][DBLP]


  183. On the Stretch Factor of Convex Delaunay Graphs [Citation Graph (, )][DBLP]


  184. Morphing of Triangular Meshes in Shape Space [Citation Graph (, )][DBLP]


  185. Succinct Geometric Indexes Supporting Point Location Queries [Citation Graph (, )][DBLP]


  186. Communication-Efficient Construction of the Plane Localized Delaunay Graph [Citation Graph (, )][DBLP]


  187. Layered Working-Set Trees [Citation Graph (, )][DBLP]


  188. Point Location in Disconnected Planar Subdivisions [Citation Graph (, )][DBLP]


  189. Pi/2-Angle Yao Graphs are Spanners [Citation Graph (, )][DBLP]


  190. Odds-On Trees [Citation Graph (, )][DBLP]


  191. An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times [Citation Graph (, )][DBLP]


  192. The dilation of the Delaunay triangulation is greater than π/2 [Citation Graph (, )][DBLP]


  193. Should Static Search Trees Ever Be Unbalanced? [Citation Graph (, )][DBLP]


  194. Traversing a Set of Points with a Minimum Number of Turns. [Citation Graph (, )][DBLP]


  195. A Polynomial Bound for Untangling Geometric Planar Graphs. [Citation Graph (, )][DBLP]


Search in 0.282secs, Finished in 0.292secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002