Publications

The θ\(_\mbox5\)-graph is a spanner

Bose, P., Morin, P., van Renssen, A., and Verdonschot, S.
Comput. Geom., 48(2):108–119, 2015.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Minimum-area enclosing triangle with a fixed angle

Bose, P. and Carufel, J. D.
Comput. Geom., 47(1):90–109, 2014.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Some properties of k-delaunay and k-gabriel graphs

Bose, P., Collette, S., Hurtado, F., Korman, M., Langerman, S., Sacristan, V., and Saumell, M.
Comput. Geom., 46(2):131–139, 2013.

DOI URL

@article{DBLP:journals/comgeo/BoseCHKLSS13,
  author={Prosenjit Bose and S{\'{e}}bastien Collette and Ferran Hurtado and Matias Korman and Stefan Langerman and Vera Sacristan 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}
}

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.

DOI URL

@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}
}

On plane geometric spanners: A survey and open problems

Bose, P. and Smid, M. H. M.
Comput. Geom., 46(7):818–830, 2013.

DOI URL

@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}
}

Bounding the locality of distributed routing algorithms

Bose, P., Carmi, P., and Durocher, S.
Distributed Computing, 26(1):39–58, 2013.

DOI URL

@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}
}

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.

URL

@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}
}

Coverage with k-transmitters in the presence of obstacles

DOI URL

@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}
}

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.

URL

@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}
}

Robust geometric spanners

Bose, P., Dujmovic, V., Morin, P., and Smid, M. H. M.
SIAM J. Comput., 42(4):1720–1736, 2013.

DOI URL

@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}
}

Layered working-set trees

Bose, P., Douïeb, K., Dujmovic, V., and Howat, J.
Algorithmica, 63(1-2):476–489, 2012.

DOI URL

@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}
}

Editorial

Bose, P. and Carmi, P.
Comput. Geom., 45(9):475, 2012.

DOI URL

@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}
}

\(\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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

A distribution-sensitive dictionary with low space overhead

Bose, P., Howat, J., and Morin, P.
J. Discrete Algorithms, 10:140–145, 2012.

DOI URL

@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}
}

Skip lift: A probabilistic alternative to red-black trees

Bose, P., Douïeb, K., and Morin, P.
J. Discrete Algorithms, 14:13–20, 2012.

DOI URL

@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}
}

On bounded degree plane strong geometric spanners

Bose, P., Carmi, P., and Chaitman-Yerushalmi, L.
J. Discrete Algorithms, 15:16–31, 2012.

DOI URL

@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}
}

Succinct geometric indexes supporting point location queries

Bose, P., Chen, E. Y., He, M., Maheshwari, A., and Morin, P.
ACM Transactions on Algorithms, 8(2):10, 2012.

DOI URL

@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} Transactions on Algorithms},
  year={2012},
  volume={8},
  number={2},
  pages={10},
  doi={10.1145/2151171.2151173},
  url={http://doi.acm.org/10.1145/2151171.2151173}
}

Location-oblivious distributed unit disk graph coloring

Barbeau, M., Bose, P., Carmi, P., Couture, M., and Kranakis, E.
Algorithmica, 60(2):236–249, 2011.

DOI URL

@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}
}

A note on the perimeter of fat objects

Bose, P., Cheong, O., and Dujmovic, V.
Comput. Geom., 44(1):1–8, 2011.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

A survey of geodesic paths on 3d surfaces

Bose, P., Maheshwari, A., Shu, C., and Wuhrer, S.
Comput. Geom., 44(9):486–498, 2011.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Spanners of additively weighted point sets

Bose, P., Carmi, P., and Couture, M.
J. Discrete Algorithms, 9(3):287–298, 2011.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

URL

@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}
}

Clamshell casting

Bose, P., Morin, P., Smid, M. H. M., and Wuhrer, S.
Algorithmica, 55(4):666–702, 2009.

DOI URL

@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}
}

Flips in planar graphs

Bose, P. and Hurtado, F.
Comput. Geom., 42(1):60–80, 2009.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Editorial CCCG 2005

Bose, P. and Mukhopadhyay, A.
Comput. Geom., 42(5):363, 2009.

DOI URL

@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}
}

Rotationally monotone polygons

Bose, P., Morin, P., Smid, M. H. M., and Wuhrer, S.
Comput. Geom., 42(5):471–483, 2009.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

A note on the lower bound of edge guards of polyhedral terrains

Bose, P.
Int. J. Comput. Math., 86(4):577–583, 2009.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Augmented reality on cloth with realistic illumination

Bradley, D., Roth, G., and Bose, P.
Mach. Vis. Appl., 20(2):85–92, 2009.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

URL

@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}
}

Editorial

Bose, P. and Fevens, T.
Comput. Geom., 39(1):1, 2008.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Reconfiguring triangulations with edge flips and point moves

Aloupis, G., Bose, P., and Morin, P.
Algorithmica, 47(4):367–378, 2007.

DOI URL

@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}
}

On the stabbing number of a random delaunay triangulation

Bose, P. and Devroye, L.
Comput. Geom., 36(2):89–105, 2007.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Induced subgraphs of bounded degree and bounded treewidth

Bose, P., Dujmovic, V., and Wood, D. R.
Contributions to Discrete Mathematics, 1(1), 2006.

URL

@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}
}

Equitable subdivisions within polygonal regions

Bereg, S., Bose, P., and Kirkpatrick, D. G.
Comput. Geom., 34(1):20–27, 2006.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Guest editors’ foreword

Bose, P. and Morin, P.
Algorithmica, 42(1):1–2, 2005.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

On simplifying dot maps

de Berg, M., Bose, P., Cheong, O., and Morin, P.
Comput. Geom., 27(1):43–62, 2004.

DOI URL

@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}
}

Ordered theta graphs

Bose, P., Gudmundsson, J., and Morin, P.
Comput. Geom., 28(1):11–18, 2004.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Light edges in degree-constrained graphs

Bose, P., Smid, M. H. M., and Wood, D. R.
Discrete Mathematics, 282(1-3):35–41, 2004.

DOI URL

@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}
}

Packing two disks into a polygonal environment

Bose, P., Morin, P., and Vigneron, A.
J. Discrete Algorithms, 2(3):373–380, 2004.

DOI URL

@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}
}

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.

URL

@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}
}

Online routing in triangulations

Bose, P. and Morin, P.
SIAM J. Comput., 33(4):937–951, 2004.

DOI URL

@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}
}

Competitive online routing in geometric graphs

Bose, P. and Morin, P.
Theor. Comput. Sci., 324(2-3):273–288, 2004.

DOI URL

@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}
}

Testing the quality of manufactured disks and balls

Bose, P. and Morin, P.
Algorithmica, 38(1):161–177, 2003.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Properties of arrangement graphs

Bose, P., Everett, H., and Wismath, S. K.
Int. J. Comput. Geometry Appl., 13(6):447–462, 2003.

DOI URL

@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}
}

Asymmetric communication protocols via hotlink assignments

Bose, P., Krizanc, D., Langerman, S., and Morin, P.
Theory Comput. Syst., 36(6):655–661, 2003.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

On embedding an outer-planar graph in a point set

Bose, P.
Comput. Geom., 23(3):303–312, 2002.

DOI URL

@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}
}

Efficient visibility queries in simple polygons

Bose, P., Lubiw, A., and Munro, J. I.
Comput. Geom., 23(3):313–335, 2002.

DOI URL

@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}
}

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.

DOI URL

@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}
}

An improved algorithm for subdivision traversal without extra storage

Bose, P. and Morin, P.
Int. J. Comput. Geometry Appl., 12(4):297–308, 2002.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Finding specified sections of arrangements: 2d results

Bose, P., Hurtado, F., Meijer, H., Ramaswami, S., Rappaport, D., Sacristan, V., Shermer, T. C., and Toussaint, G. T.
J. Math. Model. Algorithms, 1(1):3–16, 2002.

DOI URL

@article{DBLP:journals/jmma/BoseHMRRSST02,
  author={Prosenjit Bose and Ferran Hurtado and Henk Meijer and Suneeta Ramaswami and David Rappaport and Vera Sacristan 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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Filling polyhedral molds

Bose, P., van Kreveld, M. J., and Toussaint, G. T.
Computer-Aided Design, 30(4):245–254, 1998.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Intersections with random geometric objects

Bose, P. and Devroye, L.
Comput. Geom., 10(3):139–154, 1998.

DOI URL

@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}
}

Pattern matching for permutations

Bose, P., Buss, J. F., and Lubiw, A.
Inf. Process. Lett., 65(5):277–283, 1998.

DOI URL

@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}
}

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.

URL

@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}
}

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.

DOI URL

@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}
}

Determining the castability of simple polyhedra

Bose, P., Bremner, D., and van Kreveld, M. J.
Algorithmica, 19(1/2):84–113, 1997.

DOI URL

@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}
}

Characterizing and efficiently computing quadrangulations of planar point sets

Bose, P. and Toussaint, G. T.
Computer Aided Geometric Design, 14(8):763–785, 1997.

DOI URL

@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}
}

Guarding polyhedral terrains

Bose, P., Shermer, T. C., Toussaint, G. T., and Zhu, B.
Comput. Geom., 7:173–185, 1997.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Optimal algorithms to embed trees in a point set

Bose, P., McAllister, M., and Snoeyink, J.
J. Graph Algorithms Appl., 1, 1997.

URL

@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}
}

Characterizing proximity trees

Bose, P., Lenhart, W., and Liotta, G.
Algorithmica, 16(1):83–110, 1996.

DOI URL

@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}
}

All convex polyhedra can be clamped with parallel jaw grippers

Bose, P., Bremner, D., and Toussaint, G. T.
Comput. Geom., 6:291–302, 1996.

DOI URL

@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}
}

Geometric and computational aspects of gravity casting

Bose, P. and Toussaint, G. T.
Computer-Aided Design, 27(6):455–464, 1995.

DOI URL

@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}
}

Growing a tree from its branches

Bose, P. and Toussaint, G. T.
J. Algorithms, 19(1):86–103, 1995.

DOI URL

@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}
}

Geometric and computational aspects of manufacturing processes

Bose, P. and Toussaint, G. T.
Computers & Graphics, 18(4):487–497, 1994.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

Flips

Bose, P.
In Graph Drawing - 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers, page 1, 2012.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Some properties of higher order delaunay and gabriel graphs

Bose, P., Collette, S., Hurtado, F., Korman, M., Langerman, S., Sacristan, 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.

URL

@inproceedings{DBLP:conf/cccg/BoseCHKLSS10,
  author={Prosenjit Bose and S{\'{e}}bastien Collette and Ferran Hurtado and Matias Korman and Stefan Langerman and Vera Sacristan 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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Global context descriptors for SURF and MSER feature descriptors

Carmichael, G., Laganière, R., and Bose, P.
In CRV 2010, Canadian Conference on Computer and Robot Vision, Ottawa, Ontario, Canada, May 31 2010 - June 2, 2010, pages 309–316, 2010.

DOI URL

@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={{CRV} 2010, Canadian Conference on Computer and Robot Vision, Ottawa, Ontario, Canada, May 31 2010 - June 2, 2010},
  year={2010},
  publisher={{IEEE}},
  pages={309--316},
  doi={10.1109/CRV.2010.47},
  url={http://doi.ieeecomputersociety.org/10.1109/CRV.2010.47}
}

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.

DOI URL

@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}
}

\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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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}
}

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}
}

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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

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.

DOI URL

@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}
}

Journal papers

The θ\(_\mbox5\)-graph is a spanner

Searching on a line: A complete characterization of the optimal solution

Switching to directional antennas with constant increase in radius and hop distance

Minimum-area enclosing triangle with a fixed angle

Making triangulations 4-connected using flips

Triangulating and guarding realistic polygons

Theta-3 is connected

Stable roommates spanner

Some properties of k-delaunay and k-gabriel graphs

Fast local searches and updates in bounded universes

On plane geometric spanners: A survey and open problems

Bounding the locality of distributed routing algorithms

Coloring and guarding arrangements

Coverage with k-transmitters in the presence of obstacles

Network farthest-point diagrams

Robust geometric spanners

Layered working-set trees

Editorial

\(\pi\)/2-angle yao graphs are spanners

PROXIMITY GRAPHS: e, \(\delta\), \(\Delta\), \(\chi\) AND \(\omega\)

A distribution-sensitive dictionary with low space overhead

Skip lift: A probabilistic alternative to red-black trees

On bounded degree plane strong geometric spanners

Succinct geometric indexes supporting point location queries

Location-oblivious distributed unit disk graph coloring

A note on the perimeter of fat objects

Almost all delaunay triangulations have stretch factor greater than pi/2

On a family of strong geometric spanners that admit local routing strategies

A survey of geodesic paths on 3d surfaces

Every large point set contains many collinear points or an empty pentagon

On computing enclosing isosceles triangles and related problems

Computing signed permutations of polygons

Spanners of additively weighted point sets

Computing the greedy spanner in near-quadratic time

Filling holes in triangular meshes using digital images by curve unfolding

Morphing of triangular meshes in shape space

Sigma-local graphs

On the stretch factor of convex delaunay graphs

Clamshell casting

Flips in planar graphs

Geometric spanners with small chromatic number

A linear-space algorithm for distance preserving graph embedding

Editorial CCCG 2005

Rotationally monotone polygons

Connectivity-preserving transformations of binary images

Traversing a set of points with a minimum number of turns

A polynomial bound for untangling geometric planar graphs

Delaunay and diamond triangulations contain spanners of bounded degree

On structural and graph theoretic properties of higher order delaunay graphs

A note on the lower bound of edge guards of polyhedral terrains

Algorithms for optimal outlier removal

Augmented reality on cloth with realistic illumination

Spanners of complete k-partite geometric graphs

Incremental construction of k-dominating sets in wireless sensor networks

Editorial

On local transformations in plane geometric graphs embedded on small grids

A polynomial bound for untangling geometric planar graphs

On the false-positive rate of bloom filters

A characterization of the degree sequences of 2-trees

Coarse grained parallel algorithms for graph matching

Reconfiguring triangulations with edge flips and point moves

On the stabbing number of a random delaunay triangulation

Space-efficient geometric divide-and-conquer algorithms

Geodesic ham-sandwich cuts

A general approximation algorithm for planar maps with applications

Posture invariant correspondence of incomplete triangular manifolds

Simultaneous diagonal flips in plane triangulations

Induced subgraphs of bounded degree and bounded treewidth

Equitable subdivisions within polygonal regions

Partitions of complete geometric graphs into plane trees

Area-preserving approximations of polygonal paths

On the spanning ratio of gabriel graphs and beta-skeletons

Guest editors’ foreword

Constructing plane spanners of bounded degree and low weight

Generalizing monotonicity: on recognizing special classes of polygons and polyhedra

Optimizing a constrained convex polygonal annulus

On simplifying dot maps

Ordered theta graphs

Approximating geometric bottleneck shortest paths