Currently under review

  1. New bounds for facial nonrepetitive colouring


    Bose, P., Dujmovic, V., Morin, P., and Rioux-Maldague, L.
    Submitted to Journal of Graph Theory.
  2. A lower bound for deterministic asynchronous rendez-vous on the line


    Barba, L., Bose, P., Langerman, S., Carufel, J.-L. D., and Por, A.
    Submitted to Conference.
  3. Time-space trade-off for finding the k-visibility region of a point in a polygon


    Bahoo, Y., Banyassady, B., Bose, P., Durocher, S., and Mulzer, W.
    Submitted to Conference.
  4. Essential constraints of edge-constrained proximity graphs


    Bose, P., Carufel, J.-L. D., Shaikhet, A., and Smid, M.
    Submitted to Conference.
  5. Plane bichromatic trees of low degree


    Biniaz, A., Maheshwari, A., Smid, M., and Bose, P.
    Submitted to Conference.
  6. Constrained generalized delaunay graphs are plane spanners


    Bose, P., Carufel, J.-L. D., and van Renssen, A.
    Submitted to Conference.
  7. Probing convex polygons with a wedge


    Bose, P., Carufel, J.-L. D., Shaikhet, A., and Smid, M.
    Submitted to CGTA.
  8. Biased predecessor search


    Bose, P., Fagerberg, R., Howat, J., and Morin, P.
    Submitted to Algorithmica.
  9. Improved spanning ratio for low degree plane spanners


    Bose, P., Hill, D., and Smid, M. H. M.
    Submitted to TCS.
  10. On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere


    Bose, P., Carmi, P., Damian, M., Carufel, J. D., Hill, D., Maheshwari, A., Liu, Y., and Smid, M. H. M.
    Submitted to JoCG.
  11. The price of order


    Bose, P., Morin, P., and van Renssen, A.
    Submitted to IJCGA.
  12. Plane geodesic spanning trees, hamiltonian cycles, and perfect matchings in a simple polygon


    Biniaz, A., Bose, P., Maheshwari, A., and Smid, M. H. M.
    Submitted to CGTA.
  13. A general framework for searching on a line


    Bose, P. and Carufel, J. D.
    Submitted to TCS.
  14. A faster algorithm for the minimum red-blue-purple spanning graph problem for points on a circle


    Biniaz, A., Bose, P., van Duijn, I., Maheshwari, A., and Smid, M.
    Submitted to Conference.
  15. Low-memory local geometric routing in monotone planar subdivisions


    Bose, P., Carufel, J.-L. D., D’Angelo, A., and Durocher, S.
    Submitted to Conference.
  16. Data structures for halfplane proximity queries and incremental voronoi diagrams


    Aronov, B., Bose, P., Demaine, E. D., Gudmundsson, J., Iacono, J., Langerman, S., and Smid, M. H. M.
    Submitted to Algorithmica.
  17. Gabriel triangulations and angle-monotone graphs: local routing and recognition


    Bonichon, N., Bose, P., Carmi, P., Kostitsyna, I., Lubiw, A., and Verdonschot, S.
    Submitted to Conference.
  18. Towards plane spanners of degree 3


    Biniaz, A., Bose, P., Carufel, J.-L. D., Gavoille, C., Maheshwari, A., and Smid, M.
    Submitted to Conference.
  19. Constrained routing between non-visible vertices


    Bose, P., Korman, M., van Renssen, A., and Verdonschot, S.
    Submitted to Conference.

Journal papers

  1. Plane geodesic spanning trees, hamiltonian cycles, and perfect matchings in a simple polygon


    Biniaz, A., Bose, P., Maheshwari, A., and Smid, M. H. M.
    Comput. Geom., 57:27–39, 2016.
    @article{DBLP:journals/comgeo/BiniazBMS16,
      author={Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel H. M. Smid},
      title={Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon},
      journal={Comput. Geom.},
      year={2016},
      volume={57},
      pages={27--39},
      doi={10.1016/j.comgeo.2016.05.004},
      url={http://dx.doi.org/10.1016/j.comgeo.2016.05.004}
    }
    
  2. Towards tight bounds on theta-graphs: more is not always better


    Bose, P., Carufel, J. D., Morin, P., van Renssen, A., and Verdonschot, S.
    Theor. Comput. Sci., 616:70–93, 2016.
    @article{DBLP:journals/tcs/BoseCMRV16,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Pat Morin and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={Towards tight bounds on theta-graphs: More is not always better},
      journal={Theor. Comput. Sci.},
      year={2016},
      volume={616},
      pages={70--93},
      doi={10.1016/j.tcs.2015.12.017},
      url={http://dx.doi.org/10.1016/j.tcs.2015.12.017}
    }
    
  3. Visibility-monotonic polygon deflation


    Bose, P., Dujmovic, V., Hoda, N., and Morin, P.
    Contributions to Discrete Mathematics, 10(1), 2015.
    @article{DBLP:journals/cdm/BoseDHM15,
      author={Prosenjit Bose and Vida Dujmovic and Nima Hoda and Pat Morin},
      title={Visibility-monotonic polygon deflation},
      journal={Contributions to Discrete Mathematics},
      year={2015},
      volume={10},
      number={1},
      url={http://cdm.ucalgary.ca/cdm/index.php/cdm/article/view/366}
    }
    
  4. The θ\(_\mbox5\)-graph is a spanner


    Bose, P., Morin, P., van Renssen, A., and Verdonschot, S.
    Comput. Geom., 48(2):108–119, 2015.
    @article{DBLP:journals/comgeo/BoseMRV15,
      author={Prosenjit Bose and Pat Morin and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={The {\texttheta}\({}_{\mbox{5}}\)-graph is a spanner},
      journal={Comput. Geom.},
      year={2015},
      volume={48},
      number={2},
      pages={108--119},
      doi={10.1016/j.comgeo.2014.08.005},
      url={http://dx.doi.org/10.1016/j.comgeo.2014.08.005}
    }
    
  5. Reprint of: theta-3 is connected


    Aichholzer, O., Bae, S. W., Barba, L., Bose, P., Korman, M., van Renssen, A., Taslakian, P., and Verdonschot, S.
    Comput. Geom., 48(5):407–414, 2015.
    @article{DBLP:journals/comgeo/AichholzerBBBKR15,
      author={Oswin Aichholzer and Sang Won Bae and Luis Barba and Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
      title={Reprint of: Theta-3 is connected},
      journal={Comput. Geom.},
      year={2015},
      volume={48},
      number={5},
      pages={407--414},
      doi={10.1016/j.comgeo.2015.01.002},
      url={http://dx.doi.org/10.1016/j.comgeo.2015.01.002}
    }
    
  6. Packing plane perfect matchings into a point set


    Biniaz, A., Bose, P., Maheshwari, A., and Smid, M. H. M.
    Discrete Mathematics & Theoretical Computer Science, 17(2):119–142, 2015.
    @article{DBLP:journals/dmtcs/BiniazBMS15,
      author={Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel H. M. Smid},
      title={Packing Plane Perfect Matchings into a Point Set},
      journal={Discrete Mathematics {\&} Theoretical Computer Science},
      year={2015},
      volume={17},
      number={2},
      pages={119--142},
      url={http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2758}
    }
    
  7. Optimal data structures for farthest-point queries in cactus networks


    Bose, P., Carufel, J. D., Grimm, C., Maheshwari, A., and Smid, M. H. M.
    J. Graph Algorithms Appl., 19(1):11–41, 2015.
    @article{DBLP:journals/jgaa/BoseCGMS15,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Carsten Grimm and Anil Maheshwari and Michiel H. M. Smid},
      title={Optimal Data Structures for Farthest-Point Queries in Cactus Networks},
      journal={J. Graph Algorithms Appl.},
      year={2015},
      volume={19},
      number={1},
      pages={11--41},
      doi={10.7155/jgaa.00345},
      url={http://dx.doi.org/10.7155/jgaa.00345}
    }
    
  8. New and improved spanning ratios for yao graphs


    Barba, L., Bose, P., Damian, M., Fagerberg, R., Keng, W. L., O’Rourke, J., van Renssen, A., Taslakian, P., Verdonschot, S., and Xia, G.
    JoCG, 6(2):19–53, 2015.
    @article{DBLP:journals/jocg/BarbaBDFKORTVX15,
      author={Luis Barba and Prosenjit Bose and Mirela Damian and Rolf Fagerberg and Wah Loon Keng and Joseph O'Rourke and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot and Ge Xia},
      title={New and improved spanning ratios for Yao graphs},
      journal={JoCG},
      year={2015},
      volume={6},
      number={2},
      pages={19--53},
      url={http://jocg.org/index.php/jocg/article/view/190}
    }
    
  9. Optimal local routing on delaunay triangulations defined by empty equilateral triangles


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    SIAM J. Comput., 44(6):1626–1649, 2015.
    @article{DBLP:journals/siamcomp/BoseFRV15,
      author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles},
      journal={{SIAM} J. Comput.},
      year={2015},
      volume={44},
      number={6},
      pages={1626--1649},
      doi={10.1137/140988103},
      url={http://dx.doi.org/10.1137/140988103}
    }
    
  10. Searching on a line: A complete characterization of the optimal solution


    Bose, P., Carufel, J. D., and Durocher, S.
    Theor. Comput. Sci., 569:24–42, 2015.
    @article{DBLP:journals/tcs/BoseCD15,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Stephane Durocher},
      title={Searching on a line: {A} complete characterization of the optimal solution},
      journal={Theor. Comput. Sci.},
      year={2015},
      volume={569},
      pages={24--42},
      doi={10.1016/j.tcs.2014.12.007},
      url={http://dx.doi.org/10.1016/j.tcs.2014.12.007}
    }
    
  11. Switching to directional antennas with constant increase in radius and hop distance


    Bose, P., Carmi, P., Damian, M., Flatland, R. Y., Katz, M. J., and Maheshwari, A.
    Algorithmica, 69(2):397–409, 2014.
    @article{DBLP:journals/algorithmica/BoseCDFKM14,
      author={Prosenjit Bose and Paz Carmi and Mirela Damian and Robin Y. Flatland and Matthew J. Katz and Anil Maheshwari},
      title={Switching to Directional Antennas with Constant Increase in Radius and Hop Distance},
      journal={Algorithmica},
      year={2014},
      volume={69},
      number={2},
      pages={397--409},
      doi={10.1007/s00453-012-9739-y},
      url={http://dx.doi.org/10.1007/s00453-012-9739-y}
    }
    
  12. Minimum-area enclosing triangle with a fixed angle


    Bose, P. and Carufel, J. D.
    Comput. Geom., 47(1):90–109, 2014.
    @article{DBLP:journals/comgeo/BoseC14,
      author={Prosenjit Bose and Jean{-}Lou De Carufel},
      title={Minimum-area enclosing triangle with a fixed angle},
      journal={Comput. Geom.},
      year={2014},
      volume={47},
      number={1},
      pages={90--109},
      doi={10.1016/j.comgeo.2013.07.002},
      url={http://dx.doi.org/10.1016/j.comgeo.2013.07.002}
    }
    
  13. Making triangulations 4-connected using flips


    Bose, P., Jansens, D., van Renssen, A., Saumell, M., and Verdonschot, S.
    Comput. Geom., 47(2):187–197, 2014.
    @article{DBLP:journals/comgeo/BoseJRSV14,
      author={Prosenjit Bose and Dana Jansens and Andr{\'{e}} van Renssen and Maria Saumell and Sander Verdonschot},
      title={Making triangulations 4-connected using flips},
      journal={Comput. Geom.},
      year={2014},
      volume={47},
      number={2},
      pages={187--197},
      doi={10.1016/j.comgeo.2012.10.012},
      url={http://dx.doi.org/10.1016/j.comgeo.2012.10.012}
    }
    
  14. Triangulating and guarding realistic polygons


    Aloupis, G., Bose, P., Dujmovic, V., Gray, C., Langerman, S., and Speckmann, B.
    Comput. Geom., 47(2):296–306, 2014.
    @article{DBLP:journals/comgeo/AloupisBDGLS14,
      author={Greg Aloupis and Prosenjit Bose and Vida Dujmovic and Chris Gray and Stefan Langerman and Bettina Speckmann},
      title={Triangulating and guarding realistic polygons},
      journal={Comput. Geom.},
      year={2014},
      volume={47},
      number={2},
      pages={296--306},
      doi={10.1016/j.comgeo.2013.03.005},
      url={http://dx.doi.org/10.1016/j.comgeo.2013.03.005}
    }
    
  15. Theta-3 is connected


    Aichholzer, O., Bae, S. W., Barba, L., Bose, P., Korman, M., van Renssen, A., Taslakian, P., and Verdonschot, S.
    Comput. Geom., 47(9):910–917, 2014.
    @article{DBLP:journals/comgeo/AichholzerBBBKRTV14,
      author={Oswin Aichholzer and Sang Won Bae and Luis Barba and Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
      title={Theta-3 is connected},
      journal={Comput. Geom.},
      year={2014},
      volume={47},
      number={9},
      pages={910--917},
      doi={10.1016/j.comgeo.2014.05.001},
      url={http://dx.doi.org/10.1016/j.comgeo.2014.05.001}
    }
    
  16. Stable roommates spanner


    Bose, P., Carmi, P., Chaitman-Yerushalmi, L., Collette, S., Katz, M. J., and Langerman, S.
    Comput. Geom., 46(2):120–130, 2013.
    @article{DBLP:journals/comgeo/BoseCCCKL13,
      author={Prosenjit Bose and Paz Carmi and Lilach Chaitman{-}Yerushalmi and S{\'{e}}bastien Collette and Matthew J. Katz and Stefan Langerman},
      title={Stable Roommates Spanner},
      journal={Comput. Geom.},
      year={2013},
      volume={46},
      number={2},
      pages={120--130},
      doi={10.1016/j.comgeo.2012.07.001},
      url={http://dx.doi.org/10.1016/j.comgeo.2012.07.001}
    }
    
  17. Some properties of k-delaunay and k-gabriel graphs


    Bose, P., Collette, S., Hurtado, F., Korman, M., Langerman, S., Sacristán, V., and Saumell, M.
    Comput. Geom., 46(2):131–139, 2013.
    @article{DBLP:journals/comgeo/BoseCHKLSS13,
      author={Prosenjit Bose and S{\'{e}}bastien Collette and Ferran Hurtado and Matias Korman and Stefan Langerman and Vera Sacrist{\'{a}}n and Maria Saumell},
      title={Some properties of k-Delaunay and k-Gabriel graphs},
      journal={Comput. Geom.},
      year={2013},
      volume={46},
      number={2},
      pages={131--139},
      doi={10.1016/j.comgeo.2012.04.006},
      url={http://dx.doi.org/10.1016/j.comgeo.2012.04.006}
    }
    
  18. Fast local searches and updates in bounded universes


    Bose, P., Douïeb, K., Dujmovic, V., Howat, J., and Morin, P.
    Comput. Geom., 46(2):181–189, 2013.
    @article{DBLP:journals/comgeo/BoseDDHM13,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Vida Dujmovic and John Howat and Pat Morin},
      title={Fast local searches and updates in bounded universes},
      journal={Comput. Geom.},
      year={2013},
      volume={46},
      number={2},
      pages={181--189},
      doi={10.1016/j.comgeo.2012.01.002},
      url={http://dx.doi.org/10.1016/j.comgeo.2012.01.002}
    }
    
  19. On plane geometric spanners: A survey and open problems


    Bose, P. and Smid, M. H. M.
    Comput. Geom., 46(7):818–830, 2013.
    @article{DBLP:journals/comgeo/BoseS13,
      author={Prosenjit Bose and Michiel H. M. Smid},
      title={On plane geometric spanners: {A} survey and open problems},
      journal={Comput. Geom.},
      year={2013},
      volume={46},
      number={7},
      pages={818--830},
      doi={10.1016/j.comgeo.2013.04.002},
      url={http://dx.doi.org/10.1016/j.comgeo.2013.04.002}
    }
    
  20. Bounding the locality of distributed routing algorithms


    Bose, P., Carmi, P., and Durocher, S.
    Distributed Computing, 26(1):39–58, 2013.
    @article{DBLP:journals/dc/BoseCD13,
      author={Prosenjit Bose and Paz Carmi and Stephane Durocher},
      title={Bounding the locality of distributed routing algorithms},
      journal={Distributed Computing},
      year={2013},
      volume={26},
      number={1},
      pages={39--58},
      doi={10.1007/s00446-012-0179-3},
      url={http://dx.doi.org/10.1007/s00446-012-0179-3}
    }
    
  21. Coloring and guarding arrangements


    Bose, P., Cardinal, J., Collette, S., Hurtado, F., Korman, M., Langerman, S., and Taslakian, P.
    Discrete Mathematics & Theoretical Computer Science, 15(3):139–154, 2013.
    @article{DBLP:journals/dmtcs/BoseCCHKLT13,
      author={Prosenjit Bose and Jean Cardinal and S{\'{e}}bastien Collette and Ferran Hurtado and Matias Korman and Stefan Langerman and Perouz Taslakian},
      title={Coloring and Guarding Arrangements},
      journal={Discrete Mathematics {\&} Theoretical Computer Science},
      year={2013},
      volume={15},
      number={3},
      pages={139--154},
      url={http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2115}
    }
    
  22. Coverage with k-transmitters in the presence of obstacles


    Ballinger, B., Benbernou, N., Bose, P., Damian, M., Demaine, E. D., Dujmovic, V., Flatland, R. Y., Hurtado, F., Iacono, J., Lubiw, A., Morin, P., Adinolfi, V. S., Souvaine, D. L., and Uehara, R.
    J. Comb. Optim., 25(2):208–233, 2013.
    @article{DBLP:journals/jco/BallingerBBDDDFHILMASU13,
      author={Brad Ballinger and Nadia Benbernou and Prosenjit Bose and Mirela Damian and Erik D. Demaine and Vida Dujmovic and Robin Y. Flatland and Ferran Hurtado and John Iacono and Anna Lubiw and Pat Morin and Vera Sacrist{\'{a}}n Adinolfi and Diane L. Souvaine and Ryuhei Uehara},
      title={Coverage with k-transmitters in the presence of obstacles},
      journal={J. Comb. Optim.},
      year={2013},
      volume={25},
      number={2},
      pages={208--233},
      doi={10.1007/s10878-012-9475-x},
      url={http://dx.doi.org/10.1007/s10878-012-9475-x}
    }
    
  23. Network farthest-point diagrams


    Bose, P., Dannies, K., Carufel, J. D., Doell, C., Grimm, C., Maheshwari, A., Schirra, S., and Smid, M. H. M.
    JoCG, 4(1):182–211, 2013.
    @article{DBLP:journals/jocg/BoseDCDGMSS13,
      author={Prosenjit Bose and Kai Dannies and Jean{-}Lou De Carufel and Christoph Doell and Carsten Grimm and Anil Maheshwari and Stefan Schirra and Michiel H. M. Smid},
      title={Network Farthest-Point Diagrams},
      journal={JoCG},
      year={2013},
      volume={4},
      number={1},
      pages={182--211},
      url={http://jocg.org/index.php/jocg/article/view/131}
    }
    
  24. Robust geometric spanners


    Bose, P., Dujmovic, V., Morin, P., and Smid, M. H. M.
    SIAM J. Comput., 42(4):1720–1736, 2013.
    @article{DBLP:journals/siamcomp/BoseDMS13,
      author={Prosenjit Bose and Vida Dujmovic and Pat Morin and Michiel H. M. Smid},
      title={Robust Geometric Spanners},
      journal={{SIAM} J. Comput.},
      year={2013},
      volume={42},
      number={4},
      pages={1720--1736},
      doi={10.1137/120874473},
      url={http://dx.doi.org/10.1137/120874473}
    }
    
  25. Layered working-set trees


    Bose, P., Douïeb, K., Dujmovic, V., and Howat, J.
    Algorithmica, 63(1-2):476–489, 2012.
    @article{DBLP:journals/algorithmica/BoseDDH12,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Vida Dujmovic and John Howat},
      title={Layered Working-Set Trees},
      journal={Algorithmica},
      year={2012},
      volume={63},
      number={1-2},
      pages={476--489},
      doi={10.1007/s00453-011-9542-1},
      url={http://dx.doi.org/10.1007/s00453-011-9542-1}
    }
    
  26. Editorial


    Bose, P. and Carmi, P.
    Comput. Geom., 45(9):475, 2012.
    @article{DBLP:journals/comgeo/BoseC12,
      author={Prosenjit Bose and Paz Carmi},
      title={Editorial},
      journal={Comput. Geom.},
      year={2012},
      volume={45},
      number={9},
      pages={475},
      doi={10.1016/j.comgeo.2012.01.010},
      url={http://dx.doi.org/10.1016/j.comgeo.2012.01.010}
    }
    
  27. \(\pi\)/2-angle yao graphs are spanners


    Bose, P., Damian, M., Douïeb, K., O’Rourke, J., Seamone, B., Smid, M. H. M., and Wuhrer, S.
    Int. J. Comput. Geometry Appl., 22(1):61–82, 2012.
    @article{DBLP:journals/ijcga/BoseDDOSSW12,
      author={Prosenjit Bose and Mirela Damian and Karim Dou{\"{\i}}eb and Joseph O'Rourke and Ben Seamone and Michiel H. M. Smid and Stefanie Wuhrer},
      title={{\(\pi\)}/2-Angle Yao Graphs are Spanners},
      journal={Int. J. Comput. Geometry Appl.},
      year={2012},
      volume={22},
      number={1},
      pages={61--82},
      doi={10.1142/S0218195912600047},
      url={http://dx.doi.org/10.1142/S0218195912600047}
    }
    
  28. PROXIMITY GRAPHS: e, \(\delta\), \(\Delta\), \(\chi\) AND \(\omega\)


    Bose, P., Dujmovic, V., Hurtado, F., Iacono, J., Langerman, S., Meijer, H., Adinolfi, V. S., Saumell, M., and Wood, D. R.
    Int. J. Comput. Geometry Appl., 22(5):439–470, 2012.
    @article{DBLP:journals/ijcga/BoseDHILMASW12,
      author={Prosenjit Bose and Vida Dujmovic and Ferran Hurtado and John Iacono and Stefan Langerman and Henk Meijer and Vera Sacrist{\'{a}}n Adinolfi and Maria Saumell and David R. Wood},
      title={{PROXIMITY} {GRAPHS:} E, {\(\delta\)}, {\(\Delta\)}, {\(\chi\)} {AND} {\(\omega\)}},
      journal={Int. J. Comput. Geometry Appl.},
      year={2012},
      volume={22},
      number={5},
      pages={439--470},
      doi={10.1142/S0218195912500112},
      url={http://dx.doi.org/10.1142/S0218195912500112}
    }
    
  29. A distribution-sensitive dictionary with low space overhead


    Bose, P., Howat, J., and Morin, P.
    J. Discrete Algorithms, 10:140–145, 2012.
    @article{DBLP:journals/jda/BoseHM12,
      author={Prosenjit Bose and John Howat and Pat Morin},
      title={A distribution-sensitive dictionary with low space overhead},
      journal={J. Discrete Algorithms},
      year={2012},
      volume={10},
      pages={140--145},
      doi={10.1016/j.jda.2011.11.003},
      url={http://dx.doi.org/10.1016/j.jda.2011.11.003}
    }
    
  30. Skip lift: A probabilistic alternative to red-black trees


    Bose, P., Douïeb, K., and Morin, P.
    J. Discrete Algorithms, 14:13–20, 2012.
    @article{DBLP:journals/jda/BoseDM12,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Pat Morin},
      title={Skip lift: {A} probabilistic alternative to red-black trees},
      journal={J. Discrete Algorithms},
      year={2012},
      volume={14},
      pages={13--20},
      doi={10.1016/j.jda.2011.12.017},
      url={http://dx.doi.org/10.1016/j.jda.2011.12.017}
    }
    
  31. On bounded degree plane strong geometric spanners


    Bose, P., Carmi, P., and Chaitman-Yerushalmi, L.
    J. Discrete Algorithms, 15:16–31, 2012.
    @article{DBLP:journals/jda/BoseCC12,
      author={Prosenjit Bose and Paz Carmi and Lilach Chaitman{-}Yerushalmi},
      title={On bounded degree plane strong geometric spanners},
      journal={J. Discrete Algorithms},
      year={2012},
      volume={15},
      pages={16--31},
      doi={10.1016/j.jda.2012.03.004},
      url={http://dx.doi.org/10.1016/j.jda.2012.03.004}
    }
    
  32. Succinct geometric indexes supporting point location queries


    Bose, P., Chen, E. Y., He, M., Maheshwari, A., and Morin, P.
    ACM Trans. Algorithms, 8(2):10, 2012.
    @article{DBLP:journals/talg/BoseCHMM12,
      author={Prosenjit Bose and Eric Y. Chen and Meng He and Anil Maheshwari and Pat Morin},
      title={Succinct geometric indexes supporting point location queries},
      journal={{ACM} Trans. Algorithms},
      year={2012},
      volume={8},
      number={2},
      pages={10},
      doi={10.1145/2151171.2151173},
      url={http://doi.acm.org/10.1145/2151171.2151173}
    }
    
  33. Location-oblivious distributed unit disk graph coloring


    Barbeau, M., Bose, P., Carmi, P., Couture, M., and Kranakis, E.
    Algorithmica, 60(2):236–249, 2011.
    @article{DBLP:journals/algorithmica/BarbeauBCCK11,
      author={Michel Barbeau and Prosenjit Bose and Paz Carmi and Mathieu Couture and Evangelos Kranakis},
      title={Location-Oblivious Distributed Unit Disk Graph Coloring},
      journal={Algorithmica},
      year={2011},
      volume={60},
      number={2},
      pages={236--249},
      doi={10.1007/s00453-009-9334-z},
      url={http://dx.doi.org/10.1007/s00453-009-9334-z}
    }
    
  34. A note on the perimeter of fat objects


    Bose, P., Cheong, O., and Dujmovic, V.
    Comput. Geom., 44(1):1–8, 2011.
    @article{DBLP:journals/comgeo/BoseCD11,
      author={Prosenjit Bose and Otfried Cheong and Vida Dujmovic},
      title={A note on the perimeter of fat objects},
      journal={Comput. Geom.},
      year={2011},
      volume={44},
      number={1},
      pages={1--8},
      doi={10.1016/j.comgeo.2010.06.002},
      url={http://dx.doi.org/10.1016/j.comgeo.2010.06.002}
    }
    
  35. Almost all delaunay triangulations have stretch factor greater than pi/2


    Bose, P., Devroye, L., Löffler, M., Snoeyink, J., and Verma, V.
    Comput. Geom., 44(2):121–127, 2011.
    @article{DBLP:journals/comgeo/BoseDLSV11,
      author={Prosenjit Bose and Luc Devroye and Maarten L{\"{o}}ffler and Jack Snoeyink and Vishal Verma},
      title={Almost all Delaunay triangulations have stretch factor greater than pi/2},
      journal={Comput. Geom.},
      year={2011},
      volume={44},
      number={2},
      pages={121--127},
      doi={10.1016/j.comgeo.2010.09.009},
      url={http://dx.doi.org/10.1016/j.comgeo.2010.09.009}
    }
    
  36. On a family of strong geometric spanners that admit local routing strategies


    Bose, P., Carmi, P., Couture, M., Smid, M. H. M., and Xu, D.
    Comput. Geom., 44(6-7):319–328, 2011.
    @article{DBLP:journals/comgeo/BoseCCSX11,
      author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Michiel H. M. Smid and Daming Xu},
      title={On a family of strong geometric spanners that admit local routing strategies},
      journal={Comput. Geom.},
      year={2011},
      volume={44},
      number={6-7},
      pages={319--328},
      doi={10.1016/j.comgeo.2011.01.002},
      url={http://dx.doi.org/10.1016/j.comgeo.2011.01.002}
    }
    
  37. A survey of geodesic paths on 3d surfaces


    Bose, P., Maheshwari, A., Shu, C., and Wuhrer, S.
    Comput. Geom., 44(9):486–498, 2011.
    @article{DBLP:journals/comgeo/BoseMSW11,
      author={Prosenjit Bose and Anil Maheshwari and Chang Shu and Stefanie Wuhrer},
      title={A survey of geodesic paths on 3D surfaces},
      journal={Comput. Geom.},
      year={2011},
      volume={44},
      number={9},
      pages={486--498},
      doi={10.1016/j.comgeo.2011.05.006},
      url={http://dx.doi.org/10.1016/j.comgeo.2011.05.006}
    }
    
  38. Every large point set contains many collinear points or an empty pentagon


    Abel, Z., Ballinger, B., Bose, P., Collette, S., Dujmovic, V., Hurtado, F., Kominers, S. D., Langerman, S., Pór, A., and Wood, D. R.
    Graphs and Combinatorics, 27(1):47–60, 2011.
    @article{DBLP:journals/gc/AbelBBCDHKLPW11,
      author={Zachary Abel and Brad Ballinger and Prosenjit Bose and S{\'{e}}bastien Collette and Vida Dujmovic and Ferran Hurtado and Scott Duke Kominers and Stefan Langerman and Attila P{\'{o}}r and David R. Wood},
      title={Every Large Point Set contains Many Collinear Points or an Empty Pentagon},
      journal={Graphs and Combinatorics},
      year={2011},
      volume={27},
      number={1},
      pages={47--60},
      doi={10.1007/s00373-010-0957-2},
      url={http://dx.doi.org/10.1007/s00373-010-0957-2}
    }
    
  39. On computing enclosing isosceles triangles and related problems


    Bose, P., Mora, M., Seara, C., and Sethia, S.
    Int. J. Comput. Geometry Appl., 21(1):25–45, 2011.
    @article{DBLP:journals/ijcga/BoseMSS11,
      author={Prosenjit Bose and Merc{\`{e}} Mora and Carlos Seara and Saurabh Sethia},
      title={On Computing Enclosing Isosceles Triangles and Related Problems},
      journal={Int. J. Comput. Geometry Appl.},
      year={2011},
      volume={21},
      number={1},
      pages={25--45},
      doi={10.1142/S0218195911003536},
      url={http://dx.doi.org/10.1142/S0218195911003536}
    }
    
  40. Computing signed permutations of polygons


    Aloupis, G., Bose, P., Demaine, E. D., Langerman, S., Meijer, H., Overmars, M. H., and Toussaint, G. T.
    Int. J. Comput. Geometry Appl., 21(1):87–100, 2011.
    @article{DBLP:journals/ijcga/AloupisBDLMOT11,
      author={Greg Aloupis and Prosenjit Bose and Erik D. Demaine and Stefan Langerman and Henk Meijer and Mark H. Overmars and Godfried T. Toussaint},
      title={Computing Signed Permutations of Polygons},
      journal={Int. J. Comput. Geometry Appl.},
      year={2011},
      volume={21},
      number={1},
      pages={87--100},
      doi={10.1142/S0218195911003561},
      url={http://dx.doi.org/10.1142/S0218195911003561}
    }
    
  41. Spanners of additively weighted point sets


    Bose, P., Carmi, P., and Couture, M.
    J. Discrete Algorithms, 9(3):287–298, 2011.
    @article{DBLP:journals/jda/BoseCC11,
      author={Prosenjit Bose and Paz Carmi and Mathieu Couture},
      title={Spanners of additively weighted point sets},
      journal={J. Discrete Algorithms},
      year={2011},
      volume={9},
      number={3},
      pages={287--298},
      doi={10.1016/j.jda.2011.03.001},
      url={http://dx.doi.org/10.1016/j.jda.2011.03.001}
    }
    
  42. Computing the greedy spanner in near-quadratic time


    Bose, P., Carmi, P., Farshi, M., Maheshwari, A., and Smid, M. H. M.
    Algorithmica, 58(3):711–729, 2010.
    @article{DBLP:journals/algorithmica/BoseCFMS10,
      author={Prosenjit Bose and Paz Carmi and Mohammad Farshi and Anil Maheshwari and Michiel H. M. Smid},
      title={Computing the Greedy Spanner in Near-Quadratic Time},
      journal={Algorithmica},
      year={2010},
      volume={58},
      number={3},
      pages={711--729},
      doi={10.1007/s00453-009-9293-4},
      url={http://dx.doi.org/10.1007/s00453-009-9293-4}
    }
    
  43. Filling holes in triangular meshes using digital images by curve unfolding


    Brunton, A., Wuhrer, S., Shu, C., Bose, P., and Demaine, E. D.
    International Journal of Shape Modeling, 16(1-2):151–171, 2010.
    @article{DBLP:journals/ijsm/BruntonWSBD10,
      author={Alan Brunton and Stefanie Wuhrer and Chang Shu and Prosenjit Bose and Erik D. Demaine},
      title={Filling Holes in Triangular Meshes Using Digital Images by Curve Unfolding},
      journal={International Journal of Shape Modeling},
      year={2010},
      volume={16},
      number={1-2},
      pages={151--171},
      doi={10.1142/S0218654310001328},
      url={http://dx.doi.org/10.1142/S0218654310001328}
    }
    
  44. Morphing of triangular meshes in shape space


    Wuhrer, S., Bose, P., Shu, C., O’Rourke, J., and Brunton, A.
    International Journal of Shape Modeling, 16(1-2):195–212, 2010.
    @article{DBLP:journals/ijsm/WuhrerBSOB10,
      author={Stefanie Wuhrer and Prosenjit Bose and Chang Shu and Joseph O'Rourke and Alan Brunton},
      title={Morphing of Triangular Meshes in Shape Space},
      journal={International Journal of Shape Modeling},
      year={2010},
      volume={16},
      number={1-2},
      pages={195--212},
      doi={10.1142/S0218654310001341},
      url={http://dx.doi.org/10.1142/S0218654310001341}
    }
    
  45. Sigma-local graphs


    Bose, P., Collette, S., Langerman, S., Maheshwari, A., Morin, P., and Smid, M. H. M.
    J. Discrete Algorithms, 8(1):15–23, 2010.
    @article{DBLP:journals/jda/BoseCLMMS10,
      author={Prosenjit Bose and S{\'{e}}bastien Collette and Stefan Langerman and Anil Maheshwari and Pat Morin and Michiel H. M. Smid},
      title={Sigma-local graphs},
      journal={J. Discrete Algorithms},
      year={2010},
      volume={8},
      number={1},
      pages={15--23},
      doi={10.1016/j.jda.2008.10.002},
      url={http://dx.doi.org/10.1016/j.jda.2008.10.002}
    }
    
  46. On the stretch factor of convex delaunay graphs


    Bose, P., Carmi, P., Collette, S., and Smid, M. H. M.
    JoCG, 1(1):41–56, 2010.
    @article{DBLP:journals/jocg/BoseCCS10,
      author={Prosenjit Bose and Paz Carmi and S{\'{e}}bastien Collette and Michiel H. M. Smid},
      title={On the Stretch Factor of Convex Delaunay Graphs},
      journal={JoCG},
      year={2010},
      volume={1},
      number={1},
      pages={41--56},
      url={http://jocg.org/index.php/jocg/article/view/5}
    }
    
  47. Clamshell casting


    Bose, P., Morin, P., Smid, M. H. M., and Wuhrer, S.
    Algorithmica, 55(4):666–702, 2009.
    @article{DBLP:journals/algorithmica/BoseMSW09,
      author={Prosenjit Bose and Pat Morin and Michiel H. M. Smid and Stefanie Wuhrer},
      title={Clamshell Casting},
      journal={Algorithmica},
      year={2009},
      volume={55},
      number={4},
      pages={666--702},
      doi={10.1007/s00453-007-9160-0},
      url={http://dx.doi.org/10.1007/s00453-007-9160-0}
    }
    
  48. Flips in planar graphs


    Bose, P. and Hurtado, F.
    Comput. Geom., 42(1):60–80, 2009.
    @article{DBLP:journals/comgeo/BoseH09,
      author={Prosenjit Bose and Ferran Hurtado},
      title={Flips in planar graphs},
      journal={Comput. Geom.},
      year={2009},
      volume={42},
      number={1},
      pages={60--80},
      doi={10.1016/j.comgeo.2008.04.001},
      url={http://dx.doi.org/10.1016/j.comgeo.2008.04.001}
    }
    
  49. Geometric spanners with small chromatic number


    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Smid, M. H. M., and Zeh, N.
    Comput. Geom., 42(2):134–146, 2009.
    @article{DBLP:journals/comgeo/BoseCCMSZ09,
      author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Anil Maheshwari and Michiel H. M. Smid and Norbert Zeh},
      title={Geometric spanners with small chromatic number},
      journal={Comput. Geom.},
      year={2009},
      volume={42},
      number={2},
      pages={134--146},
      doi={10.1016/j.comgeo.2008.04.003},
      url={http://dx.doi.org/10.1016/j.comgeo.2008.04.003}
    }
    
  50. A linear-space algorithm for distance preserving graph embedding


    Asano, T., Bose, P., Carmi, P., Maheshwari, A., Shu, C., Smid, M. H. M., and Wuhrer, S.
    Comput. Geom., 42(4):289–304, 2009.
    @article{DBLP:journals/comgeo/AsanoBCMSSW09,
      author={Tetsuo Asano and Prosenjit Bose and Paz Carmi and Anil Maheshwari and Chang Shu and Michiel H. M. Smid and Stefanie Wuhrer},
      title={A linear-space algorithm for distance preserving graph embedding},
      journal={Comput. Geom.},
      year={2009},
      volume={42},
      number={4},
      pages={289--304},
      doi={10.1016/j.comgeo.2008.06.004},
      url={http://dx.doi.org/10.1016/j.comgeo.2008.06.004}
    }
    
  51. Editorial CCCG 2005


    Bose, P. and Mukhopadhyay, A.
    Comput. Geom., 42(5):363, 2009.
    @article{DBLP:journals/comgeo/BoseM09,
      author={Prosenjit Bose and Asish Mukhopadhyay},
      title={Editorial {CCCG} 2005},
      journal={Comput. Geom.},
      year={2009},
      volume={42},
      number={5},
      pages={363},
      doi={10.1016/j.comgeo.2008.12.001},
      url={http://dx.doi.org/10.1016/j.comgeo.2008.12.001}
    }
    
  52. Rotationally monotone polygons


    Bose, P., Morin, P., Smid, M. H. M., and Wuhrer, S.
    Comput. Geom., 42(5):471–483, 2009.
    @article{DBLP:journals/comgeo/BoseMSW09,
      author={Prosenjit Bose and Pat Morin and Michiel H. M. Smid and Stefanie Wuhrer},
      title={Rotationally monotone polygons},
      journal={Comput. Geom.},
      year={2009},
      volume={42},
      number={5},
      pages={471--483},
      doi={10.1016/j.comgeo.2007.02.004},
      url={http://dx.doi.org/10.1016/j.comgeo.2007.02.004}
    }
    
  53. Connectivity-preserving transformations of binary images


    Bose, P., Dujmovic, V., Hurtado, F., and Morin, P.
    Computer Vision and Image Understanding, 113(10):1027–1038, 2009.
    @article{DBLP:journals/cviu/BoseDHM09,
      author={Prosenjit Bose and Vida Dujmovic and Ferran Hurtado and Pat Morin},
      title={Connectivity-preserving transformations of binary images},
      journal={Computer Vision and Image Understanding},
      year={2009},
      volume={113},
      number={10},
      pages={1027--1038},
      doi={10.1016/j.cviu.2007.06.003},
      url={http://dx.doi.org/10.1016/j.cviu.2007.06.003}
    }
    
  54. Traversing a set of points with a minimum number of turns


    Bereg, S., Bose, P., Dumitrescu, A., Hurtado, F., and Valtr, P.
    Discrete & Computational Geometry, 41(4):513–532, 2009.
    @article{DBLP:journals/dcg/BeregBDHV09,
      author={Sergey Bereg and Prosenjit Bose and Adrian Dumitrescu and Ferran Hurtado and Pavel Valtr},
      title={Traversing a Set of Points with a Minimum Number of Turns},
      journal={Discrete {\&} Computational Geometry},
      year={2009},
      volume={41},
      number={4},
      pages={513--532},
      doi={10.1007/s00454-008-9127-1},
      url={http://dx.doi.org/10.1007/s00454-008-9127-1}
    }
    
  55. A polynomial bound for untangling geometric planar graphs


    Bose, P., Dujmovic, V., Hurtado, F., Langerman, S., Morin, P., and Wood, D. R.
    Discrete & Computational Geometry, 42(4):570–585, 2009.
    @article{DBLP:journals/dcg/BoseDHLMW09,
      author={Prosenjit Bose and Vida Dujmovic and Ferran Hurtado and Stefan Langerman and Pat Morin and David R. Wood},
      title={A Polynomial Bound for Untangling Geometric Planar Graphs},
      journal={Discrete {\&} Computational Geometry},
      year={2009},
      volume={42},
      number={4},
      pages={570--585},
      doi={10.1007/s00454-008-9125-3},
      url={http://dx.doi.org/10.1007/s00454-008-9125-3}
    }
    
  56. Delaunay and diamond triangulations contain spanners of bounded degree


    Bose, P., Smid, M. H. M., and Xu, D.
    Int. J. Comput. Geometry Appl., 19(2):119–140, 2009.
    @article{DBLP:journals/ijcga/BoseSX09,
      author={Prosenjit Bose and Michiel H. M. Smid and Daming Xu},
      title={Delaunay and diamond Triangulations contain Spanners of Bounded Degree},
      journal={Int. J. Comput. Geometry Appl.},
      year={2009},
      volume={19},
      number={2},
      pages={119--140},
      doi={10.1142/S0218195909002861},
      url={http://dx.doi.org/10.1142/S0218195909002861}
    }
    
  57. On structural and graph theoretic properties of higher order delaunay graphs


    Abellanas, M., Bose, P., García-López, J., Hurtado, F., Nicolás, C. M., and Ramos, P.
    Int. J. Comput. Geometry Appl., 19(6):595–615, 2009.
    @article{DBLP:journals/ijcga/AbellanasBGHNR09,
      author={Manuel Abellanas and Prosenjit Bose and Jes{\'{u}}s Garc{\'{\i}}a{-}L{\'{o}}pez and Ferran Hurtado and Carlos M. Nicol{\'{a}}s and Pedro Ramos},
      title={On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs},
      journal={Int. J. Comput. Geometry Appl.},
      year={2009},
      volume={19},
      number={6},
      pages={595--615},
      doi={10.1142/S0218195909003143},
      url={http://dx.doi.org/10.1142/S0218195909003143}
    }
    
  58. A note on the lower bound of edge guards of polyhedral terrains


    Bose, P.
    Int. J. Comput. Math., 86(4):577–583, 2009.
    @article{DBLP:journals/ijcm/Bose09,
      author={Prosenjit Bose},
      title={A note on the lower bound of edge guards of polyhedral terrains},
      journal={Int. J. Comput. Math.},
      year={2009},
      volume={86},
      number={4},
      pages={577--583},
      doi={10.1080/00207160701623046},
      url={http://dx.doi.org/10.1080/00207160701623046}
    }
    
  59. Algorithms for optimal outlier removal


    Atanassov, R., Bose, P., Couture, M., Maheshwari, A., Morin, P., Paquette, M., Smid, M. H. M., and Wuhrer, S.
    J. Discrete Algorithms, 7(2):239–248, 2009.
    @article{DBLP:journals/jda/AtanassovBCMMPSW09,
      author={Rossen Atanassov and Prosenjit Bose and Mathieu Couture and Anil Maheshwari and Pat Morin and Michel Paquette and Michiel H. M. Smid and Stefanie Wuhrer},
      title={Algorithms for optimal outlier removal},
      journal={J. Discrete Algorithms},
      year={2009},
      volume={7},
      number={2},
      pages={239--248},
      doi={10.1016/j.jda.2008.12.002},
      url={http://dx.doi.org/10.1016/j.jda.2008.12.002}
    }
    
  60. Augmented reality on cloth with realistic illumination


    Bradley, D., Roth, G., and Bose, P.
    Mach. Vis. Appl., 20(2):85–92, 2009.
    @article{DBLP:journals/mva/BradleyRB09,
      author={Derek Bradley and Gerhard Roth and Prosenjit Bose},
      title={Augmented reality on cloth with realistic illumination},
      journal={Mach. Vis. Appl.},
      year={2009},
      volume={20},
      number={2},
      pages={85--92},
      doi={10.1007/s00138-007-0108-9},
      url={http://dx.doi.org/10.1007/s00138-007-0108-9}
    }
    
  61. Spanners of complete k-partite geometric graphs


    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Morin, P., and Smid, M. H. M.
    SIAM J. Comput., 38(5):1803–1820, 2009.
    @article{DBLP:journals/siamcomp/BoseCCMMS09,
      author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Anil Maheshwari and Pat Morin and Michiel H. M. Smid},
      title={Spanners of Complete k-Partite Geometric Graphs},
      journal={{SIAM} J. Comput.},
      year={2009},
      volume={38},
      number={5},
      pages={1803--1820},
      doi={10.1137/070707130},
      url={http://dx.doi.org/10.1137/070707130}
    }
    
  62. Incremental construction of k-dominating sets in wireless sensor networks


    Couture, M., Barbeau, M., Bose, P., and Kranakis, E.
    Ad Hoc & Sensor Wireless Networks, 5(1-2):47–68, 2008.
    @article{DBLP:journals/ahswn/CoutureBBK08,
      author={Mathieu Couture and Michel Barbeau and Prosenjit Bose and Evangelos Kranakis},
      title={Incremental Construction of k-Dominating Sets in Wireless Sensor Networks},
      journal={Ad Hoc {\&} Sensor Wireless Networks},
      year={2008},
      volume={5},
      number={1-2},
      pages={47--68},
      url={http://www.oldcitypublishing.com/AHSWN/AHSWNabstracts/AHSWN5.1-2abstracts/AHSWNv5n1-2p47-67Courture.html}
    }
    
  63. Editorial


    Bose, P. and Fevens, T.
    Comput. Geom., 39(1):1, 2008.
    @article{DBLP:journals/comgeo/BoseF08,
      author={Prosenjit Bose and Thomas Fevens},
      title={Editorial},
      journal={Comput. Geom.},
      year={2008},
      volume={39},
      number={1},
      pages={1},
      doi={10.1016/j.comgeo.2007.06.002},
      url={http://dx.doi.org/10.1016/j.comgeo.2007.06.002}
    }
    
  64. On local transformations in plane geometric graphs embedded on small grids


    Abellanas, M., Bose, P., Olaverri, A. G., Hurtado, F., Ramos, P., Rivera-Campo, E., and Tejel, J.
    Comput. Geom., 39(2):65–77, 2008.
    @article{DBLP:journals/comgeo/AbellanasBOHRRT08,
      author={Manuel Abellanas and Prosenjit Bose and Alfredo Garc{\'{\i}}a Olaverri and Ferran Hurtado and Pedro Ramos and Eduardo Rivera{-}Campo and Javier Tejel},
      title={On local transformations in plane geometric graphs embedded on small grids},
      journal={Comput. Geom.},
      year={2008},
      volume={39},
      number={2},
      pages={65--77},
      doi={10.1016/j.comgeo.2006.12.004},
      url={http://dx.doi.org/10.1016/j.comgeo.2006.12.004}
    }
    
  65. A polynomial bound for untangling geometric planar graphs


    Bose, P., Dujmovic, V., Hurtado, F., Morin, P., Langerman, S., and Wood, D. R.
    Electronic Notes in Discrete Mathematics, 31:213–218, 2008.
    @article{DBLP:journals/endm/BoseDHMLW08,
      author={Prosenjit Bose and Vida Dujmovic and Ferran Hurtado and Pat Morin and Stefan Langerman and David R. Wood},
      title={A Polynomial Bound for Untangling Geometric Planar Graphs},
      journal={Electronic Notes in Discrete Mathematics},
      year={2008},
      volume={31},
      pages={213--218},
      doi={10.1016/j.endm.2008.06.042},
      url={http://dx.doi.org/10.1016/j.endm.2008.06.042}
    }
    
  66. On the false-positive rate of bloom filters


    Bose, P., Guo, H., Kranakis, E., Maheshwari, A., Morin, P., Morrison, J., Smid, M. H. M., and Tang, Y.
    Inf. Process. Lett., 108(4):210–213, 2008.
    @article{DBLP:journals/ipl/BoseGKMMMST08,
      author={Prosenjit Bose and Hua Guo and Evangelos Kranakis and Anil Maheshwari and Pat Morin and Jason Morrison and Michiel H. M. Smid and Yihui Tang},
      title={On the false-positive rate of Bloom filters},
      journal={Inf. Process. Lett.},
      year={2008},
      volume={108},
      number={4},
      pages={210--213},
      doi={10.1016/j.ipl.2008.05.018},
      url={http://dx.doi.org/10.1016/j.ipl.2008.05.018}
    }
    
  67. A characterization of the degree sequences of 2-trees


    Bose, P., Dujmovic, V., Krizanc, D., Langerman, S., Morin, P., Wood, D. R., and Wuhrer, S.
    Journal of Graph Theory, 58(3):191–209, 2008.
    @article{DBLP:journals/jgt/BoseDKLMWW08,
      author={Prosenjit Bose and Vida Dujmovic and Danny Krizanc and Stefan Langerman and Pat Morin and David R. Wood and Stefanie Wuhrer},
      title={A Characterization of the degree sequences of 2-trees},
      journal={Journal of Graph Theory},
      year={2008},
      volume={58},
      number={3},
      pages={191--209},
      doi={10.1002/jgt.20302},
      url={http://dx.doi.org/10.1002/jgt.20302}
    }
    
  68. Coarse grained parallel algorithms for graph matching


    Chan, A., Dehne, F. K. H. A., Bose, P., and Latzel, M.
    Parallel Computing, 34(1):47–62, 2008.
    @article{DBLP:journals/pc/ChanDBL08,
      author={Albert Chan and Frank K. H. A. Dehne and Prosenjit Bose and Markus Latzel},
      title={Coarse grained parallel algorithms for graph matching},
      journal={Parallel Computing},
      year={2008},
      volume={34},
      number={1},
      pages={47--62},
      doi={10.1016/j.parco.2007.11.004},
      url={http://dx.doi.org/10.1016/j.parco.2007.11.004}
    }
    
  69. Reconfiguring triangulations with edge flips and point moves


    Aloupis, G., Bose, P., and Morin, P.
    Algorithmica, 47(4):367–378, 2007.
    @article{DBLP:journals/algorithmica/AloupisBM07,
      author={Greg Aloupis and Prosenjit Bose and Pat Morin},
      title={Reconfiguring Triangulations with Edge Flips and Point Moves},
      journal={Algorithmica},
      year={2007},
      volume={47},
      number={4},
      pages={367--378},
      doi={10.1007/s00453-006-0168-7},
      url={http://dx.doi.org/10.1007/s00453-006-0168-7}
    }
    
  70. On the stabbing number of a random delaunay triangulation


    Bose, P. and Devroye, L.
    Comput. Geom., 36(2):89–105, 2007.
    @article{DBLP:journals/comgeo/BoseD07,
      author={Prosenjit Bose and Luc Devroye},
      title={On the stabbing number of a random Delaunay triangulation},
      journal={Comput. Geom.},
      year={2007},
      volume={36},
      number={2},
      pages={89--105},
      doi={10.1016/j.comgeo.2006.05.005},
      url={http://dx.doi.org/10.1016/j.comgeo.2006.05.005}
    }
    
  71. Space-efficient geometric divide-and-conquer algorithms


    Bose, P., Maheshwari, A., Morin, P., Morrison, J., Smid, M. H. M., and Vahrenhold, J.
    Comput. Geom., 37(3):209–227, 2007.
    @article{DBLP:journals/comgeo/BoseMMMSV07,
      author={Prosenjit Bose and Anil Maheshwari and Pat Morin and Jason Morrison and Michiel H. M. Smid and Jan Vahrenhold},
      title={Space-efficient geometric divide-and-conquer algorithms},
      journal={Comput. Geom.},
      year={2007},
      volume={37},
      number={3},
      pages={209--227},
      doi={10.1016/j.comgeo.2006.03.006},
      url={http://dx.doi.org/10.1016/j.comgeo.2006.03.006}
    }
    
  72. Geodesic ham-sandwich cuts


    Bose, P., Demaine, E. D., Hurtado, F., Iacono, J., Langerman, S., and Morin, P.
    Discrete & Computational Geometry, 37(3):325–339, 2007.
    @article{DBLP:journals/dcg/BoseDHILM07,
      author={Prosenjit Bose and Erik D. Demaine and Ferran Hurtado and John Iacono and Stefan Langerman and Pat Morin},
      title={Geodesic Ham-Sandwich Cuts},
      journal={Discrete {\&} Computational Geometry},
      year={2007},
      volume={37},
      number={3},
      pages={325--339},
      doi={10.1007/s00454-006-1287-2},
      url={http://dx.doi.org/10.1007/s00454-006-1287-2}
    }
    
  73. A general approximation algorithm for planar maps with applications


    Bose, P., Coll, N., Hurtado, F., and Sellarès, J. A.
    Int. J. Comput. Geometry Appl., 17(6):529–554, 2007.
    @article{DBLP:journals/ijcga/BoseCHS07,
      author={Prosenjit Bose and Narc{\'{\i}}s Coll and Ferran Hurtado and Joan Antoni Sellar{\`{e}}s},
      title={A General Approximation Algorithm for Planar Maps with Applications},
      journal={Int. J. Comput. Geometry Appl.},
      year={2007},
      volume={17},
      number={6},
      pages={529--554},
      doi={10.1142/S0218195907002471},
      url={http://dx.doi.org/10.1142/S0218195907002471}
    }
    
  74. Posture invariant correspondence of incomplete triangular manifolds


    Wuhrer, S., Shu, C., Bose, P., and Azouz, Z. B.
    International Journal of Shape Modeling, 13(2):139–157, 2007.
    @article{DBLP:journals/ijsm/WuhrerSBA07,
      author={Stefanie Wuhrer and Chang Shu and Prosenjit Bose and Zouhour Ben Azouz},
      title={Posture Invariant Correspondence of Incomplete Triangular Manifolds},
      journal={International Journal of Shape Modeling},
      year={2007},
      volume={13},
      number={2},
      pages={139--157},
      doi={10.1142/S0218654307000981},
      url={http://dx.doi.org/10.1142/S0218654307000981}
    }
    
  75. Simultaneous diagonal flips in plane triangulations


    Bose, P., Czyzowicz, J., Gao, Z., Morin, P., and Wood, D. R.
    Journal of Graph Theory, 54(4):307–330, 2007.
    @article{DBLP:journals/jgt/BoseCGMW07,
      author={Prosenjit Bose and Jurek Czyzowicz and Zhicheng Gao and Pat Morin and David R. Wood},
      title={Simultaneous diagonal flips in plane triangulations},
      journal={Journal of Graph Theory},
      year={2007},
      volume={54},
      number={4},
      pages={307--330},
      doi={10.1002/jgt.20214},
      url={http://dx.doi.org/10.1002/jgt.20214}
    }
    
  76. Induced subgraphs of bounded degree and bounded treewidth


    Bose, P., Dujmovic, V., and Wood, D. R.
    Contributions to Discrete Mathematics, 1(1), 2006.
    @article{DBLP:journals/cdm/BoseDW06,
      author={Prosenjit Bose and Vida Dujmovic and David R. Wood},
      title={Induced Subgraphs of Bounded Degree and Bounded Treewidth},
      journal={Contributions to Discrete Mathematics},
      year={2006},
      volume={1},
      number={1},
      url={http://cdm.ucalgary.ca/cdm/index.php/cdm/article/view/44}
    }
    
  77. Equitable subdivisions within polygonal regions


    Bereg, S., Bose, P., and Kirkpatrick, D. G.
    Comput. Geom., 34(1):20–27, 2006.
    @article{DBLP:journals/comgeo/BeregBK06,
      author={Sergey Bereg and Prosenjit Bose and David G. Kirkpatrick},
      title={Equitable subdivisions within polygonal regions},
      journal={Comput. Geom.},
      year={2006},
      volume={34},
      number={1},
      pages={20--27},
      doi={10.1016/j.comgeo.2005.06.003},
      url={http://dx.doi.org/10.1016/j.comgeo.2005.06.003}
    }
    
  78. Partitions of complete geometric graphs into plane trees


    Bose, P., Hurtado, F., Rivera-Campo, E., and Wood, D. R.
    Comput. Geom., 34(2):116–125, 2006.
    @article{DBLP:journals/comgeo/BoseHRW06,
      author={Prosenjit Bose and Ferran Hurtado and Eduardo Rivera{-}Campo and David R. Wood},
      title={Partitions of complete geometric graphs into plane trees},
      journal={Comput. Geom.},
      year={2006},
      volume={34},
      number={2},
      pages={116--125},
      doi={10.1016/j.comgeo.2005.08.006},
      url={http://dx.doi.org/10.1016/j.comgeo.2005.08.006}
    }
    
  79. Area-preserving approximations of polygonal paths


    Bose, P., Cabello, S., Cheong, O., Gudmundsson, J., van Kreveld, M. J., and Speckmann, B.
    J. Discrete Algorithms, 4(4):554–566, 2006.
    @article{DBLP:journals/jda/BoseCCGKS06,
      author={Prosenjit Bose and Sergio Cabello and Otfried Cheong and Joachim Gudmundsson and Marc J. van Kreveld and Bettina Speckmann},
      title={Area-preserving approximations of polygonal paths},
      journal={J. Discrete Algorithms},
      year={2006},
      volume={4},
      number={4},
      pages={554--566},
      doi={10.1016/j.jda.2005.06.008},
      url={http://dx.doi.org/10.1016/j.jda.2005.06.008}
    }
    
  80. On the spanning ratio of gabriel graphs and beta-skeletons


    Bose, P., Devroye, L., Evans, W. S., and Kirkpatrick, D. G.
    SIAM J. Discrete Math., 20(2):412–427, 2006.
    @article{DBLP:journals/siamdm/BoseDEK06,
      author={Prosenjit Bose and Luc Devroye and William S. Evans and David G. Kirkpatrick},
      title={On the Spanning Ratio of Gabriel Graphs and beta-Skeletons},
      journal={{SIAM} J. Discrete Math.},
      year={2006},
      volume={20},
      number={2},
      pages={412--427},
      doi={10.1137/S0895480197318088},
      url={http://dx.doi.org/10.1137/S0895480197318088}
    }
    
  81. Guest editors’ foreword


    Bose, P. and Morin, P.
    Algorithmica, 42(1):1–2, 2005.
    @article{DBLP:journals/algorithmica/BoseM05,
      author={Prosenjit Bose and Pat Morin},
      title={Guest Editors' Foreword},
      journal={Algorithmica},
      year={2005},
      volume={42},
      number={1},
      pages={1--2},
      doi={10.1007/s00453-004-1135-9},
      url={http://dx.doi.org/10.1007/s00453-004-1135-9}
    }
    
  82. Constructing plane spanners of bounded degree and low weight


    Bose, P., Gudmundsson, J., and Smid, M. H. M.
    Algorithmica, 42(3-4):249–264, 2005.
    @article{DBLP:journals/algorithmica/BoseGS05,
      author={Prosenjit Bose and Joachim Gudmundsson and Michiel H. M. Smid},
      title={Constructing Plane Spanners of Bounded Degree and Low Weight},
      journal={Algorithmica},
      year={2005},
      volume={42},
      number={3-4},
      pages={249--264},
      doi={10.1007/s00453-005-1168-8},
      url={http://dx.doi.org/10.1007/s00453-005-1168-8}
    }
    
  83. Generalizing monotonicity: on recognizing special classes of polygons and polyhedra


    Bose, P. and van Kreveld, M. J.
    Int. J. Comput. Geometry Appl., 15(6):591–608, 2005.
    @article{DBLP:journals/ijcga/BoseK05,
      author={Prosenjit Bose and Marc J. van Kreveld},
      title={Generalizing Monotonicity: on Recognizing Special Classes of Polygons and Polyhedra},
      journal={Int. J. Comput. Geometry Appl.},
      year={2005},
      volume={15},
      number={6},
      pages={591--608},
      doi={10.1142/S0218195905001877},
      url={http://dx.doi.org/10.1142/S0218195905001877}
    }
    
  84. Optimizing a constrained convex polygonal annulus


    Barequet, G., Bose, P., Dickerson, M. T., and Goodrich, M. T.
    J. Discrete Algorithms, 3(1):1–26, 2005.
    @article{DBLP:journals/jda/BarequetBDG05,
      author={Gill Barequet and Prosenjit Bose and Matthew T. Dickerson and Michael T. Goodrich},
      title={Optimizing a constrained convex polygonal annulus},
      journal={J. Discrete Algorithms},
      year={2005},
      volume={3},
      number={1},
      pages={1--26},
      doi={10.1016/j.jda.2003.12.004},
      url={http://dx.doi.org/10.1016/j.jda.2003.12.004}
    }
    
  85. On simplifying dot maps


    de Berg, M., Bose, P., Cheong, O., and Morin, P.
    Comput. Geom., 27(1):43–62, 2004.
    @article{DBLP:journals/comgeo/BergBCM04,
      author={Mark de Berg and Prosenjit Bose and Otfried Cheong and Pat Morin},
      title={On simplifying dot maps},
      journal={Comput. Geom.},
      year={2004},
      volume={27},
      number={1},
      pages={43--62},
      doi={10.1016/j.comgeo.2003.07.005},
      url={http://dx.doi.org/10.1016/j.comgeo.2003.07.005}
    }
    
  86. Ordered theta graphs


    Bose, P., Gudmundsson, J., and Morin, P.
    Comput. Geom., 28(1):11–18, 2004.
    @article{DBLP:journals/comgeo/BoseGM04,
      author={Prosenjit Bose and Joachim Gudmundsson and Pat Morin},
      title={Ordered theta graphs},
      journal={Comput. Geom.},
      year={2004},
      volume={28},
      number={1},
      pages={11--18},
      doi={10.1016/j.comgeo.2004.01.003},
      url={http://dx.doi.org/10.1016/j.comgeo.2004.01.003}
    }
    
  87. Approximating geometric bottleneck shortest paths


    Bose, P., Maheshwari, A., Narasimhan, G., Smid, M. H. M., and Zeh, N.
    Comput. Geom., 29(3):233–249, 2004.
    @article{DBLP:journals/comgeo/BoseMNSZ04,
      author={Prosenjit Bose and Anil Maheshwari and Giri Narasimhan and Michiel H. M. Smid and Norbert Zeh},
      title={Approximating geometric bottleneck shortest paths},
      journal={Comput. Geom.},
      year={2004},
      volume={29},
      number={3},
      pages={233--249},
      doi={10.1016/j.comgeo.2004.04.003},
      url={http://dx.doi.org/10.1016/j.comgeo.2004.04.003}
    }
    
  88. Light edges in degree-constrained graphs


    Bose, P., Smid, M. H. M., and Wood, D. R.
    Discrete Mathematics, 282(1-3):35–41, 2004.
    @article{DBLP:journals/dm/BoseSW04,
      author={Prosenjit Bose and Michiel H. M. Smid and David R. Wood},
      title={Light edges in degree-constrained graphs},
      journal={Discrete Mathematics},
      year={2004},
      volume={282},
      number={1-3},
      pages={35--41},
      doi={10.1016/j.disc.2003.12.003},
      url={http://dx.doi.org/10.1016/j.disc.2003.12.003}
    }
    
  89. Packing two disks into a polygonal environment


    Bose, P., Morin, P., and Vigneron, A.
    J. Discrete Algorithms, 2(3):373–380, 2004.
    @article{DBLP:journals/jda/BoseMV04,
      author={Prosenjit Bose and Pat Morin and Antoine Vigneron},
      title={Packing two disks into a polygonal environment},
      journal={J. Discrete Algorithms},
      year={2004},
      volume={2},
      number={3},
      pages={373--380},
      doi={10.1016/j.jda.2003.12.003},
      url={http://dx.doi.org/10.1016/j.jda.2003.12.003}
    }
    
  90. The maximum number of edges in a three-dimensional grid-drawing


    Bose, P., Czyzowicz, J., Morin, P., and Wood, D. R.
    J. Graph Algorithms Appl., 8:21–26, 2004.
    @article{DBLP:journals/jgaa/BoseCMW04,
      author={Prosenjit Bose and Jurek Czyzowicz and Pat Morin and David R. Wood},
      title={The Maximum Number of Edges in a Three-Dimensional Grid-Drawing},
      journal={J. Graph Algorithms Appl.},
      year={2004},
      volume={8},
      pages={21--26},
      url={http://jgaa.info/accepted/2004/Bose+2004.8.1.pdf}
    }
    
  91. Online routing in triangulations


    Bose, P. and Morin, P.
    SIAM J. Comput., 33(4):937–951, 2004.
    @article{DBLP:journals/siamcomp/BoseM04,
      author={Prosenjit Bose and Pat Morin},
      title={Online Routing in Triangulations},
      journal={{SIAM} J. Comput.},
      year={2004},
      volume={33},
      number={4},
      pages={937--951},
      doi={10.1137/S0097539700369387},
      url={http://dx.doi.org/10.1137/S0097539700369387}
    }
    
  92. Competitive online routing in geometric graphs


    Bose, P. and Morin, P.
    Theor. Comput. Sci., 324(2-3):273–288, 2004.
    @article{DBLP:journals/tcs/BoseM04,
      author={Prosenjit Bose and Pat Morin},
      title={Competitive online routing in geometric graphs},
      journal={Theor. Comput. Sci.},
      year={2004},
      volume={324},
      number={2-3},
      pages={273--288},
      doi={10.1016/j.tcs.2004.05.019},
      url={http://dx.doi.org/10.1016/j.tcs.2004.05.019}
    }
    
  93. Testing the quality of manufactured disks and balls


    Bose, P. and Morin, P.
    Algorithmica, 38(1):161–177, 2003.
    @article{DBLP:journals/algorithmica/BoseM03,
      author={Prosenjit Bose and Pat Morin},
      title={Testing the Quality of Manufactured Disks and Balls},
      journal={Algorithmica},
      year={2003},
      volume={38},
      number={1},
      pages={161--177},
      doi={10.1007/s00453-003-1048-z},
      url={http://dx.doi.org/10.1007/s00453-003-1048-z}
    }
    
  94. Fast approximations for sums of distances, clustering and the fermat-weber problem


    Bose, P., Maheshwari, A., and Morin, P.
    Comput. Geom., 24(3):135–146, 2003.
    @article{DBLP:journals/comgeo/BoseMM03,
      author={Prosenjit Bose and Anil Maheshwari and Pat Morin},
      title={Fast approximations for sums of distances, clustering and the Fermat-Weber problem},
      journal={Comput. Geom.},
      year={2003},
      volume={24},
      number={3},
      pages={135--146},
      doi={10.1016/S0925-7721(02)00102-5},
      url={http://dx.doi.org/10.1016/S0925-7721(02)00102-5}
    }
    
  95. Translating a regular grid over a point set


    Bose, P., van Kreveld, M. J., Maheshwari, A., Morin, P., and Morrison, J.
    Comput. Geom., 25(1-2):21–34, 2003.
    @article{DBLP:journals/comgeo/BoseKMMM03,
      author={Prosenjit Bose and Marc J. van Kreveld and Anil Maheshwari and Pat Morin and Jason Morrison},
      title={Translating a regular grid over a point set},
      journal={Comput. Geom.},
      year={2003},
      volume={25},
      number={1-2},
      pages={21--34},
      doi={10.1016/S0925-7721(02)00128-1},
      url={http://dx.doi.org/10.1016/S0925-7721(02)00128-1}
    }
    
  96. Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces


    Bose, P., Kirkpatrick, D. G., and Li, Z.
    Comput. Geom., 26(3):209–219, 2003.
    @article{DBLP:journals/comgeo/BoseKL03,
      author={Prosenjit Bose and David G. Kirkpatrick and Zaiqing Li},
      title={Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces},
      journal={Comput. Geom.},
      year={2003},
      volume={26},
      number={3},
      pages={209--219},
      doi={10.1016/S0925-7721(03)00027-0},
      url={http://dx.doi.org/10.1016/S0925-7721(03)00027-0}
    }
    
  97. Properties of arrangement graphs


    Bose, P., Everett, H., and Wismath, S. K.
    Int. J. Comput. Geometry Appl., 13(6):447–462, 2003.
    @article{DBLP:journals/ijcga/BoseEW03,
      author={Prosenjit Bose and Hazel Everett and Stephen K. Wismath},
      title={Properties of Arrangement Graphs},
      journal={Int. J. Comput. Geometry Appl.},
      year={2003},
      volume={13},
      number={6},
      pages={447--462},
      doi={10.1142/S0218195903001281},
      url={http://dx.doi.org/10.1142/S0218195903001281}
    }
    
  98. Asymmetric communication protocols via hotlink assignments


    Bose, P., Krizanc, D., Langerman, S., and Morin, P.
    Theory Comput. Syst., 36(6):655–661, 2003.
    @article{DBLP:journals/mst/BoseKLM03,
      author={Prosenjit Bose and Danny Krizanc and Stefan Langerman and Pat Morin},
      title={Asymmetric Communication Protocols via Hotlink Assignments},
      journal={Theory Comput. Syst.},
      year={2003},
      volume={36},
      number={6},
      pages={655--661},
      doi={10.1007/s00224-003-1126-2},
      url={http://dx.doi.org/10.1007/s00224-003-1126-2}
    }
    
  99. Some aperture-angle optimization problems


    Bose, P., Hurtado, F., Omaña-Pulido, E., Snoeyink, J., and Toussaint, G. T.
    Algorithmica, 33(4):411–435, 2002.
    @article{DBLP:journals/algorithmica/BoseHOST02,
      author={Prosenjit Bose and Ferran Hurtado and Elsa Oma{\~{n}}a{-}Pulido and Jack Snoeyink and Godfried T. Toussaint},
      title={Some Aperture-Angle Optimization Problems},
      journal={Algorithmica},
      year={2002},
      volume={33},
      number={4},
      pages={411--435},
      doi={10.1007/s00453-001-0112-9},
      url={http://dx.doi.org/10.1007/s00453-001-0112-9}
    }
    
  100. Separating an object from its cast


    Ahn, H., de Berg, M., Bose, P., Cheng, S., Halperin, D., Matousek, J., and Schwarzkopf, O.
    Computer-Aided Design, 34(8):547–559, 2002.
    @article{DBLP:journals/cad/AhnBBCHMS02,
      author={Hee{-}Kap Ahn and Mark de Berg and Prosenjit Bose and Siu{-}Wing Cheng and Dan Halperin and Jir{\'{\i}} Matousek and Otfried Schwarzkopf},
      title={Separating an object from its cast},
      journal={Computer-Aided Design},
      year={2002},
      volume={34},
      number={8},
      pages={547--559},
      doi={10.1016/S0010-4485(01)00119-1},
      url={http://dx.doi.org/10.1016/S0010-4485(01)00119-1}
    }
    
  101. Experimental results on quadrangulations of sets of fixed points


    Bose, P., Ramaswami, S., Toussaint, G. T., and Turki, A.
    Computer Aided Geometric Design, 19(7):533–552, 2002.
    @article{DBLP:journals/cagd/BoseRTT02,
      author={Prosenjit Bose and Suneeta Ramaswami and Godfried T. Toussaint and Alain Turki},
      title={Experimental results on quadrangulations of sets of fixed points},
      journal={Computer Aided Geometric Design},
      year={2002},
      volume={19},
      number={7},
      pages={533--552},
      doi={10.1016/S0167-8396(02)00133-4},
      url={http://dx.doi.org/10.1016/S0167-8396(02)00133-4}
    }
    
  102. On embedding an outer-planar graph in a point set


    Bose, P.
    Comput. Geom., 23(3):303–312, 2002.
    @article{DBLP:journals/comgeo/Bose02,
      author={Prosenjit Bose},
      title={On embedding an outer-planar graph in a point set},
      journal={Comput. Geom.},
      year={2002},
      volume={23},
      number={3},
      pages={303--312},
      doi={10.1016/S0925-7721(01)00069-4},
      url={http://dx.doi.org/10.1016/S0925-7721(01)00069-4}
    }
    
  103. Efficient visibility queries in simple polygons


    Bose, P., Lubiw, A., and Munro, J. I.
    Comput. Geom., 23(3):313–335, 2002.
    @article{DBLP:journals/comgeo/BoseLM02,
      author={Prosenjit Bose and Anna Lubiw and J. Ian Munro},
      title={Efficient visibility queries in simple polygons},
      journal={Comput. Geom.},
      year={2002},
      volume={23},
      number={3},
      pages={313--335},
      doi={10.1016/S0925-7721(01)00070-0},
      url={http://dx.doi.org/10.1016/S0925-7721(01)00070-0}
    }
    
  104. Online routing in convex subdivisions


    Bose, P., Brodnik, A., Carlsson, S., Demaine, E. D., Fleischer, R., López-Ortiz, A., Morin, P., and Munro, J. I.
    Int. J. Comput. Geometry Appl., 12(4):283–296, 2002.
    @article{DBLP:journals/ijcga/BoseBCDFLMM02,
      author={Prosenjit Bose and Andrej Brodnik and Svante Carlsson and Erik D. Demaine and Rudolf Fleischer and Alejandro L{\'{o}}pez{-}Ortiz and Pat Morin and J. Ian Munro},
      title={Online Routing in Convex Subdivisions},
      journal={Int. J. Comput. Geometry Appl.},
      year={2002},
      volume={12},
      number={4},
      pages={283--296},
      doi={10.1142/S021819590200089X},
      url={http://dx.doi.org/10.1142/S021819590200089X}
    }
    
  105. An improved algorithm for subdivision traversal without extra storage


    Bose, P. and Morin, P.
    Int. J. Comput. Geometry Appl., 12(4):297–308, 2002.
    @article{DBLP:journals/ijcga/BoseM02,
      author={Prosenjit Bose and Pat Morin},
      title={An Improved Algorithm for Subdivision Traversal without Extra Storage},
      journal={Int. J. Comput. Geometry Appl.},
      year={2002},
      volume={12},
      number={4},
      pages={297--308},
      doi={10.1142/S0218195902000906},
      url={http://dx.doi.org/10.1142/S0218195902000906}
    }
    
  106. Diamonds are not a minimum weight triangulation’s best friend


    Bose, P., Devroye, L., and Evans, W. S.
    Int. J. Comput. Geometry Appl., 12(6):445–454, 2002.
    @article{DBLP:journals/ijcga/BoseDE02,
      author={Prosenjit Bose and Luc Devroye and William S. Evans},
      title={Diamonds are Not a Minimum Weight Triangulation's Best Friend},
      journal={Int. J. Comput. Geometry Appl.},
      year={2002},
      volume={12},
      number={6},
      pages={445--454},
      doi={10.1142/S0218195902000979},
      url={http://dx.doi.org/10.1142/S0218195902000979}
    }
    
  107. Finding specified sections of arrangements: 2d results


    Bose, P., Hurtado, F., Meijer, H., Ramaswami, S., Rappaport, D., Sacristán, V., Shermer, T. C., and Toussaint, G. T.
    J. Math. Model. Algorithms, 1(1):3–16, 2002.
    @article{DBLP:journals/jmma/BoseHMRRSST02,
      author={Prosenjit Bose and Ferran Hurtado and Henk Meijer and Suneeta Ramaswami and David Rappaport and Vera Sacrist{\'{a}}n and Thomas C. Shermer and Godfried T. Toussaint},
      title={Finding Specified Sections of Arrangements: 2D Results},
      journal={J. Math. Model. Algorithms},
      year={2002},
      volume={1},
      number={1},
      pages={3--16},
      doi={10.1023/A:1015648719133},
      url={http://dx.doi.org/10.1023/A:1015648719133}
    }
    
  108. Station layouts in the presence of location constraints


    Bose, P., Kranakis, E., Kaklamanis, C., Kirousis, L. M., Krizanc, D., and Peleg, D.
    Journal of Interconnection Networks, 3(1-2):1–17, 2002.
    @article{DBLP:journals/join/BoseKKKKP02,
      author={Prosenjit Bose and Evangelos Kranakis and Christos Kaklamanis and Lefteris M. Kirousis and Danny Krizanc and David Peleg},
      title={Station Layouts in the Presence of Location Constraints},
      journal={Journal of Interconnection Networks},
      year={2002},
      volume={3},
      number={1-2},
      pages={1--17},
      doi={10.1142/S0219265902000513},
      url={http://dx.doi.org/10.1142/S0219265902000513}
    }
    
  109. Every set of disjoint line segments admits a binary tree


    Bose, P., Houle, M. E., and Toussaint, G. T.
    Discrete & Computational Geometry, 26(3):387–410, 2001.
    @article{DBLP:journals/dcg/BoseHT01,
      author={Prosenjit Bose and Michael E. Houle and Godfried T. Toussaint},
      title={Every Set of Disjoint Line Segments Admits a Binary Tree},
      journal={Discrete {\&} Computational Geometry},
      year={2001},
      volume={26},
      number={3},
      pages={387--410},
      doi={10.1007/s00454-001-0042-y},
      url={http://dx.doi.org/10.1007/s00454-001-0042-y}
    }
    
  110. Efficient algorithms for petersen’s matching theorem


    Biedl, T. C., Bose, P., Demaine, E. D., and Lubiw, A.
    J. Algorithms, 38(1):110–134, 2001.
    @article{DBLP:journals/jal/BiedlBDL01,
      author={Therese C. Biedl and Prosenjit Bose and Erik D. Demaine and Anna Lubiw},
      title={Efficient Algorithms for Petersen's Matching Theorem},
      journal={J. Algorithms},
      year={2001},
      volume={38},
      number={1},
      pages={110--134},
      doi={10.1006/jagm.2000.1132},
      url={http://dx.doi.org/10.1006/jagm.2000.1132}
    }
    
  111. Routing with guaranteed delivery in ad hoc wireless networks


    Bose, P., Morin, P., Stojmenovic, I., and Urrutia, J.
    Wireless Networks, 7(6):609–616, 2001.
    @article{DBLP:journals/winet/BoseMSU01,
      author={Prosenjit Bose and Pat Morin and Ivan Stojmenovic and Jorge Urrutia},
      title={Routing with Guaranteed Delivery in Ad Hoc Wireless Networks},
      journal={Wireless Networks},
      year={2001},
      volume={7},
      number={6},
      pages={609--616},
      doi={10.1023/A:1012319418150},
      url={http://dx.doi.org/10.1023/A:1012319418150}
    }
    
  112. Drawing nice projections of objects in space


    Bose, P., Gómez, F., Ramos, P., and Toussaint, G.
    J. Visual Communication and Image Representation, 10(2):155–172, 1999.
    @article{DBLP:journals/jvcir/BoseGRT99,
      author={Prosenjit Bose and Francisco G{\'{o}}mez and Pedro Ramos and Godfried Toussaint},
      title={Drawing Nice Projections of Objects in Space},
      journal={J. Visual Communication and Image Representation},
      year={1999},
      volume={10},
      number={2},
      pages={155--172},
      doi={10.1006/jvci.1999.0415},
      url={http://dx.doi.org/10.1006/jvci.1999.0415}
    }
    
  113. Filling polyhedral molds


    Bose, P., van Kreveld, M. J., and Toussaint, G. T.
    Computer-Aided Design, 30(4):245–254, 1998.
    @article{DBLP:journals/cad/BoseKT98,
      author={Prosenjit Bose and Marc J. van Kreveld and Godfried T. Toussaint},
      title={Filling polyhedral molds},
      journal={Computer-Aided Design},
      year={1998},
      volume={30},
      number={4},
      pages={245--254},
      doi={10.1016/S0010-4485(97)00075-4},
      url={http://dx.doi.org/10.1016/S0010-4485(97)00075-4}
    }
    
  114. Computing constrained minimum-width annuli of point sets


    de Berg, M., Bose, P., Bremner, D., Ramaswami, S., and Wilfong, G. T.
    Computer-Aided Design, 30(4):267–275, 1998.
    @article{DBLP:journals/cad/BergBBRW98,
      author={Mark de Berg and Prosenjit Bose and David Bremner and Suneeta Ramaswami and Gordon T. Wilfong},
      title={Computing constrained minimum-width annuli of point sets},
      journal={Computer-Aided Design},
      year={1998},
      volume={30},
      number={4},
      pages={267--275},
      doi={10.1016/S0010-4485(97)00073-0},
      url={http://dx.doi.org/10.1016/S0010-4485(97)00073-0}
    }
    
  115. Intersections with random geometric objects


    Bose, P. and Devroye, L.
    Comput. Geom., 10(3):139–154, 1998.
    @article{DBLP:journals/comgeo/BoseD98,
      author={Prosenjit Bose and Luc Devroye},
      title={Intersections with random geometric objects},
      journal={Comput. Geom.},
      year={1998},
      volume={10},
      number={3},
      pages={139--154},
      doi={10.1016/S0925-7721(98)00004-2},
      url={http://dx.doi.org/10.1016/S0925-7721(98)00004-2}
    }
    
  116. Pattern matching for permutations


    Bose, P., Buss, J. F., and Lubiw, A.
    Inf. Process. Lett., 65(5):277–283, 1998.
    @article{DBLP:journals/ipl/BoseBL98,
      author={Prosenjit Bose and Jonathan F. Buss and Anna Lubiw},
      title={Pattern Matching for Permutations},
      journal={Inf. Process. Lett.},
      year={1998},
      volume={65},
      number={5},
      pages={277--283},
      doi={10.1016/S0020-0190(97)00209-3},
      url={http://dx.doi.org/10.1016/S0020-0190(97)00209-3}
    }
    
  117. A visibility representation for graphs in three dimensions


    Bose, P., Everett, H., Fekete, S. P., Houle, M. E., Lubiw, A., Meijer, H., Romanik, K., Rote, G., Shermer, T. C., Whitesides, S., and Zelle, C.
    J. Graph Algorithms Appl., 2(2), 1998.
    @article{DBLP:journals/jgaa/BoseEFHLMRRSWZ98,
      author={Prosenjit Bose and Hazel Everett and S{\'{a}}ndor P. Fekete and Michael E. Houle and Anna Lubiw and Henk Meijer and Kathleen Romanik and G{\"{u}}nter Rote and Thomas C. Shermer and Sue Whitesides and Christian Zelle},
      title={A Visibility Representation for Graphs in Three Dimensions},
      journal={J. Graph Algorithms Appl.},
      year={1998},
      volume={2},
      number={2},
      url={http://www.cs.brown.edu/publications/jgaa/accepted/98/Bose+a4-98.2.3.pdf}
    }
    
  118. Feasibility of design in stereolithography


    Asberg, B., Blanco, G., Bose, P., Garcia-Lopez, J., Overmars, M. H., Toussaint, G. T., Wilfong, G. T., and Zhu, B.
    Algorithmica, 19(1/2):61–83, 1997.
    @article{DBLP:journals/algorithmica/AsbergBBGOTWZ97,
      author={Boudewijn Asberg and Gregoria Blanco and Prosenjit Bose and Jesus Garcia{-}Lopez and Mark H. Overmars and Godfried T. Toussaint and Gordon T. Wilfong and Binhai Zhu},
      title={Feasibility of Design in Stereolithography},
      journal={Algorithmica},
      year={1997},
      volume={19},
      number={1/2},
      pages={61--83},
      doi={10.1007/PL00014421},
      url={http://dx.doi.org/10.1007/PL00014421}
    }
    
  119. Determining the castability of simple polyhedra


    Bose, P., Bremner, D., and van Kreveld, M. J.
    Algorithmica, 19(1/2):84–113, 1997.
    @article{DBLP:journals/algorithmica/BoseBK97,
      author={Prosenjit Bose and David Bremner and Marc J. van Kreveld},
      title={Determining the Castability of Simple Polyhedra},
      journal={Algorithmica},
      year={1997},
      volume={19},
      number={1/2},
      pages={84--113},
      doi={10.1007/PL00014422},
      url={http://dx.doi.org/10.1007/PL00014422}
    }
    
  120. Characterizing and efficiently computing quadrangulations of planar point sets


    Bose, P. and Toussaint, G. T.
    Computer Aided Geometric Design, 14(8):763–785, 1997.
    @article{DBLP:journals/cagd/BoseT97,
      author={Prosenjit Bose and Godfried T. Toussaint},
      title={Characterizing and efficiently computing quadrangulations of planar point sets},
      journal={Computer Aided Geometric Design},
      year={1997},
      volume={14},
      number={8},
      pages={763--785},
      doi={10.1016/S0167-8396(97)00013-7},
      url={http://dx.doi.org/10.1016/S0167-8396(97)00013-7}
    }
    
  121. Guarding polyhedral terrains


    Bose, P., Shermer, T. C., Toussaint, G. T., and Zhu, B.
    Comput. Geom., 7:173–185, 1997.
    @article{DBLP:journals/comgeo/BoseSTZ97,
      author={Prosenjit Bose and Thomas C. Shermer and Godfried T. Toussaint and Binhai Zhu},
      title={Guarding Polyhedral Terrains},
      journal={Comput. Geom.},
      year={1997},
      volume={7},
      pages={173--185},
      doi={10.1016/0925-7721(95)00034-8},
      url={http://dx.doi.org/10.1016/0925-7721(95)00034-8}
    }
    
  122. The floodlight problem


    Bose, P., Guibas, L. J., Lubiw, A., Overmars, M. H., Souvaine, D. L., and Urrutia, J.
    Int. J. Comput. Geometry Appl., 7(1/2):153–163, 1997.
    @article{DBLP:journals/ijcga/BoseGLOSU97,
      author={Prosenjit Bose and Leonidas J. Guibas and Anna Lubiw and Mark H. Overmars and Diane L. Souvaine and Jorge Urrutia},
      title={The Floodlight Problem},
      journal={Int. J. Comput. Geometry Appl.},
      year={1997},
      volume={7},
      number={1/2},
      pages={153--163},
      doi={10.1142/S0218195997000090},
      url={http://dx.doi.org/10.1142/S0218195997000090}
    }
    
  123. Optimal algorithms to embed trees in a point set


    Bose, P., McAllister, M., and Snoeyink, J.
    J. Graph Algorithms Appl., 1, 1997.
    @article{DBLP:journals/jgaa/BoseMS97,
      author={Prosenjit Bose and Michael McAllister and Jack Snoeyink},
      title={Optimal Algorithms to Embed Trees in a Point Set},
      journal={J. Graph Algorithms Appl.},
      year={1997},
      volume={1},
      url={http://www.cs.brown.edu/publications/jgaa/accepted/97/BoseMcAllisterSnoeyink97.1.2.pdf}
    }
    
  124. Characterizing proximity trees


    Bose, P., Lenhart, W., and Liotta, G.
    Algorithmica, 16(1):83–110, 1996.
    @article{DBLP:journals/algorithmica/BoseLL96,
      author={Prosenjit Bose and William Lenhart and Giuseppe Liotta},
      title={Characterizing Proximity Trees},
      journal={Algorithmica},
      year={1996},
      volume={16},
      number={1},
      pages={83--110},
      doi={10.1007/BF02086609},
      url={http://dx.doi.org/10.1007/BF02086609}
    }
    
  125. All convex polyhedra can be clamped with parallel jaw grippers


    Bose, P., Bremner, D., and Toussaint, G. T.
    Comput. Geom., 6:291–302, 1996.
    @article{DBLP:journals/comgeo/BoseBT96,
      author={Prosenjit Bose and David Bremner and Godfried T. Toussaint},
      title={All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers},
      journal={Comput. Geom.},
      year={1996},
      volume={6},
      pages={291--302},
      doi={10.1016/0925-7721(95)00052-6},
      url={http://dx.doi.org/10.1016/0925-7721(95)00052-6}
    }
    
  126. Geometric and computational aspects of gravity casting


    Bose, P. and Toussaint, G. T.
    Computer-Aided Design, 27(6):455–464, 1995.
    @article{DBLP:journals/cad/BoseT95,
      author={Prosenjit Bose and Godfried T. Toussaint},
      title={Geometric and computational aspects of gravity casting},
      journal={Computer-Aided Design},
      year={1995},
      volume={27},
      number={6},
      pages={455--464},
      doi={10.1016/0010-4485(95)00018-M},
      url={http://dx.doi.org/10.1016/0010-4485(95)00018-M}
    }
    
  127. Growing a tree from its branches


    Bose, P. and Toussaint, G. T.
    J. Algorithms, 19(1):86–103, 1995.
    @article{DBLP:journals/jal/BoseT95,
      author={Prosenjit Bose and Godfried T. Toussaint},
      title={Growing a Tree from Its Branches},
      journal={J. Algorithms},
      year={1995},
      volume={19},
      number={1},
      pages={86--103},
      doi={10.1006/jagm.1995.1028},
      url={http://dx.doi.org/10.1006/jagm.1995.1028}
    }
    
  128. Geometric and computational aspects of manufacturing processes


    Bose, P. and Toussaint, G. T.
    Computers & Graphics, 18(4):487–497, 1994.
    @article{DBLP:journals/cg/BoseT94,
      author={Prosenjit Bose and Godfried T. Toussaint},
      title={Geometric and computational aspects of manufacturing processes},
      journal={Computers {\&} Graphics},
      year={1994},
      volume={18},
      number={4},
      pages={487--497},
      doi={10.1016/0097-8493(94)90061-2},
      url={http://dx.doi.org/10.1016/0097-8493(94)90061-2}
    }
    
  129. Isoperimetric triangular enclosures with a fixed angle


    Bose, P. and Carufel, J.-L. D.
    J. Geom., 104(2):229–255, 2013.
    @article{MR3089778,
      author={Prosenjit Bose and Jean-Lou De Carufel},
      title={Isoperimetric triangular enclosures with a fixed angle},
      journal={J. Geom.},
      year={2013},
      volume={104},
      number={2},
      pages={229--255},
      issn={0047-2468},
      doi={10.1007/s00022-013-0167-1},
      url={http://dx.doi.org/10.1007/s00022-013-0167-1}
    }
    
  130. A generalized Winternitz theorem


    Bose, P., Carmi, P., Hurtado, F., and Morin, P.
    J. Geom., 100(1-2):29–35, 2011.
    @article{MR2845275,
      author={Prosenjit Bose and Paz Carmi and Ferran Hurtado and Pat Morin},
      title={A generalized {W}internitz theorem},
      journal={J. Geom.},
      year={2011},
      volume={100},
      number={1-2},
      pages={29--35},
      issn={0047-2468},
      doi={10.1007/s00022-011-0076-0},
      url={http://dx.doi.org/10.1007/s00022-011-0076-0}
    }
    
  131. Cutting circles into equal area pieces


    Bose, P., Czyzowicz, J., Kranakis, E., Krizanc, D., and Maheshwari, A.
    Geombinatorics, 11(1):13–20, 2001.
    @article{MR1837578,
      author={Prosenjit Bose and Jurek Czyzowicz and Evangelos Kranakis and Danny Krizanc and Anil Maheshwari},
      title={Cutting circles into equal area pieces},
      journal={Geombinatorics},
      year={2001},
      volume={11},
      number={1},
      pages={13--20},
      issn={1065-7371}
    }
    
  132. Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications


    Bose, P. and Toussaint, G.
    Stud. Locat. Anal., (15):37–66, 2000.
    @article{MR1802589,
      author={Prosenjit Bose and Godfried Toussaint},
      title={Computing the constrained {E}uclidean, geodesic and link centre of a simple polygon with applications},
      journal={Stud. Locat. Anal.},
      year={2000},
      number={15},
      pages={37--66},
      issn={1105-5162}
    }
    
  133. Flipping your lid


    Ahn, H.-K., Bose, P., Czyzowicz, J., Hanusse, N., Kranakis, E., and Morin, P.
    Geombinatorics, 10(2):57–63, 2000.
    @article{MR1784372,
      author={Hee-Kap Ahn and Prosenjit Bose and Jurek Czyzowicz and Nicolas Hanusse and Evangelos Kranakis and Pat Morin},
      title={Flipping your lid},
      journal={Geombinatorics},
      year={2000},
      volume={10},
      number={2},
      pages={57--63},
      issn={1065-7371}
    }
    
  134. Formalization of the general video temporal synchronization problem


    Whitehead, A., Laganiere, R., and Bose, P.
    Electronic Letters on Computer Vision and Image Analysis, 9(1):1–17, 2010.
    @article{WLB10,
      author={Anthony Whitehead and Robert Laganiere and Prosenjit Bose},
      title={Formalization of the General Video Temporal Synchronization Problem},
      journal={Electronic Letters on Computer Vision and Image Analysis},
      year={2010},
      volume={9},
      number={1},
      pages={1--17}
    }
    

Conference papers

  1. Improved spanning ratio for low degree plane spanners


    Bose, P., Hill, D., and Smid, M. H. M.
    In LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, pages 249–262, 2016.
    @inproceedings{DBLP:conf/latin/BoseHS16,
      author={Prosenjit Bose and Darryl Hill and Michiel H. M. Smid},
      title={Improved Spanning Ratio for Low Degree Plane Spanners},
      booktitle={{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings},
      year={2016},
      editor={Evangelos Kranakis and Gonzalo Navarro and Edgar Ch{\'{a}}vez},
      publisher={Springer},
      volume={9644},
      series={Lecture Notes in Computer Science},
      pages={249--262},
      doi={10.1007/978-3-662-49529-2_19},
      url={http://dx.doi.org/10.1007/978-3-662-49529-2_19}
    }
    
  2. A general framework for searching on a line


    Bose, P. and Carufel, J. D.
    In WALCOM: Algorithms and Computation - 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings, pages 143–153, 2016.
    @inproceedings{DBLP:conf/walcom/BoseC16,
      author={Prosenjit Bose and Jean{-}Lou De Carufel},
      title={A General Framework for Searching on a Line},
      booktitle={{WALCOM:} Algorithms and Computation - 10th International Workshop, {WALCOM} 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings},
      year={2016},
      editor={Mohammad Kaykobad and Rossella Petreschi},
      publisher={Springer},
      volume={9627},
      series={Lecture Notes in Computer Science},
      pages={143--153},
      doi={10.1007/978-3-319-30139-6_12},
      url={http://dx.doi.org/10.1007/978-3-319-30139-6_12}
    }
    
  3. One of ferran hurtado’s favorite topics - flips


    Bose, P.
    In Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015, Kingston, Ontario, Canada, August 10-12, 2015, 2015.
    @inproceedings{DBLP:conf/cccg/Bose15,
      author={Prosenjit Bose},
      title={One of Ferran Hurtado's favorite topics - Flips},
      booktitle={Proceedings of the 27th Canadian Conference on Computational Geometry, {CCCG} 2015, Kingston, Ontario, Canada, August 10-12, 2015},
      year={2015},
      publisher={Queen's University, Ontario, Canada},
      url={http://research.cs.queensu.ca/cccg2015/CCCG15-papers/JitBose.pdf}
    }
    
  4. Constrained empty-rectangle delaunay graphs


    Bose, P., Carufel, J. D., and van Renssen, A.
    In Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015, Kingston, Ontario, Canada, August 10-12, 2015, 2015.
    @inproceedings{DBLP:conf/cccg/BoseCR15,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Andr{\'{e}} van Renssen},
      title={Constrained Empty-Rectangle Delaunay Graphs},
      booktitle={Proceedings of the 27th Canadian Conference on Computational Geometry, {CCCG} 2015, Kingston, Ontario, Canada, August 10-12, 2015},
      year={2015},
      publisher={Queen's University, Ontario, Canada},
      url={http://research.cs.queensu.ca/cccg2015/CCCG15-papers/15.pdf}
    }
    
  5. Flips in edge-labelled pseudo-triangulations


    Bose, P. and Verdonschot, S.
    In Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015, Kingston, Ontario, Canada, August 10-12, 2015, 2015.
    @inproceedings{DBLP:conf/cccg/BoseV15,
      author={Prosenjit Bose and Sander Verdonschot},
      title={Flips in Edge-Labelled Pseudo-Triangulations},
      booktitle={Proceedings of the 27th Canadian Conference on Computational Geometry, {CCCG} 2015, Kingston, Ontario, Canada, August 10-12, 2015},
      year={2015},
      publisher={Queen's University, Ontario, Canada},
      url={http://research.cs.queensu.ca/cccg2015/CCCG15-papers/38.pdf}
    }
    
  6. The shadows of a cycle cannot all be paths


    Viglietta, G., Bose, P., Carufel, J. D., Dobbins, M. G., and Kim, H.
    In Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015, Kingston, Ontario, Canada, August 10-12, 2015, 2015.
    @inproceedings{DBLP:conf/cccg/VigliettaBCDK15,
      author={Giovanni Viglietta and Prosenjit Bose and Jean{-}Lou De Carufel and Michael Gene Dobbins and Heuna Kim},
      title={The Shadows of a Cycle Cannot All Be Paths},
      booktitle={Proceedings of the 27th Canadian Conference on Computational Geometry, {CCCG} 2015, Kingston, Ontario, Canada, August 10-12, 2015},
      year={2015},
      publisher={Queen's University, Ontario, Canada},
      url={http://research.cs.queensu.ca/cccg2015/CCCG15-papers/32.pdf}
    }
    
  7. A linear-time algorithm for the geodesic center of a simple polygon


    Ahn, H., Barba, L., Bose, P., Carufel, J. D., Korman, M., and Oh, E.
    In 31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands, pages 209–223, 2015.
    @inproceedings{DBLP:conf/compgeom/AhnBBCKO15,
      author={Hee{-}Kap Ahn and Luis Barba and Prosenjit Bose and Jean{-}Lou De Carufel and Matias Korman and Eunjin Oh},
      title={A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon},
      booktitle={31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands},
      year={2015},
      editor={Lars Arge and J{\'{a}}nos Pach},
      publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
      volume={34},
      series={LIPIcs},
      pages={209--223},
      doi={10.4230/LIPIcs.SOCG.2015.209},
      url={http://dx.doi.org/10.4230/LIPIcs.SOCG.2015.209}
    }
    
  8. Upper and lower bounds for online routing on delaunay triangulations


    Bonichon, N., Bose, P., Carufel, J. D., Perkovic, L., and van Renssen, A.
    In Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, pages 203–214, 2015.
    @inproceedings{DBLP:conf/esa/BonichonBCPR15,
      author={Nicolas Bonichon and Prosenjit Bose and Jean{-}Lou De Carufel and Ljubomir Perkovic and Andr{\'{e}} van Renssen},
      title={Upper and Lower Bounds for Online Routing on Delaunay Triangulations},
      booktitle={Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings},
      year={2015},
      editor={Nikhil Bansal and Irene Finocchi},
      publisher={Springer},
      volume={9294},
      series={Lecture Notes in Computer Science},
      pages={203--214},
      doi={10.1007/978-3-662-48350-3_18},
      url={http://dx.doi.org/10.1007/978-3-662-48350-3_18}
    }
    
  9. Competitive local routing with constraints


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    In Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings, pages 23–34, 2015.
    @inproceedings{DBLP:conf/isaac/BoseFRV15,
      author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={Competitive Local Routing with Constraints},
      booktitle={Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
      year={2015},
      editor={Khaled M. Elbassioni and Kazuhisa Makino},
      publisher={Springer},
      volume={9472},
      series={Lecture Notes in Computer Science},
      pages={23--34},
      doi={10.1007/978-3-662-48971-0_3},
      url={http://dx.doi.org/10.1007/978-3-662-48971-0_3}
    }
    
  10. Local routing in convex subdivisions


    Bose, P., Durocher, S., Mondal, D., Peabody, M., Skala, M., and Wahid, M. A.
    In SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. Proceedings, pages 140–151, 2015.
    @inproceedings{DBLP:conf/sofsem/BoseDMPSW15,
      author={Prosenjit Bose and Stephane Durocher and Debajyoti Mondal and Maxime Peabody and Matthew Skala and Mohammad Abdul Wahid},
      title={Local Routing in Convex Subdivisions},
      booktitle={{SOFSEM} 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sn{\v{e}}{\v{z}}kou, Czech Republic, January 24-29, 2015. Proceedings},
      year={2015},
      editor={Giuseppe F. Italiano and Tiziana Margaria{-}Steffen and Jaroslav Pokorn{\'{y}} and Jean{-}Jacques Quisquater and Roger Wattenhofer},
      publisher={Springer},
      volume={8939},
      series={Lecture Notes in Computer Science},
      pages={140--151},
      doi={10.1007/978-3-662-46078-8_12},
      url={http://dx.doi.org/10.1007/978-3-662-46078-8_12}
    }
    
  11. Plane geodesic spanning trees, hamiltonian cycles, and perfect matchings in a simple polygon


    Biniaz, A., Bose, P., Maheshwari, A., and Smid, M. H. M.
    In Topics in Theoretical Computer Science - The First IFIP WG 1.8 International Conference, TTCS 2015, Tehran, Iran, August 26-28, 2015, Revised Selected Papers, pages 56–71, 2015.
    @inproceedings{DBLP:conf/ttcs/BiniazBMS15,
      author={Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel H. M. Smid},
      title={Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon},
      booktitle={Topics in Theoretical Computer Science - The First {IFIP} {WG} 1.8 International Conference, {TTCS} 2015, Tehran, Iran, August 26-28, 2015, Revised Selected Papers},
      year={2015},
      editor={Mohammad Taghi Hajiaghayi and Mohammad Reza Mousavi},
      publisher={Springer},
      volume={9541},
      series={Lecture Notes in Computer Science},
      pages={56--71},
      doi={10.1007/978-3-319-28678-5_5},
      url={http://dx.doi.org/10.1007/978-3-319-28678-5_5}
    }
    
  12. A general framework to generate sizing systems from 3d motion data applied to face mask design


    Bolkart, T., Bose, P., Shu, C., and Wuhrer, S.
    In 2nd International Conference on 3D Vision, 3DV 2014, Tokyo, Japan, December 8-11, 2014, Volume 1, pages 425–431, 2014.
    @inproceedings{DBLP:conf/3dim/BolkartB0W14,
      author={Timo Bolkart and Prosenjit Bose and Chang Shu and Stefanie Wuhrer},
      title={A General Framework to Generate Sizing Systems from 3D Motion Data Applied to Face Mask Design},
      booktitle={2nd International Conference on 3D Vision, 3DV 2014, Tokyo, Japan, December 8-11, 2014, Volume 1},
      year={2014},
      publisher={{IEEE} Computer Society},
      pages={425--431},
      doi={10.1109/3DV.2014.43},
      url={http://dx.doi.org/10.1109/3DV.2014.43}
    }
    
  13. Continuous yao graphs


    Barba, L., Bose, P., Carufel, J. D., Damian, M., Fagerberg, R., van Renssen, A., Taslakian, P., and Verdonschot, S.
    In Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014, 2014.
    @inproceedings{DBLP:conf/cccg/BarbaBCDFRTV14,
      author={Luis Barba and Prosenjit Bose and Jean{-}Lou De Carufel and Mirela Damian and Rolf Fagerberg and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
      title={Continuous Yao Graphs},
      booktitle={Proceedings of the 26th Canadian Conference on Computational Geometry, {CCCG} 2014, Halifax, Nova Scotia, Canada, 2014},
      year={2014},
      publisher={Carleton University, Ottawa, Canada},
      url={http://www.cccg.ca/proceedings/2014/papers/paper15.pdf}
    }
    
  14. Searching by panning and zooming


    Bose, P., Howat, J., and Morin, P.
    In Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014, 2014.
    @inproceedings{DBLP:conf/cccg/BoseHM14,
      author={Prosenjit Bose and John Howat and Pat Morin},
      title={Searching by Panning and Zooming},
      booktitle={Proceedings of the 26th Canadian Conference on Computational Geometry, {CCCG} 2014, Halifax, Nova Scotia, Canada, 2014},
      year={2014},
      publisher={Carleton University, Ottawa, Canada},
      url={http://www.cccg.ca/proceedings/2014/papers/paper57.pdf}
    }
    
  15. The convex hull of points on a sphere is a spanner


    Bose, P., Pratt, S., and Smid, M. H. M.
    In Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014, 2014.
    @inproceedings{DBLP:conf/cccg/BosePS14,
      author={Prosenjit Bose and Simon Pratt and Michiel H. M. Smid},
      title={The Convex Hull of Points on a Sphere is a Spanner},
      booktitle={Proceedings of the 26th Canadian Conference on Computational Geometry, {CCCG} 2014, Halifax, Nova Scotia, Canada, 2014},
      year={2014},
      publisher={Carleton University, Ottawa, Canada},
      url={http://www.cccg.ca/proceedings/2014/papers/paper36.pdf}
    }
    
  16. New and improved spanning ratios for yao graphs


    Barba, L., Bose, P., Damian, M., Fagerberg, R., Keng, W. L., O’Rourke, J., van Renssen, A., Taslakian, P., Verdonschot, S., and Xia, G.
    In 30th Annual Symposium on Computational Geometry, SOCG’14, Kyoto, Japan, June 08 - 11, 2014, page 30, 2014.
    @inproceedings{DBLP:conf/compgeom/BarbaBDFKORTVX14,
      author={Luis Barba and Prosenjit Bose and Mirela Damian and Rolf Fagerberg and Wah Loon Keng and Joseph O'Rourke and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot and Ge Xia},
      title={New and Improved Spanning Ratios for Yao Graphs},
      booktitle={30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014},
      year={2014},
      editor={Siu{-}Wing Cheng and Olivier Devillers},
      publisher={{ACM}},
      pages={30},
      doi={10.1145/2582112.2582143},
      url={http://doi.acm.org/10.1145/2582112.2582143}
    }
    
  17. The power and limitations of static binary search trees with lazy finger


    Bose, P., Douïeb, K., Iacono, J., and Langerman, S.
    In Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings, pages 181–192, 2014.
    @inproceedings{DBLP:conf/isaac/BoseDIL14,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb and John Iacono and Stefan Langerman},
      title={The Power and Limitations of Static Binary Search Trees with Lazy Finger},
      booktitle={Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
      year={2014},
      editor={Hee{-}Kap Ahn and Chan{-}Su Shin},
      publisher={Springer},
      volume={8889},
      series={Lecture Notes in Computer Science},
      pages={181--192},
      doi={10.1007/978-3-319-13075-0_15},
      url={http://dx.doi.org/10.1007/978-3-319-13075-0_15}
    }
    
  18. The price of order


    Bose, P., Morin, P., and van Renssen, A.
    In Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings, pages 313–325, 2014.
    @inproceedings{DBLP:conf/isaac/BoseMR14,
      author={Prosenjit Bose and Pat Morin and Andr{\'{e}} van Renssen},
      title={The Price of Order},
      booktitle={Algorithms and Computation - 25th International Symposium, {ISAAC} 2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
      year={2014},
      editor={Hee{-}Kap Ahn and Chan{-}Su Shin},
      publisher={Springer},
      volume={8889},
      series={Lecture Notes in Computer Science},
      pages={313--325},
      doi={10.1007/978-3-319-13075-0_25},
      url={http://dx.doi.org/10.1007/978-3-319-13075-0_25}
    }
    
  19. Optimal algorithms for constrained 1-center problems


    Barba, L., Bose, P., and Langerman, S.
    In LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, pages 84–95, 2014.
    @inproceedings{DBLP:conf/latin/BarbaBL14,
      author={Luis Barba and Prosenjit Bose and Stefan Langerman},
      title={Optimal Algorithms for Constrained 1-Center Problems},
      booktitle={{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
      year={2014},
      editor={Alberto Pardo and Alfredo Viola},
      publisher={Springer},
      volume={8392},
      series={Lecture Notes in Computer Science},
      pages={84--95},
      doi={10.1007/978-3-642-54423-1_8},
      url={http://dx.doi.org/10.1007/978-3-642-54423-1_8}
    }
    
  20. Upper bounds on the spanning ratio of constrained theta-graphs


    Bose, P. and van Renssen, A.
    In LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, pages 108–119, 2014.
    @inproceedings{DBLP:conf/latin/BoseR14,
      author={Prosenjit Bose and Andr{\'{e}} van Renssen},
      title={Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs},
      booktitle={{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
      year={2014},
      editor={Alberto Pardo and Alfredo Viola},
      publisher={Springer},
      volume={8392},
      series={Lecture Notes in Computer Science},
      pages={108--119},
      doi={10.1007/978-3-642-54423-1_10},
      url={http://dx.doi.org/10.1007/978-3-642-54423-1_10}
    }
    
  21. Biased predecessor search


    Bose, P., Fagerberg, R., Howat, J., and Morin, P.
    In LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, pages 755–764, 2014.
    @inproceedings{DBLP:conf/latin/BoseFHM14,
      author={Prosenjit Bose and Rolf Fagerberg and John Howat and Pat Morin},
      title={Biased Predecessor Search},
      booktitle={{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
      year={2014},
      editor={Alberto Pardo and Alfredo Viola},
      publisher={Springer},
      volume={8392},
      series={Lecture Notes in Computer Science},
      pages={755--764},
      doi={10.1007/978-3-642-54423-1_65},
      url={http://dx.doi.org/10.1007/978-3-642-54423-1_65}
    }
    
  22. Competitive online routing on delaunay triangulations


    Bose, P., Carufel, J. D., Durocher, S., and Taslakian, P.
    In Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings, pages 98–109, 2014.
    @inproceedings{DBLP:conf/swat/BoseCDT14,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Stephane Durocher and Perouz Taslakian},
      title={Competitive Online Routing on Delaunay Triangulations},
      booktitle={Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings},
      year={2014},
      editor={R. Ravi and Inge Li G{\o}rtz},
      publisher={Springer},
      volume={8503},
      series={Lecture Notes in Computer Science},
      pages={98--109},
      doi={10.1007/978-3-319-08404-6_9},
      url={http://dx.doi.org/10.1007/978-3-319-08404-6_9}
    }
    
  23. A history of distribution-sensitive data structures


    Bose, P., Howat, J., and Morin, P.
    In Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday, pages 133–149, 2013.
    @inproceedings{DBLP:conf/birthday/BoseHM13,
      author={Prosenjit Bose and John Howat and Pat Morin},
      title={A History of Distribution-Sensitive Data Structures},
      booktitle={Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday},
      year={2013},
      editor={Andrej Brodnik and Alejandro L{\'{o}}pez{-}Ortiz and Venkatesh Raman and Alfredo Viola},
      publisher={Springer},
      volume={8066},
      series={Lecture Notes in Computer Science},
      pages={133--149},
      doi={10.1007/978-3-642-40273-9_10},
      url={http://dx.doi.org/10.1007/978-3-642-40273-9_10}
    }
    
  24. Theta-3 is connected


    Aichholzer, O., Bae, S. W., Barba, L., Bose, P., Korman, M., van Renssen, A., Taslakian, P., and Verdonschot, S.
    In Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013, 2013.
    @inproceedings{DBLP:conf/cccg/AichholzerBBBKRTV13,
      author={Oswin Aichholzer and Sang Won Bae and Luis Barba and Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
      title={Theta-3 is connected},
      booktitle={Proceedings of the 25th Canadian Conference on Computational Geometry, {CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
      year={2013},
      publisher={Carleton University, Ottawa, Canada},
      url={http://cccg.ca/proceedings/2013/papers/paper_16.pdf}
    }
    
  25. Computing covers of plane forests


    Barba, L., Beingessner, A., Bose, P., and Smid, M. H. M.
    In Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013, 2013.
    @inproceedings{DBLP:conf/cccg/BarbaBBS13,
      author={Luis Barba and Alexis Beingessner and Prosenjit Bose and Michiel H. M. Smid},
      title={Computing Covers of Plane Forests},
      booktitle={Proceedings of the 25th Canadian Conference on Computational Geometry, {CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
      year={2013},
      publisher={Carleton University, Ottawa, Canada},
      url={http://cccg.ca/proceedings/2013/papers/paper_18.pdf}
    }
    
  26. Optimal data structures for farthest-point queries in cactus networks


    Bose, P., Carufel, J. D., Grimm, C., Maheshwari, A., and Smid, M. H. M.
    In Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013, 2013.
    @inproceedings{DBLP:conf/cccg/BoseCGMS13,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Carsten Grimm and Anil Maheshwari and Michiel H. M. Smid},
      title={Optimal Data Structures for Farthest-Point Queries in Cactus Networks},
      booktitle={Proceedings of the 25th Canadian Conference on Computational Geometry, {CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
      year={2013},
      publisher={Carleton University, Ottawa, Canada},
      url={http://cccg.ca/proceedings/2013/papers/paper_23.pdf}
    }
    
  27. Robust geometric spanners


    Bose, P., Dujmovic, V., Morin, P., and Smid, M. H. M.
    In Symposuim on Computational Geometry 2013, SoCG ’13, Rio de Janeiro, Brazil, June 17-20, 2013, pages 449–458, 2013.
    @inproceedings{DBLP:conf/compgeom/BoseDMS13,
      author={Prosenjit Bose and Vida Dujmovic and Pat Morin and Michiel H. M. Smid},
      title={Robust geometric spanners},
      booktitle={Symposuim on Computational Geometry 2013, SoCG '13, Rio de Janeiro, Brazil, June 17-20, 2013},
      year={2013},
      editor={Guilherme Dias da Fonseca and Thomas Lewiner and Luis Mariano Pe{\~{n}}aranda and Timothy M. Chan and Rolf Klein},
      publisher={{ACM}},
      pages={449--458},
      doi={10.1145/2462356.2462381},
      url={http://doi.acm.org/10.1145/2462356.2462381}
    }
    
  28. Revisiting the problem of searching on a line


    Bose, P., Carufel, J. D., and Durocher, S.
    In Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings, pages 205–216, 2013.
    @inproceedings{DBLP:conf/esa/BoseCD13,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Stephane Durocher},
      title={Revisiting the Problem of Searching on a Line},
      booktitle={Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings},
      year={2013},
      editor={Hans L. Bodlaender and Giuseppe F. Italiano},
      publisher={Springer},
      volume={8125},
      series={Lecture Notes in Computer Science},
      pages={205--216},
      doi={10.1007/978-3-642-40450-4_18},
      url={http://dx.doi.org/10.1007/978-3-642-40450-4_18}
    }
    
  29. On the stretch factor of the theta-4 graph


    Barba, L., Bose, P., Carufel, J. D., van Renssen, A., and Verdonschot, S.
    In Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings, pages 109–120, 2013.
    @inproceedings{DBLP:conf/wads/BarbaBCRV13,
      author={Luis Barba and Prosenjit Bose and Jean{-}Lou De Carufel and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={On the Stretch Factor of the Theta-4 Graph},
      booktitle={Algorithms and Data Structures - 13th International Symposium, {WADS} 2013, London, ON, Canada, August 12-14, 2013. Proceedings},
      year={2013},
      editor={Frank Dehne and Roberto Solis{-}Oba and J{\"{o}}rg{-}R{\"{u}}diger Sack},
      publisher={Springer},
      volume={8037},
      series={Lecture Notes in Computer Science},
      pages={109--120},
      doi={10.1007/978-3-642-40104-6_10},
      url={http://dx.doi.org/10.1007/978-3-642-40104-6_10}
    }
    
  30. On the spanning ratio of theta-graphs


    Bose, P., van Renssen, A., and Verdonschot, S.
    In Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings, pages 182–194, 2013.
    @inproceedings{DBLP:conf/wads/BoseRV13,
      author={Prosenjit Bose and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={On the Spanning Ratio of Theta-Graphs},
      booktitle={Algorithms and Data Structures - 13th International Symposium, {WADS} 2013, London, ON, Canada, August 12-14, 2013. Proceedings},
      year={2013},
      editor={Frank Dehne and Roberto Solis{-}Oba and J{\"{o}}rg{-}R{\"{u}}diger Sack},
      publisher={Springer},
      volume={8037},
      series={Lecture Notes in Computer Science},
      pages={182--194},
      doi={10.1007/978-3-642-40104-6_16},
      url={http://dx.doi.org/10.1007/978-3-642-40104-6_16}
    }
    
  31. The θ 5-graph is a spanner


    Bose, P., Morin, P., van Renssen, A., and Verdonschot, S.
    In Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pages 100–114, 2013.
    @inproceedings{DBLP:conf/wg/BoseMRV13,
      author={Prosenjit Bose and Pat Morin and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={The {\texttheta} 5-Graph is a Spanner},
      booktitle={Graph-Theoretic Concepts in Computer Science - 39th International Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013, Revised Papers},
      year={2013},
      editor={Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk},
      publisher={Springer},
      volume={8165},
      series={Lecture Notes in Computer Science},
      pages={100--114},
      doi={10.1007/978-3-642-45043-3_10},
      url={http://dx.doi.org/10.1007/978-3-642-45043-3_10}
    }
    
  32. Visibility monotonic polygon deflation


    Bose, P., Dujmovic, V., Hoda, N., and Morin, P.
    In Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012, pages 11–16, 2012.
    @inproceedings{DBLP:conf/cccg/BoseDHM12,
      author={Prosenjit Bose and Vida Dujmovic and Nima Hoda and Pat Morin},
      title={Visibility Monotonic Polygon Deflation},
      booktitle={Proceedings of the 24th Canadian Conference on Computational Geometry, {CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012},
      year={2012},
      pages={11--16},
      url={http://2012.cccg.ca/papers/paper57.pdf}
    }
    
  33. On farthest-point information in networks


    Bose, P., Carufel, J. D., Grimm, C., Maheshwari, A., and Smid, M. H. M.
    In Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012, pages 199–204, 2012.
    @inproceedings{DBLP:conf/cccg/BoseCGMS12,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Carsten Grimm and Anil Maheshwari and Michiel H. M. Smid},
      title={On Farthest-Point Information in Networks},
      booktitle={Proceedings of the 24th Canadian Conference on Computational Geometry, {CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012},
      year={2012},
      pages={199--204},
      url={http://2012.cccg.ca/papers/paper22.pdf}
    }
    
  34. Competitive routing on a bounded-degree plane spanner


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    In Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012, pages 285–290, 2012.
    @inproceedings{DBLP:conf/cccg/BoseFRV12,
      author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={Competitive Routing on a Bounded-Degree Plane Spanner},
      booktitle={Proceedings of the 24th Canadian Conference on Computational Geometry, {CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012},
      year={2012},
      pages={285--290},
      url={http://2012.cccg.ca/papers/paper74.pdf}
    }
    
  35. Optimal bounds on theta-graphs: more is not always better


    Bose, P., Carufel, J. D., Morin, P., van Renssen, A., and Verdonschot, S.
    In Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012, pages 291–296, 2012.
    @inproceedings{DBLP:conf/cccg/BoseCMRV12,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Pat Morin and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={Optimal Bounds on Theta-Graphs: More is not Always Better},
      booktitle={Proceedings of the 24th Canadian Conference on Computational Geometry, {CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012},
      year={2012},
      pages={291--296},
      url={http://2012.cccg.ca/papers/paper11.pdf}
    }
    
  36. Flips


    Bose, P.
    In Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers, page 1, 2012.
    @inproceedings{DBLP:conf/gd/Bose12,
      author={Prosenjit Bose},
      title={Flips},
      booktitle={Graph Drawing - 20th International Symposium, {GD} 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers},
      year={2012},
      editor={Walter Didimo and Maurizio Patrignani},
      publisher={Springer},
      volume={7704},
      series={Lecture Notes in Computer Science},
      pages={1},
      doi={10.1007/978-3-642-36763-2_1},
      url={http://dx.doi.org/10.1007/978-3-642-36763-2_1}
    }
    
  37. De-amortizing binary search trees


    Bose, P., Collette, S., Fagerberg, R., and Langerman, S.
    In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, pages 121–132, 2012.
    @inproceedings{DBLP:conf/icalp/BoseCFL12,
      author={Prosenjit Bose and S{\'{e}}bastien Collette and Rolf Fagerberg and Stefan Langerman},
      title={De-amortizing Binary Search Trees},
      booktitle={Automata, Languages, and Programming - 39th International Colloquium, {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
      year={2012},
      editor={Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts and Roger Wattenhofer},
      publisher={Springer},
      volume={7391},
      series={Lecture Notes in Computer Science},
      pages={121--132},
      doi={10.1007/978-3-642-31594-7_11},
      url={http://dx.doi.org/10.1007/978-3-642-31594-7_11}
    }
    
  38. On spanning properties of various delaunay graphs


    Bose, P.
    In Ninth International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2012, New Brunswick, NJ, USA, June 27-29, 2012, page 1, 2012.
    @inproceedings{DBLP:conf/isvd/Bose12,
      author={Prosenjit Bose},
      title={On Spanning Properties of Various Delaunay Graphs},
      booktitle={Ninth International Symposium on Voronoi Diagrams in Science and Engineering, {ISVD} 2012, New Brunswick, NJ, USA, June 27-29, 2012},
      year={2012},
      publisher={{IEEE}},
      pages={1},
      doi={10.1109/ISVD.2012.30},
      url={http://dx.doi.org/10.1109/ISVD.2012.30}
    }
    
  39. On plane constrained bounded-degree spanners


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    In LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings, pages 85–96, 2012.
    @inproceedings{DBLP:conf/latin/BoseFRV12,
      author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={On Plane Constrained Bounded-Degree Spanners},
      booktitle={{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings},
      year={2012},
      editor={David Fern{\'{a}}ndez{-}Baca},
      publisher={Springer},
      volume={7256},
      series={Lecture Notes in Computer Science},
      pages={85--96},
      doi={10.1007/978-3-642-29344-3_8},
      url={http://dx.doi.org/10.1007/978-3-642-29344-3_8}
    }
    
  40. Competitive routing in the half-θ\(_\mbox6\)-graph


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, pages 1319–1328, 2012.
    @inproceedings{DBLP:conf/soda/BoseFRV12,
      author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={Competitive routing in the half-{\texttheta}\({}_{\mbox{6}}\)-graph},
      booktitle={Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
      year={2012},
      editor={Yuval Rabani},
      publisher={{SIAM}},
      pages={1319--1328},
      url={http://portal.acm.org/citation.cfm?id=2095220&CFID=63838676&CFTOKEN=79617016}
    }
    
  41. Isoperimetric triangular enclosure with a fixed angle


    Bose, P. and Carufel, J. D.
    In Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011, 2011.
    @inproceedings{DBLP:conf/cccg/BoseC11,
      author={Prosenjit Bose and Jean{-}Lou De Carufel},
      title={Isoperimetric Triangular Enclosure with a Fixed Angle},
      booktitle={Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011},
      year={2011},
      url={http://www.cccg.ca/proceedings/2011/papers/paper89.pdf}
    }
    
  42. Making triangulations 4-connected using flips


    Bose, P., Jansens, D., van Renssen, A., Saumell, M., and Verdonschot, S.
    In Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011, 2011.
    @inproceedings{DBLP:conf/cccg/BoseJRSV11,
      author={Prosenjit Bose and Dana Jansens and Andr{\'{e}} van Renssen and Maria Saumell and Sander Verdonschot},
      title={Making triangulations 4-connected using flips},
      booktitle={Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011},
      year={2011},
      url={http://www.cccg.ca/proceedings/2011/papers/paper34.pdf}
    }
    
  43. A history of flips in combinatorial triangulations


    Bose, P. and Verdonschot, S.
    In Computational Geometry - XIV Spanish Meeting on Computational Geometry, EGC 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Alcalá de Henares, Spain, June 27-30, 2011, Revised Selected Papers, pages 29–44, 2011.
    @inproceedings{DBLP:conf/s-egc/BoseV11,
      author={Prosenjit Bose and Sander Verdonschot},
      title={A History of Flips in Combinatorial Triangulations},
      booktitle={Computational Geometry - {XIV} Spanish Meeting on Computational Geometry, {EGC} 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Alcal{\'{a}} de Henares, Spain, June 27-30, 2011, Revised Selected Papers},
      year={2011},
      editor={Alberto M{\'{a}}rquez and Pedro Ramos and Jorge Urrutia},
      publisher={Springer},
      volume={7579},
      series={Lecture Notes in Computer Science},
      pages={29--44},
      doi={10.1007/978-3-642-34191-5_3},
      url={http://dx.doi.org/10.1007/978-3-642-34191-5_3}
    }
    
  44. Switching to directional antennas with constant increase in radius and hop distance


    Bose, P., Carmi, P., Damian, M., Flatland, R. Y., Katz, M. J., and Maheshwari, A.
    In Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings, pages 134–146, 2011.
    @inproceedings{DBLP:conf/wads/BoseCDFKM11,
      author={Prosenjit Bose and Paz Carmi and Mirela Damian and Robin Y. Flatland and Matthew J. Katz and Anil Maheshwari},
      title={Switching to Directional Antennas with Constant Increase in Radius and Hop Distance},
      booktitle={Algorithms and Data Structures - 12th International Symposium, {WADS} 2011, New York, NY, USA, August 15-17, 2011. Proceedings},
      year={2011},
      editor={Frank Dehne and John Iacono and J{\"{o}}rg{-}R{\"{u}}diger Sack},
      publisher={Springer},
      volume={6844},
      series={Lecture Notes in Computer Science},
      pages={134--146},
      doi={10.1007/978-3-642-22300-6_12},
      url={http://dx.doi.org/10.1007/978-3-642-22300-6_12}
    }
    
  45. Some properties of higher order delaunay and gabriel graphs


    Bose, P., Collette, S., Hurtado, F., Korman, M., Langerman, S., Sacristán, V., and Saumell, M.
    In Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010, pages 13–16, 2010.
    @inproceedings{DBLP:conf/cccg/BoseCHKLSS10,
      author={Prosenjit Bose and S{\'{e}}bastien Collette and Ferran Hurtado and Matias Korman and Stefan Langerman and Vera Sacrist{\'{a}}n and Maria Saumell},
      title={Some properties of higher order delaunay and gabriel graphs},
      booktitle={Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010},
      year={2010},
      pages={13--16},
      url={http://cccg.ca/proceedings/2010/paper06.pdf}
    }
    
  46. On the perimeter of fat objects


    Bose, P., Cheong, O., and Dujmovic, V.
    In Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010, pages 163–166, 2010.
    @inproceedings{DBLP:conf/cccg/BoseCD10,
      author={Prosenjit Bose and Otfried Cheong and Vida Dujmovic},
      title={On the perimeter of fat objects},
      booktitle={Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010},
      year={2010},
      pages={163--166},
      url={http://cccg.ca/proceedings/2010/paper44.pdf}
    }
    
  47. Minimum enclosing area triangle with a fixed angle


    Bose, P. and Carufel, J. D.
    In Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010, pages 171–174, 2010.
    @inproceedings{DBLP:conf/cccg/BoseC10,
      author={Prosenjit Bose and Jean{-}Lou De Carufel},
      title={Minimum enclosing area triangle with a fixed angle},
      booktitle={Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010},
      year={2010},
      pages={171--174},
      url={http://cccg.ca/proceedings/2010/paper46.pdf}
    }
    
  48. Fast local searches and updates in bounded universes


    Bose, P., Douïeb, K., Dujmovic, V., Howat, J., and Morin, P.
    In Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010, pages 261–264, 2010.
    @inproceedings{DBLP:conf/cccg/BoseDDHM10,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Vida Dujmovic and John Howat and Pat Morin},
      title={Fast local searches and updates in bounded universes},
      booktitle={Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010},
      year={2010},
      pages={261--264},
      url={http://cccg.ca/proceedings/2010/paper69.pdf}
    }
    
  49. Common unfoldings of polyominoes and polycubes


    Aloupis, G., Bose, P., Collette, S., Demaine, E. D., Demaine, M. L., Douïeb, K., Dujmovic, V., Iacono, J., Langerman, S., and Morin, P.
    In Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers, pages 44–54, 2010.
    @inproceedings{DBLP:conf/cgga/AloupisBCDDDDILM10,
      author={Greg Aloupis and Prosenjit Bose and S{\'{e}}bastien Collette and Erik D. Demaine and Martin L. Demaine and Karim Dou{\"{\i}}eb and Vida Dujmovic and John Iacono and Stefan Langerman and Pat Morin},
      title={Common Unfoldings of Polyominoes and Polycubes},
      booktitle={Computational Geometry, Graphs and Applications - 9th International Conference, {CGGA} 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers},
      year={2010},
      editor={Jin Akiyama and Jiang Bo and Mikio Kano and Xuehou Tan},
      publisher={Springer},
      volume={7033},
      series={Lecture Notes in Computer Science},
      pages={44--54},
      doi={10.1007/978-3-642-24983-9_5},
      url={http://dx.doi.org/10.1007/978-3-642-24983-9_5}
    }
    
  50. Coverage with \emphk-transmitters in the presence of obstacles


    Ballinger, B., Benbernou, N., Bose, P., Damian, M., Demaine, E. D., Dujmovic, V., Flatland, R. Y., Hurtado, F., Iacono, J., Lubiw, A., Morin, P., Adinolfi, V. S., Souvaine, D. L., and Uehara, R.
    In Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II, pages 1–15, 2010.
    @inproceedings{DBLP:conf/cocoa/BallingerBBDDDFHILa10,
      author={Brad Ballinger and Nadia Benbernou and Prosenjit Bose and Mirela Damian and Erik D. Demaine and Vida Dujmovic and Robin Y. Flatland and Ferran Hurtado and John Iacono and Anna Lubiw and Pat Morin and Vera Sacrist{\'{a}}n Adinolfi and Diane L. Souvaine and Ryuhei Uehara},
      title={Coverage with \emph{k}-Transmitters in the Presence of Obstacles},
      booktitle={Combinatorial Optimization and Applications - 4th International Conference, {COCOA} 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part {II}},
      year={2010},
      editor={Weili Wu and Ovidiu Daescu},
      publisher={Springer},
      volume={6509},
      series={Lecture Notes in Computer Science},
      pages={1--15},
      doi={10.1007/978-3-642-17461-2_1},
      url={http://dx.doi.org/10.1007/978-3-642-17461-2_1}
    }
    
  51. Global context descriptors for SURF and MSER feature descriptors


    Carmichael, G., Laganière, R., and Bose, P.
    In Canadian Conference on Computer and Robot Vision, CRV 2010, Ottawa, Ontario, Canada, May 31 - June 2, 2010, pages 309–316, 2010.
    @inproceedings{DBLP:conf/crv/CarmichaelLB10,
      author={Gail Carmichael and Robert Lagani{\`{e}}re and Prosenjit Bose},
      title={Global Context Descriptors for {SURF} and {MSER} Feature Descriptors},
      booktitle={Canadian Conference on Computer and Robot Vision, {CRV} 2010, Ottawa, Ontario, Canada, May 31 - June 2, 2010},
      year={2010},
      publisher={{IEEE} Computer Society},
      pages={309--316},
      doi={10.1109/CRV.2010.47},
      url={http://dx.doi.org/10.1109/CRV.2010.47}
    }
    
  52. Should static search trees ever be unbalanced?


    Bose, P. and Douïeb, K.
    In Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I, pages 109–120, 2010.
    @inproceedings{DBLP:conf/isaac/BoseD10,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb},
      title={Should Static Search Trees Ever Be Unbalanced?},
      booktitle={Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {I}},
      year={2010},
      editor={Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park},
      publisher={Springer},
      volume={6506},
      series={Lecture Notes in Computer Science},
      pages={109--120},
      doi={10.1007/978-3-642-17517-6_12},
      url={http://dx.doi.org/10.1007/978-3-642-17517-6_12}
    }
    
  53. \eMphpi/2-angle yao graphs are spanners


    Bose, P., Damian, M., Douïeb, K., O’Rourke, J., Seamone, B., Smid, M. H. M., and Wuhrer, S.
    In Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II, pages 446–457, 2010.
    @inproceedings{DBLP:conf/isaac/BoseDDOSSW10,
      author={Prosenjit Bose and Mirela Damian and Karim Dou{\"{\i}}eb and Joseph O'Rourke and Ben Seamone and Michiel H. M. Smid and Stefanie Wuhrer},
      title={\emph{pi}/2-Angle Yao Graphs Are Spanners},
      booktitle={Algorithms and Computation - 21st International Symposium, {ISAAC} 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part {II}},
      year={2010},
      editor={Otfried Cheong and Kyung{-}Yong Chwa and Kunsoo Park},
      publisher={Springer},
      volume={6507},
      series={Lecture Notes in Computer Science},
      pages={446--457},
      doi={10.1007/978-3-642-17514-5_38},
      url={http://dx.doi.org/10.1007/978-3-642-17514-5_38}
    }
    
  54. Skip lift: A probabilistic alternative to red-black trees


    Bose, P., Douïeb, K., and Morin, P.
    In Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, pages 226–237, 2010.
    @inproceedings{DBLP:conf/iwoca/BoseDM10,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Pat Morin},
      title={Skip Lift: {A} Probabilistic Alternative to Red-Black Trees},
      booktitle={Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010, London, UK, July 26-28, 2010, Revised Selected Papers},
      year={2010},
      editor={Costas S. Iliopoulos and William F. Smyth},
      publisher={Springer},
      volume={6460},
      series={Lecture Notes in Computer Science},
      pages={226--237},
      doi={10.1007/978-3-642-19222-7_23},
      url={http://dx.doi.org/10.1007/978-3-642-19222-7_23}
    }
    
  55. Communication-efficient construction of the plane localized delaunay graph


    Bose, P., Carmi, P., Smid, M. H. M., and Xu, D.
    In LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, pages 282–293, 2010.
    @inproceedings{DBLP:conf/latin/BoseCSX10,
      author={Prosenjit Bose and Paz Carmi and Michiel H. M. Smid and Daming Xu},
      title={Communication-Efficient Construction of the Plane Localized Delaunay Graph},
      booktitle={{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings},
      year={2010},
      editor={Alejandro L{\'{o}}pez{-}Ortiz},
      publisher={Springer},
      volume={6034},
      series={Lecture Notes in Computer Science},
      pages={282--293},
      doi={10.1007/978-3-642-12200-2_26},
      url={http://dx.doi.org/10.1007/978-3-642-12200-2_26}
    }
    
  56. Layered working-set trees


    Bose, P., Douïeb, K., Dujmovic, V., and Howat, J.
    In LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, pages 686–696, 2010.
    @inproceedings{DBLP:conf/latin/BoseDDH10,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Vida Dujmovic and John Howat},
      title={Layered Working-Set Trees},
      booktitle={{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings},
      year={2010},
      editor={Alejandro L{\'{o}}pez{-}Ortiz},
      publisher={Springer},
      volume={6034},
      series={Lecture Notes in Computer Science},
      pages={686--696},
      doi={10.1007/978-3-642-12200-2_59},
      url={http://dx.doi.org/10.1007/978-3-642-12200-2_59}
    }
    
  57. An \emphO(log log \emphn)-competitive binary search tree with optimal worst-case access times


    Bose, P., Douïeb, K., Dujmovic, V., and Fagerberg, R.
    In Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings, pages 38–49, 2010.
    @inproceedings{DBLP:conf/swat/BoseDDF10,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Vida Dujmovic and Rolf Fagerberg},
      title={An \emph{O}(log log \emph{n})-Competitive Binary Search Tree with Optimal Worst-Case Access Times},
      booktitle={Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
      year={2010},
      editor={Haim Kaplan},
      publisher={Springer},
      volume={6139},
      series={Lecture Notes in Computer Science},
      pages={38--49},
      doi={10.1007/978-3-642-13731-0_5},
      url={http://dx.doi.org/10.1007/978-3-642-13731-0_5}
    }
    
  58. Improved methods for generating quasi-gray codes


    Bose, P., Carmi, P., Jansens, D., Maheshwari, A., Morin, P., and Smid, M. H. M.
    In Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings, pages 224–235, 2010.
    @inproceedings{DBLP:conf/swat/BoseCJMMS10,
      author={Prosenjit Bose and Paz Carmi and Dana Jansens and Anil Maheshwari and Pat Morin and Michiel H. M. Smid},
      title={Improved Methods For Generating Quasi-gray Codes},
      booktitle={Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
      year={2010},
      editor={Haim Kaplan},
      publisher={Springer},
      volume={6139},
      series={Lecture Notes in Computer Science},
      pages={224--235},
      doi={10.1007/978-3-642-13731-0_22},
      url={http://dx.doi.org/10.1007/978-3-642-13731-0_22}
    }
    
  59. Every large point set contains many collinear points or an empty pentagon


    Abel, Z., Ballinger, B., Bose, P., Collette, S., Dujmovic, V., Hurtado, F., Kominers, S. D., Langerman, S., Pór, A., and Wood, D. R.
    In Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009, pages 99–102, 2009.
    @inproceedings{DBLP:conf/cccg/AbelBBCDHKLPW09,
      author={Zachary Abel and Brad Ballinger and Prosenjit Bose and S{\'{e}}bastien Collette and Vida Dujmovic and Ferran Hurtado and Scott D. Kominers and Stefan Langerman and Attila P{\'{o}}r and David R. Wood},
      title={Every Large Point Set contains Many Collinear Points or an Empty Pentagon},
      booktitle={Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009},
      year={2009},
      pages={99--102},
      url={http://cccg.ca/proceedings/2009/cccg09_26.pdf}
    }
    
  60. The spanning ratio of the delaunay triangulation is greater than pi/2


    Bose, P., Devroye, L., Löffler, M., Snoeyink, J., and Verma, V.
    In Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009, pages 165–167, 2009.
    @inproceedings{DBLP:conf/cccg/BoseDLSV09,
      author={Prosenjit Bose and Luc Devroye and Maarten L{\"{o}}ffler and Jack Snoeyink and Vishal Verma},
      title={The spanning ratio of the Delaunay triangulation is greater than pi/2},
      booktitle={Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009},
      year={2009},
      pages={165--167},
      url={http://cccg.ca/proceedings/2009/cccg09_43.pdf}
    }
    
  61. Relaxed gabriel graphs


    Bose, P., Cardinal, J., Collette, S., Demaine, E. D., Palop, B., Taslakian, P., and Zeh, N.
    In Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009, pages 169–172, 2009.
    @inproceedings{DBLP:conf/cccg/BoseCCDPTZ09,
      author={Prosenjit Bose and Jean Cardinal and S{\'{e}}bastien Collette and Erik D. Demaine and Bel{\'{e}}n Palop and Perouz Taslakian and Norbert Zeh},
      title={Relaxed Gabriel Graphs},
      booktitle={Proceedings of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009},
      year={2009},
      pages={169--172},
      url={http://cccg.ca/proceedings/2009/cccg09_44.pdf}
    }
    
  62. Bounding the locality of distributed routing algorithms


    Bose, P., Carmi, P., and Durocher, S.
    In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pages 250–259, 2009.
    @inproceedings{DBLP:conf/podc/BoseCD09,
      author={Prosenjit Bose and Paz Carmi and Stephane Durocher},
      title={Bounding the locality of distributed routing algorithms},
      booktitle={Proceedings of the 28th Annual {ACM} Symposium on Principles of Distributed Computing, {PODC} 2009, Calgary, Alberta, Canada, August 10-12, 2009},
      year={2009},
      editor={Srikanta Tirthapura and Lorenzo Alvisi},
      publisher={{ACM}},
      pages={250--259},
      doi={10.1145/1582716.1582756},
      url={http://doi.acm.org/10.1145/1582716.1582756}
    }
    
  63. Filling holes in triangular meshes by curve unfolding


    Brunton, A., Wuhrer, S., Shu, C., Bose, P., and Demaine, E. D.
    In IEEE International Conference on Shape Modeling and Applications, SMI 2009, Beijing, China, 26-28 June 2009, pages 66–72, 2009.
    @inproceedings{DBLP:conf/smi/BruntonWSBD09,
      author={Alan Brunton and Stefanie Wuhrer and Chang Shu and Prosenjit Bose and Erik D. Demaine},
      title={Filling holes in triangular meshes by curve unfolding},
      booktitle={{IEEE} International Conference on Shape Modeling and Applications, {SMI} 2009, Beijing, China, 26-28 June 2009},
      year={2009},
      editor={Jun{-}Hai Yong and Michela Spagnuolo and Wenping Wang},
      publisher={{IEEE} Computer Society},
      pages={66--72},
      doi={10.1109/SMI.2009.5170165},
      url={http://dx.doi.org/10.1109/SMI.2009.5170165}
    }
    
  64. Succinct geometric indexes supporting point location queries


    Bose, P., Chen, E. Y., He, M., Maheshwari, A., and Morin, P.
    In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pages 635–644, 2009.
    @inproceedings{DBLP:conf/soda/BoseCHMM09,
      author={Prosenjit Bose and Eric Y. Chen and Meng He and Anil Maheshwari and Pat Morin},
      title={Succinct geometric indexes supporting point location queries},
      booktitle={Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
      year={2009},
      editor={Claire Mathieu},
      publisher={{SIAM}},
      pages={635--644},
      url={http://dl.acm.org/citation.cfm?id=1496770.1496840}
    }
    
  65. Succinct orthogonal range search structures on a grid with applications to text indexing


    Bose, P., He, M., Maheshwari, A., and Morin, P.
    In Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, pages 98–109, 2009.
    @inproceedings{DBLP:conf/wads/BoseHMM09,
      author={Prosenjit Bose and Meng He and Anil Maheshwari and Pat Morin},
      title={Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing},
      booktitle={Algorithms and Data Structures, 11th International Symposium, {WADS} 2009, Banff, Canada, August 21-23, 2009. Proceedings},
      year={2009},
      editor={Frank K. H. A. Dehne and Marina L. Gavrilova and J{\"{o}}rg{-}R{\"{u}}diger Sack and Csaba D. T{\'{o}}th},
      publisher={Springer},
      volume={5664},
      series={Lecture Notes in Computer Science},
      pages={98--109},
      doi={10.1007/978-3-642-03367-4_9},
      url={http://dx.doi.org/10.1007/978-3-642-03367-4_9}
    }
    
  66. A distribution-sensitive dictionary with low space overhead


    Bose, P., Howat, J., and Morin, P.
    In Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, pages 110–118, 2009.
    @inproceedings{DBLP:conf/wads/BoseHM09,
      author={Prosenjit Bose and John Howat and Pat Morin},
      title={A Distribution-Sensitive Dictionary with Low Space Overhead},
      booktitle={Algorithms and Data Structures, 11th International Symposium, {WADS} 2009, Banff, Canada, August 21-23, 2009. Proceedings},
      year={2009},
      editor={Frank K. H. A. Dehne and Marina L. Gavrilova and J{\"{o}}rg{-}R{\"{u}}diger Sack and Csaba D. T{\'{o}}th},
      publisher={Springer},
      volume={5664},
      series={Lecture Notes in Computer Science},
      pages={110--118},
      doi={10.1007/978-3-642-03367-4_10},
      url={http://dx.doi.org/10.1007/978-3-642-03367-4_10}
    }
    
  67. Efficient construction of near-optimal binary and multiway search trees


    Bose, P. and Douïeb, K.
    In Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, pages 230–241, 2009.
    @inproceedings{DBLP:conf/wads/BoseD09,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb},
      title={Efficient Construction of Near-Optimal Binary and Multiway Search Trees},
      booktitle={Algorithms and Data Structures, 11th International Symposium, {WADS} 2009, Banff, Canada, August 21-23, 2009. Proceedings},
      year={2009},
      editor={Frank K. H. A. Dehne and Marina L. Gavrilova and J{\"{o}}rg{-}R{\"{u}}diger Sack and Csaba D. T{\'{o}}th},
      publisher={Springer},
      volume={5664},
      series={Lecture Notes in Computer Science},
      pages={230--241},
      doi={10.1007/978-3-642-03367-4_21},
      url={http://dx.doi.org/10.1007/978-3-642-03367-4_21}
    }
    
  68. Triangulating and guarding realistic polygons


    Aloupis, G., Bose, P., Dujmovic, V., Gray, C., Langerman, S., and Speckmann, B.
    In Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montréal, Canada, August 13-15, 2008, 2008.
    @inproceedings{DBLP:conf/cccg/AloupisBDGLS08,
      author={Greg Aloupis and Prosenjit Bose and Vida Dujmovic and Chris Gray and Stefan Langerman and Bettina Speckmann},
      title={Triangulating and Guarding Realistic Polygons},
      booktitle={Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montr{\'{e}}al, Canada, August 13-15, 2008},
      year={2008}
    }
    
  69. Smallest enclosing circle centered on a query line segment


    Bose, P., Langerman, S., and Roy, S.
    In Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montréal, Canada, August 13-15, 2008, 2008.
    @inproceedings{DBLP:conf/cccg/BoseLR08,
      author={Prosenjit Bose and Stefan Langerman and Sasanka Roy},
      title={Smallest enclosing circle centered on a query line segment},
      booktitle={Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montr{\'{e}}al, Canada, August 13-15, 2008},
      year={2008}
    }
    
  70. Isometric morphing of triangular meshes


    Bose, P., O’Rourke, J., Shu, C., and Wuhrer, S.
    In Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montréal, Canada, August 13-15, 2008, 2008.
    @inproceedings{DBLP:conf/cccg/BoseOSW08,
      author={Prosenjit Bose and Joseph O'Rourke and Chang Shu and Stefanie Wuhrer},
      title={Isometric Morphing of Triangular Meshes},
      booktitle={Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montr{\'{e}}al, Canada, August 13-15, 2008},
      year={2008}
    }
    
  71. On the stretch factor of convex delaunay graphs


    Bose, P., Carmi, P., Collette, S., and Smid, M. H. M.
    In Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pages 656–667, 2008.
    @inproceedings{DBLP:conf/isaac/BoseCCS08,
      author={Prosenjit Bose and Paz Carmi and S{\'{e}}bastien Collette and Michiel H. M. Smid},
      title={On the Stretch Factor of Convex Delaunay Graphs},
      booktitle={Algorithms and Computation, 19th International Symposium, {ISAAC} 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
      year={2008},
      editor={Seok{-}Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
      publisher={Springer},
      volume={5369},
      series={Lecture Notes in Computer Science},
      pages={656--667},
      doi={10.1007/978-3-540-92182-0_58},
      url={http://dx.doi.org/10.1007/978-3-540-92182-0_58}
    }
    
  72. Spanners of complete k -partite geometric graphs


    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Morin, P., and Smid, M. H. M.
    In LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pages 170–181, 2008.
    @inproceedings{DBLP:conf/latin/BoseCCMMS08,
      author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Anil Maheshwari and Pat Morin and Michiel H. M. Smid},
      title={Spanners of Complete k -Partite Geometric Graphs},
      booktitle={{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium, B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
      year={2008},
      editor={Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Luerbio Faria},
      publisher={Springer},
      volume={4957},
      series={Lecture Notes in Computer Science},
      pages={170--181},
      doi={10.1007/978-3-540-78773-0_15},
      url={http://dx.doi.org/10.1007/978-3-540-78773-0_15}
    }
    
  73. Dynamic optimality for skip lists and b-trees


    Bose, P., Douïeb, K., and Langerman, S.
    In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pages 1106–1114, 2008.
    @inproceedings{DBLP:conf/soda/BoseDL08,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Stefan Langerman},
      title={Dynamic optimality for skip lists and B-trees},
      booktitle={Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22, 2008},
      year={2008},
      editor={Shang{-}Hua Teng},
      publisher={{SIAM}},
      pages={1106--1114},
      url={http://dl.acm.org/citation.cfm?id=1347082.1347203}
    }
    
  74. Spanners of additively weighted point sets


    Bose, P., Carmi, P., and Couture, M.
    In Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pages 367–377, 2008.
    @inproceedings{DBLP:conf/swat/BoseCC08,
      author={Prosenjit Bose and Paz Carmi and Mathieu Couture},
      title={Spanners of Additively Weighted Point Sets},
      booktitle={Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
      year={2008},
      editor={Joachim Gudmundsson},
      publisher={Springer},
      volume={5124},
      series={Lecture Notes in Computer Science},
      pages={367--377},
      doi={10.1007/978-3-540-69903-3_33},
      url={http://dx.doi.org/10.1007/978-3-540-69903-3_33}
    }
    
  75. Computing the greedy spanner in near-quadratic time


    Bose, P., Carmi, P., Farshi, M., Maheshwari, A., and Smid, M. H. M.
    In Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pages 390–401, 2008.
    @inproceedings{DBLP:conf/swat/BoseCFMS08,
      author={Prosenjit Bose and Paz Carmi and Mohammad Farshi and Anil Maheshwari and Michiel H. M. Smid},
      title={Computing the Greedy Spanner in Near-Quadratic Time},
      booktitle={Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
      year={2008},
      editor={Joachim Gudmundsson},
      publisher={Springer},
      volume={5124},
      series={Lecture Notes in Computer Science},
      pages={390--401},
      doi={10.1007/978-3-540-69903-3_35},
      url={http://dx.doi.org/10.1007/978-3-540-69903-3_35}
    }
    
  76. A characterization of the degree sequences of 2-trees


    Bose, P., Dujmovic, V., Krizanc, D., Langerman, S., Morin, P., Wood, D. R., and Wuhrer, S.
    In Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2007, New Orleans, Louisiana, USA, January 06, 2007, pages 232–241, 2007.
    @inproceedings{DBLP:conf/analco/BoseDKLMWW07,
      author={Prosenjit Bose and Vida Dujmovic and Danny Krizanc and Stefan Langerman and Pat Morin and David R. Wood and Stefanie Wuhrer},
      title={A Characterization of the Degree Sequences of 2-trees},
      booktitle={Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, {ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
      year={2007},
      editor={Daniel Panario and Robert Sedgewick},
      publisher={{SIAM}},
      pages={232--241},
      doi={10.1137/1.9781611972979.10},
      url={http://dx.doi.org/10.1137/1.9781611972979.10}
    }
    
  77. Optimal point set partitioning using rigid motion star placement


    Bose, P. and Morrison, J.
    In Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada, pages 49–52, 2007.
    @inproceedings{DBLP:conf/cccg/BoseM07,
      author={Prosenjit Bose and Jason Morrison},
      title={Optimal Point Set Partitioning using Rigid Motion Star Placement},
      booktitle={Proceedings of the 19th Annual Canadian Conference on Computational Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa, Canada},
      year={2007},
      editor={Prosenjit Bose},
      publisher={Carleton University, Ottawa, Canada},
      pages={49--52},
      url={http://cccg.ca/proceedings/2007/03a1.pdf}
    }
    
  78. Vertex pops and popturns


    Aloupis, G., Ballinger, B., Bose, P., Damian, M., Demaine, E. D., Demaine, M. L., Flatland, R. Y., Hurtado, F., Langerman, S., O’Rourke, J., Taslakian, P., and Toussaint, G. T.
    In Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada, pages 137–140, 2007.
    @inproceedings{DBLP:conf/cccg/AloupisBBDDDFHLOTT07,
      author={Greg Aloupis and Brad Ballinger and Prosenjit Bose and Mirela Damian and Erik D. Demaine and Martin L. Demaine and Robin Y. Flatland and Ferran Hurtado and Stefan Langerman and Joseph O'Rourke and Perouz Taslakian and Godfried T. Toussaint},
      title={Vertex Pops and Popturns},
      booktitle={Proceedings of the 19th Annual Canadian Conference on Computational Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa, Canada},
      year={2007},
      editor={Prosenjit Bose},
      publisher={Carleton University, Ottawa, Canada},
      pages={137--140},
      url={http://cccg.ca/proceedings/2007/05b4.pdf}
    }
    
  79. Approximations of geodesic distances for incomplete triangular manifolds


    Azouz, Z. B., Bose, P., Shu, C., and Wuhrer, S.
    In Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada, pages 177–180, 2007.
    @inproceedings{DBLP:conf/cccg/AzouzBSW07,
      author={Zouhour Ben Azouz and Prosenjit Bose and Chang Shu and Stefanie Wuhrer},
      title={Approximations of Geodesic Distances for Incomplete Triangular Manifolds},
      booktitle={Proceedings of the 19th Annual Canadian Conference on Computational Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa, Canada},
      year={2007},
      editor={Prosenjit Bose},
      publisher={Carleton University, Ottawa, Canada},
      pages={177--180},
      url={http://cccg.ca/proceedings/2007/08a2.pdf}
    }
    
  80. Linear-space algorithms for distance preserving embedding


    Asano, T., Bose, P., Carmi, P., Maheshwari, A., Shu, C., Smid, M. H. M., and Wuhrer, S.
    In Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada, pages 185–188, 2007.
    @inproceedings{DBLP:conf/cccg/AsanoBCMSSW07,
      author={Tetsuo Asano and Prosenjit Bose and Paz Carmi and Anil Maheshwari and Chang Shu and Michiel H. M. Smid and Stefanie Wuhrer},
      title={Linear-Space Algorithms for Distance Preserving Embedding},
      booktitle={Proceedings of the 19th Annual Canadian Conference on Computational Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa, Canada},
      year={2007},
      editor={Prosenjit Bose},
      publisher={Carleton University, Ottawa, Canada},
      pages={185--188},
      url={http://cccg.ca/proceedings/2007/08a3.pdf}
    }
    
  81. Traversing a set of points with a minimum number of turns


    Bereg, S., Bose, P., Dumitrescu, A., Hurtado, F., and Valtr, P.
    In Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pages 46–55, 2007.
    @inproceedings{DBLP:conf/compgeom/BeregBDHV07,
      author={Sergey Bereg and Prosenjit Bose and Adrian Dumitrescu and Ferran Hurtado and Pavel Valtr},
      title={Traversing a set of points with a minimum number of turns},
      booktitle={Proceedings of the 23rd {ACM} Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007},
      year={2007},
      editor={Jeff Erickson},
      publisher={{ACM}},
      pages={46--55},
      doi={10.1145/1247069.1247077},
      url={http://doi.acm.org/10.1145/1247069.1247077}
    }
    
  82. Location oblivious distributed unit disk graph coloring


    Couture, M., Barbeau, M., Bose, P., Carmi, P., and Kranakis, E.
    In Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings, pages 222–233, 2007.
    @inproceedings{DBLP:conf/sirocco/CoutureBBCK07,
      author={Mathieu Couture and Michel Barbeau and Prosenjit Bose and Paz Carmi and Evangelos Kranakis},
      title={Location Oblivious Distributed Unit Disk Graph Coloring},
      booktitle={Structural Information and Communication Complexity, 14th International Colloquium, {SIROCCO} 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings},
      year={2007},
      editor={Giuseppe Prencipe and Shmuel Zaks},
      publisher={Springer},
      volume={4474},
      series={Lecture Notes in Computer Science},
      pages={222--233},
      doi={10.1007/978-3-540-72951-8_18},
      url={http://dx.doi.org/10.1007/978-3-540-72951-8_18}
    }
    
  83. On a family of strong geometric spanners that admit local routing strategies


    Bose, P., Carmi, P., Couture, M., Smid, M. H. M., and Xu, D.
    In Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pages 300–311, 2007.
    @inproceedings{DBLP:conf/wads/BoseCCSX07,
      author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Michiel H. M. Smid and Daming Xu},
      title={On a Family of Strong Geometric Spanners That Admit Local Routing Strategies},
      booktitle={Algorithms and Data Structures, 10th International Workshop, {WADS} 2007, Halifax, Canada, August 15-17, 2007, Proceedings},
      year={2007},
      editor={Frank K. H. A. Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Norbert Zeh},
      publisher={Springer},
      volume={4619},
      series={Lecture Notes in Computer Science},
      pages={300--311},
      doi={10.1007/978-3-540-73951-7_27},
      url={http://dx.doi.org/10.1007/978-3-540-73951-7_27}
    }
    
  84. On generalized diamond spanners


    Bose, P., Lee, A., and Smid, M. H. M.
    In Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pages 325–336, 2007.
    @inproceedings{DBLP:conf/wads/BoseLS07,
      author={Prosenjit Bose and Aaron Lee and Michiel H. M. Smid},
      title={On Generalized Diamond Spanners},
      booktitle={Algorithms and Data Structures, 10th International Workshop, {WADS} 2007, Halifax, Canada, August 15-17, 2007, Proceedings},
      year={2007},
      editor={Frank K. H. A. Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Norbert Zeh},
      publisher={Springer},
      volume={4619},
      series={Lecture Notes in Computer Science},
      pages={325--336},
      doi={10.1007/978-3-540-73951-7_29},
      url={http://dx.doi.org/10.1007/978-3-540-73951-7_29}
    }
    
  85. Geometric spanners with small chromatic number


    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Smid, M. H. M., and Zeh, N.
    In Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers, pages 75–88, 2007.
    @inproceedings{DBLP:conf/waoa/BoseCCMSZ07,
      author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Anil Maheshwari and Michiel H. M. Smid and Norbert Zeh},
      title={Geometric Spanners with Small Chromatic Number},
      booktitle={Approximation and Online Algorithms, 5th International Workshop, {WAOA} 2007, Eilat, Israel, October 11-12, 2007. Revised Papers},
      year={2007},
      editor={Christos Kaklamanis and Martin Skutella},
      publisher={Springer},
      volume={4927},
      series={Lecture Notes in Computer Science},
      pages={75--88},
      doi={10.1007/978-3-540-77918-6_7},
      url={http://dx.doi.org/10.1007/978-3-540-77918-6_7}
    }
    
  86. Computing the tool path of an externally monotone polygon in linear time


    Bose, P., Bremner, D., and Souvaine, D. L.
    In Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006, August 14-16, 2006, Queen’s University, Ontario, Canada, 2006.
    @inproceedings{DBLP:conf/cccg/BoseBS06,
      author={Prosenjit Bose and David Bremner and Diane L. Souvaine},
      title={Computing the Tool Path of an Externally Monotone Polygon in Linear Time},
      booktitle={Proceedings of the 18th Annual Canadian Conference on Computational Geometry, {CCCG} 2006, August 14-16, 2006, Queen's University, Ontario, Canada},
      year={2006},
      url={http://www.cs.queensu.ca/cccg/papers/cccg22.pdf}
    }
    
  87. Optimal polygon placement


    Bose, P. and Morrison, J.
    In Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006, August 14-16, 2006, Queen’s University, Ontario, Canada, 2006.
    @inproceedings{DBLP:conf/cccg/BoseM06,
      author={Prosenjit Bose and Jason Morrison},
      title={Optimal Polygon Placement},
      booktitle={Proceedings of the 18th Annual Canadian Conference on Computational Geometry, {CCCG} 2006, August 14-16, 2006, Queen's University, Ontario, Canada},
      year={2006},
      url={http://www.cs.queensu.ca/cccg/papers/cccg23.pdf}
    }
    
  88. Rotationally monotone polygons


    Bose, P., Morin, P., Smid, M. H. M., and Wuhrer, S.
    In Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006, August 14-16, 2006, Queen’s University, Ontario, Canada, 2006.
    @inproceedings{DBLP:conf/cccg/BoseMSW06,
      author={Prosenjit Bose and Pat Morin and Michiel H. M. Smid and Stefanie Wuhrer},
      title={Rotationally Monotone Polygons},
      booktitle={Proceedings of the 18th Annual Canadian Conference on Computational Geometry, {CCCG} 2006, August 14-16, 2006, Queen's University, Ontario, Canada},
      year={2006},
      url={http://www.cs.queensu.ca/cccg/papers/cccg27.pdf}
    }
    
  89. Lazy generation of building interiors in realtime


    Hahn, E., Bose, P., and Whitehead, A.
    In Proceedings of the Canadian Conference on Electrical and Computer Engineering, CCECE 2006, May 7-10, 2006, Ottawa Congress Centre, Ottawa, Canada, pages 2441–2444, 2006.
    @inproceedings{DBLP:conf/ccece/HahnBW06,
      author={Evan Hahn and Prosenjit Bose and Anthony Whitehead},
      title={Lazy Generation of Building Interiors in Realtime},
      booktitle={Proceedings of the Canadian Conference on Electrical and Computer Engineering, {CCECE} 2006, May 7-10, 2006, Ottawa Congress Centre, Ottawa, Canada},
      year={2006},
      publisher={{IEEE}},
      pages={2441--2444},
      doi={10.1109/CCECE.2006.277767},
      url={http://dx.doi.org/10.1109/CCECE.2006.277767}
    }
    
  90. Diamond triangulations contain spanners of bounded degree


    Bose, P., Smid, M. H. M., and Xu, D.
    In Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pages 173–182, 2006.
    @inproceedings{DBLP:conf/isaac/BoseSX06,
      author={Prosenjit Bose and Michiel H. M. Smid and Daming Xu},
      title={Diamond Triangulations Contain Spanners of Bounded Degree},
      booktitle={Algorithms and Computation, 17th International Symposium, {ISAAC} 2006, Kolkata, India, December 18-20, 2006, Proceedings},
      year={2006},
      editor={Tetsuo Asano},
      publisher={Springer},
      volume={4288},
      series={Lecture Notes in Computer Science},
      pages={173--182},
      doi={10.1007/11940128_19},
      url={http://dx.doi.org/10.1007/11940128_19}
    }
    
  91. On the stretch factor of the constrained delaunay triangulation


    Bose, P. and Keil, J. M.
    In 3rd International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2006, Banff, Alberta, Canada, July 2-5, 2006, pages 25–31, 2006.
    @inproceedings{DBLP:conf/isvd/BoseK06,
      author={Prosenjit Bose and J. Mark Keil},
      title={On the Stretch Factor of the Constrained Delaunay Triangulation},
      booktitle={3rd International Symposium on Voronoi Diagrams in Science and Engineering, {ISVD} 2006, Banff, Alberta, Canada, July 2-5, 2006},
      year={2006},
      publisher={{IEEE} Computer Society},
      pages={25--31},
      doi={10.1109/ISVD.2006.28},
      url={http://doi.ieeecomputersociety.org/10.1109/ISVD.2006.28}
    }
    
  92. Data structures for halfplane proximity queries and incremental voronoi diagrams


    Aronov, B., Bose, P., Demaine, E. D., Gudmundsson, J., Iacono, J., Langerman, S., and Smid, M. H. M.
    In LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pages 80–92, 2006.
    @inproceedings{DBLP:conf/latin/AronovBDGILS06,
      author={Boris Aronov and Prosenjit Bose and Erik D. Demaine and Joachim Gudmundsson and John Iacono and Stefan Langerman and Michiel H. M. Smid},
      title={Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams},
      booktitle={{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings},
      year={2006},
      editor={Jos{\'{e}} R. Correa and Alejandro Hevia and Marcos A. Kiwi},
      publisher={Springer},
      volume={3887},
      series={Lecture Notes in Computer Science},
      pages={80--92},
      doi={10.1007/11682462_12},
      url={http://dx.doi.org/10.1007/11682462_12}
    }
    
  93. Incremental construction of \emphk-dominating sets in wireless sensor networks


    Couture, M., Barbeau, M., Bose, P., and Kranakis, E.
    In Principles of Distributed Systems, 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings, pages 202–214, 2006.
    @inproceedings{DBLP:conf/opodis/CoutureBBK06,
      author={Mathieu Couture and Michel Barbeau and Prosenjit Bose and Evangelos Kranakis},
      title={Incremental Construction of \emph{k}-Dominating Sets in Wireless Sensor Networks},
      booktitle={Principles of Distributed Systems, 10th International Conference, {OPODIS} 2006, Bordeaux, France, December 12-15, 2006, Proceedings},
      year={2006},
      editor={Alexander A. Shvartsman},
      publisher={Springer},
      volume={4305},
      series={Lecture Notes in Computer Science},
      pages={202--214},
      doi={10.1007/11945529_15},
      url={http://dx.doi.org/10.1007/11945529_15}
    }
    
  94. Persistent realtime building interior generation


    Hahn, E., Bose, P., and Whitehead, A.
    In Proceedings of the 2006 ACM SIGGRAPH symposium on Videogames, Sandbox ’06, Boston, Massachusetts, USA, July 30-31, 2006, pages 179–186, 2006.
    @inproceedings{DBLP:conf/siggraph/HahnBW06,
      author={Evan Hahn and Prosenjit Bose and Anthony Whitehead},
      title={Persistent realtime building interior generation},
      booktitle={Proceedings of the 2006 {ACM} {SIGGRAPH} symposium on Videogames, Sandbox '06, Boston, Massachusetts, USA, July 30-31, 2006},
      year={2006},
      editor={Alan Heirich and Douglas Thomas},
      publisher={{ACM}},
      pages={179--186},
      doi={10.1145/1183316.1183342},
      url={http://doi.acm.org/10.1145/1183316.1183342}
    }
    
  95. Simultaneous diagonal flips in plane triangulations


    Bose, P., Czyzowicz, J., Gao, Z., Morin, P., and Wood, D. R.
    In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pages 212–221, 2006.
    @inproceedings{DBLP:conf/soda/BoseCGMW06,
      author={Prosenjit Bose and Jurek Czyzowicz and Zhicheng Gao and Pat Morin and David R. Wood},
      title={Simultaneous diagonal flips in plane triangulations},
      booktitle={Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
      year={2006},
      publisher={{ACM} Press},
      pages={212--221},
      url={http://dl.acm.org/citation.cfm?id=1109557.1109582}
    }
    
  96. Translating a star over a point set


    Bose, P. and Morrison, J.
    In Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG’05, University of Windsor, Ontario, Canada, August 10-12, 2005, pages 179–182, 2005.
    @inproceedings{DBLP:conf/cccg/BoseM05,
      author={Prosenjit Bose and Jason Morrison},
      title={Translating a Star over a Point Set},
      booktitle={Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG'05, University of Windsor, Ontario, Canada, August 10-12, 2005},
      year={2005},
      pages={179--182},
      url={http://www.cccg.ca/proceedings/2005/62.pdf}
    }
    
  97. High-speed texture-preserving digital image inpainting


    Whitehead, A., Bose, P., and Audet, V.
    In Signal and Image Processing (SIP 2005), Proceedings of the IASTED International Conference, August 15-17, 2005, Honolulu, HI, USA, pages 526–531, 2005.
    @inproceedings{DBLP:conf/sip/WhiteheadBA05,
      author={Anthony Whitehead and Prosenjit Bose and Veronique Audet},
      title={High-speed texture-preserving digital image inpainting},
      booktitle={Signal and Image Processing {(SIP} 2005), Proceedings of the {IASTED} International Conference, August 15-17, 2005, Honolulu, HI, {USA}},
      year={2005},
      editor={Michael W. Marcellin},
      publisher={{IASTED/ACTA} Press},
      pages={526--531}
    }
    
  98. Approximate range mode and range median queries


    Bose, P., Kranakis, E., Morin, P., and Tang, Y.
    In STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings, pages 377–388, 2005.
    @inproceedings{DBLP:conf/stacs/BoseKMT05,
      author={Prosenjit Bose and Evangelos Kranakis and Pat Morin and Yihui Tang},
      title={Approximate Range Mode and Range Median Queries},
      booktitle={{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
      year={2005},
      editor={Volker Diekert and Bruno Durand},
      publisher={Springer},
      volume={3404},
      series={Lecture Notes in Computer Science},
      pages={377--388},
      doi={10.1007/978-3-540-31856-9_31},
      url={http://dx.doi.org/10.1007/978-3-540-31856-9_31}
    }
    
  99. Temporal synchronization of video sequences in theory and in practice


    Whitehead, A., Laganière, R., and Bose, P.
    In 7th IEEE Workshop on Applications of Computer Vision / IEEE Workshop on Motion and Video Computing (WACV/MOTION 2005), 5-7 January 2005, Breckenridge, CO, USA, pages 132–137, 2005.
    @inproceedings{DBLP:conf/wacv/WhiteheadLB05,
      author={Anthony Whitehead and Robert Lagani{\`{e}}re and Prosenjit Bose},
      title={Temporal Synchronization of Video Sequences in Theory and in Practice},
      booktitle={7th {IEEE} Workshop on Applications of Computer Vision / {IEEE} Workshop on Motion and Video Computing {(WACV/MOTION} 2005), 5-7 January 2005, Breckenridge, CO, {USA}},
      year={2005},
      publisher={{IEEE} Computer Society},
      pages={132--137},
      doi={10.1109/ACVMOT.2005.114},
      url={http://dx.doi.org/10.1109/ACVMOT.2005.114}
    }
    
  100. Induced subgraphs of bounded degree and bounded treewidth


    Bose, P., Dujmovic, V., and Wood, D. R.
    In Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pages 175–186, 2005.
    @inproceedings{DBLP:conf/wg/BoseDW05,
      author={Prosenjit Bose and Vida Dujmovic and David R. Wood},
      title={Induced Subgraphs of Bounded Degree and Bounded Treewidth},
      booktitle={Graph-Theoretic Concepts in Computer Science, 31st International Workshop, {WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
      year={2005},
      editor={Dieter Kratsch},
      publisher={Springer},
      volume={3787},
      series={Lecture Notes in Computer Science},
      pages={175--186},
      doi={10.1007/11604686_16},
      url={http://dx.doi.org/10.1007/11604686_16}
    }
    
  101. On properties of higher-order delaunay graphs with applications


    Abellanas, M., Bose, P., García-López, J., Hurtado, F., Nicolás, M., and Ramos, P. A.
    In (Informal) Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, pages 119–122, 2005.
    @inproceedings{DBLP:conf/ewcg/AbellanasBGHNR05,
      author={Manuel Abellanas and Prosenjit Bose and Jes{\'{u}}s Garc{\'{\i}}a{-}L{\'{o}}pez and Ferran Hurtado and Mariano Nicol{\'{a}}s and Pedro A. Ramos},
      title={On properties of higher-order Delaunay graphs with applications},
      booktitle={(Informal) Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005},
      year={2005},
      publisher={Technische Universiteit Eindhoven},
      pages={119--122},
      url={http://www.win.tue.nl/EWCG2005/Proceedings/31.pdf}
    }
    
  102. Computing nice sweeps for polyhedra and polygons


    Bose, P. and van Kreveld, M. J.
    In Proceedings of the 16th Canadian Conference on Computational Geometry, CCCG’04, Concordia University, Montréal, Québec, Canada, August 9-11, 2004, pages 108–111, 2004.
    @inproceedings{DBLP:conf/cccg/BoseK04,
      author={Prosenjit Bose and Marc J. van Kreveld},
      title={Computing nice sweeps for polyhedra and polygons},
      booktitle={Proceedings of the 16th Canadian Conference on Computational Geometry, CCCG'04, Concordia University, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, August 9-11, 2004},
      year={2004},
      pages={108--111},
      url={http://www.cccg.ca/proceedings/2004/54.pdf}
    }
    
  103. On computing enclosing isosceles triangles and related problems


    Bose, P., Seara, C., and Sethia, S.
    In Proceedings of the 16th Canadian Conference on Computational Geometry, CCCG’04, Concordia University, Montréal, Québec, Canada, August 9-11, 2004, pages 120–123, 2004.
    @inproceedings{DBLP:conf/cccg/BoseSS04,
      author={Prosenjit Bose and Carlos Seara and Saurabh Sethia},
      title={On computing enclosing isosceles triangles and related problems},
      booktitle={Proceedings of the 16th Canadian Conference on Computational Geometry, CCCG'04, Concordia University, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, August 9-11, 2004},
      year={2004},
      pages={120--123},
      url={http://www.cccg.ca/proceedings/2004/38.pdf}
    }
    
  104. Feature based cut detection with automatic threshold selection


    Whitehead, A., Bose, P., and Laganière, R.
    In Image and Video Retrieval: Third International Conference, CIVR 2004, Dublin, Ireland, July 21-23, 2004. Proceedings, pages 410–418, 2004.
    @inproceedings{DBLP:conf/civr/WhiteheadBL04,
      author={Anthony Whitehead and Prosenjit Bose and Robert Lagani{\`{e}}re},
      title={Feature Based Cut Detection with Automatic Threshold Selection},
      booktitle={Image and Video Retrieval: Third International Conference, {CIVR} 2004, Dublin, Ireland, July 21-23, 2004. Proceedings},
      year={2004},
      publisher={Springer},
      volume={3115},
      series={Lecture Notes in Computer Science},
      pages={410--418},
      doi={10.1007/978-3-540-27814-6_49},
      url={http://dx.doi.org/10.1007/978-3-540-27814-6_49}
    }
    
  105. Geodesic ham-sandwich cuts


    Bose, P., Demaine, E. D., Hurtado, F., Iacono, J., Langerman, S., and Morin, P.
    In Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pages 1–9, 2004.
    @inproceedings{DBLP:conf/compgeom/BoseDHILM04,
      author={Prosenjit Bose and Erik D. Demaine and Ferran Hurtado and John Iacono and Stefan Langerman and Pat Morin},
      title={Geodesic ham-sandwich cuts},
      booktitle={Proceedings of the 20th {ACM} Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004},
      year={2004},
      editor={Jack Snoeyink and Jean{-}Daniel Boissonnat},
      publisher={{ACM}},
      pages={1--9},
      doi={10.1145/997817.997821},
      url={http://doi.acm.org/10.1145/997817.997821}
    }
    
  106. Reconfiguring triangulations with edge flips and point moves


    Aloupis, G., Bose, P., and Morin, P.
    In Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers, pages 1–11, 2004.
    @inproceedings{DBLP:conf/gd/AloupisBM04,
      author={Greg Aloupis and Prosenjit Bose and Pat Morin},
      title={Reconfiguring Triangulations with Edge Flips and Point Moves},
      booktitle={Graph Drawing, 12th International Symposium, {GD} 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers},
      year={2004},
      editor={J{\'{a}}nos Pach},
      publisher={Springer},
      volume={3383},
      series={Lecture Notes in Computer Science},
      pages={1--11},
      doi={10.1007/978-3-540-31843-9_1},
      url={http://dx.doi.org/10.1007/978-3-540-31843-9_1}
    }
    
  107. Partitions of complete geometric graphs into plane trees


    Bose, P., Hurtado, F., Rivera-Campo, E., and Wood, D. R.
    In Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers, pages 71–81, 2004.
    @inproceedings{DBLP:conf/gd/BoseHRW04,
      author={Prosenjit Bose and Ferran Hurtado and Eduardo Rivera{-}Campo and David R. Wood},
      title={Partitions of Complete Geometric Graphs into Plane Trees},
      booktitle={Graph Drawing, 12th International Symposium, {GD} 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers},
      year={2004},
      editor={J{\'{a}}nos Pach},
      publisher={Springer},
      volume={3383},
      series={Lecture Notes in Computer Science},
      pages={71--81},
      doi={10.1007/978-3-540-31843-9_9},
      url={http://dx.doi.org/10.1007/978-3-540-31843-9_9}
    }
    
  108. On local transformations in plane geometric graphs embedded on small grids


    Abellanas, M., Bose, P., Olaverri, A. G., Hurtado, F., Ramos, P. A., Rivera-Campo, E., and Tejel, J.
    In Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part III, pages 22–31, 2004.
    @inproceedings{DBLP:conf/iccsa/AbellanasBOHRRT04,
      author={Manuel Abellanas and Prosenjit Bose and Alfredo Garc{\'{\i}}a Olaverri and Ferran Hurtado and Pedro A. Ramos and Eduardo Rivera{-}Campo and Javier Tejel},
      title={On Local Transformations in Plane Geometric Graphs Embedded on Small Grids},
      booktitle={Computational Science and Its Applications - {ICCSA} 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part {III}},
      year={2004},
      editor={Antonio Lagan{\`{a}} and Marina L. Gavrilova and Vipin Kumar and Youngsong Mun and Chih Jeng Kenneth Tan and Osvaldo Gervasi},
      publisher={Springer},
      volume={3045},
      series={Lecture Notes in Computer Science},
      pages={22--31},
      doi={10.1007/978-3-540-24767-8_3},
      url={http://dx.doi.org/10.1007/978-3-540-24767-8_3}
    }
    
  109. Weighted ham-sandwich cuts


    Bose, P. and Langerman, S.
    In Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers, pages 48–53, 2004.
    @inproceedings{DBLP:conf/jcdcg/BoseL04,
      author={Prosenjit Bose and Stefan Langerman},
      title={Weighted Ham-Sandwich Cuts},
      booktitle={Discrete and Computational Geometry, Japanese Conference, {JCDCG} 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers},
      year={2004},
      editor={Jin Akiyama and Mikio Kano and Xuehou Tan},
      publisher={Springer},
      volume={3742},
      series={Lecture Notes in Computer Science},
      pages={48--53},
      doi={10.1007/11589440_5},
      url={http://dx.doi.org/10.1007/11589440_5}
    }
    
  110. Bounds for frequency estimation of packet streams


    Bose, P., Kranakis, E., Morin, P., and Tang, Y.
    In SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, June 18-20, 2003, Umeå Sweden, pages 33–42, 2003.
    @inproceedings{DBLP:conf/sirocco/BoseKMT03,
      author={Prosenjit Bose and Evangelos Kranakis and Pat Morin and Yihui Tang},
      title={Bounds for Frequency Estimation of Packet Streams},
      booktitle={{SIROCCO} 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, June 18-20, 2003, Ume{\aa} Sweden},
      year={2003},
      editor={Jop F. Sibeyn},
      publisher={Carleton Scientific},
      volume={17},
      series={Proceedings in Informatics},
      pages={33--42}
    }
    
  111. Approximating geometric bottleneck shortest paths


    Bose, P., Maheshwari, A., Narasimhan, G., Smid, M. H. M., and Zeh, N.
    In STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pages 38–49, 2003.
    @inproceedings{DBLP:conf/stacs/BoseMNSZ03,
      author={Prosenjit Bose and Anil Maheshwari and Giri Narasimhan and Michiel H. M. Smid and Norbert Zeh},
      title={Approximating Geometric Bottleneck Shortest Paths},
      booktitle={{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
      year={2003},
      editor={Helmut Alt and Michel Habib},
      publisher={Springer},
      volume={2607},
      series={Lecture Notes in Computer Science},
      pages={38--49},
      doi={10.1007/3-540-36494-3_5},
      url={http://dx.doi.org/10.1007/3-540-36494-3_5}
    }
    
  112. Ordered theta graphs


    Bose, P., Gudmundsson, J., and Morin, P.
    In Proceedings of the 14th Canadian Conference on Computational Geometry, University of Lethbridge, Alberta, Canada, August 12-14, 2002, pages 17–21, 2002.
    @inproceedings{DBLP:conf/cccg/BoseGM02,
      author={Prosenjit Bose and Joachim Gudmundsson and Pat Morin},
      title={Ordered theta graphs},
      booktitle={Proceedings of the 14th Canadian Conference on Computational Geometry, University of Lethbridge, Alberta, Canada, August 12-14, 2002},
      year={2002},
      pages={17--21},
      url={http://www.cs.uleth.ca/~wismath/cccg/papers/34.ps}
    }
    
  113. Computing signed permutations of polygons


    Aloupis, G., Bose, P., Demaine, E. D., Langerman, S., Meijer, H., Overmars, M. H., and Toussaint, G. T.
    In Proceedings of the 14th Canadian Conference on Computational Geometry, University of Lethbridge, Alberta, Canada, August 12-14, 2002, pages 68–71, 2002.
    @inproceedings{DBLP:conf/cccg/AloupisBDLMOT02,
      author={Greg Aloupis and Prosenjit Bose and Erik D. Demaine and Stefan Langerman and Henk Meijer and Mark H. Overmars and Godfried T. Toussaint},
      title={Computing signed permutations of polygons},
      booktitle={Proceedings of the 14th Canadian Conference on Computational Geometry, University of Lethbridge, Alberta, Canada, August 12-14, 2002},
      year={2002},
      pages={68--71},
      url={http://www.cs.uleth.ca/~wismath/cccg/papers/23l.ps}
    }
    
  114. Light edges in degree-constrained graphs


    Bose, P., Smid, M. H. M., and Wood, D. R.
    In Proceedings of the 14th Canadian Conference on Computational Geometry, University of Lethbridge, Alberta, Canada, August 12-14, 2002, pages 142–145, 2002.
    @inproceedings{DBLP:conf/cccg/BoseSW02,
      author={Prosenjit Bose and Michiel H. M. Smid and David R. Wood},
      title={Light edges in degree-constrained graphs},
      booktitle={Proceedings of the 14th Canadian Conference on Computational Geometry, University of Lethbridge, Alberta, Canada, August 12-14, 2002},
      year={2002},
      pages={142--145},
      url={http://www.cs.uleth.ca/~wismath/cccg/papers/35.ps}
    }
    
  115. Constructing plane spanners of bounded degree and low weight


    Bose, P., Gudmundsson, J., and Smid, M. H. M.
    In Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pages 234–246, 2002.
    @inproceedings{DBLP:conf/esa/BoseGS02,
      author={Prosenjit Bose and Joachim Gudmundsson and Michiel H. M. Smid},
      title={Constructing Plane Spanners of Bounded Degree and Low Weight},
      booktitle={Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings},
      year={2002},
      editor={Rolf H. M{\"{o}}hring and Rajeev Raman},
      publisher={Springer},
      volume={2461},
      series={Lecture Notes in Computer Science},
      pages={234--246},
      doi={10.1007/3-540-45749-6_24},
      url={http://dx.doi.org/10.1007/3-540-45749-6_24}
    }
    
  116. Succinct data structures for approximating convex functions with applications


    Bose, P., Devroye, L., and Morin, P.
    In Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers, pages 97–107, 2002.
    @inproceedings{DBLP:conf/jcdcg/BoseDM02,
      author={Prosenjit Bose and Luc Devroye and Pat Morin},
      title={Succinct Data Structures for Approximating Convex Functions with Applications},
      booktitle={Discrete and Computational Geometry, Japanese Conference, {JCDCG} 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers},
      year={2002},
      editor={Jin Akiyama and Mikio Kano},
      publisher={Springer},
      volume={2866},
      series={Lecture Notes in Computer Science},
      pages={97--107},
      doi={10.1007/978-3-540-44400-8_10},
      url={http://dx.doi.org/10.1007/978-3-540-44400-8_10}
    }
    
  117. Facility location constrained to a polygonal domain


    Bose, P. and Wang, Q.
    In LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings, pages 153–164, 2002.
    @inproceedings{DBLP:conf/latin/BoseW02,
      author={Prosenjit Bose and Qingda Wang},
      title={Facility Location Constrained to a Polygonal Domain},
      booktitle={{LATIN} 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings},
      year={2002},
      editor={Sergio Rajsbaum},
      publisher={Springer},
      volume={2286},
      series={Lecture Notes in Computer Science},
      pages={153--164},
      doi={10.1007/3-540-45995-2_18},
      url={http://dx.doi.org/10.1007/3-540-45995-2_18}
    }
    
  118. On the spanning ratio of gabriel graphs and beta-skeletons


    Bose, P., Devroye, L., Evans, W. S., and Kirkpatrick, D. G.
    In LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings, pages 479–493, 2002.
    @inproceedings{DBLP:conf/latin/BoseDEK02,
      author={Prosenjit Bose and Luc Devroye and William S. Evans and David G. Kirkpatrick},
      title={On the Spanning Ratio of Gabriel Graphs and beta-skeletons},
      booktitle={{LATIN} 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings},
      year={2002},
      editor={Sergio Rajsbaum},
      publisher={Springer},
      volume={2286},
      series={Lecture Notes in Computer Science},
      pages={479--493},
      doi={10.1007/3-540-45995-2_42},
      url={http://dx.doi.org/10.1007/3-540-45995-2_42}
    }
    
  119. Asymmetric communication protocols via hotlink assignments


    Bose, P., Krizanc, D., Langerman, S., and Morin, P.
    In SIROCCO 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002, pages 33–39, 2002.
    @inproceedings{DBLP:conf/sirocco/BoseKLM02,
      author={Prosenjit Bose and Danny Krizanc and Stefan Langerman and Pat Morin},
      title={Asymmetric Communication Protocols via Hotlink Assignments},
      booktitle={{SIROCCO} 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002},
      year={2002},
      editor={Christos Kaklamanis and Lefteris M. Kirousis},
      publisher={Carleton Scientific},
      volume={13},
      series={Proceedings in Informatics},
      pages={33--39}
    }
    
  120. Packing two disks into a polygonal environment


    Bose, P., Morin, P., and Vigneron, A.
    In Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pages 142–149, 2001.
    @inproceedings{DBLP:conf/cocoon/BoseMV01,
      author={Prosenjit Bose and Pat Morin and Antoine Vigneron},
      title={Packing Two Disks into a Polygonal Environment},
      booktitle={Computing and Combinatorics, 7th Annual International Conference, {COCOON} 2001, Guilin, China, August 20-23, 2001, Proceedings},
      year={2001},
      editor={Jie Wang},
      publisher={Springer},
      volume={2108},
      series={Lecture Notes in Computer Science},
      pages={142--149},
      doi={10.1007/3-540-44679-6_16},
      url={http://dx.doi.org/10.1007/3-540-44679-6_16}
    }
    
  121. Competitive online routing in geometric graphs


    Bose, P. and Morin, P.
    In SIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001, pages 35–44, 2001.
    @inproceedings{DBLP:conf/sirocco/BoseM01,
      author={Prosenjit Bose and Pat Morin},
      title={Competitive Online Routing in Geometric Graphs},
      booktitle={{SIROCCO} 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de N{\'{u}}ria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001},
      year={2001},
      editor={Francesc Comellas and Josep F{\`{a}}brega and Pierre Fraigniaud},
      publisher={Carleton Scientific},
      volume={8},
      series={Proceedings in Informatics},
      pages={35--44}
    }
    
  122. The grid placement problem


    Bose, P., Maheshwari, A., Morin, P., and Morrison, J.
    In Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings, pages 180–191, 2001.
    @inproceedings{DBLP:conf/wads/BoseMMM01,
      author={Prosenjit Bose and Anil Maheshwari and Pat Morin and Jason Morrison},
      title={The Grid Placement Problem},
      booktitle={Algorithms and Data Structures, 7th International Workshop, {WADS} 2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
      year={2001},
      editor={Frank K. H. A. Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Roberto Tamassia},
      publisher={Springer},
      volume={2125},
      series={Lecture Notes in Computer Science},
      pages={180--191},
      doi={10.1007/3-540-44634-6_17},
      url={http://dx.doi.org/10.1007/3-540-44634-6_17}
    }
    
  123. Flipping your lid


    Ahn, H., Bose, P., Czyzowicz, J., Hanusse, N., Kranakis, E., and Morin, P.
    In Proceedings of the 12th Canadian Conference on Computational Geometry, Fredericton, New Brunswick, Canada, August 16-19, 2000, 2000.
    @inproceedings{DBLP:conf/cccg/AhnBCHKM00,
      author={Hee{-}Kap Ahn and Prosenjit Bose and Jurek Czyzowicz and Nicolas Hanusse and Evangelos Kranakis and Pat Morin},
      title={Flipping your Lid},
      booktitle={Proceedings of the 12th Canadian Conference on Computational Geometry, Fredericton, New Brunswick, Canada, August 16-19, 2000},
      year={2000},
      url={http://www.cccg.ca/proceedings/2000/38.ps.gz}
    }
    
  124. Strategies for hotlink assignments


    Bose, P., Kranakis, E., Krizanc, D., Martin, M. V., Czyzowicz, J., Pelc, A., and Gasieniec, L.
    In Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pages 23–34, 2000.
    @inproceedings{DBLP:conf/isaac/BoseKKMCPG00,
      author={Prosenjit Bose and Evangelos Kranakis and Danny Krizanc and Miguel Vargas Martin and Jurek Czyzowicz and Andrzej Pelc and Leszek Gasieniec},
      title={Strategies for Hotlink Assignments},
      booktitle={Algorithms and Computation, 11th International Conference, {ISAAC} 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
      year={2000},
      editor={D. T. Lee and Shang{-}Hua Teng},
      publisher={Springer},
      volume={1969},
      series={Lecture Notes in Computer Science},
      pages={23--34},
      doi={10.1007/3-540-40996-3_3},
      url={http://dx.doi.org/10.1007/3-540-40996-3_3}
    }
    
  125. Online routing in convex subdivisions


    Bose, P., Morin, P., Brodnik, A., Carlsson, S., Demaine, E. D., Fleischer, R., Munro, J. I., and López-Ortiz, A.
    In Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pages 47–59, 2000.
    @inproceedings{DBLP:conf/isaac/BoseMBCDFML00,
      author={Prosenjit Bose and Pat Morin and Andrej Brodnik and Svante Carlsson and Erik D. Demaine and Rudolf Fleischer and J. Ian Munro and Alejandro L{\'{o}}pez{-}Ortiz},
      title={Online Routing in Convex Subdivisions},
      booktitle={Algorithms and Computation, 11th International Conference, {ISAAC} 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
      year={2000},
      editor={D. T. Lee and Shang{-}Hua Teng},
      publisher={Springer},
      volume={1969},
      series={Lecture Notes in Computer Science},
      pages={47--59},
      doi={10.1007/3-540-40996-3_5},
      url={http://dx.doi.org/10.1007/3-540-40996-3_5}
    }
    
  126. An improved algorithm for subdivision traversal without extra storage


    Bose, P. and Morin, P.
    In Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pages 444–455, 2000.
    @inproceedings{DBLP:conf/isaac/BoseM00,
      author={Prosenjit Bose and Pat Morin},
      title={An Improved Algorithm for Subdivision Traversal without Extra Storage},
      booktitle={Algorithms and Computation, 11th International Conference, {ISAAC} 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
      year={2000},
      editor={D. T. Lee and Shang{-}Hua Teng},
      publisher={Springer},
      volume={1969},
      series={Lecture Notes in Computer Science},
      pages={444--455},
      doi={10.1007/3-540-40996-3_38},
      url={http://dx.doi.org/10.1007/3-540-40996-3_38}
    }
    
  127. Near optimal-partitioning of rectangles and prisms


    Bose, P., Czyzowicz, J., Kranakis, E., Krizanc, D., and Lessard, D.
    In Proceedings of the 11th Canadian Conference on Computational Geometry, UBC, Vancouver, British Columbia, Canada, August 15-18, 1999, 1999.
    @inproceedings{DBLP:conf/cccg/BoseCKKL99,
      author={Prosenjit Bose and Jurek Czyzowicz and Evangelos Kranakis and Danny Krizanc and Dominic Lessard},
      title={Near optimal-partitioning of rectangles and prisms},
      booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry, UBC, Vancouver, British Columbia, Canada, August 15-18, 1999},
      year={1999},
      url={http://www.cccg.ca/proceedings/1999/fp45.pdf}
    }
    
  128. Routing with guaranteed delivery in ad hoc wireless networks


    Bose, P., Morin, P., Stojmenovic, I., and Urrutia, J.
    In Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 1999), Seattle, Washington, USA, August 20, 1999, pages 48–55, 1999.
    @inproceedings{DBLP:conf/dialm/BoseMSU99,
      author={Prosenjit Bose and Pat Morin and Ivan Stojmenovic and Jorge Urrutia},
      title={Routing with guaranteed delivery in ad hoc wireless networks},
      booktitle={Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications {(DIAL-M} 1999), Seattle, Washington, USA, August 20, 1999},
      year={1999},
      publisher={{ACM}},
      pages={48--55},
      doi={10.1145/313239.313282},
      url={http://doi.acm.org/10.1145/313239.313282}
    }
    
  129. Coarse grained parallel maximum matching in convex bipartite graphs


    Bose, P., Chan, A., Dehne, F. K. H. A., and Latzel, M.
    In 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP ’99), 12-16 April 1999, San Juan, Puerto Rico, Proceedings, pages 125–129, 1999.
    @inproceedings{DBLP:conf/ipps/BoseCDL99,
      author={Prosenjit Bose and Albert Chan and Frank K. H. A. Dehne and Markus Latzel},
      title={Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs},
      booktitle={13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing {(IPPS} / {SPDP} '99), 12-16 April 1999, San Juan, Puerto Rico, Proceedings},
      year={1999},
      publisher={{IEEE} Computer Society},
      pages={125--129},
      doi={10.1109/IPPS.1999.760446},
      url={http://dx.doi.org/10.1109/IPPS.1999.760446}
    }
    
  130. Online routing in triangulations


    Bose, P. and Morin, P.
    In Algorithms and Computation, 10th International Symposium, ISAAC ’99, Chennai, India, December 16-18, 1999, Proceedings, pages 113–122, 1999.
    @inproceedings{DBLP:conf/isaac/BoseM99,
      author={Prosenjit Bose and Pat Morin},
      title={Online Routing in Triangulations},
      booktitle={Algorithms and Computation, 10th International Symposium, {ISAAC} '99, Chennai, India, December 16-18, 1999, Proceedings},
      year={1999},
      editor={Alok Aggarwal and C. Pandu Rangan},
      publisher={Springer},
      volume={1741},
      series={Lecture Notes in Computer Science},
      pages={113--122},
      doi={10.1007/3-540-46632-0_12},
      url={http://dx.doi.org/10.1007/3-540-46632-0_12}
    }
    
  131. Station layouts in the presence of location constraints


    Bose, P., Kaklamanis, C., Kirousis, L. M., Kranakis, E., Krizanc, D., and Peleg, D.
    In Algorithms and Computation, 10th International Symposium, ISAAC ’99, Chennai, India, December 16-18, 1999, Proceedings, pages 269–278, 1999.
    @inproceedings{DBLP:conf/isaac/BoseKKKKP99,
      author={Prosenjit Bose and Christos Kaklamanis and Lefteris M. Kirousis and Evangelos Kranakis and Danny Krizanc and David Peleg},
      title={Station Layouts in the Presence of Location Constraints},
      booktitle={Algorithms and Computation, 10th International Symposium, {ISAAC} '99, Chennai, India, December 16-18, 1999, Proceedings},
      year={1999},
      editor={Alok Aggarwal and C. Pandu Rangan},
      publisher={Springer},
      volume={1741},
      series={Lecture Notes in Computer Science},
      pages={269--278},
      doi={10.1007/3-540-46632-0_28},
      url={http://dx.doi.org/10.1007/3-540-46632-0_28}
    }
    
  132. Efficient algorithms for petersen’s matching theorem


    Biedl, T. C., Bose, P., Demaine, E. D., and Lubiw, A.
    In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland., pages 130–139, 1999.
    @inproceedings{DBLP:conf/soda/BiedlBDL99,
      author={Therese C. Biedl and Prosenjit Bose and Erik D. Demaine and Anna Lubiw},
      title={Efficient Algorithms for Petersen's Matching Theorem},
      booktitle={Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland.},
      year={1999},
      editor={Robert Endre Tarjan and Tandy J. Warnow},
      publisher={{ACM/SIAM}},
      pages={130--139},
      url={http://dl.acm.org/citation.cfm?id=314500.314544}
    }
    
  133. Optimizing constrained offset and scaled polygonal annuli


    Barequet, G., Bose, P., and Dickerson, M.
    In Algorithms and Data Structures, 6th International Workshop, WADS ’99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings, pages 62–73, 1999.
    @inproceedings{DBLP:conf/wads/BarequetBD99,
      author={Gill Barequet and Prosenjit Bose and Matthew Dickerson},
      title={Optimizing Constrained Offset and Scaled Polygonal Annuli},
      booktitle={Algorithms and Data Structures, 6th International Workshop, {WADS} '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings},
      year={1999},
      editor={Frank K. H. A. Dehne and Arvind Gupta and J{\"{o}}rg{-}R{\"{u}}diger Sack and Roberto Tamassia},
      publisher={Springer},
      volume={1663},
      series={Lecture Notes in Computer Science},
      pages={62--73},
      doi={10.1007/3-540-48447-7_8},
      url={http://dx.doi.org/10.1007/3-540-48447-7_8}
    }
    
  134. Testing the quality of manufactured balls


    Bose, P. and Morin, P.
    In Algorithms and Data Structures, 6th International Workshop, WADS ’99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings, pages 145–156, 1999.
    @inproceedings{DBLP:conf/wads/BoseM99,
      author={Prosenjit Bose and Pat Morin},
      title={Testing the Quality of Manufactured Balls},
      booktitle={Algorithms and Data Structures, 6th International Workshop, {WADS} '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings},
      year={1999},
      editor={Frank K. H. A. Dehne and Arvind Gupta and J{\"{o}}rg{-}R{\"{u}}diger Sack and Roberto Tamassia},
      publisher={Springer},
      volume={1663},
      series={Lecture Notes in Computer Science},
      pages={145--156},
      doi={10.1007/3-540-48447-7_16},
      url={http://dx.doi.org/10.1007/3-540-48447-7_16}
    }
    
  135. Recovering lines with fixed linear probes


    de Berg, M., Bose, P., Bremner, D., Evans, W. S., and Narayanan, L.
    In Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montréal, Québec, Canada, August 10-12, 1998, 1998.
    @inproceedings{DBLP:conf/cccg/BergBBEN98,
      author={Mark de Berg and Prosenjit Bose and David Bremner and William S. Evans and Lata Narayanan},
      title={Recovering lines with fixed linear probes},
      booktitle={Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, August 10-12, 1998},
      year={1998},
      url={http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-deberg-recovering.ps.gz}
    }
    
  136. Detection of text-line orientation


    Bose, P., Caron, J., and Ghoudi, K.
    In Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montréal, Québec, Canada, August 10-12, 1998, 1998.
    @inproceedings{DBLP:conf/cccg/BoseCG98,
      author={Prosenjit Bose and Jean{-}Denis Caron and Kilani Ghoudi},
      title={Detection of text-line orientation},
      booktitle={Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, August 10-12, 1998},
      year={1998},
      url={http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-bose-detection.ps.gz}
    }
    
  137. Cutting rectangles in equal area pieces


    Bose, P., Czyzowicz, J., and Lessard, D.
    In Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montréal, Québec, Canada, August 10-12, 1998, 1998.
    @inproceedings{DBLP:conf/cccg/BoseCL98,
      author={Prosenjit Bose and Jurek Czyzowicz and Dominic Lessard},
      title={Cutting rectangles in equal area pieces},
      booktitle={Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, August 10-12, 1998},
      year={1998},
      url={http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-bose-cutting.ps.gz}
    }
    
  138. Finding specified sections of arrangements: 2d results


    Bose, P., Hurtado, F., Meijer, H., Ramaswami, S., Rappaport, D., Sacristán, V., Shermer, T. C., and Toussaint, G. T.
    In Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montréal, Québec, Canada, August 10-12, 1998, 1998.
    @inproceedings{DBLP:conf/cccg/BoseHMRRSST98,
      author={Prosenjit Bose and Ferran Hurtado and Henk Meijer and Suneeta Ramaswami and David Rappaport and Vera Sacrist{\'{a}}n and Thomas C. Shermer and Godfried T. Toussaint},
      title={Finding specified sections of arrangements: 2d results},
      booktitle={Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, August 10-12, 1998},
      year={1998},
      url={http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-bose-finding.ps.gz}
    }
    
  139. Testing the quality of manufactured disks and cylinders


    Bose, P. and Morin, P.
    In Algorithms and Computation, 9th International Symposium, ISAAC ’98, Taejon, Korea, December 14-16, 1998, Proceedings, pages 129–138, 1998.
    @inproceedings{DBLP:conf/isaac/BoseM98,
      author={Prosenjit Bose and Pat Morin},
      title={Testing the Quality of Manufactured Disks and Cylinders},
      booktitle={Algorithms and Computation, 9th International Symposium, {ISAAC} '98, Taejon, Korea, December 14-16, 1998, Proceedings},
      year={1998},
      editor={Kyung{-}Yong Chwa and Oscar H. Ibarra},
      publisher={Springer},
      volume={1533},
      series={Lecture Notes in Computer Science},
      pages={129--138},
      doi={10.1007/3-540-49381-6_15},
      url={http://dx.doi.org/10.1007/3-540-49381-6_15}
    }
    
  140. Polygon cutting: revisited


    Bose, P., Czyzowicz, J., Kranakis, E., Krizanc, D., and Maheshwari, A.
    In Discrete and Computational Geometry, Japanese Conference, JCDCG’98, Tokyo, Japan, December 9-12, 1998, Revised Papers, pages 81–92, 1998.
    @inproceedings{DBLP:conf/jcdcg/BoseCKKM98,
      author={Prosenjit Bose and Jurek Czyzowicz and Evangelos Kranakis and Danny Krizanc and Anil Maheshwari},
      title={Polygon Cutting: Revisited},
      booktitle={Discrete and Computational Geometry, Japanese Conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, Revised Papers},
      year={1998},
      editor={Jin Akiyama and Mikio Kano and Masatsugu Urabe},
      publisher={Springer},
      volume={1763},
      series={Lecture Notes in Computer Science},
      pages={81--92},
      doi={10.1007/978-3-540-46515-7_7},
      url={http://dx.doi.org/10.1007/978-3-540-46515-7_7}
    }
    
  141. Algorithms for packing two circles in a convex polygon


    Bose, P., Czyzowicz, J., Kranakis, E., and Maheshwari, A.
    In Discrete and Computational Geometry, Japanese Conference, JCDCG’98, Tokyo, Japan, December 9-12, 1998, Revised Papers, pages 93–103, 1998.
    @inproceedings{DBLP:conf/jcdcg/BoseCKM98,
      author={Prosenjit Bose and Jurek Czyzowicz and Evangelos Kranakis and Anil Maheshwari},
      title={Algorithms for Packing Two Circles in a Convex Polygon},
      booktitle={Discrete and Computational Geometry, Japanese Conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, Revised Papers},
      year={1998},
      editor={Jin Akiyama and Mikio Kano and Masatsugu Urabe},
      publisher={Springer},
      volume={1763},
      series={Lecture Notes in Computer Science},
      pages={93--103},
      doi={10.1007/978-3-540-46515-7_8},
      url={http://dx.doi.org/10.1007/978-3-540-46515-7_8}
    }
    
  142. Separating an object from its cast


    Ahn, H., de Berg, M., Bose, P., Cheng, S., Halperin, D., Matousek, J., and Schwarzkopf, O.
    In Proceedings of the Thirteenth Annual Symposium on Computational Geometry, Nice, France, June 4-6, 1997, pages 221–230, 1997.
    @inproceedings{DBLP:conf/compgeom/AhnBBCHMS97,
      author={Hee{-}Kap Ahn and Mark de Berg and Prosenjit Bose and Siu{-}Wing Cheng and Dan Halperin and Jir{\'{\i}} Matousek and Otfried Schwarzkopf},
      title={Separating an Object from its Cast},
      booktitle={Proceedings of the Thirteenth Annual Symposium on Computational Geometry, Nice, France, June 4-6, 1997},
      year={1997},
      editor={Jean{-}Daniel Boissonnat},
      publisher={{ACM}},
      pages={221--230},
      doi={10.1145/262839.262974},
      url={http://doi.acm.org/10.1145/262839.262974}
    }
    
  143. On embedding an outer-planar graph in a point set


    Bose, P.
    In Graph Drawing, 5th International Symposium, GD ’97, Rome, Italy, September 18-20, 1997, Proceedings, pages 25–36, 1997.
    @inproceedings{DBLP:conf/gd/Bose97,
      author={Prosenjit Bose},
      title={On Embedding an Outer-Planar Graph in a Point Set},
      booktitle={Graph Drawing, 5th International Symposium, {GD} '97, Rome, Italy, September 18-20, 1997, Proceedings},
      year={1997},
      editor={Giuseppe Di Battista},
      publisher={Springer},
      volume={1353},
      series={Lecture Notes in Computer Science},
      pages={25--36},
      doi={10.1007/3-540-63938-1_47},
      url={http://dx.doi.org/10.1007/3-540-63938-1_47}
    }
    
  144. Computing constrained minimum-width annuli of point sets


    de Berg, M., Bose, P., Bremner, D., Ramaswami, S., and Wilfong, G. T.
    In Algorithms and Data Structures, 5th International Workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings, pages 392–401, 1997.
    @inproceedings{DBLP:conf/wads/BergBBRW97,
      author={Mark de Berg and Prosenjit Bose and David Bremner and Suneeta Ramaswami and Gordon T. Wilfong},
      title={Computing Constrained Minimum-Width Annuli of Point Sets},
      booktitle={Algorithms and Data Structures, 5th International Workshop, {WADS} '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings},
      year={1997},
      editor={Frank K. H. A. Dehne and Andrew Rau{-}Chaplin and J{\"{o}}rg{-}R{\"{u}}diger Sack and Roberto Tamassia},
      publisher={Springer},
      volume={1272},
      series={Lecture Notes in Computer Science},
      pages={392--401},
      doi={10.1007/3-540-63307-3_77},
      url={http://dx.doi.org/10.1007/3-540-63307-3_77}
    }
    
  145. Diamonds are not a minimum weight triangulation’s best friend


    Bose, P., Devroye, L., and Evans, W. S.
    In Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996, pages 68–73, 1996.
    @inproceedings{DBLP:conf/cccg/BoseDE96,
      author={Prosenjit Bose and Luc Devroye and William S. Evans},
      title={Diamonds Are Not a Minimum Weight Triangulation's Best Friend},
      booktitle={Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996},
      year={1996},
      editor={Frank Fiala and Evangelos Kranakis and J{\"{o}}rg{-}R{\"{u}}diger Sack},
      publisher={Carleton University Press},
      pages={68--73},
      url={http://www.cccg.ca/proceedings/1996/cccg1996_0012.pdf}
    }
    
  146. Approximating shortest paths in arrangements of lines


    Bose, P., Evans, W. S., Kirkpatrick, D. G., McAllister, M., and Snoeyink, J.
    In Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996, pages 143–148, 1996.
    @inproceedings{DBLP:conf/cccg/BoseEKMS96,
      author={Prosenjit Bose and William S. Evans and David G. Kirkpatrick and Michael McAllister and Jack Snoeyink},
      title={Approximating Shortest Paths in Arrangements of Lines},
      booktitle={Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996},
      year={1996},
      editor={Frank Fiala and Evangelos Kranakis and J{\"{o}}rg{-}R{\"{u}}diger Sack},
      publisher={Carleton University Press},
      pages={143--148},
      url={http://www.cccg.ca/proceedings/1996/cccg1996_0025.pdf}
    }
    
  147. Efficient algorithms for guarding or illuminating the surface of a polyhedral terrain


    Bose, P., Kirkpatrick, D. G., and Li, Z.
    In Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996, pages 217–222, 1996.
    @inproceedings{DBLP:conf/cccg/BoseKL96,
      author={Prosenjit Bose and David G. Kirkpatrick and Zaiqing Li},
      title={Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain},
      booktitle={Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996},
      year={1996},
      editor={Frank Fiala and Evangelos Kranakis and J{\"{o}}rg{-}R{\"{u}}diger Sack},
      publisher={Carleton University Press},
      pages={217--222},
      url={http://www.cccg.ca/proceedings/1996/cccg1996_0037.pdf}
    }
    
  148. The complexity of rivers in triangulated terrains


    de Berg, M., Bose, P., Dobrindt, K., van Kreveld, M. J., Overmars, M. H., de Groot, M., Roos, T., Snoeyink, J., and Yu, S.
    In Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996, pages 325–330, 1996.
    @inproceedings{DBLP:conf/cccg/BergBDKOGRSY96,
      author={Mark de Berg and Prosenjit Bose and Katrin Dobrindt and Marc J. van Kreveld and Mark H. Overmars and Marko de Groot and Thomas Roos and Jack Snoeyink and Sidi Yu},
      title={The Complexity of Rivers in Triangulated Terrains},
      booktitle={Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996},
      year={1996},
      editor={Frank Fiala and Evangelos Kranakis and J{\"{o}}rg{-}R{\"{u}}diger Sack},
      publisher={Carleton University Press},
      pages={325--330},
      url={http://www.cccg.ca/proceedings/1996/cccg1996_0054.pdf}
    }
    
  149. Computing the constrained euclidean geodesic and link center of a simple polygon with application


    Bose, P. and Toussaint, G. T.
    In Computer Graphics International Conference, CGI 1996, Pohang, Korea, June 24-28, 1996, pages 102–110, 1996.
    @inproceedings{DBLP:conf/cgi/BoseT96,
      author={Prosenjit Bose and Godfried T. Toussaint},
      title={Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application},
      booktitle={Computer Graphics International Conference, {CGI} 1996, Pohang, Korea, June 24-28, 1996},
      year={1996},
      publisher={{IEEE} Computer Society},
      pages={102--110},
      doi={10.1109/CGI.1996.511792},
      url={http://doi.ieeecomputersociety.org/10.1109/CGI.1996.511792}
    }
    
  150. On the sectional area of convex polytopes


    Avis, D., Bose, P., Toussaint, G. T., Shermer, T. C., Zhu, B., and Snoeyink, J.
    In Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, USA, May 24-26, 1996, pages C–11–C–12, 1996.
    @inproceedings{DBLP:conf/compgeom/AvisBTSZS96,
      author={David Avis and Prosenjit Bose and Godfried T. Toussaint and Thomas C. Shermer and Binhai Zhu and Jack Snoeyink},
      title={On the Sectional Area of Convex Polytopes},
      booktitle={Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, USA, May 24-26, 1996},
      year={1996},
      editor={Sue Whitesides},
      publisher={{ACM}},
      pages={C--11--C--12},
      doi={10.1145/237218.237411},
      url={http://doi.acm.org/10.1145/237218.237411}
    }
    
  151. On rectangle visibility graphs


    Bose, P., Dean, A. M., Hutchinson, J. P., and Shermer, T. C.
    In Graph Drawing, Symposium on Graph Drawing, GD ’96, Berkeley, California, USA, September 18-20, Proceedings, pages 25–44, 1996.
    @inproceedings{DBLP:conf/gd/BoseDHS96,
      author={Prosenjit Bose and Alice M. Dean and Joan P. Hutchinson and Thomas C. Shermer},
      title={On Rectangle Visibility Graphs},
      booktitle={Graph Drawing, Symposium on Graph Drawing, {GD} '96, Berkeley, California, USA, September 18-20, Proceedings},
      year={1996},
      editor={Stephen C. North},
      publisher={Springer},
      volume={1190},
      series={Lecture Notes in Computer Science},
      pages={25--44},
      doi={10.1007/3-540-62495-3_35},
      url={http://dx.doi.org/10.1007/3-540-62495-3_35}
    }
    
  152. Aperture angle optimization problems


    Bose, P., Hurtado, F., Omaña-Pulido, E., and Toussaint, G. T.
    In Proceedings of the 7th Canadian Conference on Computational Geometry, Quebec City, Quebec, Canada, August 1995, pages 73–78, 1995.
    @inproceedings{DBLP:conf/cccg/BoseHOT95,
      author={Prosenjit Bose and Ferran Hurtado and Elsa Oma{\~{n}}a{-}Pulido and Godfried T. Toussaint},
      title={Aperture angle optimization problems},
      booktitle={Proceedings of the 7th Canadian Conference on Computational Geometry, Quebec City, Quebec, Canada, August 1995},
      year={1995},
      publisher={Carleton University, Ottawa, Canada},
      pages={73--78},
      url={http://www.cccg.ca/proceedings/1995/cccg1995_0012.pdf}
    }
    
  153. Drawing nice projections of objects in space


    Bose, P., Gómez, F., Ramos, P. A., and Toussaint, G. T.
    In Graph Drawing, Symposium on Graph Drawing, GD ’95, Passau, Germany, September 20-22, 1995, Proceedings, pages 52–63, 1995.
    @inproceedings{DBLP:conf/gd/BoseGRT95,
      author={Prosenjit Bose and Francisco G{\'{o}}mez and Pedro A. Ramos and Godfried T. Toussaint},
      title={Drawing Nice Projections of Objects in Space},
      booktitle={Graph Drawing, Symposium on Graph Drawing, {GD} '95, Passau, Germany, September 20-22, 1995, Proceedings},
      year={1995},
      editor={Franz{-}Josef Brandenburg},
      publisher={Springer},
      volume={1027},
      series={Lecture Notes in Computer Science},
      pages={52--63},
      doi={10.1007/BFb0021790},
      url={http://dx.doi.org/10.1007/BFb0021790}
    }
    
  154. Optimal algorithms to embed trees in a point set


    Bose, P., McAllister, M., and Snoeyink, J.
    In Graph Drawing, Symposium on Graph Drawing, GD ’95, Passau, Germany, September 20-22, 1995, Proceedings, pages 64–75, 1995.
    @inproceedings{DBLP:conf/gd/BoseMS95,
      author={Prosenjit Bose and Michael McAllister and Jack Snoeyink},
      title={Optimal Algorithms to Embed Trees in a Point Set},
      booktitle={Graph Drawing, Symposium on Graph Drawing, {GD} '95, Passau, Germany, September 20-22, 1995, Proceedings},
      year={1995},
      editor={Franz{-}Josef Brandenburg},
      publisher={Springer},
      volume={1027},
      series={Lecture Notes in Computer Science},
      pages={64--75},
      doi={10.1007/BFb0021791},
      url={http://dx.doi.org/10.1007/BFb0021791}
    }
    
  155. No quadrangulation is extremely odd


    Bose, P. and Toussaint, G. T.
    In Algorithms and Computation, 6th International Symposium, ISAAC ’95, Cairns, Australia, December 4-6, 1995, Proceedings, pages 372–381, 1995.
    @inproceedings{DBLP:conf/isaac/BoseT95,
      author={Prosenjit Bose and Godfried T. Toussaint},
      title={No Quadrangulation is Extremely Odd},
      booktitle={Algorithms and Computation, 6th International Symposium, {ISAAC} '95, Cairns, Australia, December 4-6, 1995, Proceedings},
      year={1995},
      editor={John Staples and Peter Eades and Naoki Katoh and Alistair Moffat},
      publisher={Springer},
      volume={1004},
      series={Lecture Notes in Computer Science},
      pages={372--381},
      doi={10.1007/BFb0015443},
      url={http://dx.doi.org/10.1007/BFb0015443}
    }
    
  156. All convex polyhedra can be clamped with parallel jaw grippers


    Bose, P., Bremner, D., and Toussaint, G. T.
    In Proceedings of the 6th Canadian Conference on Computational Geometry, Saskatoon, SK, Canada, August 1994, pages 344–349, 1994.
    @inproceedings{DBLP:conf/cccg/BoseBT94,
      author={Prosenjit Bose and David Bremner and Godfried T. Toussaint},
      title={All Convex Polyhedra can be Clamped with Parallel Jaw Grippers},
      booktitle={Proceedings of the 6th Canadian Conference on Computational Geometry, Saskatoon, SK, Canada, August 1994},
      year={1994},
      publisher={University of Saskatchewan},
      pages={344--349}
    }
    
  157. K-guarding polygons on the plane


    Belleville, P., Bose, P., Czyzowicz, J., Urrutia, J., and Zaks, J.
    In Proceedings of the 6th Canadian Conference on Computational Geometry, Saskatoon, SK, Canada, August 1994, pages 381–386, 1994.
    @inproceedings{DBLP:conf/cccg/BellevilleBCUZ94,
      author={Patrice Belleville and Prosenjit Bose and Jurek Czyzowicz and Jorge Urrutia and Joseph Zaks},
      title={K-Guarding Polygons on the Plane},
      booktitle={Proceedings of the 6th Canadian Conference on Computational Geometry, Saskatoon, SK, Canada, August 1994},
      year={1994},
      publisher={University of Saskatchewan},
      pages={381--386}
    }
    
  158. Determining the castability of simple polyhedra


    Bose, P., Bremner, D., and van Kreveld, M. J.
    In Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, USA, June 6-8, 1994, pages 123–131, 1994.
    @inproceedings{DBLP:conf/compgeom/BoseBK94,
      author={Prosenjit Bose and David Bremner and Marc J. van Kreveld},
      title={Determining the Castability of Simple Polyhedra},
      booktitle={Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, USA, June 6-8, 1994},
      year={1994},
      editor={Kurt Mehlhorn},
      publisher={{ACM}},
      pages={123--131},
      doi={10.1145/177424.177576},
      url={http://doi.acm.org/10.1145/177424.177576}
    }
    
  159. Proximity constraints and representable trees


    Bose, P., Battista, G. D., Lenhart, W., and Liotta, G.
    In Graph Drawing, DIMACS International Workshop, GD ’94, Princeton, New Jersey, USA, October 10-12, 1994, Proceedings, pages 340–351, 1994.
    @inproceedings{DBLP:conf/gd/BoseBLL94,
      author={Prosenjit Bose and Giuseppe Di Battista and William Lenhart and Giuseppe Liotta},
      title={Proximity Constraints and Representable Trees},
      booktitle={Graph Drawing, {DIMACS} International Workshop, {GD} '94, Princeton, New Jersey, USA, October 10-12, 1994, Proceedings},
      year={1994},
      editor={Roberto Tamassia and Ioannis G. Tollis},
      publisher={Springer},
      volume={894},
      series={Lecture Notes in Computer Science},
      pages={340--351},
      doi={10.1007/3-540-58950-3_389},
      url={http://dx.doi.org/10.1007/3-540-58950-3_389}
    }
    
  160. Every set of disjoint line segments admits a binary tree


    Bose, P., Houle, M. E., and Toussaint, G. T.
    In Algorithms and Computation, 5th International Symposium, ISAAC ’94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pages 20–28, 1994.
    @inproceedings{DBLP:conf/isaac/BoseHT94,
      author={Prosenjit Bose and Michael E. Houle and Godfried T. Toussaint},
      title={Every Set of Disjoint Line Segments Admits a Binary Tree},
      booktitle={Algorithms and Computation, 5th International Symposium, {ISAAC} '94, Beijing, P. R. China, August 25-27, 1994, Proceedings},
      year={1994},
      editor={Ding{-}Zhu Du and Xiang{-}Sun Zhang},
      publisher={Springer},
      volume={834},
      series={Lecture Notes in Computer Science},
      pages={20--28},
      doi={10.1007/3-540-58325-4_162},
      url={http://dx.doi.org/10.1007/3-540-58325-4_162}
    }
    
  161. The floodlight problem


    Bose, P., Guibas, L. J., Lubiw, A., Overmars, M. H., Souvaine, D. L., and Urrutia, J.
    In Proceedings of the 5th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, August 1993, pages 399–404, 1993.
    @inproceedings{DBLP:conf/cccg/BoseGLOSU93,
      author={Prosenjit Bose and Leonidas J. Guibas and Anna Lubiw and Mark H. Overmars and Diane L. Souvaine and Jorge Urrutia},
      title={The Floodlight Problem},
      booktitle={Proceedings of the 5th Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada, August 1993},
      year={1993},
      publisher={University of Waterloo},
      pages={399--404}
    }
    
  162. Feasability of design in stereolithography


    Asberg, B., Blanco, G., Bose, P., Garcia-Lopez, J., Overmars, M. H., Toussaint, G. T., Wilfong, G. T., and Zhu, B.
    In Foundations of Software Technology and Theoretical Computer Science, 13th Conference, Bombay, India, December 15-17, 1993, Proceedings, pages 228–237, 1993.
    @inproceedings{DBLP:conf/fsttcs/AsbergBBGOTWZ93,
      author={Boudewijn Asberg and Gregoria Blanco and Prosenjit Bose and Jesus Garcia{-}Lopez and Mark H. Overmars and Godfried T. Toussaint and Gordon T. Wilfong and Binhai Zhu},
      title={Feasability of Design in Stereolithography},
      booktitle={Foundations of Software Technology and Theoretical Computer Science, 13th Conference, Bombay, India, December 15-17, 1993, Proceedings},
      year={1993},
      editor={R. K. Shyamasundar},
      publisher={Springer},
      volume={761},
      series={Lecture Notes in Computer Science},
      pages={228--237},
      doi={10.1007/3-540-57529-4_56},
      url={http://dx.doi.org/10.1007/3-540-57529-4_56}
    }
    
  163. Pattern matching for permutations


    Bose, P., Buss, J. F., and Lubiw, A.
    In Algorithms and Data Structures, Third Workshop, WADS ’93, Montréal, Canada, August 11-13, 1993, Proceedings, pages 200–209, 1993.
    @inproceedings{DBLP:conf/wads/BoseBL93,
      author={Prosenjit Bose and Jonathan F. Buss and Anna Lubiw},
      title={Pattern Matching for Permutations},
      booktitle={Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al, Canada, August 11-13, 1993, Proceedings},
      year={1993},
      editor={Frank K. H. A. Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Nicola Santoro and Sue Whitesides},
      publisher={Springer},
      volume={709},
      series={Lecture Notes in Computer Science},
      pages={200--209},
      doi={10.1007/3-540-57155-8_248},
      url={http://dx.doi.org/10.1007/3-540-57155-8_248}
    }
    
  164. Filling polyhedral molds


    Bose, P., van Kreveld, M. J., and Toussaint, G. T.
    In Algorithms and Data Structures, Third Workshop, WADS ’93, Montréal, Canada, August 11-13, 1993, Proceedings, pages 210–221, 1993.
    @inproceedings{DBLP:conf/wads/BoseKT93,
      author={Prosenjit Bose and Marc J. van Kreveld and Godfried T. Toussaint},
      title={Filling Polyhedral Molds},
      booktitle={Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al, Canada, August 11-13, 1993, Proceedings},
      year={1993},
      editor={Frank K. H. A. Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Nicola Santoro and Sue Whitesides},
      publisher={Springer},
      volume={709},
      series={Lecture Notes in Computer Science},
      pages={210--221},
      doi={10.1007/3-540-57155-8_249},
      url={http://dx.doi.org/10.1007/3-540-57155-8_249}
    }
    

Arxiv

  1. The price of order


    Bose, P., Morin, P., and van Renssen, A.
    CoRR, abs/1602.00399, 2016.
    @article{DBLP:journal/corr/BoseMR16,
      author={Prosenjit Bose and Pat Morin and Andr{\'{e}} van Renssen},
      title={The Price of Order},
      journal={CoRR},
      year={2016},
      volume={abs/1602.00399},
      url={http://arxiv.org/abs/1602.00399}
    }
    
  2. Constrained generalized delaunay graphs are plane spanners


    Bose, P., Carufel, J. D., and van Renssen, A.
    CoRR, abs/1602.07365, 2016.
    @article{DBLP:journal/corr/BoseCR16,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Andr{\'{e}} van Renssen},
      title={Constrained Generalized Delaunay Graphs Are Plane Spanners},
      journal={CoRR},
      year={2016},
      volume={abs/1602.07365},
      url={http://arxiv.org/abs/1602.07365}
    }
    
  3. Time-space trade-off for finding the k-visibility region of a point in a polygon


    Bahoo, Y., Banyassady, B., Bose, P., Durocher, S., and Mulzer, W.
    CoRR, abs/1603.02853, 2016.
    @article{DBLP:journal/corr/BahooBBDM16,
      author={Yeganeh Bahoo and Bahareh Banyassady and Prosenjit Bose and Stephane Durocher and Wolfgang Mulzer},
      title={Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon},
      journal={CoRR},
      year={2016},
      volume={abs/1603.02853},
      url={http://arxiv.org/abs/1603.02853}
    }
    
  4. Algorithms for sensor systems - 11th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2015, patras, greece, september 17-18, 2015, revised selected papers


    Bose, P., Gasieniec, L. A., Römer, K., and Wattenhofer, R., editors.
    Volume 9536 of Lecture Notes in Computer Science. Springer, 2015.
    @proceedings{DBLP:conf/algosensors/2015,
      editor={Prosenjit Bose and Leszek Antoni Gasieniec and Kay R{\"{o}}mer and Roger Wattenhofer},
      title={Algorithms for Sensor Systems - 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} 2015, Patras, Greece, September 17-18, 2015, Revised Selected Papers},
      year={2015},
      publisher={Springer},
      volume={9536},
      series={Lecture Notes in Computer Science},
      isbn={978-3-319-28471-2},
      doi={10.1007/978-3-319-28472-9},
      url={http://dx.doi.org/10.1007/978-3-319-28472-9}
    }
    
  5. A linear-time algorithm for the geodesic center of a simple polygon


    Ahn, H., Barba, L., Bose, P., Carufel, J. D., Korman, M., and Oh, E.
    CoRR, abs/1501.00561, 2015.
    @article{DBLP:journal/corr/AhnBBCKO15,
      author={Hee{-}Kap Ahn and Luis Barba and Prosenjit Bose and Jean{-}Lou De Carufel and Matias Korman and Eunjin Oh},
      title={A linear-time algorithm for the geodesic center of a simple polygon},
      journal={CoRR},
      year={2015},
      volume={abs/1501.00561},
      url={http://arxiv.org/abs/1501.00561}
    }
    
  6. Upper and lower bounds for competitive online routing on delaunay triangulations


    Bonichon, N., Bose, P., Carufel, J. D., Perkovic, L., and van Renssen, A.
    CoRR, abs/1501.01783, 2015.
    @article{DBLP:journal/corr/BonichonBCPR15,
      author={Nicolas Bonichon and Prosenjit Bose and Jean{-}Lou De Carufel and Ljubomir Perkovic and Andr{\'{e}} van Renssen},
      title={Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations},
      journal={CoRR},
      year={2015},
      volume={abs/1501.01783},
      url={http://arxiv.org/abs/1501.01783}
    }
    
  7. Packing plane perfect matchings into a point set


    Biniaz, A., Bose, P., Maheshwari, A., and Smid, M. H. M.
    CoRR, abs/1501.03686, 2015.
    @article{DBLP:journal/corr/BiniazBMS15,
      author={Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel H. M. Smid},
      title={Packing Plane Perfect Matchings into a Point Set},
      journal={CoRR},
      year={2015},
      volume={abs/1501.03686},
      url={http://arxiv.org/abs/1501.03686}
    }
    
  8. Probing convex polygons with a wedge


    Bose, P., Carufel, J. D., Shaikhet, A., and Smid, M. H. M.
    CoRR, abs/1506.02572, 2015.
    @article{DBLP:journal/corr/BoseCSS15,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Alina Shaikhet and Michiel H. M. Smid},
      title={Probing Convex Polygons with a Wedge},
      journal={CoRR},
      year={2015},
      volume={abs/1506.02572},
      url={http://arxiv.org/abs/1506.02572}
    }
    
  9. Improved spanning ratio for low degree plane spanners


    Bose, P., Hill, D., and Smid, M. H. M.
    CoRR, abs/1506.09061, 2015.
    @article{DBLP:journal/corr/BoseHS15,
      author={Prosenjit Bose and Darryl Hill and Michiel H. M. Smid},
      title={Improved Spanning Ratio for Low Degree Plane Spanners},
      journal={CoRR},
      year={2015},
      volume={abs/1506.09061},
      url={http://arxiv.org/abs/1506.09061}
    }
    
  10. The shadows of a cycle cannot all be paths


    Bose, P., Carufel, J. D., Dobbins, M. G., Kim, H., and Viglietta, G.
    CoRR, abs/1507.02355, 2015.
    @article{DBLP:journal/corr/BoseCDKV15,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Michael Gene Dobbins and Heuna Kim and Giovanni Viglietta},
      title={The Shadows of a Cycle Cannot All Be Paths},
      journal={CoRR},
      year={2015},
      volume={abs/1507.02355},
      url={http://arxiv.org/abs/1507.02355}
    }
    
  11. On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere


    Bose, P., Carmi, P., Damian, M., Carufel, J. D., Hill, D., Maheshwari, A., Liu, Y., and Smid, M. H. M.
    CoRR, abs/1507.06856, 2015.
    @article{DBLP:journal/corr/BoseCDCHMLS15,
      author={Prosenjit Bose and Paz Carmi and Mirela Damian and Jean{-}Lou De Carufel and Darryl Hill and Anil Maheshwari and Yuyang Liu and Michiel H. M. Smid},
      title={On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere},
      journal={CoRR},
      year={2015},
      volume={abs/1507.06856},
      url={http://arxiv.org/abs/1507.06856}
    }
    
  12. Flips in edge-labelled pseudo-triangulations


    Bose, P. and Verdonschot, S.
    CoRR, abs/1512.01485, 2015.
    @article{DBLP:journal/corr/BoseV15,
      author={Prosenjit Bose and Sander Verdonschot},
      title={Flips in Edge-Labelled Pseudo-Triangulations},
      journal={CoRR},
      year={2015},
      volume={abs/1512.01485},
      url={http://arxiv.org/abs/1512.01485}
    }
    
  13. Plane bichromatic trees of low degree


    Biniaz, A., Bose, P., Maheshwari, A., and Smid, M. H. M.
    CoRR, abs/1512.02730, 2015.
    @article{DBLP:journal/corr/BiniazBMS15a,
      author={Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel H. M. Smid},
      title={Plane Bichromatic Trees of Low Degree},
      journal={CoRR},
      year={2015},
      volume={abs/1512.02730},
      url={http://arxiv.org/abs/1512.02730}
    }
    
  14. Upper bounds on the spanning ratio of constrained theta-graphs


    Bose, P. and van Renssen, A.
    CoRR, abs/1401.2127, 2014.
    @article{DBLP:journal/corr/BoseR14,
      author={Prosenjit Bose and Andr{\'{e}} van Renssen},
      title={Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs},
      journal={CoRR},
      year={2014},
      volume={abs/1401.2127},
      url={http://arxiv.org/abs/1401.2127}
    }
    
  15. Towards tight bounds on theta-graphs


    Bose, P., Carufel, J. D., Morin, P., van Renssen, A., and Verdonschot, S.
    CoRR, abs/1404.6233, 2014.
    @article{DBLP:journal/corr/BoseCMRV14,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Pat Morin and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={Towards Tight Bounds on Theta-Graphs},
      journal={CoRR},
      year={2014},
      volume={abs/1404.6233},
      url={http://arxiv.org/abs/1404.6233}
    }
    
  16. Theta-3 is connected


    Aichholzer, O., Bae, S. W., Barba, L., Bose, P., Korman, M., van Renssen, A., Taslakian, P., and Verdonschot, S.
    CoRR, abs/1404.7186, 2014.
    @article{DBLP:journal/corr/AichholzerBBBKRTV14,
      author={Oswin Aichholzer and Sang Won Bae and Luis Barba and Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
      title={Theta-3 is connected},
      journal={CoRR},
      year={2014},
      volume={abs/1404.7186},
      url={http://arxiv.org/abs/1404.7186}
    }
    
  17. Continuous yao graphs


    Barba, L., Bose, P., Carufel, J. D., Damian, M., Fagerberg, R., van Renssen, A., Taslakian, P., and Verdonschot, S.
    CoRR, abs/1408.4099, 2014.
    @article{DBLP:journal/corr/BarbaBCDFRTV14,
      author={Luis Barba and Prosenjit Bose and Jean{-}Lou De Carufel and Mirela Damian and Rolf Fagerberg and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
      title={Continuous Yao Graphs},
      journal={CoRR},
      year={2014},
      volume={abs/1408.4099},
      url={http://arxiv.org/abs/1408.4099}
    }
    
  18. Towards a general framework for searching on a line and searching on \textdollarm$ rays


    Bose, P. and Carufel, J. D.
    CoRR, abs/1408.6812, 2014.
    @article{DBLP:journal/corr/BoseC14,
      author={Prosenjit Bose and Jean{-}Lou De Carufel},
      title={Towards a General Framework for Searching on a Line and Searching on {\textdollar}m{\textdollar} Rays},
      journal={CoRR},
      year={2014},
      volume={abs/1408.6812},
      url={http://arxiv.org/abs/1408.6812}
    }
    
  19. Optimal local routing on delaunay triangulations defined by empty equilateral triangles


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    CoRR, abs/1409.6397, 2014.
    @article{DBLP:journal/corr/BoseFRV14,
      author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={Optimal local routing on Delaunay triangulations defined by empty equilateral triangles},
      journal={CoRR},
      year={2014},
      volume={abs/1409.6397},
      url={http://arxiv.org/abs/1409.6397}
    }
    
  20. Optimal data structures for farthest-point queries in cactus networks


    Bose, P., Carufel, J. D., Grimm, C., Maheshwari, A., and Smid, M. H. M.
    CoRR, abs/1411.1879, 2014.
    @article{DBLP:journal/corr/BoseCGMS14,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Carsten Grimm and Anil Maheshwari and Michiel H. M. Smid},
      title={Optimal Data Structures for Farthest-Point Queries in Cactus Networks},
      journal={CoRR},
      year={2014},
      volume={abs/1411.1879},
      url={http://arxiv.org/abs/1411.1879}
    }
    
  21. Competitive local routing with constraints


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    CoRR, abs/1412.0760, 2014.
    @article{DBLP:journal/corr/BoseFRV14a,
      author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={Competitive Local Routing with Constraints},
      journal={CoRR},
      year={2014},
      volume={abs/1412.0760},
      url={http://arxiv.org/abs/1412.0760}
    }
    
  22. On the stretch factor of the theta-4 graph


    Barba, L., Bose, P., Carufel, J. D., van Renssen, A., and Verdonschot, S.
    CoRR, abs/1303.5473, 2013.
    @article{DBLP:journal/corr/abs-1303-5473,
      author={Luis Barba and Prosenjit Bose and Jean{-}Lou De Carufel and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={On the stretch factor of the Theta-4 graph},
      journal={CoRR},
      year={2013},
      volume={abs/1303.5473},
      url={http://arxiv.org/abs/1303.5473}
    }
    
  23. Network farthest-point diagrams


    Bose, P., Dannies, K., Carufel, J. D., Doell, C., Grimm, C., Maheshwari, A., Schirra, S., and Smid, M. H. M.
    CoRR, abs/1304.1909, 2013.
    @article{DBLP:journal/corr/abs-1304-1909,
      author={Prosenjit Bose and Kai Dannies and Jean{-}Lou De Carufel and Christoph Doell and Carsten Grimm and Anil Maheshwari and Stefan Schirra and Michiel H. M. Smid},
      title={Network Farthest-Point Diagrams},
      journal={CoRR},
      year={2013},
      volume={abs/1304.1909},
      url={http://arxiv.org/abs/1304.1909}
    }
    
  24. The power and limitations of static binary search trees with lazy finger


    Bose, P., Douïeb, K., Iacono, J., and Langerman, S.
    CoRR, abs/1304.6897, 2013.
    @article{DBLP:journal/corr/abs-1304-6897,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb and John Iacono and Stefan Langerman},
      title={The Power and Limitations of Static Binary Search Trees with Lazy Finger},
      journal={CoRR},
      year={2013},
      volume={abs/1304.6897},
      url={http://arxiv.org/abs/1304.6897}
    }
    
  25. New and improved spanning ratios for yao graphs


    Barba, L., Bose, P., Damian, M., Fagerberg, R., O’Rourke, J., van Renssen, A., Taslakian, P., and Verdonschot, S.
    CoRR, abs/1307.5829, 2013.
    @article{DBLP:journal/corr/BarbaBDFORTV13,
      author={Luis Barba and Prosenjit Bose and Mirela Damian and Rolf Fagerberg and Joseph O'Rourke and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
      title={New and Improved Spanning Ratios for Yao Graphs},
      journal={CoRR},
      year={2013},
      volume={abs/1307.5829},
      url={http://arxiv.org/abs/1307.5829}
    }
    
  26. Revisiting the problem of searching on a line


    Bose, P., Carufel, J. D., and Durocher, S.
    CoRR, abs/1310.1048, 2013.
    @article{DBLP:journal/corr/BoseCD13,
      author={Prosenjit Bose and Jean{-}Lou De Carufel and Stephane Durocher},
      title={Revisiting the Problem of Searching on a Line},
      journal={CoRR},
      year={2013},
      volume={abs/1310.1048},
      url={http://arxiv.org/abs/1310.1048}
    }
    
  27. Flipping edge-labelled triangulations


    Bose, P., Lubiw, A., Pathak, V., and Verdonschot, S.
    CoRR, abs/1310.1166, 2013.
    @article{DBLP:journal/corr/BoseLPV13,
      author={Prosenjit Bose and Anna Lubiw and Vinayak Pathak and Sander Verdonschot},
      title={Flipping Edge-Labelled Triangulations},
      journal={CoRR},
      year={2013},
      volume={abs/1310.1166},
      url={http://arxiv.org/abs/1310.1166}
    }
    
  28. Computing covers of plane forests


    Barba, L., Beingessner, A., Bose, P., and Smid, M. H. M.
    CoRR, abs/1311.4860, 2013.
    @article{DBLP:journal/corr/BarbaBBS13,
      author={Luis Barba and Alexis Beingessner and Prosenjit Bose and Michiel H. M. Smid},
      title={Computing Covers of Plane Forests},
      journal={CoRR},
      year={2013},
      volume={abs/1311.4860},
      url={http://arxiv.org/abs/1311.4860}
    }
    
  29. Robust geometric spanners


    Bose, P., Dujmovic, V., Morin, P., and Smid, M. H. M.
    CoRR, abs/1204.4679, 2012.
    @article{DBLP:journal/corr/abs-1204-4679,
      author={Prosenjit Bose and Vida Dujmovic and Pat Morin and Michiel H. M. Smid},
      title={Robust Geometric Spanners},
      journal={CoRR},
      year={2012},
      volume={abs/1204.4679},
      url={http://arxiv.org/abs/1204.4679}
    }
    
  30. Coloring and guarding arrangements


    Bose, P., Cardinal, J., Collette, S., Hurtado, F., Korman, M., Langerman, S., and Taslakian, P.
    CoRR, abs/1205.5162, 2012.
    @article{DBLP:journal/corr/abs-1205-5162,
      author={Prosenjit Bose and Jean Cardinal and S{\'{e}}bastien Collette and Ferran Hurtado and Matias Korman and Stefan Langerman and Perouz Taslakian},
      title={Coloring and Guarding Arrangements},
      journal={CoRR},
      year={2012},
      volume={abs/1205.5162},
      url={http://arxiv.org/abs/1205.5162}
    }
    
  31. A history of flips in combinatorial triangulations


    Bose, P. and Verdonschot, S.
    CoRR, abs/1206.0303, 2012.
    @article{DBLP:journal/corr/abs-1206-0303,
      author={Prosenjit Bose and Sander Verdonschot},
      title={A History of Flips in Combinatorial Triangulations},
      journal={CoRR},
      year={2012},
      volume={abs/1206.0303},
      url={http://arxiv.org/abs/1206.0303}
    }
    
  32. Visibility-monotonic polygon deflation


    Bose, P., Dujmovic, V., Hoda, N., and Morin, P.
    CoRR, abs/1206.1982, 2012.
    @article{DBLP:journal/corr/abs-1206-1982,
      author={Prosenjit Bose and Vida Dujmovic and Nima Hoda and Pat Morin},
      title={Visibility-Monotonic Polygon Deflation},
      journal={CoRR},
      year={2012},
      volume={abs/1206.1982},
      url={http://arxiv.org/abs/1206.1982}
    }
    
  33. The theta-5-graph is a spanner


    Bose, P., Morin, P., van Renssen, A., and Verdonschot, S.
    CoRR, abs/1212.0570, 2012.
    @article{DBLP:journal/corr/abs-1212-0570,
      author={Prosenjit Bose and Pat Morin and Andr{\'{e}} van Renssen and Sander Verdonschot},
      title={The theta-5-graph is a spanner},
      journal={CoRR},
      year={2012},
      volume={abs/1212.0570},
      url={http://arxiv.org/abs/1212.0570}
    }
    
  34. Automatically creating design models from 3d anthropometry data


    Wuhrer, S., Shu, C., and Bose, P.
    CoRR, abs/1108.4572, 2011.
    @article{DBLP:journal/corr/abs-1108-4572,
      author={Stefanie Wuhrer and Chang Shu and Prosenjit Bose},
      title={Automatically Creating Design Models from 3D Anthropometry Data},
      journal={CoRR},
      year={2011},
      volume={abs/1108.4572},
      url={http://arxiv.org/abs/1108.4572}
    }
    
  35. Making triangulations 4-connected using flips


    Bose, P., Jansens, D., van Renssen, A., Saumell, M., and Verdonschot, S.
    CoRR, abs/1110.6473, 2011.
    @article{DBLP:journal/corr/abs-1110-6473,
      author={Prosenjit Bose and Dana Jansens and Andr{\'{e}} van Renssen and Maria Saumell and Sander Verdonschot},
      title={Making triangulations 4-connected using flips},
      journal={CoRR},
      year={2011},
      volume={abs/1110.6473},
      url={http://arxiv.org/abs/1110.6473}
    }
    
  36. De-amortizing binary search trees


    Bose, P., Collette, S., Fagerberg, R., and Langerman, S.
    CoRR, abs/1111.1665, 2011.
    @article{DBLP:journal/corr/abs-1111-1665,
      author={Prosenjit Bose and S{\'{e}}bastien Collette and Rolf Fagerberg and Stefan Langerman},
      title={De-amortizing Binary Search Trees},
      journal={CoRR},
      year={2011},
      volume={abs/1111.1665},
      url={http://arxiv.org/abs/1111.1665}
    }
    
  37. Point location in disconnected planar subdivisions


    Bose, P., Devroye, L., Douïeb, K., Dujmovic, V., King, J., and Morin, P.
    CoRR, abs/1001.2763, 2010.
    @article{DBLP:journal/corr/abs-1001-2763,
      author={Prosenjit Bose and Luc Devroye and Karim Dou{\"{\i}}eb and Vida Dujmovic and James King and Pat Morin},
      title={Point Location in Disconnected Planar Subdivisions},
      journal={CoRR},
      year={2010},
      volume={abs/1001.2763},
      url={http://arxiv.org/abs/1001.2763}
    }
    
  38. Pi/2-angle yao graphs are spanners


    Bose, P., Damian, M., Douïeb, K., O’Rourke, J., Seamone, B., Smid, M. H. M., and Wuhrer, S.
    CoRR, abs/1001.2913, 2010.
    @article{DBLP:journal/corr/abs-1001-2913,
      author={Prosenjit Bose and Mirela Damian and Karim Dou{\"{\i}}eb and Joseph O'Rourke and Ben Seamone and Michiel H. M. Smid and Stefanie Wuhrer},
      title={Pi/2-Angle Yao Graphs are Spanners},
      journal={CoRR},
      year={2010},
      volume={abs/1001.2913},
      url={http://arxiv.org/abs/1001.2913}
    }
    
  39. Odds-on trees


    Bose, P., Devroye, L., Douïeb, K., Dujmovic, V., King, J., and Morin, P.
    CoRR, abs/1002.1092, 2010.
    @article{DBLP:journal/corr/abs-1002-1092,
      author={Prosenjit Bose and Luc Devroye and Karim Dou{\"{\i}}eb and Vida Dujmovic and James King and Pat Morin},
      title={Odds-On Trees},
      journal={CoRR},
      year={2010},
      volume={abs/1002.1092},
      url={http://arxiv.org/abs/1002.1092}
    }
    
  40. An o(loglog n)-competitive binary search tree with optimal worst-case access times


    Bose, P., Douïeb, K., Dujmovic, V., and Fagerberg, R.
    CoRR, abs/1003.0139, 2010.
    @article{DBLP:journal/corr/abs-1003-0139,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Vida Dujmovic and Rolf Fagerberg},
      title={An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times},
      journal={CoRR},
      year={2010},
      volume={abs/1003.0139},
      url={http://arxiv.org/abs/1003.0139}
    }
    
  41. The dilation of the delaunay triangulation is greater than \(\pi\)/2


    Bose, P., Devroye, L., Löffler, M., Snoeyink, J., and Verma, V.
    CoRR, abs/1006.0291, 2010.
    @article{DBLP:journal/corr/abs-1006-0291,
      author={Prosenjit Bose and Luc Devroye and Maarten L{\"{o}}ffler and Jack Snoeyink and Vishal Verma},
      title={The dilation of the Delaunay triangulation is greater than {\(\pi\)}/2},
      journal={CoRR},
      year={2010},
      volume={abs/1006.0291},
      url={http://arxiv.org/abs/1006.0291}
    }
    
  42. Should static search trees ever be unbalanced?


    Bose, P. and Douïeb, K.
    CoRR, abs/1006.3715, 2010.
    @article{DBLP:journal/corr/abs-1006-3715,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb},
      title={Should Static Search Trees Ever Be Unbalanced?},
      journal={CoRR},
      year={2010},
      volume={abs/1006.3715},
      url={http://arxiv.org/abs/1006.3715}
    }
    
  43. Minimum enclosing area triangle with a fixed angle


    Bose, P. and Carufel, J. D.
    CoRR, abs/1009.3006, 2010.
    @article{DBLP:journal/corr/abs-1009-3006,
      author={Prosenjit Bose and Jean{-}Lou De Carufel},
      title={Minimum Enclosing Area Triangle with a Fixed Angle},
      journal={CoRR},
      year={2010},
      volume={abs/1009.3006},
      url={http://arxiv.org/abs/1009.3006}
    }
    
  44. Improved methods for generating quasi-gray codes


    Jansens, D., Bose, P., Carmi, P., Maheshwari, A., Morin, P., and Smid, M. H. M.
    CoRR, abs/1010.0905, 2010.
    @article{DBLP:journal/corr/abs-1010-0905,
      author={Dana Jansens and Prosenjit Bose and Paz Carmi and Anil Maheshwari and Pat Morin and Michiel H. M. Smid},
      title={Improved Methods For Generating Quasi-Gray Codes},
      journal={CoRR},
      year={2010},
      volume={abs/1010.0905},
      url={http://arxiv.org/abs/1010.0905}
    }
    
  45. Layered working-set trees


    Bose, P., Douïeb, K., Dujmovic, V., and Howat, J.
    CoRR, abs/0907.2071, 2009.
    @article{DBLP:journal/corr/abs-0907-2071,
      author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Vida Dujmovic and John Howat},
      title={Layered Working-Set Trees},
      journal={CoRR},
      year={2009},
      volume={abs/0907.2071},
      url={http://arxiv.org/abs/0907.2071}
    }
    
  46. Spanners of additively weighted point sets


    Bose, P., Carmi, P., and Couture, M.
    CoRR, abs/0801.4013, 2008.
    @article{DBLP:journal/corr/abs-0801-4013,
      author={Prosenjit Bose and Paz Carmi and Mathieu Couture},
      title={Spanners of Additively Weighted Point Sets},
      journal={CoRR},
      year={2008},
      volume={abs/0801.4013},
      url={http://arxiv.org/abs/0801.4013}
    }
    
  47. On the stretch factor of convex delaunay graphs


    Bose, P., Carmi, P., Collette, S., and Smid, M. H. M.
    CoRR, abs/0804.1041, 2008.
    @article{DBLP:journal/corr/abs-0804-1041,
      author={Prosenjit Bose and Paz Carmi and S{\'{e}}bastien Collette and Michiel H. M. Smid},
      title={On the Stretch Factor of Convex Delaunay Graphs},
      journal={CoRR},
      year={2008},
      volume={abs/0804.1041},
      url={http://arxiv.org/abs/0804.1041}
    }
    
  48. Morphing of triangular meshes in shape space


    Wuhrer, S., Bose, P., Shu, C., O’Rourke, J., and Brunton, A.
    CoRR, abs/0805.0162, 2008.
    @article{DBLP:journal/corr/abs-0805-0162,
      author={Stefanie Wuhrer and Prosenjit Bose and Chang Shu and Joseph O'Rourke and Alan Brunton},
      title={Morphing of Triangular Meshes in Shape Space},
      journal={CoRR},
      year={2008},
      volume={abs/0805.0162},
      url={http://arxiv.org/abs/0805.0162}
    }
    
  49. Succinct geometric indexes supporting point location queries


    Bose, P., Chen, E. Y., He, M., Maheshwari, A., and Morin, P.
    CoRR, abs/0805.4147, 2008.
    @article{DBLP:journal/corr/abs-0805-4147,
      author={Prosenjit Bose and Eric Y. Chen and Meng He and Anil Maheshwari and Pat Morin},
      title={Succinct Geometric Indexes Supporting Point Location Queries},
      journal={CoRR},
      year={2008},
      volume={abs/0805.4147},
      url={http://arxiv.org/abs/0805.4147}
    }
    
  50. Communication-efficient construction of the plane localized delaunay graph


    Bose, P., Carmi, P., Smid, M. H. M., and Xu, D.
    CoRR, abs/0809.2956, 2008.
    @article{DBLP:journal/corr/abs-0809-2956,
      author={Prosenjit Bose and Paz Carmi and Michiel H. M. Smid and Daming Xu},
      title={Communication-Efficient Construction of the Plane Localized Delaunay Graph},
      journal={CoRR},
      year={2008},
      volume={abs/0809.2956},
      url={http://arxiv.org/abs/0809.2956}
    }
    
  51. Proceedings of the 19th annual canadian conference on computational geometry, CCCG 2007, august 20-22, 2007, carleton university, ottawa, canada


    Bose, P., editor.
    Carleton University, Ottawa, Canada, 2007.
    @proceedings{DBLP:conf/cccg/2007,
      editor={Prosenjit Bose},
      title={Proceedings of the 19th Annual Canadian Conference on Computational Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa, Canada},
      year={2007},
      publisher={Carleton University, Ottawa, Canada},
      isbn={978-0-7709-0520-0}
    }
    
  52. A polynomial bound for untangling geometric planar graphs


    Bose, P., Dujmovic, V., Hurtado, F., Langerman, S., Morin, P., and Wood, D. R.
    CoRR, abs/0710.1641, 2007.
    @article{DBLP:journal/corr/abs-0710-1641,
      author={Prosenjit Bose and Vida Dujmovic and Ferran Hurtado and Stefan Langerman and Pat Morin and David R. Wood},
      title={A polynomial bound for untangling geometric planar graphs},
      journal={CoRR},
      year={2007},
      volume={abs/0710.1641},
      url={http://arxiv.org/abs/0710.1641}
    }
    
  53. Geometric spanners with small chromatic number


    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Smid, M. H. M., and Zeh, N.
    CoRR, abs/0711.0114, 2007.
    @article{DBLP:journal/corr/abs-0711-0114,
      author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Anil Maheshwari and Michiel H. M. Smid and Norbert Zeh},
      title={Geometric Spanners With Small Chromatic Number},
      journal={CoRR},
      year={2007},
      volume={abs/0711.0114},
      url={http://arxiv.org/abs/0711.0114}
    }
    
  54. Spanners of complete \textdollark\textdollar-partite geometric graphs


    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Morin, P., and Smid, M. H. M.
    CoRR, abs/0712.0554, 2007.
    @article{DBLP:journal/corr/abs-0712-0554,
      author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Anil Maheshwari and Pat Morin and Michiel H. M. Smid},
      title={Spanners of Complete {\textdollar}k{\textdollar}-Partite Geometric Graphs},
      journal={CoRR},
      year={2007},
      volume={abs/0712.0554},
      url={http://arxiv.org/abs/0712.0554}
    }
    
  55. On a family of strong geometric spanners that admit local routing strategies


    Bose, P., Carmi, P., Couture, M., Smid, M. H. M., and Xu, D.
    CoRR, abs/cs/0702117, 2007.
    @article{DBLP:journal/corr/abs-cs-0702117,
      author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Michiel H. M. Smid and Daming Xu},
      title={On a family of strong geometric spanners that admit local routing strategies},
      journal={CoRR},
      year={2007},
      volume={abs/cs/0702117},
      url={http://arxiv.org/abs/cs/0702117}
    }
    
  56. A characterization of the degree sequences of 2-trees


    Bose, P., Dujmovic, V., Krizanc, D., Langerman, S., Morin, P., Wood, D. R., and Wuhrer, S.
    CoRR, abs/cs/0605011, 2006.
    @article{DBLP:journal/corr/abs-cs-0605011,
      author={Prosenjit Bose and Vida Dujmovic and Danny Krizanc and Stefan Langerman and Pat Morin and David R. Wood and Stefanie Wuhrer},
      title={A Characterization of the Degree Sequences of 2-Trees},
      journal={CoRR},
      year={2006},
      volume={abs/cs/0605011},
      url={http://arxiv.org/abs/cs/0605011}
    }
    
  57. Data structures for halfplane proximity queries and incremental voronoi diagrams


    Aronov, B., Bose, P., Demaine, E. D., Gudmundsson, J., Iacono, J., Langerman, S., and Smid, M. H. M.
    CoRR, abs/cs/0512091, 2005.
    @article{DBLP:journal/corr/abs-cs-0512091,
      author={Boris Aronov and Prosenjit Bose and Erik D. Demaine and Joachim Gudmundsson and John Iacono and Stefan Langerman and Michiel H. M. Smid},
      title={Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams},
      journal={CoRR},
      year={2005},
      volume={abs/cs/0512091},
      url={http://arxiv.org/abs/cs/0512091}
    }
    
  58. Simultaneous diagonal flips in plane triangulations


    Bose, P., Czyzowicz, J., Gao, Z., Morin, P., and Wood, D. R.
    CoRR, abs/math/0509478, 2005.
    @article{DBLP:journal/corr/abs-math-0509478,
      author={Prosenjit Bose and Jurek Czyzowicz and Zhicheng Gao and Pat Morin and David R. Wood},
      title={Simultaneous Diagonal Flips in Plane Triangulations},
      journal={CoRR},
      year={2005},
      volume={abs/math/0509478},
      url={http://arxiv.org/abs/math/0509478}
    }
    
  59. Algorithms and computation, 13th international symposium, ISAAC 2002 vancouver, bc, canada, november 21-23, 2002, proceedings


    Bose, P. and Morin, P., editors.
    Volume 2518 of Lecture Notes in Computer Science. Springer, 2002.
    @proceedings{DBLP:conf/isaac/2002,
      editor={Prosenjit Bose and Pat Morin},
      title={Algorithms and Computation, 13th International Symposium, {ISAAC} 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
      year={2002},
      publisher={Springer},
      volume={2518},
      series={Lecture Notes in Computer Science},
      isbn={3-540-00142-5}
    }
    

Generated by Publy 0.9.  Last modified on 24 June 2016.