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