Publications

Journal papers

Approximate shortest paths in weighted equilateral triangular meshes

Bose, P., Esteban, G., and Maheshwari, A.
TCS, 2024.

@article{tcs2024,
  author={Prosenjit Bose and Guillermo Esteban and Anil Maheshwari},
  title={Approximate shortest paths in weighted equilateral triangular meshes},
  journal={TCS},
  year={2024}
}

Improved routing on the delaunay triangulation

Bonichon, N., Bose, P., Carufel, J. D., Despré, V., Hill, D., and Smid, M. H. M.
Discrete and Computational Geometry, 2023, accepted.

@article{DBLP:journals/sub74,
  author={Nicolas Bonichon and Prosenjit Bose and Jean{-}Lou De Carufel and Vincent Despr{\'{e}} and Darryl Hill and Michiel H. M. Smid},
  title={Improved Routing on the Delaunay Triangulation},
  journal={Discrete and Computational Geometry},
  year={2023, accepted}
}

On the spanning and routing ratio of theta-four

Bose, P., Carufel, J. D., Hill, D., and Smid, M. H. M.
Discrete and Computational Geometry, 2023, accepted.

@article{DBLP:journals/sub102,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Darryl Hill and Michiel H. M. Smid},
  title={On the Spanning and Routing Ratio of Theta-Four},
  journal={Discrete and Computational Geometry},
  year={2023, accepted}
}

On the spanning and routing ratio of the directed theta-four graph

Bose, P., Carufel, J. D., Hill, D., and Smid, M.
Discret. Comput. Geom., 71(3):872–892, 2024.

DOI URL

@article{DBLP:journals/dcg/BoseCHS24,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Darryl Hill and Michiel Smid},
  title={On the Spanning and Routing Ratio of the Directed Theta-Four Graph},
  journal={Discret. Comput. Geom.},
  year={2024},
  volume={71},
  number={3},
  pages={872--892},
  doi={10.1007/S00454-023-00597-8},
  url={https://doi.org/10.1007/s00454-023-00597-8}
}

On approximating shortest paths in weighted triangular tessellations

Bose, P., Esteban, G., Orden, D., and Silveira, R. I.
Artif. Intell., 318:103898, 2023.

DOI URL

@article{DBLP:journals/ai/BoseEOS23,
  author={Prosenjit Bose and Guillermo Esteban and David Orden and Rodrigo I. Silveira},
  title={On approximating shortest paths in weighted triangular tessellations},
  journal={Artif. Intell.},
  year={2023},
  volume={318},
  pages={103898},
  doi={10.1016/J.ARTINT.2023.103898},
  url={https://doi.org/10.1016/j.artint.2023.103898}
}

Geodesic obstacle representation of graphs

Bose, P., Carmi, P., Dujmovic, V., Mehrabi, S., Montecchiani, F., Morin, P., and da Silveira, L. F. S. X.
Comput. Geom., 109:101946, 2023.

DOI URL

@article{DBLP:journals/comgeo/BoseCDMMMS23,
  author={Prosenjit Bose and Paz Carmi and Vida Dujmovic and Saeed Mehrabi and Fabrizio Montecchiani and Pat Morin and Lu{\'{\i}}s Fernando Schultz Xavier da Silveira},
  title={Geodesic obstacle representation of graphs},
  journal={Comput. Geom.},
  year={2023},
  volume={109},
  pages={101946},
  doi={10.1016/J.COMGEO.2022.101946},
  url={https://doi.org/10.1016/j.comgeo.2022.101946}
}

Simple linear time algorithms for piercing pairwise intersecting disks

Biniaz, A., Bose, P., and Wang, Y.
Comput. Geom., 114:102011, 2023.

DOI URL

@article{DBLP:journals/comgeo/BiniazBW23,
  author={Ahmad Biniaz and Prosenjit Bose and Yunkai Wang},
  title={Simple linear time algorithms for piercing pairwise intersecting disks},
  journal={Comput. Geom.},
  year={2023},
  volume={114},
  pages={102011},
  doi={10.1016/J.COMGEO.2023.102011},
  url={https://doi.org/10.1016/j.comgeo.2023.102011}
}

Improved routing on the delaunay triangulation

Bonichon, N., Bose, P., Carufel, J. D., Despré, V., Hill, D., and Smid, M.
Discret. Comput. Geom., 70(3):495–549, 2023.

DOI URL

@article{DBLP:journals/dcg/BonichonBCDHS23,
  author={Nicolas Bonichon and Prosenjit Bose and Jean{-}Lou De Carufel and Vincent Despr{\'{e}} and Darryl Hill and Michiel Smid},
  title={Improved Routing on the Delaunay Triangulation},
  journal={Discret. Comput. Geom.},
  year={2023},
  volume={70},
  number={3},
  pages={495--549},
  doi={10.1007/S00454-023-00499-9},
  url={https://doi.org/10.1007/s00454-023-00499-9}
}

The minimum moving spanning tree problem

Akitaya, H. A., Biniaz, A., Bose, P., Carufel, J. D., Maheshwari, A., da Silveira, L. F. S. X., and Smid, M.
J. Graph Algorithms Appl., 27(1):1–18, 2023.

DOI URL

@article{DBLP:journals/jgaa/AkitayaBBCMSS23,
  author={Hugo A. Akitaya and Ahmad Biniaz and Prosenjit Bose and Jean{-}Lou De Carufel and Anil Maheshwari and Lu{\'{\i}}s Fernando Schultz Xavier da Silveira and Michiel Smid},
  title={The Minimum Moving Spanning Tree Problem},
  journal={J. Graph Algorithms Appl.},
  year={2023},
  volume={27},
  number={1},
  pages={1--18},
  doi={10.7155/JGAA.00607},
  url={https://doi.org/10.7155/jgaa.00607}
}

Competitive online search trees on trees

Bose, P., Cardinal, J., Iacono, J., Koumoutsos, G., and Langerman, S.
ACM Trans. Algorithms, 19(3):25:1–25:19, 2023.

DOI URL

@article{DBLP:journals/talg/BoseCIKL23,
  author={Prosenjit Bose and Jean Cardinal and John Iacono and Grigorios Koumoutsos and Stefan Langerman},
  title={Competitive Online Search Trees on Trees},
  journal={{ACM} Trans. Algorithms},
  year={2023},
  volume={19},
  number={3},
  pages={25:1--25:19},
  doi={10.1145/3595180},
  url={https://doi.org/10.1145/3595180}
}

Bounded-angle minimum spanning trees

Biniaz, A., Bose, P., Lubiw, A., and Maheshwari, A.
Algorithmica, 84(1):150–175, 2022.

DOI URL

@article{DBLP:journals/algorithmica/BiniazBLM22,
  author={Ahmad Biniaz and Prosenjit Bose and Anna Lubiw and Anil Maheshwari},
  title={Bounded-Angle Minimum Spanning Trees},
  journal={Algorithmica},
  year={2022},
  volume={84},
  number={1},
  pages={150--175},
  doi={10.1007/S00453-021-00889-6},
  url={https://doi.org/10.1007/s00453-021-00889-6}
}

Computing maximum independent set on outerstring graphs and their relatives

Bose, P., Carmi, P., Keil, J. M., Maheshwari, A., Mehrabi, S., Mondal, D., and Smid, M.
Comput. Geom., 103:101852, 2022.

DOI URL

@article{DBLP:journals/comgeo/BoseCKM0MS22,
  author={Prosenjit Bose and Paz Carmi and J. Mark Keil and Anil Maheshwari and Saeed Mehrabi and Debajyoti Mondal and Michiel Smid},
  title={Computing maximum independent set on outerstring graphs and their relatives},
  journal={Comput. Geom.},
  year={2022},
  volume={103},
  pages={101852},
  doi={10.1016/J.COMGEO.2021.101852},
  url={https://doi.org/10.1016/j.comgeo.2021.101852}
}

On the spanning and routing ratios of the directed $\Theta$$_\mbox6$-graph

Akitaya, H. A., Biniaz, A., and Bose, P.
Comput. Geom., 105-106:101881, 2022.

DOI URL

@article{DBLP:journals/comgeo/AkitayaBB22,
  author={Hugo A. Akitaya and Ahmad Biniaz and Prosenjit Bose},
  title={On the spanning and routing ratios of the directed {\(\Theta\)}\({}_{\mbox{6}}\)-graph},
  journal={Comput. Geom.},
  year={2022},
  volume={105-106},
  pages={101881},
  doi={10.1016/J.COMGEO.2022.101881},
  url={https://doi.org/10.1016/j.comgeo.2022.101881}
}

Drawing graphs as spanners

Aichholzer, O., Borrazzo, M., Bose, P., Cardinal, J., Frati, F., Morin, P., and Vogtenhuber, B.
Discret. Comput. Geom., 68(3):774–795, 2022.

DOI URL

@article{DBLP:journals/dcg/AichholzerBBCFM22,
  author={Oswin Aichholzer and Manuel Borrazzo and Prosenjit Bose and Jean Cardinal and Fabrizio Frati and Pat Morin and Birgit Vogtenhuber},
  title={Drawing Graphs as Spanners},
  journal={Discret. Comput. Geom.},
  year={2022},
  volume={68},
  number={3},
  pages={774--795},
  doi={10.1007/S00454-022-00398-5},
  url={https://doi.org/10.1007/s00454-022-00398-5}
}

Separating layered treewidth and row treewidth

Bose, P., Dujmovic, V., Javarsineh, M., Morin, P., and Wood, D. R.
Discret. Math. Theor. Comput. Sci., 24(1), 2022.

DOI URL

@article{DBLP:journals/dmtcs/BoseDJMW22,
  author={Prosenjit Bose and Vida Dujmovic and Mehrnoosh Javarsineh and Pat Morin and David R. Wood},
  title={Separating layered treewidth and row treewidth},
  journal={Discret. Math. Theor. Comput. Sci.},
  year={2022},
  volume={24},
  number={1},
  doi={10.46298/DMTCS.7458},
  url={https://doi.org/10.46298/dmtcs.7458}
}

On the restricted k-steiner tree problem

Bose, P., D’Angelo, A., and Durocher, S.
J. Comb. Optim., 44(4):2893–2918, 2022.

DOI URL

@article{DBLP:journals/jco/BoseDD22,
  author={Prosenjit Bose and Anthony D'Angelo and Stephane Durocher},
  title={On the restricted k-Steiner tree problem},
  journal={J. Comb. Optim.},
  year={2022},
  volume={44},
  number={4},
  pages={2893--2918},
  doi={10.1007/S10878-021-00808-Z},
  url={https://doi.org/10.1007/s10878-021-00808-z}
}

Parameterized complexity of two-interval pattern problem

Bose, P., Mehrabi, S., and Mondal, D.
Theor. Comput. Sci., 902:21–28, 2022.

DOI URL

@article{DBLP:journals/tcs/BoseMM22,
  author={Prosenjit Bose and Saeed Mehrabi and Debajyoti Mondal},
  title={Parameterized complexity of two-interval pattern problem},
  journal={Theor. Comput. Sci.},
  year={2022},
  volume={902},
  pages={21--28},
  doi={10.1016/J.TCS.2021.12.005},
  url={https://doi.org/10.1016/j.tcs.2021.12.005}
}

Fragile complexity of adaptive algorithms

Bose, P., Cano, P., Fagerberg, R., Iacono, J., Jacob, R., and Langerman, S.
Theor. Comput. Sci., 919:92–102, 2022.

DOI URL

@article{DBLP:journals/tcs/BoseCFIJL22,
  author={Prosenjit Bose and Pilar Cano and Rolf Fagerberg and John Iacono and Riko Jacob and Stefan Langerman},
  title={Fragile complexity of adaptive algorithms},
  journal={Theor. Comput. Sci.},
  year={2022},
  volume={919},
  pages={92--102},
  doi={10.1016/J.TCS.2022.03.034},
  url={https://doi.org/10.1016/j.tcs.2022.03.034}
}

Affine invariant triangulations

Bose, P., Cano, P., and Silveira, R. I.
Comput. Aided Geom. Des., 91:102039, 2021.

DOI URL

@article{DBLP:journals/cagd/BoseCS21,
  author={Prosenjit Bose and Pilar Cano and Rodrigo I. Silveira},
  title={Affine invariant triangulations},
  journal={Comput. Aided Geom. Des.},
  year={2021},
  volume={91},
  pages={102039},
  doi={10.1016/J.CAGD.2021.102039},
  url={https://doi.org/10.1016/j.cagd.2021.102039}
}

Attraction-convexity and normal visibility

Bose, P. and Shermer, T. C.
Comput. Geom., 96:101748, 2021.

DOI URL

@article{DBLP:journals/comgeo/BoseS21,
  author={Prosenjit Bose and Thomas C. Shermer},
  title={Attraction-convexity and normal visibility},
  journal={Comput. Geom.},
  year={2021},
  volume={96},
  pages={101748},
  doi={10.1016/J.COMGEO.2021.101748},
  url={https://doi.org/10.1016/j.comgeo.2021.101748}
}

Piercing pairwise intersecting geodesic disks

Bose, P., Carmi, P., and Shermer, T. C.
Comput. Geom., 98:101774, 2021.

DOI URL

@article{DBLP:journals/comgeo/BoseCS21,
  author={Prosenjit Bose and Paz Carmi and Thomas C. Shermer},
  title={Piercing pairwise intersecting geodesic disks},
  journal={Comput. Geom.},
  year={2021},
  volume={98},
  pages={101774},
  doi={10.1016/J.COMGEO.2021.101774},
  url={https://doi.org/10.1016/j.comgeo.2021.101774}
}

Local routing in wspd-based spanners

Carufel, J. D., Bose, P., Paradis, F., and Dujmovic, V.
J. Comput. Geom., 12(1):1–34, 2021.

DOI URL

@article{DBLP:journals/jocg/CarufelBPD21,
  author={Jean{-}Lou De Carufel and Prosenjit Bose and Fr{\'{e}}d{\'{e}}rik Paradis and Vida Dujmovic},
  title={Local routing in WSPD-based spanners},
  journal={J. Comput. Geom.},
  year={2021},
  volume={12},
  number={1},
  pages={1--34},
  doi={10.20382/JOCG.V12I1A1},
  url={https://doi.org/10.20382/jocg.v12i1a1}
}

Constrained routing between non-visible vertices

Bose, P., Korman, M., van Renssen, A., and Verdonschot, S.
Theor. Comput. Sci., 861:144–154, 2021.

DOI URL

@article{DBLP:journals/tcs/BoseKRV21,
  author={Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Constrained routing between non-visible vertices},
  journal={Theor. Comput. Sci.},
  year={2021},
  volume={861},
  pages={144--154},
  doi={10.1016/J.TCS.2021.02.017},
  url={https://doi.org/10.1016/j.tcs.2021.02.017}
}

Self-approaching paths in simple polygons

Bose, P., Kostitsyna, I., and Langerman, S.
Comput. Geom., 87:101595, 2020.

DOI URL

@article{DBLP:journals/comgeo/BoseKL20,
  author={Prosenjit Bose and Irina Kostitsyna and Stefan Langerman},
  title={Self-approaching paths in simple polygons},
  journal={Comput. Geom.},
  year={2020},
  volume={87},
  pages={101595},
  doi={10.1016/J.COMGEO.2019.101595},
  url={https://doi.org/10.1016/j.comgeo.2019.101595}
}

Optimal art gallery localization is np-hard

Bose, P., Carufel, J. D., Shaikhet, A., and Smid, M. H. M.
Comput. Geom., 88:101607, 2020.

DOI URL

@article{DBLP:journals/comgeo/BoseCSS20,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Alina Shaikhet and Michiel H. M. Smid},
  title={Optimal Art Gallery Localization is NP-hard},
  journal={Comput. Geom.},
  year={2020},
  volume={88},
  pages={101607},
  doi={10.1016/J.COMGEO.2020.101607},
  url={https://doi.org/10.1016/j.comgeo.2020.101607}
}

Hamiltonicity for convex shape delaunay and gabriel graphs

Bose, P., Cano, P., Saumell, M., and Silveira, R. I.
Comput. Geom., 89:101629, 2020.

DOI URL

@article{DBLP:journals/comgeo/BoseCSS20a,
  author={Prosenjit Bose and Pilar Cano and Maria Saumell and Rodrigo I. Silveira},
  title={Hamiltonicity for convex shape Delaunay and Gabriel graphs},
  journal={Comput. Geom.},
  year={2020},
  volume={89},
  pages={101629},
  doi={10.1016/J.COMGEO.2020.101629},
  url={https://doi.org/10.1016/j.comgeo.2020.101629}
}

Gathering by repulsion

Bose, P. and Shermer, T. C.
Comput. Geom., 90:101627, 2020.

DOI URL

@article{DBLP:journals/comgeo/BoseS20,
  author={Prosenjit Bose and Thomas C. Shermer},
  title={Gathering by repulsion},
  journal={Comput. Geom.},
  year={2020},
  volume={90},
  pages={101627},
  doi={10.1016/J.COMGEO.2020.101627},
  url={https://doi.org/10.1016/j.comgeo.2020.101627}
}

Local routing in convex subdivisions

Bose, P., Durocher, S., Mondal, D., Peabody, M., Skala, M., and Wahid, M. A.
Int. J. Comput. Geom. Appl., 30(1):1–17, 2020.

DOI URL

@article{DBLP:journals/ijcga/BoseDMPSW20,
  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},
  journal={Int. J. Comput. Geom. Appl.},
  year={2020},
  volume={30},
  number={1},
  pages={1--17},
  doi={10.1142/S0218195920500016},
  url={https://doi.org/10.1142/S0218195920500016}
}

Power domination on triangular grids with triangular and hexagonal shape

Bose, P., Gledel, V., Pennarun, C., and Verdonschot, S.
J. Comb. Optim., 40(2):482–500, 2020.

DOI URL

@article{DBLP:journals/jco/BoseGPV20,
  author={Prosenjit Bose and Valentin Gledel and Claire Pennarun and Sander Verdonschot},
  title={Power domination on triangular grids with triangular and hexagonal shape},
  journal={J. Comb. Optim.},
  year={2020},
  volume={40},
  number={2},
  pages={482--500},
  doi={10.1007/S10878-020-00587-Z},
  url={https://doi.org/10.1007/s10878-020-00587-z}
}

Expected complexity of routing in $\textbackslashtheta\_6$ and half-$\textbackslashtheta\_6$ graphs

Bose, P., Carufel, J. D., and Devillers, O.
J. Comput. Geom., 11(1):212–234, 2020.

DOI URL

@article{DBLP:journals/jocg/BoseCD20,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Olivier Devillers},
  title={Expected Complexity of Routing in {\textdollar}{\textbackslash}Theta{\_}6{\textdollar} and Half-{\textdollar}{\textbackslash}Theta{\_}6{\textdollar} Graphs},
  journal={J. Comput. Geom.},
  year={2020},
  volume={11},
  number={1},
  pages={212--234},
  doi={10.20382/JOCG.V11I1A9},
  url={https://doi.org/10.20382/jocg.v11i1a9}
}

Faster algorithms for some optimization problems on collinear points

Biniaz, A., Bose, P., Carmi, P., Maheshwari, A., Munro, J. I., and Smid, M. H. M.
J. Comput. Geom., 11(1):418–432, 2020.

DOI URL

@article{DBLP:journals/jocg/BiniazBCMMS20,
  author={Ahmad Biniaz and Prosenjit Bose and Paz Carmi and Anil Maheshwari and J. Ian Munro and Michiel H. M. Smid},
  title={Faster algorithms for some optimization problems on collinear points},
  journal={J. Comput. Geom.},
  year={2020},
  volume={11},
  number={1},
  pages={418--432},
  doi={10.20382/JOCG.V11I1A16},
  url={https://doi.org/10.20382/jocg.v11i1a16}
}

Computing the k-visibility region of a point in a polygon

Bahoo, Y., Bose, P., Durocher, S., and Shermer, T. C.
Theory Comput. Syst., 64(7):1292–1306, 2020.

DOI URL

@article{DBLP:journals/mst/BahooBDS20,
  author={Yeganeh Bahoo and Prosenjit Bose and Stephane Durocher and Thomas C. Shermer},
  title={Computing the k-Visibility Region of a Point in a Polygon},
  journal={Theory Comput. Syst.},
  year={2020},
  volume={64},
  number={7},
  pages={1292--1306},
  doi={10.1007/S00224-020-09999-0},
  url={https://doi.org/10.1007/s00224-020-09999-0}
}

On plane constrained bounded-degree spanners

Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
Algorithmica, 81(4):1392–1415, 2019.

DOI URL

@article{DBLP:journals/algorithmica/BoseFRV19,
  author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={On Plane Constrained Bounded-Degree Spanners},
  journal={Algorithmica},
  year={2019},
  volume={81},
  number={4},
  pages={1392--1415},
  doi={10.1007/S00453-018-0476-8},
  url={https://doi.org/10.1007/s00453-018-0476-8}
}

Maximum plane trees in multipartite geometric graphs

Biniaz, A., Bose, P., Crosbie, K., Carufel, J. D., Eppstein, D., Maheshwari, A., and Smid, M. H. M.
Algorithmica, 81(4):1512–1534, 2019.

DOI URL

@article{DBLP:journals/algorithmica/BiniazBCCEMS19,
  author={Ahmad Biniaz and Prosenjit Bose and Kimberly Crosbie and Jean{-}Lou De Carufel and David Eppstein and Anil Maheshwari and Michiel H. M. Smid},
  title={Maximum Plane Trees in Multipartite Geometric Graphs},
  journal={Algorithmica},
  year={2019},
  volume={81},
  number={4},
  pages={1512--1534},
  doi={10.1007/S00453-018-0482-X},
  url={https://doi.org/10.1007/s00453-018-0482-x}
}

Improved bounds for guarding plane graphs with edges

Biniaz, A., Bose, P., Ooms, A., and Verdonschot, S.
Graphs Comb., 35(2):437–450, 2019.

DOI URL

@article{DBLP:journals/gc/BiniazBOV19,
  author={Ahmad Biniaz and Prosenjit Bose and Aur{\'{e}}lien Ooms and Sander Verdonschot},
  title={Improved Bounds for Guarding Plane Graphs with Edges},
  journal={Graphs Comb.},
  year={2019},
  volume={35},
  number={2},
  pages={437--450},
  doi={10.1007/S00373-018-02004-Z},
  url={https://doi.org/10.1007/s00373-018-02004-z}
}

Spanning properties of yao and theta-graphs in the presence of constraints

Bose, P. and van Renssen, A.
Int. J. Comput. Geom. Appl., 29(2):95–120, 2019.

DOI URL

@article{DBLP:journals/ijcga/BoseR19,
  author={Prosenjit Bose and Andr{\'{e}} van Renssen},
  title={Spanning Properties of Yao and theta-Graphs in the Presence of Constraints},
  journal={Int. J. Comput. Geom. Appl.},
  year={2019},
  volume={29},
  number={2},
  pages={95--120},
  doi={10.1142/S021819591950002X},
  url={https://doi.org/10.1142/S021819591950002X}
}

Pole dancing: 3d morphs for tree drawings

Arseneva, E., Bose, P., Cano, P., D’Angelo, A., Dujmovic, V., Frati, F., Langerman, S., and Tappini, A.
J. Graph Algorithms Appl., 23(3):579–602, 2019.

DOI URL

@article{DBLP:journals/jgaa/ArsenevaBCDDFLT19,
  author={Elena Arseneva and Prosenjit Bose and Pilar Cano and Anthony D'Angelo and Vida Dujmovic and Fabrizio Frati and Stefan Langerman and Alessandra Tappini},
  title={Pole Dancing: 3D Morphs for Tree Drawings},
  journal={J. Graph Algorithms Appl.},
  year={2019},
  volume={23},
  number={3},
  pages={579--602},
  doi={10.7155/JGAA.00503},
  url={https://doi.org/10.7155/jgaa.00503}
}

A time-space trade-off for computing the \emphk-visibility region of a point in a polygon

Bahoo, Y., Banyassady, B., Bose, P., Durocher, S., and Mulzer, W.
Theor. Comput. Sci., 789:13–21, 2019.

DOI URL

@article{DBLP:journals/tcs/BahooBBDM19,
  author={Yeganeh Bahoo and Bahareh Banyassady and Prosenjit Bose and Stephane Durocher and Wolfgang Mulzer},
  title={A time-space trade-off for computing the \emph{k}-visibility region of a point in a polygon},
  journal={Theor. Comput. Sci.},
  year={2019},
  volume={789},
  pages={13--21},
  doi={10.1016/J.TCS.2018.06.017},
  url={https://doi.org/10.1016/j.tcs.2018.06.017}
}

Improved spanning ratio for low degree plane spanners

Bose, P., Hill, D., and Smid, M. H. M.
Algorithmica, 80(3):935–976, 2018.

DOI URL

@article{DBLP:journals/algorithmica/BoseHS18,
  author={Prosenjit Bose and Darryl Hill and Michiel H. M. Smid},
  title={Improved Spanning Ratio for Low Degree Plane Spanners},
  journal={Algorithmica},
  year={2018},
  volume={80},
  number={3},
  pages={935--976},
  doi={10.1007/S00453-017-0305-5},
  url={https://doi.org/10.1007/s00453-017-0305-5}
}

Spanning trees in multipartite geometric graphs

Biniaz, A., Bose, P., Eppstein, D., Maheshwari, A., Morin, P., and Smid, M. H. M.
Algorithmica, 80(11):3177–3191, 2018.

DOI URL

@article{DBLP:journals/algorithmica/BiniazBEMMS18,
  author={Ahmad Biniaz and Prosenjit Bose and David Eppstein and Anil Maheshwari and Pat Morin and Michiel H. M. Smid},
  title={Spanning Trees in Multipartite Geometric Graphs},
  journal={Algorithmica},
  year={2018},
  volume={80},
  number={11},
  pages={3177--3191},
  doi={10.1007/S00453-017-0375-4},
  url={https://doi.org/10.1007/s00453-017-0375-4}
}

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.
Algorithmica, 80(11):3316–3334, 2018.

DOI URL

@article{DBLP:journals/algorithmica/AronovBDGILS18,
  author={Boris Aronov and Prosenjit Bose and Erik D. Demaine and Joachim Gudmundsson and John Iacono and Stefan Langerman and Michiel H. M. Smid},
  title={Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams},
  journal={Algorithmica},
  year={2018},
  volume={80},
  number={11},
  pages={3316--3334},
  doi={10.1007/S00453-017-0389-Y},
  url={https://doi.org/10.1007/s00453-017-0389-y}
}

Continuous yao graphs

Bakhshesh, D., Barba, L., Bose, P., Carufel, J. D., Damian, M., Fagerberg, R., Farshi, M., van Renssen, A., Taslakian, P., and Verdonschot, S.
Comput. Geom., 67:42–52, 2018.

DOI URL

@article{DBLP:journals/comgeo/BakhsheshBBCDFF18,
  author={Davood Bakhshesh and Luis Barba and Prosenjit Bose and Jean{-}Lou De Carufel and Mirela Damian and Rolf Fagerberg and Mohammad Farshi and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
  title={Continuous Yao graphs},
  journal={Comput. Geom.},
  year={2018},
  volume={67},
  pages={42--52},
  doi={10.1016/J.COMGEO.2017.10.002},
  url={https://doi.org/10.1016/j.comgeo.2017.10.002}
}

Editorial: special issue in memory of dr. ferran hurtado

Bose, P. and Ramos, P.
Comput. Geom., 68:1, 2018.

DOI URL

@article{DBLP:journals/comgeo/BoseR18,
  author={Prosenjit Bose and Pedro Ramos},
  title={Editorial: Special issue in memory of Dr. Ferran Hurtado},
  journal={Comput. Geom.},
  year={2018},
  volume={68},
  pages={1},
  doi={10.1016/J.COMGEO.2017.10.001},
  url={https://doi.org/10.1016/j.comgeo.2017.10.001}
}

Flipping edge-labelled triangulations

Bose, P., Lubiw, A., Pathak, V., and Verdonschot, S.
Comput. Geom., 68:309–326, 2018.

DOI URL

@article{DBLP:journals/comgeo/BoseLPV18,
  author={Prosenjit Bose and Anna Lubiw and Vinayak Pathak and Sander Verdonschot},
  title={Flipping edge-labelled triangulations},
  journal={Comput. Geom.},
  year={2018},
  volume={68},
  pages={309--326},
  doi={10.1016/J.COMGEO.2017.06.005},
  url={https://doi.org/10.1016/j.comgeo.2017.06.005}
}

Constrained generalized delaunay graphs are plane spanners

Bose, P., Carufel, J. D., and van Renssen, A.
Comput. Geom., 74:50–65, 2018.

DOI URL

@article{DBLP:journals/comgeo/BoseCR18,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Andr{\'{e}} van Renssen},
  title={Constrained generalized Delaunay graphs are plane spanners},
  journal={Comput. Geom.},
  year={2018},
  volume={74},
  pages={50--65},
  doi={10.1016/J.COMGEO.2018.06.006},
  url={https://doi.org/10.1016/j.comgeo.2018.06.006}
}

Plane bichromatic trees of low degree

Biniaz, A., Bose, P., Maheshwari, A., and Smid, M. H. M.
Discret. Comput. Geom., 59(4):864–885, 2018.

DOI URL

@article{DBLP:journals/dcg/BiniazBMS18,
  author={Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel H. M. Smid},
  title={Plane Bichromatic Trees of Low Degree},
  journal={Discret. Comput. Geom.},
  year={2018},
  volume={59},
  number={4},
  pages={864--885},
  doi={10.1007/S00454-017-9881-Z},
  url={https://doi.org/10.1007/s00454-017-9881-z}
}

Routing on the visibility graph

Bose, P., Korman, M., Verdonschot, S., and van Renssen, A.
J. Comput. Geom., 9(1):430–453, 2018.

DOI URL

@article{DBLP:journals/jocg/BoseKVR18,
  author={Prosenjit Bose and Matias Korman and Sander Verdonschot and Andr{\'{e}} van Renssen},
  title={Routing on the visibility graph},
  journal={J. Comput. Geom.},
  year={2018},
  volume={9},
  number={1},
  pages={430--453},
  doi={10.20382/JOCG.V9I1A15},
  url={https://doi.org/10.20382/jocg.v9i1a15}
}

Flips in edge-labelled pseudo-triangulations

Bose, P. and Verdonschot, S.
Comput. Geom., 60:45–54, 2017.

DOI URL

@article{DBLP:journals/comgeo/BoseV17,
  author={Prosenjit Bose and Sander Verdonschot},
  title={Flips in edge-labelled pseudo-triangulations},
  journal={Comput. Geom.},
  year={2017},
  volume={60},
  pages={45--54},
  doi={10.1016/J.COMGEO.2016.08.001},
  url={https://doi.org/10.1016/j.comgeo.2016.08.001}
}

Upper and lower bounds for online routing on delaunay triangulations

Bonichon, N., Bose, P., Carufel, J. D., Perkovic, L., and van Renssen, A.
Discret. Comput. Geom., 58(2):482–504, 2017.

DOI URL

@article{DBLP:journals/dcg/BonichonBCPR17,
  author={Nicolas Bonichon and Prosenjit Bose and Jean{-}Lou De Carufel and Ljubomir Perkovic and Andr{\'{e}} van Renssen},
  title={Upper and Lower Bounds for Online Routing on Delaunay Triangulations},
  journal={Discret. Comput. Geom.},
  year={2017},
  volume={58},
  number={2},
  pages={482--504},
  doi={10.1007/S00454-016-9842-Y},
  url={https://doi.org/10.1007/s00454-016-9842-y}
}

New bounds for facial nonrepetitive colouring

Bose, P., Dujmovic, V., Morin, P., and Rioux-Maldague, L.
Graphs Comb., 33(4):817–832, 2017.

DOI URL

@article{DBLP:journals/gc/BoseDMR17,
  author={Prosenjit Bose and Vida Dujmovic and Pat Morin and Lucas Rioux{-}Maldague},
  title={New Bounds for Facial Nonrepetitive Colouring},
  journal={Graphs Comb.},
  year={2017},
  volume={33},
  number={4},
  pages={817--832},
  doi={10.1007/S00373-017-1816-1},
  url={https://doi.org/10.1007/s00373-017-1816-1}
}

Competitive online routing on delaunay triangulations

Bose, P., Carufel, J. D., Durocher, S., and Taslakian, P.
Int. J. Comput. Geom. Appl., 27(4):241–254, 2017.

DOI URL

@article{DBLP:journals/ijcga/BoseCDT17,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Stephane Durocher and Perouz Taslakian},
  title={Competitive Online Routing on Delaunay Triangulations},
  journal={Int. J. Comput. Geom. Appl.},
  year={2017},
  volume={27},
  number={4},
  pages={241--254},
  doi={10.1142/S0218195917500066},
  url={https://doi.org/10.1142/S0218195917500066}
}

Essential constraints of edge-constrained proximity graphs

Bose, P., Carufel, J. D., Shaikhet, A., and Smid, M. H. M.
J. Graph Algorithms Appl., 21(4):389–415, 2017.

DOI URL

@article{DBLP:journals/jgaa/BoseCSS17,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Alina Shaikhet and Michiel H. M. Smid},
  title={Essential Constraints of Edge-Constrained Proximity Graphs},
  journal={J. Graph Algorithms Appl.},
  year={2017},
  volume={21},
  number={4},
  pages={389--415},
  doi={10.7155/JGAA.00422},
  url={https://doi.org/10.7155/jgaa.00422}
}

Faster algorithms for the minimum red-blue-purple spanning graph problem

Biniaz, A., Bose, P., van Duijn, I., Maheshwari, A., and Smid, M. H. M.
J. Graph Algorithms Appl., 21(4):527–546, 2017.

DOI URL

@article{DBLP:journals/jgaa/BiniazBDMS17,
  author={Ahmad Biniaz and Prosenjit Bose and Ingo van Duijn and Anil Maheshwari and Michiel H. M. Smid},
  title={Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem},
  journal={J. Graph Algorithms Appl.},
  year={2017},
  volume={21},
  number={4},
  pages={527--546},
  doi={10.7155/JGAA.00427},
  url={https://doi.org/10.7155/jgaa.00427}
}

Towards plane spanners of degree 3

Biniaz, A., Bose, P., Carufel, J. D., Gavoille, C., Maheshwari, A., and Smid, M. H. M.
J. Comput. Geom., 8(1):11–31, 2017.

DOI URL

@article{DBLP:journals/jocg/BiniazBCGMS17,
  author={Ahmad Biniaz and Prosenjit Bose and Jean{-}Lou De Carufel and Cyril Gavoille and Anil Maheshwari and Michiel H. M. Smid},
  title={Towards plane spanners of degree 3},
  journal={J. Comput. Geom.},
  year={2017},
  volume={8},
  number={1},
  pages={11--31},
  doi={10.20382/JOCG.V8I1A2},
  url={https://doi.org/10.20382/jocg.v8i1a2}
}

Competitive local routing with constraints

Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
J. Comput. Geom., 8(1):125–152, 2017.

DOI URL

@article{DBLP:journals/jocg/BoseFRV17,
  author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Competitive local routing with constraints},
  journal={J. Comput. Geom.},
  year={2017},
  volume={8},
  number={1},
  pages={125--152},
  doi={10.20382/JOCG.V8I1A7},
  url={https://doi.org/10.20382/jocg.v8i1a7}
}

A general framework for searching on a line

Bose, P. and Carufel, J. D.
Theor. Comput. Sci., 703:1–17, 2017.

DOI URL

@article{DBLP:journals/tcs/BoseC17,
  author={Prosenjit Bose and Jean{-}Lou De Carufel},
  title={A general framework for searching on a line},
  journal={Theor. Comput. Sci.},
  year={2017},
  volume={703},
  pages={1--17},
  doi={10.1016/J.TCS.2017.08.023},
  url={https://doi.org/10.1016/j.tcs.2017.08.023}
}

Biased predecessor search

Bose, P., Fagerberg, R., Howat, J., and Morin, P.
Algorithmica, 76(4):1097–1105, 2016.

DOI URL

@article{DBLP:journals/algorithmica/BoseFHM16,
  author={Prosenjit Bose and Rolf Fagerberg and John Howat and Pat Morin},
  title={Biased Predecessor Search},
  journal={Algorithmica},
  year={2016},
  volume={76},
  number={4},
  pages={1097--1105},
  doi={10.1007/S00453-016-0146-7},
  url={https://doi.org/10.1007/s00453-016-0146-7}
}

The power and limitations of static binary search trees with lazy finger

Bose, P., Douïeb, K., Iacono, J., and Langerman, S.
Algorithmica, 76(4):1264–1275, 2016.

DOI URL

@article{DBLP:journals/algorithmica/BoseDIL16,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb and John Iacono and Stefan Langerman},
  title={The Power and Limitations of Static Binary Search Trees with Lazy Finger},
  journal={Algorithmica},
  year={2016},
  volume={76},
  number={4},
  pages={1264--1275},
  doi={10.1007/S00453-016-0224-X},
  url={https://doi.org/10.1007/s00453-016-0224-x}
}

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

Biniaz, A., Bose, P., Maheshwari, A., and Smid, M. H. M.
Comput. Geom., 57:27–39, 2016.

DOI URL

@article{DBLP:journals/comgeo/BiniazBMS16,
  author={Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel H. M. Smid},
  title={Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon},
  journal={Comput. Geom.},
  year={2016},
  volume={57},
  pages={27--39},
  doi={10.1016/J.COMGEO.2016.05.004},
  url={https://doi.org/10.1016/j.comgeo.2016.05.004}
}

Probing convex polygons with a wedge

Bose, P., Carufel, J. D., Shaikhet, A., and Smid, M. H. M.
Comput. Geom., 58:34–59, 2016.

DOI URL

@article{DBLP:journals/comgeo/BoseCSS16,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Alina Shaikhet and Michiel H. M. Smid},
  title={Probing convex polygons with a wedge},
  journal={Comput. Geom.},
  year={2016},
  volume={58},
  pages={34--59},
  doi={10.1016/J.COMGEO.2016.06.001},
  url={https://doi.org/10.1016/j.comgeo.2016.06.001}
}

A linear-time algorithm for the geodesic center of a simple polygon

Ahn, H., Barba, L., Bose, P., Carufel, J. D., Korman, M., and Oh, E.
Discret. Comput. Geom., 56(4):836–859, 2016.

DOI URL

@article{DBLP:journals/dcg/AhnBBCKO16,
  author={Hee{-}Kap Ahn and Luis Barba and Prosenjit Bose and Jean{-}Lou De Carufel and Matias Korman and Eunjin Oh},
  title={A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon},
  journal={Discret. Comput. Geom.},
  year={2016},
  volume={56},
  number={4},
  pages={836--859},
  doi={10.1007/S00454-016-9796-0},
  url={https://doi.org/10.1007/s00454-016-9796-0}
}

The price of order

Bose, P., Morin, P., and van Renssen, A.
Int. J. Comput. Geom. Appl., 26(3-4):135–150, 2016.

DOI URL

@article{DBLP:journals/ijcga/BoseMR16,
  author={Prosenjit Bose and Pat Morin and Andr{\'{e}} van Renssen},
  title={The Price of Order},
  journal={Int. J. Comput. Geom. Appl.},
  year={2016},
  volume={26},
  number={3-4},
  pages={135--150},
  doi={10.1142/S0218195916600013},
  url={https://doi.org/10.1142/S0218195916600013}
}

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere

Smid, M. H. M., Bose, P., Carmi, P., Damian, M., Carufel, J. D., Hill, D., Maheshwari, A., and Liu, Y.
J. Comput. Geom., 7(1):444–472, 2016.

DOI URL

@article{DBLP:journals/jocg/SmidBCDCHML16,
  author={Michiel H. M. Smid and Prosenjit Bose and Paz Carmi and Mirela Damian and Jean{-}Lou De Carufel and Darryl Hill and Anil Maheshwari and Yuyang Liu},
  title={On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere},
  journal={J. Comput. Geom.},
  year={2016},
  volume={7},
  number={1},
  pages={444--472},
  doi={10.20382/JOCG.V7I1A19},
  url={https://doi.org/10.20382/jocg.v7i1a19}
}

A plane 1.88-spanner for points in convex position

Biniaz, A., Amani, M., Maheshwari, A., Smid, M. H. M., Bose, P., and Carufel, J. D.
J. Comput. Geom., 7(1):520–539, 2016.

DOI URL

@article{DBLP:journals/jocg/BiniazAMSBC16,
  author={Ahmad Biniaz and Mahdi Amani and Anil Maheshwari and Michiel H. M. Smid and Prosenjit Bose and Jean{-}Lou De Carufel},
  title={A plane 1.88-spanner for points in convex position},
  journal={J. Comput. Geom.},
  year={2016},
  volume={7},
  number={1},
  pages={520--539},
  doi={10.20382/JOCG.V7I1A21},
  url={https://doi.org/10.20382/jocg.v7i1a21}
}

Towards tight bounds on theta-graphs: more is not always better

Bose, P., Carufel, J. D., Morin, P., van Renssen, A., and Verdonschot, S.
Theor. Comput. Sci., 616:70–93, 2016.

DOI URL

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

Visibility-monotonic polygon deflation

Bose, P., Dujmovic, V., Hoda, N., and Morin, P.
Contributions Discret. Math., 10(1), 2015.

URL

@article{DBLP:journals/cdm/BoseDHM15,
  author={Prosenjit Bose and Vida Dujmovic and Nima Hoda and Pat Morin},
  title={Visibility-monotonic polygon deflation},
  journal={Contributions Discret. Math.},
  year={2015},
  volume={10},
  number={1},
  url={http://cdm.ucalgary.ca/cdm/index.php/cdm/article/view/366}
}

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={https://doi.org/10.1016/j.comgeo.2014.08.005}
}

Reprint of: theta-3 is connected

Aichholzer, O., Bae, S. W., Barba, L., Bose, P., Korman, M., van Renssen, A., Taslakian, P., and Verdonschot, S.
Comput. Geom., 48(5):407–414, 2015.

DOI URL

@article{DBLP:journals/comgeo/AichholzerBBBKR15,
  author={Oswin Aichholzer and Sang Won Bae and Luis Barba and Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
  title={Reprint of: Theta-3 is connected},
  journal={Comput. Geom.},
  year={2015},
  volume={48},
  number={5},
  pages={407--414},
  doi={10.1016/J.COMGEO.2015.01.002},
  url={https://doi.org/10.1016/j.comgeo.2015.01.002}
}

Packing plane perfect matchings into a point set

Biniaz, A., Bose, P., Maheshwari, A., and Smid, M. H. M.
Discret. Math. Theor. Comput. Sci., 17(2):119–142, 2015.

DOI URL

@article{DBLP:journals/dmtcs/BiniazBMS15,
  author={Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel H. M. Smid},
  title={Packing Plane Perfect Matchings into a Point Set},
  journal={Discret. Math. Theor. Comput. Sci.},
  year={2015},
  volume={17},
  number={2},
  pages={119--142},
  doi={10.46298/DMTCS.2132},
  url={https://doi.org/10.46298/dmtcs.2132}
}

Optimal data structures for farthest-point queries in cactus networks

Bose, P., Carufel, J. D., Grimm, C., Maheshwari, A., and Smid, M. H. M.
J. Graph Algorithms Appl., 19(1):11–41, 2015.

DOI URL

@article{DBLP:journals/jgaa/BoseCGMS15,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Carsten Grimm and Anil Maheshwari and Michiel H. M. Smid},
  title={Optimal Data Structures for Farthest-Point Queries in Cactus Networks},
  journal={J. Graph Algorithms Appl.},
  year={2015},
  volume={19},
  number={1},
  pages={11--41},
  doi={10.7155/JGAA.00345},
  url={https://doi.org/10.7155/jgaa.00345}
}

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.
J. Comput. Geom., 6(2):19–53, 2015.

DOI URL

@article{DBLP:journals/jocg/BarbaBDFKORTVX15,
  author={Luis Barba and Prosenjit Bose and Mirela Damian and Rolf Fagerberg and Wah Loon Keng and Joseph O'Rourke and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot and Ge Xia},
  title={New and improved spanning ratios for Yao graphs},
  journal={J. Comput. Geom.},
  year={2015},
  volume={6},
  number={2},
  pages={19--53},
  doi={10.20382/JOCG.V6I2A3},
  url={https://doi.org/10.20382/jocg.v6i2a3}
}

Optimal local routing on delaunay triangulations defined by empty equilateral triangles

Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
SIAM J. Comput., 44(6):1626–1649, 2015.

DOI URL

@article{DBLP:journals/siamcomp/BoseFRV15,
  author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles},
  journal={{SIAM} J. Comput.},
  year={2015},
  volume={44},
  number={6},
  pages={1626--1649},
  doi={10.1137/140988103},
  url={https://doi.org/10.1137/140988103}
}

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={https://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={https://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={https://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={https://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={https://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={https://doi.org/10.1016/j.comgeo.2014.05.001}
}

Surface roughness of rock faces through the curvature of triangulated meshes

Lai, P., Samson, C., and Bose, P.
Comput. Geosci., 70:229–237, 2014.

DOI URL

@article{DBLP:journals/gandc/LaiSB14,
  author={P. Lai and Claire Samson and Prosenjit Bose},
  title={Surface roughness of rock faces through the curvature of triangulated meshes},
  journal={Comput. Geosci.},
  year={2014},
  volume={70},
  pages={229--237},
  doi={10.1016/J.CAGEO.2014.05.010},
  url={https://doi.org/10.1016/j.cageo.2014.05.010}
}

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={https://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., Sacristán, 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 Sacrist{\'{a}}n and Maria Saumell},
  title={Some properties of k-Delaunay and k-Gabriel graphs},
  journal={Comput. Geom.},
  year={2013},
  volume={46},
  number={2},
  pages={131--139},
  doi={10.1016/J.COMGEO.2012.04.006},
  url={https://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={https://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={https://doi.org/10.1016/j.comgeo.2013.04.002}
}

Bounding the locality of distributed routing algorithms

Bose, P., Carmi, P., and Durocher, S.
Distributed Comput., 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 Comput.},
  year={2013},
  volume={26},
  number={1},
  pages={39--58},
  doi={10.1007/S00446-012-0179-3},
  url={https://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.
Discret. Math. Theor. Comput. Sci., 15(3):139–154, 2013.

DOI 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={Discret. Math. Theor. Comput. Sci.},
  year={2013},
  volume={15},
  number={3},
  pages={139--154},
  doi={10.46298/DMTCS.2072},
  url={https://doi.org/10.46298/dmtcs.2072}
}

Coverage with k-transmitters in the presence of obstacles

Ballinger, B., Benbernou, N. M., Bose, P., Damian, M., Demaine, E. D., Dujmovic, V., Flatland, R. Y., Hurtado, F., Iacono, J., Lubiw, A., Morin, P., Adinolfi, V. S., Souvaine, D. L., and Uehara, R.
J. Comb. Optim., 25(2):208–233, 2013.

DOI URL

@article{DBLP:journals/jco/BallingerBBDDDFHILMASU13,
  author={Brad Ballinger and Nadia M. 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={https://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.
J. Comput. Geom., 4(1):182–211, 2013.

DOI 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={J. Comput. Geom.},
  year={2013},
  volume={4},
  number={1},
  pages={182--211},
  doi={10.20382/JOCG.V4I1A8},
  url={https://doi.org/10.20382/jocg.v4i1a8}
}

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={https://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={https://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={https://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. Geom. 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. Geom. Appl.},
  year={2012},
  volume={22},
  number={1},
  pages={61--82},
  doi={10.1142/S0218195912600047},
  url={https://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. Geom. 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. Geom. Appl.},
  year={2012},
  volume={22},
  number={5},
  pages={439--470},
  doi={10.1142/S0218195912500112},
  url={https://doi.org/10.1142/S0218195912500112}
}

Automatically creating design models from 3d anthropometry data

Wuhrer, S., Shu, C., and Bose, P.
J. Comput. Inf. Sci. Eng., 12(4), 2012.

DOI URL

@article{DBLP:journals/jcise/WuhrerSB12,
  author={Stefanie Wuhrer and Chang Shu and Prosenjit Bose},
  title={Automatically Creating Design Models From 3D Anthropometry Data},
  journal={J. Comput. Inf. Sci. Eng.},
  year={2012},
  volume={12},
  number={4},
  doi={10.1115/1.4007839},
  url={https://doi.org/10.1115/1.4007839}
}

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={https://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={https://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={https://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 Trans. Algorithms, 8(2):10:1–10:26, 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} Trans. Algorithms},
  year={2012},
  volume={8},
  number={2},
  pages={10:1--10:26},
  doi={10.1145/2151171.2151173},
  url={https://doi.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={https://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={https://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={https://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={https://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={https://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 Comb., 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 Comb.},
  year={2011},
  volume={27},
  number={1},
  pages={47--60},
  doi={10.1007/S00373-010-0957-2},
  url={https://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. Geom. 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. Geom. Appl.},
  year={2011},
  volume={21},
  number={1},
  pages={25--45},
  doi={10.1142/S0218195911003536},
  url={https://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. Geom. 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. Geom. Appl.},
  year={2011},
  volume={21},
  number={1},
  pages={87--100},
  doi={10.1142/S0218195911003561},
  url={https://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={https://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={https://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.
Int. J. Shape Model., 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={Int. J. Shape Model.},
  year={2010},
  volume={16},
  number={1-2},
  pages={151--171},
  doi={10.1142/S0218654310001328},
  url={https://doi.org/10.1142/S0218654310001328}
}

Morphing of triangular meshes in shape space

Wuhrer, S., Bose, P., Shu, C., O’Rourke, J., and Brunton, A.
Int. J. Shape Model., 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={Int. J. Shape Model.},
  year={2010},
  volume={16},
  number={1-2},
  pages={195--212},
  doi={10.1142/S0218654310001341},
  url={https://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={https://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.
J. Comput. Geom., 1(1):41–56, 2010.

DOI 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={J. Comput. Geom.},
  year={2010},
  volume={1},
  number={1},
  pages={41--56},
  doi={10.20382/JOCG.V1I1A4},
  url={https://doi.org/10.20382/jocg.v1i1a4}
}

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={https://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={https://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={https://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={https://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={https://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={https://doi.org/10.1016/j.comgeo.2007.02.004}
}

Connectivity-preserving transformations of binary images

Bose, P., Dujmovic, V., Hurtado, F., and Morin, P.
Comput. Vis. Image Underst., 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={Comput. Vis. Image Underst.},
  year={2009},
  volume={113},
  number={10},
  pages={1027--1038},
  doi={10.1016/J.CVIU.2007.06.003},
  url={https://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.
Discret. Comput. Geom., 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={Discret. Comput. Geom.},
  year={2009},
  volume={41},
  number={4},
  pages={513--532},
  doi={10.1007/S00454-008-9127-1},
  url={https://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.
Discret. Comput. Geom., 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={Discret. Comput. Geom.},
  year={2009},
  volume={42},
  number={4},
  pages={570--585},
  doi={10.1007/S00454-008-9125-3},
  url={https://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. Geom. 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. Geom. Appl.},
  year={2009},
  volume={19},
  number={2},
  pages={119--140},
  doi={10.1142/S0218195909002861},
  url={https://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. Geom. 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. Geom. Appl.},
  year={2009},
  volume={19},
  number={6},
  pages={595--615},
  doi={10.1142/S0218195909003143},
  url={https://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={https://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={https://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={https://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={https://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 Sens. Wirel. 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 Sens. Wirel. Networks},
  year={2008},
  volume={5},
  number={1-2},
  pages={47--68},
  url={http://www.oldcitypublishing.com/journals/ahswn-home/ahswn-issue-contents/ahswn-volume-5-number-1-2-2008/ahswn-5-1-2-p-47-68/}
}

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={https://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={https://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.
Electron. Notes Discret. Math., 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={Electron. Notes Discret. Math.},
  year={2008},
  volume={31},
  pages={213--218},
  doi={10.1016/J.ENDM.2008.06.042},
  url={https://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={https://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.
J. 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={J. Graph Theory},
  year={2008},
  volume={58},
  number={3},
  pages={191--209},
  doi={10.1002/JGT.20302},
  url={https://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 Comput., 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 Comput.},
  year={2008},
  volume={34},
  number={1},
  pages={47--62},
  doi={10.1016/J.PARCO.2007.11.004},
  url={https://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={https://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={https://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={https://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.
Discret. Comput. Geom., 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={Discret. Comput. Geom.},
  year={2007},
  volume={37},
  number={3},
  pages={325--339},
  doi={10.1007/S00454-006-1287-2},
  url={https://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. Geom. 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. Geom. Appl.},
  year={2007},
  volume={17},
  number={6},
  pages={529--554},
  doi={10.1142/S0218195907002471},
  url={https://doi.org/10.1142/S0218195907002471}
}

Posture invariant correspondence of incomplete triangular manifolds

Wuhrer, S., Shu, C., Bose, P., and Azouz, Z. B.
Int. J. Shape Model., 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={Int. J. Shape Model.},
  year={2007},
  volume={13},
  number={2},
  pages={139--157},
  doi={10.1142/S0218654307000981},
  url={https://doi.org/10.1142/S0218654307000981}
}

Simultaneous diagonal flips in plane triangulations

Bose, P., Czyzowicz, J., Gao, Z., Morin, P., and Wood, D. R.
J. 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={J. Graph Theory},
  year={2007},
  volume={54},
  number={4},
  pages={307--330},
  doi={10.1002/JGT.20214},
  url={https://doi.org/10.1002/jgt.20214}
}

Induced subgraphs of bounded degree and bounded treewidth

Bose, P., Dujmovic, V., and Wood, D. R.
Contributions Discret. Math., 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 Discret. Math.},
  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={https://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={https://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={https://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. Discret. 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. Discret. Math.},
  year={2006},
  volume={20},
  number={2},
  pages={412--427},
  doi={10.1137/S0895480197318088},
  url={https://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={https://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={https://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. Geom. 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. Geom. Appl.},
  year={2005},
  volume={15},
  number={6},
  pages={591--608},
  doi={10.1142/S0218195905001877},
  url={https://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={https://doi.org/10.1016/j.jda.2003.12.004}
}

Testing the quality of manufactured disks and balls

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

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={2004},
  volume={38},
  number={1},
  pages={161--177},
  doi={10.1007/S00453-003-1048-Z},
  url={https://doi.org/10.1007/s00453-003-1048-z}
}

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={https://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={https://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={https://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.
Discret. Math., 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={Discret. Math.},
  year={2004},
  volume={282},
  number={1-3},
  pages={35--41},
  doi={10.1016/J.DISC.2003.12.003},
  url={https://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={https://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.

DOI 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},
  doi={10.7155/JGAA.00079},
  url={https://doi.org/10.7155/jgaa.00079}
}

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={https://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={https://doi.org/10.1016/j.tcs.2004.05.019}
}

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={https://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={https://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={https://doi.org/10.1016/S0925-7721(03)00027-0}
}

Properties of arrangement graphs

Bose, P., Everett, H., and Wismath, S. K.
Int. J. Comput. Geom. 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. Geom. Appl.},
  year={2003},
  volume={13},
  number={6},
  pages={447--462},
  doi={10.1142/S0218195903001281},
  url={https://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={https://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={https://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.
Comput. Aided Des., 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={Comput. Aided Des.},
  year={2002},
  volume={34},
  number={8},
  pages={547--559},
  doi={10.1016/S0010-4485(01)00119-1},
  url={https://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.
Comput. Aided Geom. Des., 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={Comput. Aided Geom. Des.},
  year={2002},
  volume={19},
  number={7},
  pages={533--552},
  doi={10.1016/S0167-8396(02)00133-4},
  url={https://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={https://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={https://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. Geom. 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. Geom. Appl.},
  year={2002},
  volume={12},
  number={4},
  pages={283--296},
  doi={10.1142/S021819590200089X},
  url={https://doi.org/10.1142/S021819590200089X}
}

An improved algorithm for subdivision traversal without extra storage

Bose, P. and Morin, P.
Int. J. Comput. Geom. 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. Geom. Appl.},
  year={2002},
  volume={12},
  number={4},
  pages={297--308},
  doi={10.1142/S0218195902000906},
  url={https://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. Geom. 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. Geom. Appl.},
  year={2002},
  volume={12},
  number={6},
  pages={445--454},
  doi={10.1142/S0218195902000979},
  url={https://doi.org/10.1142/S0218195902000979}
}

Finding specified sections of arrangements: 2d results

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

DOI URL

@article{DBLP:journals/jmma/BoseHMRRSST02,
  author={Prosenjit Bose and Ferran Hurtado and Henk Meijer and Suneeta Ramaswami and David Rappaport and Vera Sacrist{\'{a}}n and Thomas C. Shermer and Godfried T. Toussaint},
  title={Finding Specified Sections of Arrangements: 2D Results},
  journal={J. Math. Model. Algorithms},
  year={2002},
  volume={1},
  number={1},
  pages={3--16},
  doi={10.1023/A:1015648719133},
  url={https://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.
J. Interconnect. 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={J. Interconnect. Networks},
  year={2002},
  volume={3},
  number={1-2},
  pages={1--17},
  doi={10.1142/S0219265902000513},
  url={https://doi.org/10.1142/S0219265902000513}
}

Every set of disjoint line segments admits a binary tree

Bose, P., Houle, M. E., and Toussaint, G. T.
Discret. Comput. Geom., 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={Discret. Comput. Geom.},
  year={2001},
  volume={26},
  number={3},
  pages={387--410},
  doi={10.1007/S00454-001-0042-Y},
  url={https://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={https://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.
Wirel. 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={Wirel. Networks},
  year={2001},
  volume={7},
  number={6},
  pages={609--616},
  doi={10.1023/A:1012319418150},
  url={https://doi.org/10.1023/A:1012319418150}
}

Drawing nice projections of objects in space

Bose, P., Gómez, F., Ramos, P., and Toussaint, G.
J. Vis. Commun. Image Represent., 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. Vis. Commun. Image Represent.},
  year={1999},
  volume={10},
  number={2},
  pages={155--172},
  doi={10.1006/JVCI.1999.0415},
  url={https://doi.org/10.1006/jvci.1999.0415}
}

Filling polyhedral molds

Bose, P., van Kreveld, M. J., and Toussaint, G. T.
Comput. Aided Des., 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={Comput. Aided Des.},
  year={1998},
  volume={30},
  number={4},
  pages={245--254},
  doi={10.1016/S0010-4485(97)00075-4},
  url={https://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.
Comput. Aided Des., 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={Comput. Aided Des.},
  year={1998},
  volume={30},
  number={4},
  pages={267--275},
  doi={10.1016/S0010-4485(97)00073-0},
  url={https://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={https://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={https://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(3):1–16, 1998.

DOI 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={3},
  pages={1--16},
  doi={10.7155/JGAA.00006},
  url={https://doi.org/10.7155/jgaa.00006}
}

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={https://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={https://doi.org/10.1007/PL00014422}
}

Characterizing and efficiently computing quadrangulations of planar point sets

Bose, P. and Toussaint, G. T.
Comput. Aided Geom. Des., 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={Comput. Aided Geom. Des.},
  year={1997},
  volume={14},
  number={8},
  pages={763--785},
  doi={10.1016/S0167-8396(97)00013-7},
  url={https://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={https://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. Geom. 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. Geom. Appl.},
  year={1997},
  volume={7},
  number={1/2},
  pages={153--163},
  doi={10.1142/S0218195997000090},
  url={https://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(2):1–15, 1997.

DOI 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},
  number={2},
  pages={1--15},
  doi={10.7155/JGAA.00002},
  url={https://doi.org/10.7155/jgaa.00002}
}

Characterizing proximity trees

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

DOI URL

@article{DBLP:journals/algorithmica/BoseLL96,
  author={Prosenjit Bose and William J. Lenhart and Giuseppe Liotta},
  title={Characterizing Proximity Trees},
  journal={Algorithmica},
  year={1996},
  volume={16},
  number={1},
  pages={83--110},
  doi={10.1007/BF02086609},
  url={https://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={https://doi.org/10.1016/0925-7721(95)00052-6}
}

Geometric and computational aspects of gravity casting

Bose, P. and Toussaint, G. T.
Comput. Aided Des., 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={Comput. Aided Des.},
  year={1995},
  volume={27},
  number={6},
  pages={455--464},
  doi={10.1016/0010-4485(95)00018-M},
  url={https://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={https://doi.org/10.1006/jagm.1995.1028}
}

Geometric and computational aspects of manufacturing processes

Bose, P. and Toussaint, G. T.
Comput. Graph., 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={Comput. Graph.},
  year={1994},
  volume={18},
  number={4},
  pages={487--497},
  doi={10.1016/0097-8493(94)90061-2},
  url={https://doi.org/10.1016/0097-8493(94)90061-2}
}

Isoperimetric triangular enclosures with a fixed angle

Bose, P. and Carufel, J.-L. D.
J. Geom., 104(2):229–255, 2013.

DOI ISSN URL

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

A generalized Winternitz theorem

Bose, P., Carmi, P., Hurtado, F., and Morin, P.
J. Geom., 100(1-2):29–35, 2011.

DOI ISSN URL

@article{DBLP:journals/MR2845275,
  author={Prosenjit Bose and Paz Carmi and Ferran Hurtado and Pat Morin},
  title={A generalized {W}internitz theorem},
  journal={J. Geom.},
  year={2011},
  volume={100},
  number={1-2},
  pages={29--35},
  issn={0047-2468},
  doi={10.1007/s00022-011-0076-0},
  url={http://dx.doi.org/10.1007/s00022-011-0076-0}
}

Cutting circles into equal area pieces

Bose, P., Czyzowicz, J., Kranakis, E., Krizanc, D., and Maheshwari, A.
Geombinatorics, 11(1):13–20, 2001.

ISSN

@article{DBLP:journals/MR1837578,
  author={Prosenjit Bose and Jurek Czyzowicz and Evangelos Kranakis and Danny Krizanc and Anil Maheshwari},
  title={Cutting circles into equal area pieces},
  journal={Geombinatorics},
  year={2001},
  volume={11},
  number={1},
  pages={13--20},
  issn={1065-7371}
}

Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications

Bose, P. and Toussaint, G.
Stud. Locat. Anal., (15):37–66, 2000.

ISSN

@article{DBLP:journals/MR1802589,
  author={Prosenjit Bose and Godfried Toussaint},
  title={Computing the constrained {E}uclidean, geodesic and link centre of a simple polygon with applications},
  journal={Stud. Locat. Anal.},
  year={2000},
  number={15},
  pages={37--66},
  issn={1105-5162}
}

Flipping your lid

Ahn, H.-K., Bose, P., Czyzowicz, J., Hanusse, N., Kranakis, E., and Morin, P.
Geombinatorics, 10(2):57–63, 2000.

ISSN

@article{DBLP:journals/MR1784372,
  author={Hee-Kap Ahn and Prosenjit Bose and Jurek Czyzowicz and Nicolas Hanusse and Evangelos Kranakis and Pat Morin},
  title={Flipping your lid},
  journal={Geombinatorics},
  year={2000},
  volume={10},
  number={2},
  pages={57--63},
  issn={1065-7371}
}

Formalization of the general video temporal synchronization problem

Whitehead, A., Laganiere, R., and Bose, P.
Electronic Letters on Computer Vision and Image Analysis, 9(1):1–17, 2010.

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

Surface roughness of rock faces through the curvature of triangulated meshes

Lai, P., Sampson, C., and Bose, P.
Computers & Geosciences, 70:229–237, 2014.

@article{DBLP:journals/lai2014surface,
  author={Po Lai and Claire Sampson and Prosenjit Bose},
  title={Surface roughness of rock faces through the curvature of triangulated meshes},
  journal={Computers \& Geosciences},
  year={2014},
  volume={70},
  pages={229--237}
}

Visual enhancement of 3d images of rock faces for fracture mapping

Lai, P., Sampson, C., and Bose, P.
International Journal of Rock Mechanics and Mining Sciences, 72:325–335, 2014.

@article{DBLP:journals/lai2014visual,
  author={Po Lai and Claire Sampson and Prosenjit Bose},
  title={Visual enhancement of 3D images of rock faces for fracture mapping},
  journal={International Journal of Rock Mechanics and Mining Sciences},
  year={2014},
  volume={72},
  pages={325--335}
}

Algorithms for designing clamshell molds

Wuhrer, S., Bose, P., Morin, P., and Smid, M.
Computer-Aided Design and Applications, 4(1-4):1–10, 2007.

@article{DBLP:journals/wuhrer2007algorithms,
  author={Stefanie Wuhrer and Prosenjit Bose and Pat Morin and Michiel Smid},
  title={Algorithms for designing clamshell molds},
  journal={Computer-Aided Design and Applications},
  year={2007},
  volume={4},
  number={1-4},
  pages={1--10}
}

A new angle on aortic neck angulation measurement

Rockley, M., Hadziomerovic, A., van Walraven, C., Bose, P., Scallan, O., and Jetty, P.
Journal of Vascular Surgery, 70(3):756–761, 2019.

@article{DBLP:journals/aortic,
  author={Mark Rockley and Adnan Hadziomerovic and Carl van Walraven and Prosenjit Bose and Oonagh Scallan and Prasad Jetty},
  title={A new angle on aortic neck angulation measurement},
  journal={Journal of Vascular Surgery},
  year={2019},
  volume={70},
  number={3},
  pages={756--761}
}

Guarding polyhedral terrains

Bose, P., Shermer, T., Toussaint, G., and Zhu, B.
Proceedings of the Allerton Conference on Communication, Control and Computing, 1992.

@article{confmis1,
  author={Prosenjit Bose and Thomas Shermer and Godfried Toussaint and Binhai Zhu},
  title={Guarding Polyhedral Terrains},
  journal={Proceedings of the Allerton Conference on Communication, Control and Computing},
  year={1992}
}

Efficient visibility queries in simple polygons

Bose, P., Lubiw, A., and Munro, J. I.
CCCG, 1992.

@article{confmis2,
  author={Prosenjit Bose and Anna Lubiw and J. Ian Munro},
  title={Efficient Visibility Queries in Simple Polygons},
  journal={CCCG},
  year={1992}
}

Geometric and computational aspects of injection molding

Bose, P. and Toussaint, G.
M.S.I. Conference on Computational Geometry, Stony Brook, NY, 1992.

@article{confmis3,
  author={Prosenjit Bose and Godfried Toussaint},
  title={Geometric and Computational Aspects of Injection Molding},
  journal={M.S.I. Conference on Computational Geometry, Stony Brook, NY},
  year={1992}
}

Currently under review

Art gallery localization

Asymptotically optimal vertex ranking of planar graphs

On the separation of a polyhedron from its single-part mold

Pursuit-evasion in graphs: zombies, lazy zombies and a survivor

The relationship between minimum degree and maximum independent sets in planar graphs

Approximating weighted shortest paths on square and hexagonal grids

Approximating weighted shortest paths on non-overlapping disks

Routing on heavy path wspd spanners

Local routing algorithms on euclidean spanners with small diameter

Approximating average bounded-angle minimum spanning trees

On separating path and tree systems in graphs

The exact spanning ratio of the parallelogram delaunay graph

Connected dominating sets in triangulations

On the spanning and routing ratios of the yao-four graph

A parameterized algorithm for vertex and edge connectivity of embedded graphs

On the independence number of 1-planar graphs

Journal papers

Approximate shortest paths in weighted equilateral triangular meshes

Improved routing on the delaunay triangulation

On the spanning and routing ratio of theta-four

On the spanning and routing ratio of the directed theta-four graph

On approximating shortest paths in weighted triangular tessellations

Geodesic obstacle representation of graphs

Simple linear time algorithms for piercing pairwise intersecting disks

Improved routing on the delaunay triangulation

The minimum moving spanning tree problem

Competitive online search trees on trees

Bounded-angle minimum spanning trees

Computing maximum independent set on outerstring graphs and their relatives

On the spanning and routing ratios of the directed \(\Theta\)\(_\mbox6\)-graph

Drawing graphs as spanners

Separating layered treewidth and row treewidth

On the restricted k-steiner tree problem

Parameterized complexity of two-interval pattern problem

Fragile complexity of adaptive algorithms

Affine invariant triangulations

Attraction-convexity and normal visibility

Piercing pairwise intersecting geodesic disks

Local routing in wspd-based spanners

Constrained routing between non-visible vertices

Self-approaching paths in simple polygons

Optimal art gallery localization is np-hard

Hamiltonicity for convex shape delaunay and gabriel graphs

Gathering by repulsion

Local routing in convex subdivisions

Power domination on triangular grids with triangular and hexagonal shape

Expected complexity of routing in $\textbackslashtheta\_6$ and half-$\textbackslashtheta\_6$ graphs

Faster algorithms for some optimization problems on collinear points

Computing the k-visibility region of a point in a polygon

On plane constrained bounded-degree spanners

Maximum plane trees in multipartite geometric graphs

Improved bounds for guarding plane graphs with edges

Spanning properties of yao and theta-graphs in the presence of constraints

Pole dancing: 3d morphs for tree drawings

A time-space trade-off for computing the \emphk-visibility region of a point in a polygon

Improved spanning ratio for low degree plane spanners

Spanning trees in multipartite geometric graphs

Data structures for halfplane proximity queries and incremental voronoi diagrams

Continuous yao graphs

Editorial: special issue in memory of dr. ferran hurtado

Flipping edge-labelled triangulations

Constrained generalized delaunay graphs are plane spanners

Plane bichromatic trees of low degree

Routing on the visibility graph

Flips in edge-labelled pseudo-triangulations

Upper and lower bounds for online routing on delaunay triangulations

New bounds for facial nonrepetitive colouring

Competitive online routing on delaunay triangulations

Essential constraints of edge-constrained proximity graphs

Faster algorithms for the minimum red-blue-purple spanning graph problem

Towards plane spanners of degree 3

Competitive local routing with constraints

A general framework for searching on a line

Biased predecessor search

The power and limitations of static binary search trees with lazy finger

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

Probing convex polygons with a wedge

A linear-time algorithm for the geodesic center of a simple polygon

The price of order