Prosenjit Bose's Publications

For any publications I haven't gotten around to putting online, please send me an email (jit@scs.carleton.ca) and I will send you a copy.

Journal Publications

[1]
P. BOSE, J-L. DE CARUFEL, C. GRIMM, A. MAHESHWARI AND M. SMID. On Farthest-Point Information in Networks. Journal of Computational Geometry, accepted, 2013.

[2]
P. BOSE AND J-L. DE CARUFEL. Isoperimetric Triangular Enclosures. Journal of Geometry, accepted, 2013.

[3]
P. BOSE AND J-L. DE CARUFEL. Minimum-area enclosing triangle with fixed angle. Computational Geometry: Theory and Applications, accepted, 2013.

[4]
P. BOSE, P. CARMI, M. DAMIAN, R. FLATLAND, M. KATZ AND A. MAHESHWARI. Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Algorithmica, accepted, 2012.

[5]
P. BOSE, D. JANSENS, A. VAN RENSSEN, M. SAUMELL AND S. VERDONSCHOT. Making triangulations 4-connected using flips. Computational Geometry: Theory and Applications, accepted, 2012.

[6]
P. BOSE AND M. KEIL. On the Stretch Factor of the Constrained Delaunay Triangulation. Journal of Discrete Algorithms, accepted, 2009.

[7]
P. BOSE, V. DUJMOVIC, P. MORIN AND M. SMID. Robust Geometric Spanners. Siam Journal of Computing, 42(4), pp. 1720-1736, 2013.

[8]
P. BOSE AND M. SMID. On Plane Geometric Spanners: A Survey and Open Problems. Computational Geometry: Theory and Applications, 46(7), pp. 818-830, 2013.

[9]
P. BOSE, P. CARMI AND S. DUROCHER. Bounding the Locality of Distributed Routing Algorithms. Distributed Computing, 26(1), pp. 39-58, 2013.

[10]
P. BOSE, P. CARMI, L. CHAITMAN, S. COLLETTE, M. KATZ AND S. LANGERMAN. Stable Roommate Spanner. Computational Geometry: Theory and Applications, 46(2), pp. 120-130, 2013.

[11]
B. BALLINGER, N. BENBERNOU, P. BOSE, M. DAMIAN, E. D. DEMAINE, V. DUJMOVIC, R. FLATLAND, F. HURTADO, J. IACONO, A. LUBIW, P. MORIN, V. SACRISTAN, D. SOUVAINE AND R. UEHARA. Coverage with K-transmitters in the presence of obstacles. Journal of Combinatorial Optimization, 25(2), pp. 208-233, 2013.

[12]
P. BOSE, K. DOUÏEB, J. HOWAT AND P. MORIN. Fast local searches and updates in bounded universes. Computational Geometry: Theory and Applications, 46(2), pp. 181-189, 2013.

[13]
P. BOSE, V. CAMPOS, S. COLLETTE, F. HURTADO, M. KORMAN, S. LANGERMAN, V. SACRISTAN AND M. SAUMELL Some properties of $k$-Delaunay and $k$-Gabriel graphs. Computational Geometry: Theory and Applications, 46(2), pp. 131-139, 2013.

[14]
P. BOSE, P. CARMI AND L. CHAITMAN. Bounded Degree Plane Strong Geometric Spanners. Journal of Discrete Algorithms, 15, pp. 16-31, 2012.

[15]
P. BOSE, M. DAMIAN, K. DOUÏEB, J. O'ROURKE, B. SEAMONE, M. SMID AND S. WUHRER. $\pi/2$-Angle Yao Graphs are Spanners. International Journal of Computational Geometry Special Issue for ISAAC, 22(1), pp. 61-82 2012.

[16]
P. BOSE, V. DUJMOVIC, F. HURTADO, J. IACONO, S. LANGERMAN, H. MEIJER, V. SACRISTAN, M. SAUMELL AND D. WOOD. Proximity Graphs: $E, \delta, \Delta, \chi,$ and $\omega$. International Journal of Computational Geometry, 22(5), pp. 439-469, 2012.

[17]
P. BOSE, P. MORIN AND J. HOWAT. A Distribution-Sensitive D ictionary with Low Space Overhead. Journal of Discrete Algorithms, 10, pp. 140-145, 2012.

[18]
P. BOSE, E. CHEN, M. HE, A. MAHESHWARI AND P. MORIN. Succinct Geometric Indexes Supporting Point Location Queries. ACM Transactions on Algorithms, 8(2), pp. 10:10-26, 2012.

[19]
P. BOSE, K. DOUÏEB, V. DUJMOVIC AND J. HOWAT. Layered Working-Set Trees. Algorithmica, 63(1), pp. 476-489, 2012.

[20]
P. BOSE, P. CARMI AND M. COUTURE. Spanners of Additively Weighted Point Sets. Journal of Discrete Algorithms, 9(3), pp. 287-298, 2011.

[21]
P. BOSE, P. CARMI, F. HURTADO AND P. MORIN. A generalized Winternitz theorem. Journal of Geometry, 100, pp. 29-35, 2011.

[22]
P. BOSE, A. MAHESHWARI, C. SHU AND S. WUHRER. A Survey of Geodesic Paths on 3D Surfaces. Computational Geometry: Theory and Applications, 44, pp. 486-498, 2011.

[23]
P. BOSE, M. MORA, C. SEARA AND S. SETHIA. On Computing Enclosing Isosceles Triangles and Related Problems. International Journal of Computational Geometry, 21(1), pp. 25-45, 2011.

[24]
P. BOSE, P. CARMI, M. COUTURE, M. SMID AND D. XU. On a family of strong geometric spanners that admit local routing strategies. Computational Geometry: Theory and Applications, 44, pp. 319-328, 2011.

[25]
M. COUTURE, M. BARBEAU, P. BOSE, P. CARMI AND E. KRANAKIS. Location Oblivious Distributed Unit Disk Graph Coloring. Algorithmica, 60(2), pp.236-249, 2011.

[26]
G. ALOUPIS, P. BOSE, E. D. DEMAINE, S. LANGERMAN, H. MEIJER, M. OVERMARS AND G. T. TOUSSAINT. Computing Signed Permutations of Polygons. International Journal of Computational Geometry, 21(1), pp. 87-100, 2011.

[27]
P. BOSE, O. CHEONG AND V. DUJMOVIC. A note on the perimeter of fat objects. Computational Geometry: Theory and Applications, 44(2), pp. 1-8, 2011.

[28]
P. BOSE, L. DEVROYE, M. LOFFLER, J. SNOEYINK AND V. VERMA. Almost all Delaunay triangulations have stretch factor greater than $\pi/2$. Computational Geometry: Theory and Applications, 44(2), pp. 121-127, 2011.

[29]
Z. ABEL, B. BALLINGER, P. BOSE, S. COLLETTE, V. DUJMOVIC, F. HURTADO, S. KOMINERS, S. LANGERMAN, A. POR AND D. WOOD. Every large point set contains many collinear points or an empty pentagon. Graphs and Combinatorics, 27(1), pp. 47-60, 2011.

[30]
A. BRUNTON, S. WUHRER, C. SHU, P. BOSE AND E. D. DEMAINE. Filling Holes in Triangular Meshes using Digital Images by Curve Unfolding, International Journal of Shape Modeling, 16(1-2), pp. 151-171, 2010.

[31]
S. WUHRER, P. BOSE, C. SHU, J. O'ROURKE AND A. BRUNTON. Morphing of Triangular Meshes in Shape Space, International Journal of Shape Modeling, 16(1-2), pp. 195-212, 2010.

[32]
P. BOSE, P. CARMI, M. FARSHI, A. MAHESHWARI AND M. SMID. Computing the greedy spanner in near-quadratic time, Algorithmica, 58(3), pp. 711-729, 2010.

[33]
P. BOSE, P. CARMI, S. COLLETTE AND M. SMID. On the Stretch Factor of Convex Delaunay Graphs. Journal of Computational Geometry, 1(1), pp. 41-56, 2010.

[34]
P. BOSE, S. COLLETTE, S. LANGERMAN, A. MAHESHWARI, P. MORIN AND M. SMID. Sigma-local graphs. Journal of Discrete Algorithms, 8, pp. 15-23, 2010.

[35]
A. WHITEHEAD, R. LAGANIÈRE AND P. BOSE. Formalization of the General Video Temporal Synchronization Problem. Electronic Letters on Computer Vision and Image Analysis, 8(2), pp. 1-17, 2010.

[36]
P. BOSE, P. MORIN, M. SMID AND S. WUHRER. Rotationally Monotone Polygons. Computational Geometry: Theory and Applications, 42(5), pp. 471-483, 2009.

[37]
D. BRADLEY, G. ROTH AND P. BOSE. ARCloth: Augmented Reality on Cloth with Realistic Illumination. Machine Vision and Applications Journal, 20(2), pp. 85-92, 2009.

[38]
P. BOSE AND F. HURTADO. Flips in Planar Graphs. Computational Geometry: Theory and Applications, 42(1), pp. 60-80, 2009.

[39]
P. BOSE, P. MORIN, M. SMID AND S. WUHRER. Clamshell Casting, Algorithmica, 55(4), pp. 666-702, 2009.

[40]
P. BOSE, P. CARMI, M. COUTURE, A. MAHESHWARI, M. SMID AND N. ZEH. Geometric Spanners with Small Chromatic Number. Computational Geometry: Theory and Applications, 42(2), pp. 134-146, 2009.

[41]
P. BOSE, P. MORIN, P. CARMI, M. COUTURE, A. MAHESHWARI AND M. SMID. Spanners of Complete $k$-partite Geometric Graphs. Siam Journal of Computing, 38(5), pp. 1803-1820, 2009.

[42]
S. BEREG, P. BOSE, A. DUMITRESCU, F. HURTADO AND P. VALTR. Traversing a Set of Points with a Minimum Number of Turns. Discrete and Computational Geometry, 41(4), pp. 513-532, 2009.

[43]
T. ASANO, P. BOSE, P. CARMI, A. MAHESHWARI, C. SHU, M. SMID AND S. WUHRER Linear-Space Algorithms for Distance Preserving Graph Embedding with Applications. Computational Geometry: Theory and Applications, 42(4), pp. 289-304, 2009.

[44]
M. ABELLANAS, P. BOSE, J. GARCÍA, F. HURTADO, C. NICOLÁS AND P. RAMOS. On Properties of Higher Order Delaunay Graphs with Applications. International Journal of Computational Geometry, 19(6), pp. 595-615, 2009.

[45]
P. BOSE, V. DUJMOVIC, F. HURTADO, S. LANGERMAN, P. MORIN AND D. WOOD. A polynomial bound for untangling geometric planar graphs, Discrete and Computational Geometry, 42(4), pp. 570-585, 2009.

[46]
P. BOSE, V. DUJMOVIC, F. HURTADO AND P. MORIN. Connectivity-Preserving Transformations of Binary Images. Computer Vision and Image Understanding, 113(10), pp. 1027-1038, 2009.

[47]
P. BOSE, M. SMID AND D. XU. Diamond Triangulations contain Spanners of Bounded Degree. Algorithmica, 19(2), pp. 199-140, 2009. [pdf]

[48]
R. ATANASSOV, P. BOSE, A. MAHESHWARI, P. MORIN, M. PAQUETTE, M. SMID AND S. WUHRER. Algorithms for optimal outlier removal. Journal of Discrete Algorithms, 7, pp. 239-248, 2009.

[49]
P. BOSE. A note on the Lower Bound of Edge Guards of Polyhedral Terrains. International Journal of Computer Mathematics, 86(4), pp. 577-583, 2009.

[50]
P. BOSE AND A. MUKHOPADHYAY. Guest Editors' Introduction. Computational Geometry: Theory and Applications: Special Issue for CCCG, 42, pp. 363, 2009.

[51]
M. ABELLANAS, P. BOSE, A. GARCÍA, F. HURTADO, P. RAMOS, E. RIVERA-CAMPO AND J. TEJEL. On Local Transformations in Plane Geometric Graphs Embedded on Small Grids. Computational Geometry: Theory and Applications, 39(2), pp. 65-77, 2008.

[52]
M. COUTURE, M. BARBEAU, P. BOSE AND E. KRANAKIS. Incremental Construction of $k$-Dominating Sets in Wireless Sensor Networks. Ad Hoc and Sensor Wireless Networks, 5(1-2), pp. 47-68, 2008.

[53]
P. BOSE, H. GUO, E. KRANAKIS, A. MAHESHWARI, P. MORIN, J. MORRISON, M. SMID AND Y. TANG. On the false-positive rate of Bloom filters. Information Processing Letters, 108(4), pp. 210-213, 2008.

[54]
P. BOSE, V. DUJMOVIC, D. KRIZANC, S. LANGERMAN, P. MORIN, D. WOOD AND S. WUHRER. A Characterization of the Degree Sequence of 2-trees. Journal of Graph Theory, 58(3), pp. 191-209, 2008.

[55]
P. BOSE AND T. FEVENS. Guest Editors' Introduction. Computational Geometry: Theory and Applications: Special Issue for CCCG, 39(1), pp. 1, 2008.

[56]
P. BOSE, N. COLL, F. HURTADO AND J.A. SELLARES. A General Online Approximation Algorithm for Embedded Plane Graphs with Applications. International Journal of Computational Geometry, 17(6), pp. 529-554, 2007.

[57]
Z. AZOUZ, P. BOSE, C. SHU AND S. WUHRER, Posture Invariant Correspondence of Incomplete Triangular Manifolds. International Journal of Shape Modeling, 13(2): pp. 139-157, 2007.

[58]
G. ALOUPIS, P. BOSE AND P. MORIN. Reconfiguring Triangulations with Point Moves and Edge Flips, Algorithmica: Special Issue on Graph Drawing, 47(4), pp. 367-378, 2007.

[59]
P. BOSE, P. MORIN, A. MAHESHWARI, J. MORRISON, M. SMID AND J. VAHRENHOLD. Space-Efficient Geometric Divide-and-Conquer Algorithms. Computational Geometry: Theory and Applications, 37(3), pp. 209-227, 2007.

[60]
P. BOSE, E. D. DEMAINE, F. HURTADO, S. LANGERMAN, J. IACONO AND P. MORIN Geodesic ham-sandwich cuts. Discrete and Computational Geometry, 37(3), pp. 325-339, 2007. .

[61]
P. BOSE, J. CZYZOWICZ, P. MORIN, J. GAO AND D. WOOD. Simultaneous diagonal flips in plane triangulations. Journal of Graph Theory, 54(4), pp. 307-330, 2007.

[62]
P. BOSE AND L. DEVROYE. On the Stabbing Number of a Random Delaunay Triangulation. Computational Geometry: Theory and Applications, 36(2), pp. 89-105, 2007.

[63]
P. BOSE, O. CHEONG, S. CABELLO, J. GUDMUNDSSON, M. VAN KREVELD AND B. SPECKMANN. Area-Preserving approximations of polygonal paths. Journal of Discrete Algorithms, 4(4), pp. 554-566, 2006.

[64]
P. BOSE, L. DEVROYE, W. EVANS AND D. KIRKPATRICK. On the spanning ratio of Gabriel Graphs and $\beta$-skeletons. Siam Journal of Discrete Math, 20(2), pp. 412-427, 2006.

[65]
P. BOSE, V. DUJMOVIC AND D. WOOD. Induced Subgraphs of Bounded Degree and Bounded Treewidth. Contributions to Discrete Mathematics, 1(1), pp. 88-105, 2006.

[66]
P. BOSE, F. HURTADO, E. RIVERA-CAMPO AND D. WOOD. Partitions of the Complete Geometric Graphs into Plane Trees. Computational Geometry: Theory and Applications, 34(2), pp. 116-125, 2006.

[67]
S. BEREG, P. BOSE AND D. KIRKPATRICK. Equitable relatively-convex partitions of simple polygonal regions. Computational Geometry: Theory and Applications: Special issue for Proceedings of the Japanese Conference on Discrete and Computational Geometry, 34(1), pp. 20-27. 2006. [postscript]

[68]
P. BOSE AND M. VAN KREVELD. Generalizing Monotonicity: On Recognizing Special Classes of Polygons and Polyhedra by Computing Nice Sweeps, International Journal of Computational Geometry, 15(6), 2005.

[69]
P. BOSE AND P. MORIN. Guest Editors' Introduction. Theory of Computing Systems: Special Issue for ISAAC, 38(3), pp. 251, 2005.

[70]
P. BOSE AND P. MORIN. Guest Editors' Foreword. Algorithmica: Special Issue for ISAAC, 42(1), pp. 1-2, 2005.

[71]
P. BOSE, J. GUDMUNDSSON AND M. SMID. Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica: Special Issue for ESA, vol. 42, pp. 249-264, 2005.

[72]
G. BAREQUET, P. BOSE, M. DICKERSON AND M. GOODRICH. Matching Points to a Constrained Annulus of a Convex Polygon. Journal of Discrete Algorithms, 3(1), pp. 1-26, 2005. [postscript]

[73]
P. BOSE AND P. MORIN. Online routing in triangulations. Siam Journal of Computing, 33(4), pp. 937-951, 2004. [postscript]

[74]
P. BOSE AND P. MORIN. Competitive online routing in geometric graphs. Theoretical Computer Science: Special Issue: In Memoriam, Steve Seiden, 324(2-3), pp. 273-288,2004. [postscript]

[75]
P. BOSE, J. CZYZOWICZ, P. MORIN AND D. WOOD. The maximum number of edges in a 3-dimensional graph drawing. Journal of Graph Algorithms and Applications, 8(1), pp. 21-26, 2004.

[76]
P. BOSE, J. GUDMUNDSSON, AND P. MORIN. Ordered Theta Graphs. Computational Geometry: Theory and Applications, 28(1), pp. 11-18, 2004. [postscript]

[77]
P. BOSE, A. MAHESHWARI, G. NARASIMHAN, M. SMID AND N. ZEH. Approximating Geometric Bottleneck Shortest Paths. Computational Geometry: Theory and Applications, 29, pp. 233-249, 2004.

[78]
P. BOSE, P. MORIN AND A. VIGNERON. Packing two disks into a polygonal environment. Journal of Discrete Algorithms, 2(3), pp. 373-380, 2004.

[79]
P. BOSE, M. SMID AND D. WOOD. Light Edges in Degree-Constrained Graphs. Discrete Mathematics, 282(1-3), pp. 35-41, 2004.

[80]
P. BOSE AND P. MORIN. Testing the quality of manufactured balls and disks. Algorithmica: Special issue on shape matching, 38(2), pp. 161-177, 2003.

[81]
P. BOSE, D. KIRKPATRICK AND Z. LI. Worst-case optimal algorithms for guarding planar graphs and polyhedral surfaces. Computational Geometry: Theory and Applications, 26(3), pp. 21-34, 2003. [postscript]

[82]
M. DE BERG, P. BOSE, O. CHEONG, AND P. MORIN. On Simplifying Dot Maps. Computational Geometry: Theory and Applications, 27(1), pp. 43-62, 2003.

[83]
P. BOSE, H. EVERETT AND S. WISMATH. Properties of Arrangements. International Journal of Computational Geometry, 13(6), pp. 447-462, 2003. [postscript]

[84]
P. BOSE, D. KRIZANC, S. LANGERMAN AND P. MORIN. Asymmetric Communication Protocols via Hotlink Assignments. Theory of Computing Systems, 26(6), pp. 655-661, 2003. [postscript]

[85]
P. BOSE, M. VAN KREVELD, A. MAHESHWARI, P. MORIN AND J. MORRISON. Translating a regular grid over a point set. Computational Geometry: Theory and Applications, 25(1), pp. 21-34, 2003. [postscript]

[86]
P. BOSE, A. MAHESHWARI AND P. MORIN. Fast approximations for sums of distances, clustering and the Fermat-Weber problem. Computational Geometry: Theory and Applications, 24(3), pp. 135-146, 2003. [postscript]

[87]
P. BOSE AND P. MORIN. An improved algorithm for subdivision traversal without extra storage. International Journal of Computational Geometry, 12(4), pp. 297-308, 2002. [postscript]

[88]
P. BOSE. On Embedding Outer-Planar Graphs on a Point Set. Computational Geometry: Theory and Applications, 23(3), pp. 303-312, 2002. [postscript]

[89]
P. BOSE, A. LUBIW AND J. I. MUNRO. Efficient Visibility Queries in Simple Polygons. Computational Geometry: Theory and Applications, 23(3), pp. 313-335, 2002. [postscript]

[90]
P. BOSE, A. BRODNIK, S. CARLSSON, E. D. DEMAINE, R. FLEISCHER, A. LÓPEZ-ORTIZ, P. MORIN AND J. I. MUNRO. Online routing in convex subdivisions. International Journal of Computational Geometry, 12(4), pp. 283-295, 2002. [postscript]

[91]
P. BOSE, S. RAMASWAMI, G. T. TOUSSAINT AND A. TURKI. Experimental Results on Quadrangulations of Sets of Fixed Points. Computer-Aided Geometric Design, 19(7), pp. 533-552, 2002. [postscript]

[92]
P. BOSE, F. HURTADO, H. MEIJER, S. RAMASWAMI, D. RAPPAPORT, V. SACRISTAN, T. SHERMER AND G. T. TOUSSAINT. Finding Specified Sections of Arrangements: 2D Results, Journal of Mathematical Modelling and Algorithms, 1(1), pp. 3-16, 2002. [postscript]

[93]
P. BOSE, L. DEVROYE, W. EVANS. Diamonds are not a Minimum Weight Triangulation's Best Friend. International Journal of Computational Geometry, 12(6), pp. 445-453, 2002. [postscript]

[94]
P. BOSE, C. KAKLAMANIS, L. KIROUSIS, E. KRANAKIS, D. KRIZANC AND D. PELEG. Station Layouts in the Presence of Location Constraints. Journal of Interconnection Networks, 3(1), pp. 1-17, 2002.

[95]
P. BOSE, F. HURTADO, E. OMANA-PULIDO, J. SNOEYINK AND G. T. TOUSSAINT. Some Aperture Angle Optimization Problems. Algorithmica, 33, pp. 411-435, 2002. [postscript]

[96]
H.-K. AHN, M. DE BERG, P. BOSE, S. CHENG, D. HALPERIN, J. MATOUSEK AND O. CHEONG. New results on casting. Computer-Aided Design, 34(8), pp. 547-559, 2002. [postscript]

[97]
P. BOSE, P. MORIN, I. STOJMENOVIC AND J. URRUTIA. Routing with guaranteed delivery in ad hoc wireless networks. Accepted in Wireless Networks,7(6), pp. 609-616, 2001. [postscript]

[98]
T. BIEDL, P. BOSE, E. D. DEMAINE AND A. LUBIW. Efficient Algorithms for Petersen's Matching Theorem. Journal of Algorithms (invited paper), 38, pp 110-134, 2001. [postscript]

[99]
P. BOSE, M. HOULE AND G. T. TOUSSAINT. Every Set of Disjoint Line Segments Admits a Binary Tree. Discrete and Computational Geometry, 26(3), pp.387-410, 2001. [postscript]

[100]
P. BOSE, J. CZYZOWICZ, E. KRANAKIS, D. KRIZANC AND A. MAHESHWARI. Cutting circles and squares in equal area pieces. Geombinatorica, XI(1), 2001.

[101]
H.-K. AHN, P. BOSE, J. CZYZOWICZ, N. HANUSSE, E. KRANAKIS AND P. MORIN. Flipping your lid. Geombinatorica, X(2), pp. 57-63, 2000. [postscript]

[102]
P. BOSE AND G. T. TOUSSAINT. Computing the constrained Euclidean, geodesic, and link centre of a simple polygon with applications. Studies of Location Analysis, Special Issue on Computation Geometry, Guest Editor: Juan Mesa, 15, pp. 37-66, 2000. [postscript]

[103]
P. BOSE, F. GOMEZ, P. RAMOS AND G. T. TOUSSAINT. Drawing Nice Projections of Objects in Space. Journal of Visual Communication and Image Representation, 10, pp. 155-172, 1999. [postscript]

[104]
P. BOSE AND L. DEVROYE. Intersections with Random Geometric Objects. Computational Geometry: Theory and Applications, 10(3), pp. 139-154, 1998. [postscript]

[105]
P. BOSE, H. EVERETT, S. FEKETE, A. LUBIW, H. MEIJER, K. ROMANIK, G. ROTE, T. SHERMER, S. WHITESIDESAND C. ZELLE. On a Visibility Representation for Graphs in Three Dimensions. Journal of Graph Algorithms and Applications, 2(3), pp. 1-16, 1998. [postscript]

[106]
P. BOSE, M. VAN KREVELD AND G. T. TOUSSAINT. Filling Polyhedral Molds. Computer-Aided Design: Special Issue on Manufacturing, 30(4), pp. 245-254, 1998. [postscript]

[107]
P. BOSE, J. BUSS AND A. LUBIW. Pattern Matching for Permutations. Information Processing Letters, 65, pp. 277-283, 1998. [postscript]

[108]
M. DE BERG, P. BOSE, D. BREMNER, S. RAMASWAMI AND G. WILFONG. Computing Constrained Minimum-Width Annuli of Point Sets. Computer-Aided Design: Special Issue on Manufacturing, 30-4, pp. 267-275, 1998. [postscript]

[109]
P. BOSE, M. MCALLISTER AND J. SNOEYINK. Optimal Algorithms to Embed Trees in a Point Set. Journal of Graph Algorithms and Applications, 1(2), pp. 1-15, 1997. [postscript]

[110]
P. BOSE AND G. T. TOUSSAINT. Characterizing and Efficiently Computing Quadrangulations of Planar Point Sets. Computer-Aided Geometric Design, 16, pp. 763-785, 1997. [postscript]

[111]
P. BOSE, D. BREMNER AND M. VAN KREVELD. Castability of Simple Polyhedra. Algorithmica: Special Issue on Manufacturing, 19, pp. 84-113, 1997. [postscript]

[112]
B. ASBERG, G. BLANCO, P. BOSE, J. GARCÍA, M. OVERMARS, G. T. TOUSSAINT, G. WILFONG AND B. ZHU. Feasibility of Design in Stereolithography. Algorithmica: Special Issue on Manufacturing, 19, pp. 61-83, 1997. [postscript]

[113]
P. BOSE, L. GUIBAS, A. LUBIW, M. OVERMARS, D. SOUVAINE AND J. URRUTIA. The Floodlight Problem. International Journal of Computational Geometry (invited paper), 7(1,2), pp. 153-163, 1997. [postscript]

[114]
P. BOSE, T. SHERMER, G. T. TOUSSAINT AND B. ZHU. Guarding Polyhedral Terrains. Computational Geometry: Theory and Applications, 6(3), pp. 173-185, 1997. [postscript]

[115]
P. BOSE, D. BREMNER AND G. T. TOUSSAINT. All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. Computational Geometry: Theory and Applications (invited paper), 6, pp. 291-302, 1996. [postscript]

[116]
P. BOSE, W. LENHART AND G. LIOTTA. Characterizing Proximity Trees. Algorithmica: Special Issue on Graph Drawing, 16, pp. 83-110, 1996. [postscript]

[117]
P. BOSE AND G. T. TOUSSAINT. Growing a Tree from its Branches. Journal of Algorithms, 19, pp. 86-103, 1995. [postscript]

[118]
P. BOSE AND G. T. TOUSSAINT. Geometric and Computational Aspects of Gravity Casting. Computer-Aided Design, 27(6), pp. 455-464, 1995. [postscript]

[119]
P. BOSE AND G. T. TOUSSAINT. Geometric and Computational Aspects of Manufacturing Processes. Computers and Graphics (invited paper), 18(4), pp. 487-497, 1994. [postscript]

Books and Volumes Edited

[120]
Special Issue for CCCG, Computational Geometry: Theory and Applications, P. Bose and P. Carmi, editors, 45(9), 2012.

[121]
Special Issue for CCCG, Computational Geometry: Theory and Applications, P. Bose and A. Mukhopadhyay, editors, 42(5), 2009.

[122]
Special Issue for CCCG, Computational Geometry: Theory and Applications, P. Bose and T. Fevens, editors, 39(1), 2008.

[123]
Proceedings of the 19th Canadian Conference on Computational Geometry, P. Bose, editor, 2007.

[124]
Algorithmica Special Issue for ISAAC, Algorithmica, P. Bose and P. Morin, editors, 42(1), 2005.

[125]
Theory of Computer Systems, Special Issue for ISAAC, Theory of Computing Systems, P. Bose and P. Morin, editors, 38(3), 2005.

[126]
Thirteenth International Symposium on Algorithms and Computation, ISAAC 2002, P. Bose and P. Morin, editors, Springer-Verlag, 2002.

[127]
Snapshots of Discrete and Computational Geometry, Vol 3, P. Bose and D. Avis, editors, School of Computer Science, McGill University, Technical Report no. SOCS 94.50, 1994.

Papers in Conferences with Proceedings

[128]
P. BOSE, R. FAGERBERG, J. HOWAT AND P. MORIN. Biased Predecessor Search. Proceedings of the Latin American Theoretical Informatics (LATIN), accepted, 2013 .

[129]
P. BOSE AND A. VAN RENSSEN. Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs. Proceedings of the Latin American Theoretical Informatics (LATIN), accepted, 2013..

[130]
L. FELIPE BARBA, P. BOSE AND S. LANGERMAN. Optimal algorithms for constrained 1-center problems. Proceedings of the Latin American Theoretical Informatics (LATIN), accepted, 2013.

[131]
P. BOSE, J-L. DE CARUFEL AND S. DUROCHER. Revisiting the Problem of Searching on a Line. Proceedings of the European Symposium on Algorithms (ESA), accepted, 2013.

[132]
P. BOSE, P. MORIN, A. VAN RENSSEN AND S. VERDONSCHOT. The $\theta_5$ graph is a spanner. Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG), accepted, 2013.

[133]
P. BOSE, J. HOWAT AND P. MORIN. A History of Distribution-Sensitive Data Structures. Festschrift for Ian Munro, accepted, 2013.

[134]
P. LAI, C. SAMPSON AND P. BOSE. Visual Enhancement of 3D Images of Rock Faces for Rock Mass Characterization. American Rocks Mechanics/Geomecanics Symposium (ARMA), accepted, 2013.

[135]
P. BOSE, A. VAN RENSSEN AND S. VERDONSCHOT. On the Spanning Ratio of Theta-Graphs. Proceedings of the Workshop of Algorithms and Data Structures (WADS), pp. 182-194, 2013.

[136]
L. FELIPE BARBA, P. BOSE, J-L. DE CARUFEL, A. VAN RENSSEN AND S. VERDONSCHOT. On the stretch factor of the Theta-4 graph. Proceedings of the Workshop of Algorithms and Data Structures (WADS), pp. 109-120, 2013.

[137]
P. BOSE, V. DUJMOVIC, P. MORIN AND M. SMID. Robust Geometric Spanners. Proceedings of the ACM Symposium on Computational Geometry (SoCG), accepted, 2013.

[138]
P. BOSE AND S. VERDONSCHOT. A history of combinatorial flips. LNCS, accepted, 2012.

[139]
P. BOSE, S. COLLETTE, R. FAGERBERG AND S. LANGERMAN. De-amortizing Binary Search Trees. International Colloquium on Automata, Languages and Programming, pp. 121-132, 2012.

[140]
P. BOSE, R. FAGERBERG, A. VAN RENSSEN AND S. VERDONSCHOT. On Plane Constrained Bounded-Degree Spanners. Proceedings of the Latin American Theoretical Informatics (LATIN), pp. 85-96, 2012.

[141]
P. BOSE, R. FAGERBERG, A. VAN RENSSEN AND S. VERDONSCHOT. Competitive Routing in the Half-$\theta_6$-Graph. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1319-1328, 2012.

[142]
P. BOSE, P. CARMI, M. DAMIAN, R. FLATLAND, M. KATZ AND A. MAHESHWARI. Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Proceedings of the Workshop of Algorithms and Data Structures (WADS), pp. 134-146, 2011.

[143]
P. BOSE AND K. DOUÏEB. Should Static Search Trees ever be Unbalanced? Proceedings of the International Symposium on Algorithms and Computation (ISAAC), pp. 109-120, 2010.

[144]
P. BOSE, M. DAMIAN, K. DOUÏEB, J. O'ROURKE, B. SEAMONE, M. SMID AND S. WUHRER. $\pi/2$-Angle Yao Graphs are Spanners. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), pp. 446-457, 2010.

[145]
G. ALOUPIS, N. BENBERNOU, P. BOSE, S. COLLETTE, E. D. DEMAINE, M. DEMAINE, K. DOUÏEB, V. DUJMOVIC, J. IACONO, S. LANGERMAN AND P. MORIN. Common Unfoldings of Polyominoes and Polycubes. Conference on Computational Geometry, Graphs and Applications, accepted, 2010.

[146]
B. BALLINGER, N. BENBERNOU, P. BOSE, M. DAMIAN, E. D. DEMAINE, V. DUJMOVIC, R. FLATLAND, F. HURTADO, J. IACONO, A. LUBIW, P. MORIN, V. SACRISTAN, D. SOUVAINE AND R. UEHARA. Coverage with K-transmitters in the presence of obstacles. International Conference on Combinatorial Optimization and Applications, pp.1-15, 2010.

[147]
P. BOSE, K. DOUÏEB AND P. MORIN. Skip Lifts: A Probabilistic Alternative to Red-Black Trees. International Workshop on Combinatorial Algorithms, pp. 226-237, 2010.

[148]
P. BOSE, K. DOUÏEB, V. DUJMOVIC AND R. FAGERBERG. An $O(\log \log n)$-time Competitive Binary Search Tree with Optimal Worst-Case Access Time. Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT), pp. 38-49, 2010.

[149]
P. BOSE, P. CARMI, D. JANSENS, A. MAHESHWARI, P. MORIN AND M. SMID Improved Methods for Generating Quasi-Gray Codes. Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT), pp. 224-235, 2010.

[150]
P. BOSE, K. DOUÏEB, V. DUJMOVIC AND J. HOWAT. Layered Working-Set Trees. Proceedings of the Latin American Theoretical Informatics (LATIN), pp. 686-696, 2010.

[151]
P. BOSE, P. CARMI, M. SMID AND D. XU. Communication-Efficient Construction of the Plane Localized Delaunay Graph. Proceedings of the Latin American Theoretical Informatics (LATIN), pp. 282-293, 2010.

[152]
S. WUHRER, C. SHU AND P. BOSE. Posture Invariant Correspondence of Triangular Meshes in Shape Space. Accepted, IEEE International Workshop on 3D Digital Imaging and Modeling (3DIM), 2009.

[153]
A. BRUNTON, S. WUHRER, C. SHU, P. BOSE AND E. D. DEMAINE. Filling Holes in Triangular Meshes by Curve Unfolding. IEEE International Conference on Shape Modeling and Applications (SMI), accepted 2009.

[154]
P. BOSE AND K. DOUÏEB. Efficient Construction of Near-Optimal Binary and Multiway Search Trees. Proceedings of the Workshop of Algorithms and Data Structures (WADS), pp. 230-241, 2009.

[155]
P. BOSE, P. MORIN AND J. HOWAT. A Distribution-Sensitive Dictionary with Low Space Overhead. Proceedings of the Workshop of Algorithms and Data Structures (WADS), pp. 110-118, 2009.

[156]
P. BOSE, M. HE, A. MAHESHWARI AND P. MORIN. Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. Proceedings of the Workshop of Algorithms and Data Structures (WADS), pp. 98-109, 2009.

[157]
P. BOSE, P. CARMI AND S. DUROCHER. Bounding the Locality of Distributed Routing Algorithms. ACM Symposium on Principles of Distributed Computing (PODC), pp. 250-259, 2009.

[158]
P. BOSE, E. CHEN, M. HE, A. MAHESHWARI AND P. MORIN. Succinct Geometric Indexes Supporting Point Location Queries. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 635-644, 2009.

[159]
P. BOSE, V. DUJMOVIC, F. HURTADO, S. LANGERMAN, P. MORIN AND D. WOOD. A polynomial bound for untangling geometric planar graphs. Topological and Geometric Graph Theory (TGGT), 2008.

[160]
P. BOSE, P. CARMI, S. COLLETTE AND M. SMID. On the Stretch Factor of Convex Delaunay Graphs. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), pp. 656-667, 2008. , 2008. .

[161]
P. BOSE, P. CARMI, M. FARSHI, A. MAHESHWARI AND M. SMID. Computing the greedy spanner in near-quadratic time. Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT), pp. 390-401, 2008.

[162]
P. BOSE, P. CARMI AND M. COUTURE. Additively Weighted Geometric Spanners. Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT), pp. 367-377, 2008.

[163]
P. BOSE, P. MORIN, P. CARMI, M. COUTURE, A. MAHESHWARI AND M. SMID. Spanners of Complete $k$-partite Geometric Graphs. Proceedings of the Latin American Theoretical Informatics (LATIN), pp. 170-181, 2008.

[164]
P. BOSE, K. DOUÏEB AND S. LANGERMAN. Dynamic Optimality for Skip Lists and B-Trees. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1106-1114, 2008.

[165]
P. BOSE, P. CARMI, M. COUTURE, A. MAHESHWARI, M. SMID AND N. ZEH. Geometric Spanners with Small Chromatic Number. Workshop on Approximation and Online Algorithms, pp. 75-88, 2007.

[166]
P. BOSE, P. CARMI, M. COUTURE, M. SMID AND D. XU. On a family of strong geometric spanners that admit local routing strategies. Proceedings of the Workshop of Algorithms and Data Structures (WADS), pp. 300-311, 2007.

[167]
P. BOSE, A. LEE AND M. SMID. On Generalized Diamond Spanners. Proceedings of the Workshop of Algorithms and Data Structures (WADS), 325-336, 2007.

[168]
M. COUTURE, M. BARBEAU, P. BOSE, P. CARMI AND E. KRANAKIS. Location Oblivious Distributed Unit Disk Graph Coloring. Proceedings of the International Colloquium on Structural Information and Communication (SIROCCO), pp. 222-233, 2007.

[169]
S. BEREG, P. BOSE, A. DUMITRESCU, F. HURTADO AND P. VALTR. Traversing a Set of Points with a Minimum Number of Turns. Proceedings of the ACM Symposium on Computational Geometry (SoCG), 46-55, 2007.

[170]
P. BOSE, P. MORIN, M. SMID AND S. WUHRER. Algorithms for Designing Clamshell Molds. International CAD Conference (CAD), pp. 1-10, 2007.

[171]
P. BOSE, V. DUJMOVIC, D. KRIZANC, S. LANGERMAN, P. MORIN, D. WOOD AND S. WUHRER. A Characterization of the Degree Sequence of 2-trees. Workshop on Analytic Algorithmics and Combinatorics, 2006.

[172]
M. COUTURE, M. BARBEAU, P. BOSE AND E. KRANAKIS. Incremental Construction of $k$-Dominating Sets in Wireless Sensor Networks. International Conference On Principles of Distributed Systems, pp. 202-214, 2006.

[173]
E. HAHN, P. BOSE AND A. WHITEHEAD. Persistent Realtime Building Interior Generation. ACM SIGGRAPH Video Game Symposium, pp. 179-186, 2006.

[174]
B. ARONOV, P. BOSE, E. D. DEMAINE, J. GUDMUNDSSON, J. IACONO, S. LANGERMAN AND M. SMID. Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Proceedings of the Latin American Theoretical Informatics (LATIN), pp. 80-92, 2006.

[175]
P. BOSE AND M. KEIL. On the Stretch Factor of the Constrained Delaunay Triangulation. Proceedings of the International Symposium on Voronoi Diagrams in Science and Engineering (ISVD), pp. 25-31, 2006.

[176]
P. BOSE, M. SMID AND D. XU. Diamond Triangulations contain Spanners of Bounded Degree. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), LNCS 4288, pp. 173-182, 2006.

[177]
P. BOSE, J. CZYZOWICZ, P. MORIN, J. GAO AND D. WOOD. Simultaneous diagonal flips in plane triangulations. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 212-221, 2006

[178]
A. WHITEHEAD, P. BOSE AND V. AUDET. High-speed Texture Preserving Digital Image Inpainting. Proceedings of Signal and Image Processing, pp. 526-531, 2005.

[179]
P. BOSE, V. DUJMOVIC AND D. WOOD. Induced Subgraphs of Bounded Degree and Bounded Treewidth. Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG), LNCS 3787, pp. 175-186, 2005.

[180]
P. BOSE AND S. LANGERMAN. Weighted ham-sandwich cuts. Proceedings of the Japanese Conference on Discrete and Computational Geometry, LNCS 3742, pp. 48-53, 2005. [postscript]

[181]
P. BOSE. On Flips in Triangulations. Proceedings of the Encuentros de Geometría Computacional (EGC), pp. 1-7, 2005. [pdf]

[182]
P. BOSE, F. HURTADO, E. RIVERA-CAMPO AND D. WOOD Particiones de grafos geométricos completos en àrboles sin cortes, Proceedings of the Encuentros de Geometría Computacional (EGC), pp. 157-164, 2005.

[183]
A. WHITEHEAD, P. BOSE AND R. LAGANIÈRE. Projective Space Temporal Synchronization of Multiple Video Sequences. Proceedings of IEEE Workshop on Motion and Video Computing, pp. 132-137, 2005.

[184]
P. BOSE, E. KRANAKIS, P. MORIN AND Y. TANG. Approximate Range Mode and Range Median Queries. Proceedings of the Symposium on Theoretical Aspects of Computer Science, pp. 377-388, 2005.

[185]
G. ALOUPIS, P. BOSE AND P. MORIN. Reconfiguring Triangulations with Point Moves and Edge Flips, Proceedings of Graph Drawing, pp. 1-11, 2004.

[186]
P. BOSE, F. HURTADO, E. RIVERA-CAMPO AND D. WOOD Partitions of the Complete Geometric Graphs into Plane Trees. Proceedings of Graph Drawing, pp. 71-81, 2004.
[187]
P. BOSE, E. D. DEMAINE, F. HURTADO, S. LANGERMAN, J. IACONO AND P. MORIN Geodesic ham-sandwich cuts. Proceedings of the ACM Symposium on Computational Geometry (SoCG), pp. 1-9, 2004.

[188]
A. WHITEHEAD, P. BOSE AND R. LAGANIÈRE. Feature Based Cut Detection with Automatic Threshold Selection. Proceedings of the International Conference on Image and Video Retrieval (CIVR), pp. 410-418, 2004. [pdf].

[189]
M. ABELLANAS, P. BOSE, A. GARCÍA, F. HURTADO, P. RAMOS, E. RIVERA-CAMPO AND J. TEJEL. On Local Transformations in Plane Geometric Graphs Embedded on Small Grids. Proceedings of the International Workshop on Computational Geometry and Applications (CGA), ICCSA (3), pp. 22-31, 2004. [postscript]

[190]
P. BOSE, L. DEVROYE AND P. MORIN. Succinct Data Structures for Convex Functions. Proceedings of the Japanese Conference on Discrete and Computational Geometry, LNCS 2866, pp. 97-107, 2003. [postscript]

[191]
P. BOSE, E. KRANAKIS, P. MORIN AND Y. TANG. Bounds for frequency estimation of packet streams. Proceedings of the International Colloquium on Structural Information and Communication (SIROCCO), 2003.

[192]
P. BOSE, A. MAHESHWARI, G. NARASIMHAN, M. SMID AND N. ZEH. Approximating Geometric Bottleneck Shortest Paths. Proceedings of the Symposium on Theoretical Aspects of Computer Science, LNCS 2607, pp. 38-49, 2003.

[193]
P. BOSE, J. GUDMUNDSSON AND M. SMID. Constructing Plane Spanners of Bounded Degree and Low Weight. Proceedings of the European Symposium on Algorithms (ESA), pp. 234-246, 2002. [postscript]

[194]
V. AUDET, P. BOSE, D. NUSSBAUM, J. SACK, J. SZANTO AND A. WHITEHEAD. Automatic Seed Detection in Online Portal Images for Prostate Treatment, Proceedings of the Second IASTED International Conference: Visualization, Imaging and Image Processing (VIIP), p. 361-366, 2002.
[195]
P. BOSE, D. KRIZANC, S. LANGERMAN AND P. MORIN. Asymmetric Communication Protocols via Hotlink Assignments. Proceedings of the International Colloquium on Structural Information and Communication (SIROCCO), 2002. [postscript]

[196]
P. BOSE AND Q. WANG. Facility location constrained to a polygonal domain. Proceedings of the Latin American Theoretical Informatics (LATIN), pp. 153-164, 2002. [postscript]

[197]
P. BOSE, L. DEVROYE, W. EVANS, AND D. KIRKPATRICK On the spanning ratio of Gabriel graphs and Beta-skeletons. Proceedings of the Latin American Theoretical Informatics (LATIN), pp. 479-493, 2002. [postscript]

[198]
P. BOSE AND P. MORIN. Competitive online routing in geometric graphs. Proceedings of the International Colloquium on Structural Information and Communication (SIROCCO), (voted best paper), 2001. [postscript]

[199]
P. BOSE, A. MAHESHWARI, P. MORIN AND J. MORRISON. The grid placement problem. Proceedings of the Workshop of Algorithms and Data Structures (WADS), pp. 180-191, 2001. [postscript] © Springer-Verlag

[200]
P. BOSE, P. MORIN AND A. VIGNERON. Packing two disks into a polygonal environment. Proceedings of the International Computing and Combinatorics Conference (COCOON), pp. 142-149, 2001. [postscript] © Springer-Verlag

[201]
P. BOSE, A. MAHESHWARI AND P. MORIN. Fast approximations for sums of distances, clustering and the Fermat-Weber problem. Proceedings of the Encuentros de Geometría Computacional (EGC), 2001. [postscript]

[202]
P. BOSE, A. BRODNIK, S. CARLSSON, E. D. DEMAINE, R. FLEISCHER, A. LÓPEZ-ORTIZ, P. MORIN AND J. I. MUNRO. Online routing in convex subdivisions. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), pp. 57-79, 2000. [postscript] © Springer-Verlag

[203]
P. BOSE AND P. MORIN. An improved algorithm for subdivision traversal without extra storage. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), pp. 444-455, 2000. [postscript] © Springer-Verlag

[204]
P. BOSE, J. CZYZOWICZ, E. KRANAKIS, D. KRIZANC, A. PELC AND M. VARGAS. Strategies for Hotlink Assignments. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), LNCS 1969, pp. 23-34, 2000. [postscript]

[205]
P. BOSE,C. KAKLAMANIS, L. KIROUSIS, E. KRANAKIS, D. KRIZANC AND D. PELEG. Station Layouts in the Presence of Location Constraints. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), pp. 275-280, 1999. [postscript]

[206]
G. BAREQUET, P. BOSE AND M. DICKERSON. Optimizing Constrained Offset and Scaled Polygonal Annuli. Proceedings of the Workshop of Algorithms and Data Structures (WADS), pp. 62-73, 1999. [postscript]

[207]
T. BIEDL, P. BOSE, E. D. DEMAINE AND A. LUBIW. Efficient Algorithms for Petersen's Matching Theorem. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 130-139, 1999. [postscript]

[208]
P. BOSE AND P. MORIN. Online routing in triangulations. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), pp. 113-122, 1999. [postscript] © Springer-Verlag

[209]
P. BOSE, P. MORIN, I. STOJMENOVIC AND J. URRUTIA. Routing with guaranteed delivery in ad hoc wireless networks. Proceedings of the International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pp. 48-55, 1999. [postscript] © ACM

[210]
P. BOSE AND P. MORIN. Testing the quality of manufactured balls. Proceedings of the Workshop of Algorithms and Data Structures (WADS), pp. 145-156, 1999. [postscript] © Springer-Verlag
[211]
P. BOSE, A. CHAN, F. DEHNE AND M. LATZEL. Coarse grained parallel maximum matching in convex bipartite graphs. Proceedings of the International Parallel Processing Symposium, pp. 125-129, 1999. [postscript]

[212]
P. BOSE AND P. MORIN. Testing the quality of manufactured disks and cylinders. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), pp. 129-138, 1998. [postscript] © Springer-Verlag

[213]
P. BOSE, J. CZYZOWICZ, E. KRANAKIS, D. KRIZANC AND A. MAHESHWARI. Polygon Cutting: Revisited. Proceedings of the Japanese Conference on Discrete and Computational Geometry, Geom., pp. 114-118, 1998. [postscript]

[214]
P. BOSE, J. CZYZOWICZ, E. KRANAKIS AND A. MAHESHWARI. Algorithms for Packing Two Circles in a Convex Polygon. Proceedings of the Japanese Conference on Discrete and Computational Geometry, pp.44-48, 1998. [postscript]

[215]
P. BOSE, J. CZYZOWICZ, E. KRANAKIS, D. KRIZANC AND A. MAHESHWARI. Cutting circles and squares in equal area pieces. Proceedings of FUN98, 1998. [postscript]

[216]
S. BEAUCHEMIN, P. BOSE, A. CHALIFOUR, F. NOUBOUD AND L. VOUGHT. Analyse Morphologique des Filets de Tricoptères: Un Problème d'Ecotoxicologie et de Géométrie Discrète. Visual Interface (VI 98), pp. 479-486, 1998. [postscript]

[217]
P. BOSE. On Embedding Outer-Planar Graphs on a Point Set. Proceedings of Graph Drawing, LNCS 1353, Springer, pp. 25-36, 1997. [postscript]

[218]
P. BOSE, H. EVERETT AND S. WISMATH. Properties of Arrangements. Proceedings of European Workshop on Computational Geometry, Spain, pp. 45-47, 1997. [longversion postscript]

[219]
M. DE BERG, P. BOSE, D. BREMNER, S. RAMASWAMI AND G. WILFONG. Computing Constrained Minimum-Width Annuli of Point Sets. Proceedings of the Workshop of Algorithms and Data Structures (WADS), LNCS 1272, Springer, pp. 392-401, 1997. [postscript]

[220]
H.-K. AHN, M. DE BERG, P. BOSE, S. CHENG, D. HALPERIN, J. MATOUSEK AND O. CHEONG. New results on casting. Proceedings of the ACM Symposium on Computational Geometry (SoCG), pp. 221-230, 1997. [postscript]

[221]
P. BOSE, A. DEAN, J. HUTCHINSON AND T. SHERMER. On Rectangle Visibility Graphs. Proceedings of Graph Drawing, LNCS 1190, Springer, pp. 25-35, 1997. [postscript]

[222]
D. AVIS, P. BOSE, T. SHERMER, J. SNOEYINK, G. T. TOUSSAINT AND B. ZHU. On the Sectional Area of Convex Polytopes. Proceedings of the ACM Symposium on Computational Geometry (SoCG), pp. C11-12, 1996. [postscript]

[223]
P. BOSE AND G. T. TOUSSAINT. Computing the constrained euclidean, geodesic and link centre of a simple polygon with applications. Proceedings of the Pacific Graphics International, Pohang, South Korea, pp. 102-112, 1996. [postscript]

[224]
P. BOSE, F. GOMEZ, P. RAMOS AND G. T. TOUSSAINT. Drawing Nice Projections of Objects in Space. Proceedings of Graph Drawing, LNCS 1027, Springer, pp. 52-63, 1996. [postscript]

[225]
P. BOSE, M. MCALLISTER AND J. SNOEYINK. Optimal Algorithms to Embed Trees in a Point Set. Proceedings of Graph Drawing, LNCS 1027, Springer, pp. 64-75, 1996. [postscript]

[226]
P. BOSE, S. RAMASWAMI, G. T. TOUSSAINT AND A. TURKI. Experimental comparison of quadrangulation algorithms for sets of points. Proceedings of European Workshop on Computational Geometry, pp. 39-40, 1996. [longversion postscript]

[227]
P. BOSE AND G. T. TOUSSAINT. No Quadrangulation is Extremely Odd. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), LNCS 1004, Springer, pp. 372-381, 1995. [postscript]

[228]
P. BOSE, G. DI BATTISTA, W. LENHART AND G. LIOTTA. Proximity Constraints and Representable Trees. Proceedings of Graph Drawing, LNCS 894, Springer, pp. 340-351, 1995. [postscript]
[229]
P. BOSE AND G. T. TOUSSAINT. No Quadrangulation is Extremely Odd. 10th Colloquium on Graph Theory. Combinatorics and Applications, Xalapa, Mexico, February 1995. [postscript]

[230]
P. BOSE AND G. T. TOUSSAINT. Computational Geometry for CAD/CAM. Proceedings of the Pacific Conference on Computer Graphics and Applications, pp. 279-291, 1994. [postscript]

[231]
P. BOSE, M. HOULE AND G. T. TOUSSAINT. Every Set of Disjoint Line Segments Admits a Binary Tree. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), pp. 20-28, 1994. [postscript]

[232]
P. BOSE, D. BREMNER AND M. VAN KREVELD. Castability of Simple Polyhedra. Proceedings of the ACM Symposium on Computational Geometry (SoCG), pp. 123-131, 1994. [postscript]
[233]
B. ASBERG, G. BLANCO, P. BOSE, J. GARCÍA, M. OVERMARS, G. T. TOUSSAINT, G. WILFONG AND B. ZHU. Feasibility of Design in Stereolithography. Proceedings of the Foundations of Software Technology and Theoretical Computer Science, pp. 228-237, 1993. [postscript]

[234]
P. BOSE AND G. T. TOUSSAINT. Growing a Tree from its Branches. Proceedings of the Pacific Conference on Computer Graphics and Applications, pp. 91-103, 1993. [postscript]

[235]
P. BOSE AND G. T. TOUSSAINT. Geometric and Computational Aspects of Injection Molding. Proceedings of the International Conference on Computer Aided Design and Computer Graphics (chosen as one of the ten best papers of the conference), Vol 1, pp. 237-243, 1993. [postscript]

[236]
P. BOSE, M. VAN KREVELD AND G. T. TOUSSAINT. Filling Polyhedral Molds. Proceedings of the Workshop of Algorithms and Data Structures (WADS), LNCS 709, Springer, pp. 210-221, 1993. [postscript]

[237]
P. BOSE, J. BUSS AND A. LUBIW. Pattern Matching for Permutations. Proceedings of the Workshop of Algorithms and Data Structures (WADS), LNCS 709, Springer pp. 200-209, 1993. [postscript]
[238]
P. BOSE, T. SHERMER, G. T. TOUSSAINT AND B. ZHU. Guarding Polyhedral Terrains. Proceedings of the Allerton Conference on Communication, Control and Computing, October 1992. [longversion postscript]

Papers in Conferences with Abstracts

[239]
S. ALLAN, O. AICHHOLZER, G. ALOUPIS, L. FELIPE BARBA, P. BOSE, J-L. DE CARUFEL, J. IACONO, S. LANGERMAN, D. SOUVAINE, P. TASLAKIAN AND M. YAGNATINSKY. Sum of Squared Edges for MST of a Point Set in a Unit Square. Proceedings of the Japanese Conference on Discrete and Computational Geometry, 2013.

[240]
O. AICHHOLZER, L. FELIPE BARBA, S. WON BAE, P. BOSE, M. KORMAN, A. VAN RENSSEN, P. TASLAKIAN AND S. VERDONSCHOT. Theta-3 is connected. Proceedings of the Canadian Conference on Computational Geometry (CCCG), accepted, 2013.

[241]
L. FELIPE BARBA, A. BEINGESSNER, P. BOSE AND M. SMID. Computing Covers of Plane Forests. Proceedings of the Canadian Conference on Computational Geometry (CCCG), accepted, 2013.

[242]
P. BOSE, J-L. DE CARUFEL, C. GRIMM, A. MAHESHWARI AND M. SMID. Optimal Data Structures for Farthest-Point Queries in Cactus Networks. Proceedings of the Canadian Conference on Computational Geometry (CCCG), accepted, 2013.

[243]
S. ALLAN, O. AICHHOLZER, G. ALOUPIS, L. FELIPE BARBA, P. BOSE, J-L. DE CARUFEL, J. IACONO, S. LANGERMAN, D. SOUVAINE, P. TASLAKIAN AND M. YAGNATINSKY. Sum of Squared Edges for MST of a Point Set in a Unit Square. Fall Workshop on Computational Geometry, 2012.

[244]
P. BOSE, P. MORIN, A. VAN RENSSEN AND S. VERDONSCHOT. Optimal Bounds on Theta-Graphs: More is not Always Better. Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2012.

[245]
P. BOSE, R. FAGERBERG, A. VAN RENSSEN AND S. VERDONSCHOT. Competitive Routing on a Bounded-Degree Plane Spanner. Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2012.

[246]
P. BOSE, J-L. DE CARUFEL, C. GRIMM, A. MAHESHWARI AND M. SMID. On Farthest-Point Information in Networks. Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2012.

[247]
P. BOSE, V. DUJMOVIC, N. HODA AND P. MORIN. Visibility-Monotonic Polygon Deflation. Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2012.

[248]
P. BOSE, J. CARDINAL, S. COLLETTE, F. HURTADO, S. LANGERMAN, M. KORMAN AND P. TASLAKIAN. Coloring and Guarding Arrangements. European Workshop on Computational Geometry, 2012.

[249]
P. BOSE, V. DUJMOVIC, F. HURTADO, J. IACONO, S. LANGERMAN, H. MEIJER, V. SACRISTAN, M. SAUMELL AND D. WOOD. Proximity graphs: $E$, $\delta$, $\Delta$, $\chi$ and $\omega$. European Workshop on Computational Geometry, 2012.

[250]
P. BOSE AND J-L. DE CARUFEL. Isoperimetric Triangular Enclosure with a Fixed Angle. Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2011.

[251]
P. BOSE, D. JANSENS, A. VAN RENSSEN, M. SAUMELL AND S. VERDONSCHOT. Making triangulations 4-connected using flips. Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2011.

[252]
P. BOSE AND J-L. DE CARUFEL. Minimum enclosing area triangle with fixed angle. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 171-174, 2010.

[253]
P. BOSE, O. CHEONG AND V. DUJMOVIC. On the perimeter of fat objects. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 163-166, 2010.

[254]
P. BOSE, K. DOUÏEB, J. HOWAT AND P. MORIN. Fast local searches and updates in bounded universes. Proceedings of the Canadian Conference on Computational Geometry (CCCG), 261-264, 2010.

[255]
P. BOSE, V. CAMPOS, S. COLLETTE, F. HURTADO, M. KORMAN, S. LANGERMAN, V. SACRISTAN AND M. SAUMELL Some properties of higher order Delaunay and Gabriel graphs. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 13-16, 2010.

[256]
G. CARMICHAEL, R. LAGANIÈRE AND P. BOSE. Global Context Descriptors for SURF and MSER Feature Descriptors. Canadian Conference on Computer and Robot Vision, pp. 309-316, 2010.

[257]
P. BOSE, J. CARDINAL, S. COLLETTE, E. D. DEMAINE, B. PALOP, P. TASLAKIAN AND N. ZEH. Relaxed Gabriel Graphs. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 169-172, 2009.

[258]
P. BOSE, L. DEVROYE, M. LOFFLER, J. SNOEYINK AND V. VERMA. The spanning ratio of the Delaunay triangulation is greater than $\pi/2$. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp.165-167, 2009.

[259]
Z. ABEL, B. BALLINGER, P. BOSE, S. COLLETTE, V. DUJMOVIC, F. HURTADO, S. KOMINERS, S. LANGERMAN, A. POR AND D. WOOD. Every large point set contains many collinear points or an empty pentagon. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 99-102, 2009.

[260]
S. WUHRER, P. BOSE, C. SHU, J. O'ROURKE AND A. BRUNTON. Morphing of Triangular Meshes in Shape Space, Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2008.

[261]
P. BOSE, S. LANGERMAN AND S. ROY. Smallest enclosing circle centered on a query line segment, Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2008.

[262]
G. ALOUPIS, P. BOSE, V. DUJMOVIC, C. GRAY, S. LANGERMAN AND B. SPECKMANN. Triangulating and Guarding Realistic Polygons. Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2008.

[263]
P. BOSE AND J. MORRISON. Optimal Partitioning of Point Sets using Rigid Motion Star Placement. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 49-52, 2007.

[264]
T. ASANO, P. BOSE, P. CARMI, A. MAHESHWARI, C. SHU, M. SMID AND S. WUHRER Linear-Space Algorithms for Distance Preserving Graph Embedding with Applications. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 185-188, 2007.

[265]
Z. AZOUZ, P. BOSE, C. SHU AND S. WUHRER, Approximations of Geodesic Distances for Incomplete Triangular Manifolds. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 177-180, 2007.

[266]
G. ALOUPIS, B. BALLINGER, P. BOSE, M. DAMIAN, E. D. DEMAINE, M. DEMAINE, R. FLATLAND, F. HURTADO, S. LANGERMAN, J. O'ROURKE, P. TASLAKIAN AND G. T. TOUSSAINT Vertex Pops and Pop Turns. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 137-140, 2007.

[267]
P. BOSE AND J. MORRISON. Optimal Polygon Placement. Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2006.

[268]
P. BOSE, P. MORIN, M. SMID AND S. WUHRER. Rotationally Monotone Polygons. Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2006.

[269]
P. BOSE, D. BREMNER AND D. SOUVAINE. Computing the Tool Path of an Externally Monotone Polygon in Linear Time. Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2006.

[270]
E. HAHN, P. BOSE AND A. WHITEHEAD. Lazy Generation of Building Interiors in Real-time. IEEE CCECE, pp. 2441-2444, 2006.

[271]
P. BOSE AND J. MORRISON. Optimally Placing a Star on a Point Set. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 176-179, 2005.

[272]
M. ABELLANAS, P. BOSE, J. GARCÍA, F. HURTADO, C. NICOLÁS AND P. RAMOS. On Properties of Higher Order Delaunay Graphs with Applications. Proceedings of European Workshop on Computational Geometry 2005.

[273]
P. BOSE AND M. VAN KREVELD. Computing Nice Sweeps for Polyhedra and Polygons. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 108-111, 2004. [postscript]

[274]
P. BOSE, C. SEARA AND S. SETHIA. On Computing Enclosing Isosceles Triangles and Related Problems. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 120-123, 2004.

[275]
P. BOSE, P. MORIN, A. MAHESHWARI, J. MORRISON, M. SMID AND J. VAHRENHOLD. Space-Efficient Geometric Divide-and-Conquer Algorithms. Proceedings of European Workshop on Computational Geometry 2004.

[276]
P. BOSE, J. CZYZOWICZ, P. MORIN AND D. WOOD. The maximum number of edges in a 3-dimensional graph drawing. Proceedings of European Workshop on Computational Geometry, 2003.

[277]
P. BOSE, M. SMID AND D. WOOD. Light Edges in Degree-Constrained Graphs. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 142-145, 2002. [postscript]

[278]
P. BOSE, J. GUDMUNDSSON, AND P. MORIN. Ordered Theta Graphs. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 17-21, 2002. [postscript]

[279]
G. ALOUPIS, P. BOSE, E. D. DEMAINE, S. LANGERMAN, H. MEIJER, M. OVERMARS AND G. T. TOUSSAINT. Computing Signed Permutations of Polygons. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 68-71, 2002. [postscript]

[280]
M. DE BERG, P. BOSE, O. CHEONG, AND P. MORIN. On Simplifying Dot Maps. Proceedings of European Workshop on Computational Geometry, 2002 [postscript]

[281]
P. BOSE, A. MAHESHWARI, P. MORIN AND J. MORRISON. The grid placement problem. Proceedings of European Workshop on Computational Geometry, 2001. [postscript]

[282]
H.-K. AHN, P. BOSE, J. CZYZOWICZ, N. HANUSSE, E. KRANAKIS AND P. MORIN. Flipping your lid. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 13-16, 2000. [postscript]

[283]
P. BOSE, J. CZYZOWICZ, E. KRANAKIS, D. KRIZANC AND D. LESSARD. Near-Optimal Partitioning of Rectangles and Prisms. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 162-165, 1999. [postscript]

[284]
M. DE BERG, P. BOSE, D. BREMNER, W. EVANS AND L. NARAYANAN. Recovering lines with fixed linear probes. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp.86-87, 1998. [longversion postscript]

[285]
P. BOSE, F. HURTADO, H. MEIJER, S. RAMASWAMI, D. RAPPAPORT, V. SACRISTAN, T. SHERMER AND G. T. TOUSSAINT. Finding Specified Sections of Arrangements: 2D Results. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp.20-21, 1998. [postscript]

[286]
P. BOSE, J-D. CARON AND K. GHOUDI. Detection of Text-Line Orientation. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 98-99, 1998. [postscript]

[287]
P. BOSE, J. CZYZOWICZ AND D. LESSARD. Cutting rectangles in equal area pieces. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 94-95, 1998. [longversion postscript]

[288]
P. BOSE, L. DEVROYE AND W. EVANS. Diamonds are not a Minimum Weight Triangulation's Best Friend. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 68-73, 1996. [postscript]

[289]
P. BOSE, W. EVANS, D. KIRKPATRICK, M. MCALLISTER AND J. SNOEYINK. Approximating Shortest Paths in Arrangements of Lines. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp.143-148, 1996. [postscript]

[290]
P. BOSE, D. KIRKPATRICK AND Z. LI. Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 217-222, 1996. [postscript]

[291]
P. AGARWAL, M. DE BERG, P. BOSE, K. DOBRINDT, M. VAN KREVELD, M. OVERMARS, M. DE GROOT, T. ROOS, J. SNOEYINK AND S. YU. The Complexity of Rivers in Triangulated Terrains. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 325-330, 1996. [postscript]

[292]
P. BOSE, F. HURTADO, E. OMANA-PULIDO AND G. T. TOUSSAINT. Aperture Angle Optimization Problems. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 73-78, August 1995. [postscript]

[293]
P. BOSE AND G. T. TOUSSAINT. Proximity Graphs of Line Segments. in proceedings of the Workshop on Proximity Graphs, Starkville, Mississippi, December 1994. [postscript]

[294]
P. BOSE, D. BREMNER AND G. T. TOUSSAINT. All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. Proceedings of the Canadian Conference on Computational Geometry (CCCG)(chosen as one of the six best papers of the conference), pp. 344-349, 1994. [postscript]

[295]
P. BELLEVILLE, P. BOSE, J. CZYZOWICZ, J. URRUTIA AND J. ZAKS. K-Guarding Polygons on the Plane. Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 381-386, 1994. [postscript]

[296]
P. BOSE, L. GUIBAS, A. LUBIW, M. OVERMARS, D. SOUVAINE AND J. URRUTIA. The Floodlight Problem. Proceedings of the Canadian Conference on Computational Geometry (CCCG)(chosen as one of the six best papers of the conference), pp. 399-405, 1993. [postscript]

[297]
P. BOSE, F. HURTADO, E. OMANA-PULIDO AND G. T. TOUSSAINT. Some Aperture Angle Optimization Problems. in Proceedings of the Third Spanish Conference on Computational Geometry, Grenada, Spain, May 1993. [postscript]

[298]
P. BOSE, W. LENHART AND G. LIOTTA. Characterizing Proximity Trees. ALCOM International Workshop on Graph Drawing and Topological Graph Algorithms, Sèvres (Paris), September 1993. [postscript]

[299]
P. BOSE, H. EVERETT, S. FEKETE, A. LUBIW, H. MEIJER, K. ROMANIK, T. SHERMER AND S. WHITESIDES. On a Visibility Representation for Graphs in Three Dimensions. ALCOM International Workshop on Graph Drawing and Topological Graph Algorithms, Sèvres (Paris), September 1993. [postscript]

[300]
P. BOSE, A. LUBIW AND J. I. MUNRO. Efficient Visibility Queries in Simple Polygons. Proceedings of the Canadian Conference on Computational Geometry (CCCG), 1992. [postscript]

[301]
P. BOSE AND G. T. TOUSSAINT. Geometric and Computational Aspects of Injection Molding. M.S.I. Conference on Computational Geometry, Stony Brook, NY, October 1992. [postscript]

Currently Under Review

[302]
P. BOSE, S. DUROCHER, D.  MONDAL, M. SKALA AND M. WAHID Local Routing in Convex Subdivisions. Submitted, 2014.

[303]
P. BOSE, J-L. DE CARUFEL AND S. DUROCHER. Searching on a Line: A Complete Characterization of the Optimal Solution. Submitted, 2014.

[304]
L. FELIPE BARBA, P. BOSE, M. DAMIAN, R. FAGERBERG, W. KENG, J. O'ROURKE, A. VAN RENSSEN, P. TASLAKIAN, S. VERDONSCHOT AND G. XIA New and Improved Spanning Ratios for Yao Graphs. Submitted, 2013.

[305]
P. LAI, C. SAMPSON, P. BOSE Surface Roughness of Rock Faces through the Curvature of Triangulated Meshes, Submitted, 2013.

[306]
P. LAI, C. SAMPSON, P. BOSE Visual Enhancement of 3D Images of Rock Faces for Fracture Mapping, Submitted, 2013.

[307]
O. AICHHOLZER, L. FELIPE BARBA, S. WON BAE, P. BOSE, M. KORMAN, A. VAN RENSSEN, P. TASLAKIAN AND S. VERDONSCHOT. Theta-3 is connected. Submitted, 2013.

[308]
P. BOSE, A. LUBIW, V. PATHAK AND S. VERDONSCHOT. Flipping edge-labelled triangulations. submitted, 2013.

[309]
L. FELIPE BARBA, P. BOSE, M. DAMIAN, R. FAGERBERG, J. O'ROURKE, A. VAN RENSSEN, P. TASLAKIAN AND S. VERDONSCHOT. New and improved spanning ratios for Yao graphs. submitted, 2013.

[310]
P. BOSE, K. DOUÏEB, J. IACONO AND S. LANGERMAN. On the Power and Limitations of Static Binary Search Trees with Lazy Finger. Submitted 2013.

[311]
P. BOSE, R. FAGERBERG, A. VAN RENSSEN AND S. VERDONSCHOT. On Plane Constrained Bounded-Degree Spanners. submitted.

[312]
P. BOSE, V. DUJMOVIC, N. HODA AND P. MORIN. Visibility-Monotonic Polygon Deflation. submitted, 2012.

[313]
P. BOSE, J. CARDINAL, S. COLLETTE, F. HURTADO, M. KORMAN, S. LANGERMAN AND P. TASLAKIAN. Coloring and Guarding Arrangements. Submitted, 2011.

[314]
P. BOSE AND J-L. DE CARUFEL. Angular Probing. Submitted, 2011.

[315]
S. WUHRER, C. SHU AND P. BOSE. Automatically Creating Design Models from 3D Anthropometric Data. Submitted, 2012.

[316]
P. BOSE, K. DOUÏEB AND P. MORIN. Skip Lifts: A Probabilistic Alternative to Red-Black Trees. Submited, 2010.

[317]
P. BOSE, P. CARMI, M. SMID AND D. XU. Communication-Efficient Construction of the Plane Localized Delaunay Graph. Submitted to journal, 2009.

[318]
G. ALOUPIS, P. BOSE, E. D. DEMAINE, S. LANGERMAN, H. MEIJER, M. OVERMARS AND G. T. TOUSSAINT. Computing Signed Permutations of Polygons. Submitted to journal, 2009.

[319]
P. BOSE, L. DEVROYE AND P. MORIN. Minimal Data Structures for Convex Functions. Journal of Discrete Algorithms, decision pending, 2009.

[320]
P. BOSE AND V. DUJMOVIC. A note on the perimeter of $(\alpha,\beta)$-covered objects. Submitted to journal, 2009.

[321]
G. ALOUPIS, P. BOSE, V. DUJMOVIC, C. GRAY, S. LANGERMAN AND B. SPECKMANN. Triangulating and Guarding Realistic Polygons. Submitted to journal 2008.

[322]
A. WHITEHEAD, P. BOSE AND R. LAGANIÈRE. Feature Based Cut Detection with Automatic Threshold Selection. Submitted 2007.

[323]
R. ATANASSOV, P. BOSE AND C. SHU. FaceFan: A Space Efficient Data Structure for Polygonal Meshes. Submitted 2006.

[324]
P. BOSE, E. KRANAKIS, P. MORIN AND Y. TANG. Bounds for frequency estimation of packet streams. Submitted 2006.

[325]
N. BENBERNOU, P. BOSE, D. BREMNER, E. D. DEMAINE, M. DEMAINE, F. HURTADO, V. SACRISTAN AND P. TASLAKIAN. Efficient Reconfiguration of Pivoting Tiles.

Masters and PhD Thesis

[326]
P. BOSE. Geometric and Computational Aspects of Manufacturing Processes. Ph.D. thesis, McGill University, 1995. [postscript]

[327]
P. BOSE Visibility in Simple Polygons. Masters thesis, University of Waterloo, 1991. [postscript]



Prosenjit Bose 2014-02-26