Submitted Journal Conference Arxiv

Currently under review

  1. Asymptotically optimal vertex ranking of planar graphs


    Bose, P., Dujmovic, V., Javarsineh, M., and Morin, P.
    Submitted to Journal of Combinatorial Series B, revision submitted.

  2. Approximating shortest paths in weighted square and hexagonal grids


    Bose, P., Esteban, G., Orden, D., and Silveira, R.
    Submitted to TBD.

  3. Approximating weighted shortest paths on non-overlapping disks


    Bose, P., Esteban, G., Carufel, J.-L. D., and Maheshwari, A.
    Submitted to TBD.

  4. Local routing algorithms on euclidean spanners with small diameter


    Bonichon, N., Bose, P., and Garito, Y.
    Submitted to TBD.

  5. Approximating average bounded-angle minimum spanning trees


    Biniaz, A., Bose, P., and Devaney, P.
    Submitted to TBD.

  6. On separating path and tree systems in graphs


    Biniaz, A., Bose, P., Carufel, J.-L. D., Maheshwari, A., Miraftab, B., Odak, S., Smid, M., Smorodinsky, S., and Yuditsky, Y.
    Submitted to TBD.

  7. Connected dominating sets in triangulations


    Bose, P., Dujmovic, V., Morin, P., Houdrouge, H., and Odak, S.
    Submitted to TBD.

  8. Piercing unit geodesic disks


    Biniaz, A., Bose, P., and Shermer, T.
    Submitted to TBD.

  9. On the d-independence number of 1-planar graphs


    Biedl, T., Bose, P., and Miraftab, B.
    Submitted to TBD.

  10. The basis number of 1-planar graphs


    Bazargani, S., Biedl, T., Bose, P., Maheshwari, A., and Miraftab, B.
    Submitted to Combin. Theory.

  11. Tight bounds on the number of closest pairs in vertical slabs


    Biniaz, A., Bose, P., Chung, C., Carufel, J.-L. D., Iacono, J., Maheshwari, A., Odak, S., Smid, M., and Toth, C.
    Submitted to WADS.

  12. On geodesic disks enclosing many points


    Bose, P., Esteban, G., Orden, D., Silveira, R., and Tuttle, T.
    Submitted to WADS.

  13. Online routing in directed yao4 infinity graphs


    Bose, P., Carufel, J.-L. D., and Stuart, J.
    Submitted to WADS.

  14. On shortest path, bfs, and dfs tree graphs


    Bose, P., Madani, A., Maheshwari, A., and Miraftab, B.
    Submitted to WADS.

Journal papers

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


    Bose, P., Fogel, E., Geft, T., Halperin, D., and Shamai, S.
    Computing in Geometry and Topology, 3(1):7:1 – 7:19, 2024.
    @article{cgt98,
  author={Prosenjit Bose and Eli Fogel and Tzvika Geft and Dan Halperin and Shahar Shamai},
  title={On the Separation of a Polyhedron from Its Single-Part Mold},
  journal={Computing in Geometry and Topology},
  year={2024},
  volume={3},
  number={1},
  pages={7:1 - 7:19}
}

  2. Linear versus centred chromatic numbers


    Bose, P., Dujmovic, V., Houdrouge, H., Javarsineh, M., and Morin, P.
    Journal of Graph Theory, accepted, 2024.
    @article{bdhjm24,
  author={Prosenjit Bose and Vida Dujmovic and Hussein Houdrouge and Mehrnoosh Javarsineh and Pat Morin},
  title={Linear versus centred chromatic numbers},
  journal={Journal of Graph Theory, accepted},
  year={2024}
}

  3. Approximating the smallest k-enclosing geodesic disc in a simple polygon


    Bose, P., D’Angelo, A., and Durocher, S.
    JoCG, accepted, 2024.
    @article{BDD24,
  author={Prosenjit Bose and Anthony D'Angelo and Stephane Durocher},
  title={Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon},
  journal={JoCG, accepted},
  year={2024}
}

  4. The exact spanning ratio of the parallelogram delaunay graph


    Bose, P., Carufel, J.-L. D., and Njoo, S.
    TCS, accepted, 2025.
    @article{bcn25,
  author={Prosenjit Bose and Jean-Lou De Carufel and Sandrine Njoo},
  title={The Exact Spanning Ratio of the Parallelogram Delaunay Graph},
  journal={TCS, accepted},
  year={2025}
}

  5. On 1-planar graphs with bounded cop-number


    Bose, P., Carufel, J.-L. D., Maheshwari, A., and Murali, K.
    TCS, accepted, 2025.
    @article{bcmm125,
  author={Prosenjit Bose and Jean-Lou De Carufel and Anil Maheshwari and Karthik Murali},
  title={On 1-Planar Graphs with Bounded Cop-number},
  journal={TCS, accepted},
  year={2025}
}

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


    Bose, P., Carufel, J. D., and Shermer, T. C.
    Discret. Math., 348(1):114220, 2025.
    @article{DBLP:journals/dm/BoseCS25,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Thomas C. Shermer},
  title={Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor},
  journal={Discret. Math.},
  year={2025},
  volume={348},
  number={1},
  pages={114220}
}

  7. Routing on heavy path WSPD spanners


    Bose, P. and Tuttle, T.
    Comput. Geom., 123:102121, 2024.
    @article{DBLP:journals/comgeo/BoseT24,
  author={Prosenjit Bose and Tyler Tuttle},
  title={Routing on heavy path {WSPD} spanners},
  journal={Comput. Geom.},
  year={2024},
  volume={123},
  pages={102121}
}

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

  9. Improved spanning ratio of the theta-5 graph


    Bose, P., Hill, D., and Ooms, A.
    J. Comput. Geom., 15(1):66–87, 2024.
    @article{DBLP:journals/jocg/BoseHO24,
  author={Prosenjit Bose and Darryl Hill and Aur{\'{e}}lien Ooms},
  title={Improved spanning ratio of the Theta-5 graph},
  journal={J. Comput. Geom.},
  year={2024},
  volume={15},
  number={1},
  pages={66--87}
}

  10. A steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes


    Bose, P., Esteban, G., and Maheshwari, A.
    Theor. Comput. Sci., 1001:114583, 2024.
    @article{DBLP:journals/tcs/BoseEM24,
  author={Prosenjit Bose and Guillermo Esteban and Anil Maheshwari},
  title={A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes},
  journal={Theor. Comput. Sci.},
  year={2024},
  volume={1001},
  pages={114583}
}

  11. On approximating shortest paths in weighted triangular tessellations


    Bose, P., Esteban, G., Orden, D., and Silveira, R. I.
    Artif. Intell., 318:103898, 2023.
    @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}
}

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

  13. Simple linear time algorithms for piercing pairwise intersecting disks


    Biniaz, A., Bose, P., and Wang, Y.
    Comput. Geom., 114:102011, 2023.
    @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}
}

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

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

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

  17. Bounded-angle minimum spanning trees


    Biniaz, A., Bose, P., Lubiw, A., and Maheshwari, A.
    Algorithmica, 84(1):150–175, 2022.
    @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}
}

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

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

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

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

  22. On the restricted k-steiner tree problem


    Bose, P., D’Angelo, A., and Durocher, S.
    J. Comb. Optim., 44(4):2893–2918, 2022.
    @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}
}

  23. Parameterized complexity of two-interval pattern problem


    Bose, P., Mehrabi, S., and Mondal, D.
    Theor. Comput. Sci., 902:21–28, 2022.
    @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}
}

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

  25. Affine invariant triangulations


    Bose, P., Cano, P., and Silveira, R. I.
    Comput. Aided Geom. Des., 91:102039, 2021.
    @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}
}

  26. Attraction-convexity and normal visibility


    Bose, P. and Shermer, T. C.
    Comput. Geom., 96:101748, 2021.
    @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}
}

  27. Piercing pairwise intersecting geodesic disks


    Bose, P., Carmi, P., and Shermer, T. C.
    Comput. Geom., 98:101774, 2021.
    @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}
}

  28. Local routing in wspd-based spanners


    Carufel, J. D., Bose, P., Paradis, F., and Dujmovic, V.
    J. Comput. Geom., 12(1):1–34, 2021.
    @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}
}

  29. Constrained routing between non-visible vertices


    Bose, P., Korman, M., van Renssen, A., and Verdonschot, S.
    Theor. Comput. Sci., 861:144–154, 2021.
    @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}
}

  30. Self-approaching paths in simple polygons


    Bose, P., Kostitsyna, I., and Langerman, S.
    Comput. Geom., 87:101595, 2020.
    @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}
}

  31. Optimal art gallery localization is np-hard


    Bose, P., Carufel, J. D., Shaikhet, A., and Smid, M. H. M.
    Comput. Geom., 88:101607, 2020.
    @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}
}

  32. Hamiltonicity for convex shape delaunay and gabriel graphs


    Bose, P., Cano, P., Saumell, M., and Silveira, R. I.
    Comput. Geom., 89:101629, 2020.
    @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}
}

  33. Gathering by repulsion


    Bose, P. and Shermer, T. C.
    Comput. Geom., 90:101627, 2020.
    @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}
}

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

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

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

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

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

  39. On plane constrained bounded-degree spanners


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    Algorithmica, 81(4):1392–1415, 2019.
    @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}
}

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

  41. Improved bounds for guarding plane graphs with edges


    Biniaz, A., Bose, P., Ooms, A., and Verdonschot, S.
    Graphs Comb., 35(2):437–450, 2019.
    @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}
}

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

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

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

  45. Improved spanning ratio for low degree plane spanners


    Bose, P., Hill, D., and Smid, M. H. M.
    Algorithmica, 80(3):935–976, 2018.
    @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}
}

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

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

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

  49. Editorial: special issue in memory of dr. ferran hurtado


    Bose, P. and Ramos, P.
    Comput. Geom., 68:1, 2018.
    @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}
}

  50. Flipping edge-labelled triangulations


    Bose, P., Lubiw, A., Pathak, V., and Verdonschot, S.
    Comput. Geom., 68:309–326, 2018.
    @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}
}

  51. Constrained generalized delaunay graphs are plane spanners


    Bose, P., Carufel, J. D., and van Renssen, A.
    Comput. Geom., 74:50–65, 2018.
    @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}
}

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

  53. Routing on the visibility graph


    Bose, P., Korman, M., Verdonschot, S., and van Renssen, A.
    J. Comput. Geom., 9(1):430–453, 2018.
    @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}
}

  54. Flips in edge-labelled pseudo-triangulations


    Bose, P. and Verdonschot, S.
    Comput. Geom., 60:45–54, 2017.
    @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}
}

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

  56. New bounds for facial nonrepetitive colouring


    Bose, P., Dujmovic, V., Morin, P., and Rioux-Maldague, L.
    Graphs Comb., 33(4):817–832, 2017.
    @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}
}

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

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

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

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

  61. Competitive local routing with constraints


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    J. Comput. Geom., 8(1):125–152, 2017.
    @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}
}

  62. A general framework for searching on a line


    Bose, P. and Carufel, J. D.
    Theor. Comput. Sci., 703:1–17, 2017.
    @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}
}

  63. Biased predecessor search


    Bose, P., Fagerberg, R., Howat, J., and Morin, P.
    Algorithmica, 76(4):1097–1105, 2016.
    @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}
}

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

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


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

  66. Probing convex polygons with a wedge


    Bose, P., Carufel, J. D., Shaikhet, A., and Smid, M. H. M.
    Comput. Geom., 58:34–59, 2016.
    @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}
}

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

  68. The price of order


    Bose, P., Morin, P., and van Renssen, A.
    Int. J. Comput. Geom. Appl., 26(3-4):135–150, 2016.
    @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}
}

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

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

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


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

  72. Visibility-monotonic polygon deflation


    Bose, P., Dujmovic, V., Hoda, N., and Morin, P.
    Contributions Discret. Math., 10(1), 2015.
    @article{DBLP:journals/cdm/BoseDHM15,
  author={Prosenjit Bose and Vida Dujmovic and Nima Hoda and Pat Morin},
  title={Visibility-monotonic polygon deflation},
  journal={Contributions Discret. Math.},
  year={2015},
  volume={10},
  number={1}
}

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


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

  74. Reprint of: theta-3 is connected


    Aichholzer, O., Bae, S. W., Barba, L., Bose, P., Korman, M., van Renssen, A., Taslakian, P., and Verdonschot, S.
    Comput. Geom., 48(5):407–414, 2015.
    @article{DBLP:journals/comgeo/AichholzerBBBKR15,
  author={Oswin Aichholzer and Sang Won Bae and Luis Barba and Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
  title={Reprint of: Theta-3 is connected},
  journal={Comput. Geom.},
  year={2015},
  volume={48},
  number={5},
  pages={407--414}
}

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

  76. Optimal data structures for farthest-point queries in cactus networks


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

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

  78. Optimal local routing on delaunay triangulations defined by empty equilateral triangles


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

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


    Bose, P., Carufel, J. D., and Durocher, S.
    Theor. Comput. Sci., 569:24–42, 2015.
    @article{DBLP:journals/tcs/BoseCD15,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Stephane Durocher},
  title={Searching on a line: {A} complete characterization of the optimal solution},
  journal={Theor. Comput. Sci.},
  year={2015},
  volume={569},
  pages={24--42}
}

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


    Bose, P., Carmi, P., Damian, M., Flatland, R. Y., Katz, M. J., and Maheshwari, A.
    Algorithmica, 69(2):397–409, 2014.
    @article{DBLP:journals/algorithmica/BoseCDFKM14,
  author={Prosenjit Bose and Paz Carmi and Mirela Damian and Robin Y. Flatland and Matthew J. Katz and Anil Maheshwari},
  title={Switching to Directional Antennas with Constant Increase in Radius and Hop Distance},
  journal={Algorithmica},
  year={2014},
  volume={69},
  number={2},
  pages={397--409}
}

  81. Minimum-area enclosing triangle with a fixed angle


    Bose, P. and Carufel, J. D.
    Comput. Geom., 47(1):90–109, 2014.
    @article{DBLP:journals/comgeo/BoseC14,
  author={Prosenjit Bose and Jean{-}Lou De Carufel},
  title={Minimum-area enclosing triangle with a fixed angle},
  journal={Comput. Geom.},
  year={2014},
  volume={47},
  number={1},
  pages={90--109}
}

  82. Making triangulations 4-connected using flips


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

  83. Triangulating and guarding realistic polygons


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

  84. Theta-3 is connected


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

  85. Surface roughness of rock faces through the curvature of triangulated meshes


    Lai, P., Samson, C., and Bose, P.
    Comput. Geosci., 70:229–237, 2014.
    @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}
}

  86. Stable roommates spanner


    Bose, P., Carmi, P., Chaitman-Yerushalmi, L., Collette, S., Katz, M. J., and Langerman, S.
    Comput. Geom., 46(2):120–130, 2013.
    @article{DBLP:journals/comgeo/BoseCCCKL13,
  author={Prosenjit Bose and Paz Carmi and Lilach Chaitman{-}Yerushalmi and S{\'{e}}bastien Collette and Matthew J. Katz and Stefan Langerman},
  title={Stable Roommates Spanner},
  journal={Comput. Geom.},
  year={2013},
  volume={46},
  number={2},
  pages={120--130}
}

  87. Some properties of k-delaunay and k-gabriel graphs


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

  88. Fast local searches and updates in bounded universes


    Bose, P., Douïeb, K., Dujmovic, V., Howat, J., and Morin, P.
    Comput. Geom., 46(2):181–189, 2013.
    @article{DBLP:journals/comgeo/BoseDDHM13,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Vida Dujmovic and John Howat and Pat Morin},
  title={Fast local searches and updates in bounded universes},
  journal={Comput. Geom.},
  year={2013},
  volume={46},
  number={2},
  pages={181--189}
}

  89. On plane geometric spanners: A survey and open problems


    Bose, P. and Smid, M. H. M.
    Comput. Geom., 46(7):818–830, 2013.
    @article{DBLP:journals/comgeo/BoseS13,
  author={Prosenjit Bose and Michiel H. M. Smid},
  title={On plane geometric spanners: {A} survey and open problems},
  journal={Comput. Geom.},
  year={2013},
  volume={46},
  number={7},
  pages={818--830}
}

  90. Bounding the locality of distributed routing algorithms


    Bose, P., Carmi, P., and Durocher, S.
    Distributed Comput., 26(1):39–58, 2013.
    @article{DBLP:journals/dc/BoseCD13,
  author={Prosenjit Bose and Paz Carmi and Stephane Durocher},
  title={Bounding the locality of distributed routing algorithms},
  journal={Distributed Comput.},
  year={2013},
  volume={26},
  number={1},
  pages={39--58}
}

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

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

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

  94. Robust geometric spanners


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

  95. Layered working-set trees


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

  96. Editorial


    Bose, P. and Carmi, P.
    Comput. Geom., 45(9):475, 2012.
    @article{DBLP:journals/comgeo/BoseC12,
  author={Prosenjit Bose and Paz Carmi},
  title={Editorial},
  journal={Comput. Geom.},
  year={2012},
  volume={45},
  number={9},
  pages={475}
}

  97. \(\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.
    @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}
}

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

  99. Automatically creating design models from 3d anthropometry data


    Wuhrer, S., Shu, C., and Bose, P.
    J. Comput. Inf. Sci. Eng., 12(4), 2012.
    @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}
}

  100. A distribution-sensitive dictionary with low space overhead


    Bose, P., Howat, J., and Morin, P.
    J. Discrete Algorithms, 10:140–145, 2012.
    @article{DBLP:journals/jda/BoseHM12,
  author={Prosenjit Bose and John Howat and Pat Morin},
  title={A distribution-sensitive dictionary with low space overhead},
  journal={J. Discrete Algorithms},
  year={2012},
  volume={10},
  pages={140--145}
}

  101. Skip lift: A probabilistic alternative to red-black trees


    Bose, P., Douïeb, K., and Morin, P.
    J. Discrete Algorithms, 14:13–20, 2012.
    @article{DBLP:journals/jda/BoseDM12,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Pat Morin},
  title={Skip lift: {A} probabilistic alternative to red-black trees},
  journal={J. Discrete Algorithms},
  year={2012},
  volume={14},
  pages={13--20}
}

  102. On bounded degree plane strong geometric spanners


    Bose, P., Carmi, P., and Chaitman-Yerushalmi, L.
    J. Discrete Algorithms, 15:16–31, 2012.
    @article{DBLP:journals/jda/BoseCC12,
  author={Prosenjit Bose and Paz Carmi and Lilach Chaitman{-}Yerushalmi},
  title={On bounded degree plane strong geometric spanners},
  journal={J. Discrete Algorithms},
  year={2012},
  volume={15},
  pages={16--31}
}

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

  104. Location-oblivious distributed unit disk graph coloring


    Barbeau, M., Bose, P., Carmi, P., Couture, M., and Kranakis, E.
    Algorithmica, 60(2):236–249, 2011.
    @article{DBLP:journals/algorithmica/BarbeauBCCK11,
  author={Michel Barbeau and Prosenjit Bose and Paz Carmi and Mathieu Couture and Evangelos Kranakis},
  title={Location-Oblivious Distributed Unit Disk Graph Coloring},
  journal={Algorithmica},
  year={2011},
  volume={60},
  number={2},
  pages={236--249}
}

  105. A note on the perimeter of fat objects


    Bose, P., Cheong, O., and Dujmovic, V.
    Comput. Geom., 44(1):1–8, 2011.
    @article{DBLP:journals/comgeo/BoseCD11,
  author={Prosenjit Bose and Otfried Cheong and Vida Dujmovic},
  title={A note on the perimeter of fat objects},
  journal={Comput. Geom.},
  year={2011},
  volume={44},
  number={1},
  pages={1--8}
}

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


    Bose, P., Devroye, L., Löffler, M., Snoeyink, J., and Verma, V.
    Comput. Geom., 44(2):121–127, 2011.
    @article{DBLP:journals/comgeo/BoseDLSV11,
  author={Prosenjit Bose and Luc Devroye and Maarten L{\"{o}}ffler and Jack Snoeyink and Vishal Verma},
  title={Almost all Delaunay triangulations have stretch factor greater than pi/2},
  journal={Comput. Geom.},
  year={2011},
  volume={44},
  number={2},
  pages={121--127}
}

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


    Bose, P., Carmi, P., Couture, M., Smid, M. H. M., and Xu, D.
    Comput. Geom., 44(6-7):319–328, 2011.
    @article{DBLP:journals/comgeo/BoseCCSX11,
  author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Michiel H. M. Smid and Daming Xu},
  title={On a family of strong geometric spanners that admit local routing strategies},
  journal={Comput. Geom.},
  year={2011},
  volume={44},
  number={6-7},
  pages={319--328}
}

  108. A survey of geodesic paths on 3d surfaces


    Bose, P., Maheshwari, A., Shu, C., and Wuhrer, S.
    Comput. Geom., 44(9):486–498, 2011.
    @article{DBLP:journals/comgeo/BoseMSW11,
  author={Prosenjit Bose and Anil Maheshwari and Chang Shu and Stefanie Wuhrer},
  title={A survey of geodesic paths on 3D surfaces},
  journal={Comput. Geom.},
  year={2011},
  volume={44},
  number={9},
  pages={486--498}
}

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

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

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

  112. Spanners of additively weighted point sets


    Bose, P., Carmi, P., and Couture, M.
    J. Discrete Algorithms, 9(3):287–298, 2011.
    @article{DBLP:journals/jda/BoseCC11,
  author={Prosenjit Bose and Paz Carmi and Mathieu Couture},
  title={Spanners of additively weighted point sets},
  journal={J. Discrete Algorithms},
  year={2011},
  volume={9},
  number={3},
  pages={287--298}
}

  113. Computing the greedy spanner in near-quadratic time


    Bose, P., Carmi, P., Farshi, M., Maheshwari, A., and Smid, M. H. M.
    Algorithmica, 58(3):711–729, 2010.
    @article{DBLP:journals/algorithmica/BoseCFMS10,
  author={Prosenjit Bose and Paz Carmi and Mohammad Farshi and Anil Maheshwari and Michiel H. M. Smid},
  title={Computing the Greedy Spanner in Near-Quadratic Time},
  journal={Algorithmica},
  year={2010},
  volume={58},
  number={3},
  pages={711--729}
}

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

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

  116. Sigma-local graphs


    Bose, P., Collette, S., Langerman, S., Maheshwari, A., Morin, P., and Smid, M. H. M.
    J. Discrete Algorithms, 8(1):15–23, 2010.
    @article{DBLP:journals/jda/BoseCLMMS10,
  author={Prosenjit Bose and S{\'{e}}bastien Collette and Stefan Langerman and Anil Maheshwari and Pat Morin and Michiel H. M. Smid},
  title={Sigma-local graphs},
  journal={J. Discrete Algorithms},
  year={2010},
  volume={8},
  number={1},
  pages={15--23}
}

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

  118. Clamshell casting


    Bose, P., Morin, P., Smid, M. H. M., and Wuhrer, S.
    Algorithmica, 55(4):666–702, 2009.
    @article{DBLP:journals/algorithmica/BoseMSW09,
  author={Prosenjit Bose and Pat Morin and Michiel H. M. Smid and Stefanie Wuhrer},
  title={Clamshell Casting},
  journal={Algorithmica},
  year={2009},
  volume={55},
  number={4},
  pages={666--702}
}

  119. Flips in planar graphs


    Bose, P. and Hurtado, F.
    Comput. Geom., 42(1):60–80, 2009.
    @article{DBLP:journals/comgeo/BoseH09,
  author={Prosenjit Bose and Ferran Hurtado},
  title={Flips in planar graphs},
  journal={Comput. Geom.},
  year={2009},
  volume={42},
  number={1},
  pages={60--80}
}

  120. Geometric spanners with small chromatic number


    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Smid, M. H. M., and Zeh, N.
    Comput. Geom., 42(2):134–146, 2009.
    @article{DBLP:journals/comgeo/BoseCCMSZ09,
  author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Anil Maheshwari and Michiel H. M. Smid and Norbert Zeh},
  title={Geometric spanners with small chromatic number},
  journal={Comput. Geom.},
  year={2009},
  volume={42},
  number={2},
  pages={134--146}
}

  121. A linear-space algorithm for distance preserving graph embedding


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

  122. Editorial CCCG 2005


    Bose, P. and Mukhopadhyay, A.
    Comput. Geom., 42(5):363, 2009.
    @article{DBLP:journals/comgeo/BoseM09,
  author={Prosenjit Bose and Asish Mukhopadhyay},
  title={Editorial {CCCG} 2005},
  journal={Comput. Geom.},
  year={2009},
  volume={42},
  number={5},
  pages={363}
}

  123. Rotationally monotone polygons


    Bose, P., Morin, P., Smid, M. H. M., and Wuhrer, S.
    Comput. Geom., 42(5):471–483, 2009.
    @article{DBLP:journals/comgeo/BoseMSW09,
  author={Prosenjit Bose and Pat Morin and Michiel H. M. Smid and Stefanie Wuhrer},
  title={Rotationally monotone polygons},
  journal={Comput. Geom.},
  year={2009},
  volume={42},
  number={5},
  pages={471--483}
}

  124. Connectivity-preserving transformations of binary images


    Bose, P., Dujmovic, V., Hurtado, F., and Morin, P.
    Comput. Vis. Image Underst., 113(10):1027–1038, 2009.
    @article{DBLP:journals/cviu/BoseDHM09,
  author={Prosenjit Bose and Vida Dujmovic and Ferran Hurtado and Pat Morin},
  title={Connectivity-preserving transformations of binary images},
  journal={Comput. Vis. Image Underst.},
  year={2009},
  volume={113},
  number={10},
  pages={1027--1038}
}

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

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

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

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

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


    Bose, P.
    Int. J. Comput. Math., 86(4):577–583, 2009.
    @article{DBLP:journals/ijcm/Bose09,
  author={Prosenjit Bose},
  title={A note on the lower bound of edge guards of polyhedral terrains},
  journal={Int. J. Comput. Math.},
  year={2009},
  volume={86},
  number={4},
  pages={577--583}
}

  130. Algorithms for optimal outlier removal


    Atanassov, R., Bose, P., Couture, M., Maheshwari, A., Morin, P., Paquette, M., Smid, M. H. M., and Wuhrer, S.
    J. Discrete Algorithms, 7(2):239–248, 2009.
    @article{DBLP:journals/jda/AtanassovBCMMPSW09,
  author={Rossen Atanassov and Prosenjit Bose and Mathieu Couture and Anil Maheshwari and Pat Morin and Michel Paquette and Michiel H. M. Smid and Stefanie Wuhrer},
  title={Algorithms for optimal outlier removal},
  journal={J. Discrete Algorithms},
  year={2009},
  volume={7},
  number={2},
  pages={239--248}
}

  131. Augmented reality on cloth with realistic illumination


    Bradley, D., Roth, G., and Bose, P.
    Mach. Vis. Appl., 20(2):85–92, 2009.
    @article{DBLP:journals/mva/BradleyRB09,
  author={Derek Bradley and Gerhard Roth and Prosenjit Bose},
  title={Augmented reality on cloth with realistic illumination},
  journal={Mach. Vis. Appl.},
  year={2009},
  volume={20},
  number={2},
  pages={85--92}
}

  132. Spanners of complete k-partite geometric graphs


    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Morin, P., and Smid, M. H. M.
    SIAM J. Comput., 38(5):1803–1820, 2009.
    @article{DBLP:journals/siamcomp/BoseCCMMS09,
  author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Anil Maheshwari and Pat Morin and Michiel H. M. Smid},
  title={Spanners of Complete k-Partite Geometric Graphs},
  journal={{SIAM} J. Comput.},
  year={2009},
  volume={38},
  number={5},
  pages={1803--1820}
}

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

  134. Editorial


    Bose, P. and Fevens, T.
    Comput. Geom., 39(1):1, 2008.
    @article{DBLP:journals/comgeo/BoseF08,
  author={Prosenjit Bose and Thomas Fevens},
  title={Editorial},
  journal={Comput. Geom.},
  year={2008},
  volume={39},
  number={1},
  pages={1}
}

  135. On local transformations in plane geometric graphs embedded on small grids


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

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

  137. On the false-positive rate of bloom filters


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

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

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

  140. Reconfiguring triangulations with edge flips and point moves


    Aloupis, G., Bose, P., and Morin, P.
    Algorithmica, 47(4):367–378, 2007.
    @article{DBLP:journals/algorithmica/AloupisBM07,
  author={Greg Aloupis and Prosenjit Bose and Pat Morin},
  title={Reconfiguring Triangulations with Edge Flips and Point Moves},
  journal={Algorithmica},
  year={2007},
  volume={47},
  number={4},
  pages={367--378}
}

  141. On the stabbing number of a random delaunay triangulation


    Bose, P. and Devroye, L.
    Comput. Geom., 36(2):89–105, 2007.
    @article{DBLP:journals/comgeo/BoseD07,
  author={Prosenjit Bose and Luc Devroye},
  title={On the stabbing number of a random Delaunay triangulation},
  journal={Comput. Geom.},
  year={2007},
  volume={36},
  number={2},
  pages={89--105}
}

  142. Space-efficient geometric divide-and-conquer algorithms


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

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

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

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

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

  147. Induced subgraphs of bounded degree and bounded treewidth


    Bose, P., Dujmovic, V., and Wood, D. R.
    Contributions Discret. Math., 1(1), 2006.
    @article{DBLP:journals/cdm/BoseDW06,
  author={Prosenjit Bose and Vida Dujmovic and David R. Wood},
  title={Induced Subgraphs of Bounded Degree and Bounded Treewidth},
  journal={Contributions Discret. Math.},
  year={2006},
  volume={1},
  number={1}
}

  148. Equitable subdivisions within polygonal regions


    Bereg, S., Bose, P., and Kirkpatrick, D. G.
    Comput. Geom., 34(1):20–27, 2006.
    @article{DBLP:journals/comgeo/BeregBK06,
  author={Sergey Bereg and Prosenjit Bose and David G. Kirkpatrick},
  title={Equitable subdivisions within polygonal regions},
  journal={Comput. Geom.},
  year={2006},
  volume={34},
  number={1},
  pages={20--27}
}

  149. Partitions of complete geometric graphs into plane trees


    Bose, P., Hurtado, F., Rivera-Campo, E., and Wood, D. R.
    Comput. Geom., 34(2):116–125, 2006.
    @article{DBLP:journals/comgeo/BoseHRW06,
  author={Prosenjit Bose and Ferran Hurtado and Eduardo Rivera{-}Campo and David R. Wood},
  title={Partitions of complete geometric graphs into plane trees},
  journal={Comput. Geom.},
  year={2006},
  volume={34},
  number={2},
  pages={116--125}
}

  150. Area-preserving approximations of polygonal paths


    Bose, P., Cabello, S., Cheong, O., Gudmundsson, J., van Kreveld, M. J., and Speckmann, B.
    J. Discrete Algorithms, 4(4):554–566, 2006.
    @article{DBLP:journals/jda/BoseCCGKS06,
  author={Prosenjit Bose and Sergio Cabello and Otfried Cheong and Joachim Gudmundsson and Marc J. van Kreveld and Bettina Speckmann},
  title={Area-preserving approximations of polygonal paths},
  journal={J. Discrete Algorithms},
  year={2006},
  volume={4},
  number={4},
  pages={554--566}
}

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

  152. Guest editors’ foreword


    Bose, P. and Morin, P.
    Algorithmica, 42(1):1–2, 2005.
    @article{DBLP:journals/algorithmica/BoseM05,
  author={Prosenjit Bose and Pat Morin},
  title={Guest Editors' Foreword},
  journal={Algorithmica},
  year={2005},
  volume={42},
  number={1},
  pages={1--2}
}

  153. Constructing plane spanners of bounded degree and low weight


    Bose, P., Gudmundsson, J., and Smid, M. H. M.
    Algorithmica, 42(3-4):249–264, 2005.
    @article{DBLP:journals/algorithmica/BoseGS05,
  author={Prosenjit Bose and Joachim Gudmundsson and Michiel H. M. Smid},
  title={Constructing Plane Spanners of Bounded Degree and Low Weight},
  journal={Algorithmica},
  year={2005},
  volume={42},
  number={3-4},
  pages={249--264}
}

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

  155. Optimizing a constrained convex polygonal annulus


    Barequet, G., Bose, P., Dickerson, M. T., and Goodrich, M. T.
    J. Discrete Algorithms, 3(1):1–26, 2005.
    @article{DBLP:journals/jda/BarequetBDG05,
  author={Gill Barequet and Prosenjit Bose and Matthew T. Dickerson and Michael T. Goodrich},
  title={Optimizing a constrained convex polygonal annulus},
  journal={J. Discrete Algorithms},
  year={2005},
  volume={3},
  number={1},
  pages={1--26}
}

  156. Testing the quality of manufactured disks and balls


    Bose, P. and Morin, P.
    Algorithmica, 38(1):161–177, 2004.
    @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}
}

  157. On simplifying dot maps


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

  158. Ordered theta graphs


    Bose, P., Gudmundsson, J., and Morin, P.
    Comput. Geom., 28(1):11–18, 2004.
    @article{DBLP:journals/comgeo/BoseGM04,
  author={Prosenjit Bose and Joachim Gudmundsson and Pat Morin},
  title={Ordered theta graphs},
  journal={Comput. Geom.},
  year={2004},
  volume={28},
  number={1},
  pages={11--18}
}

  159. Approximating geometric bottleneck shortest paths


    Bose, P., Maheshwari, A., Narasimhan, G., Smid, M. H. M., and Zeh, N.
    Comput. Geom., 29(3):233–249, 2004.
    @article{DBLP:journals/comgeo/BoseMNSZ04,
  author={Prosenjit Bose and Anil Maheshwari and Giri Narasimhan and Michiel H. M. Smid and Norbert Zeh},
  title={Approximating geometric bottleneck shortest paths},
  journal={Comput. Geom.},
  year={2004},
  volume={29},
  number={3},
  pages={233--249}
}

  160. Light edges in degree-constrained graphs


    Bose, P., Smid, M. H. M., and Wood, D. R.
    Discret. Math., 282(1-3):35–41, 2004.
    @article{DBLP:journals/dm/BoseSW04,
  author={Prosenjit Bose and Michiel H. M. Smid and David R. Wood},
  title={Light edges in degree-constrained graphs},
  journal={Discret. Math.},
  year={2004},
  volume={282},
  number={1-3},
  pages={35--41}
}

  161. Packing two disks into a polygonal environment


    Bose, P., Morin, P., and Vigneron, A.
    J. Discrete Algorithms, 2(3):373–380, 2004.
    @article{DBLP:journals/jda/BoseMV04,
  author={Prosenjit Bose and Pat Morin and Antoine Vigneron},
  title={Packing two disks into a polygonal environment},
  journal={J. Discrete Algorithms},
  year={2004},
  volume={2},
  number={3},
  pages={373--380}
}

  162. The maximum number of edges in a three-dimensional grid-drawing


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

  163. Online routing in triangulations


    Bose, P. and Morin, P.
    SIAM J. Comput., 33(4):937–951, 2004.
    @article{DBLP:journals/siamcomp/BoseM04,
  author={Prosenjit Bose and Pat Morin},
  title={Online Routing in Triangulations},
  journal={{SIAM} J. Comput.},
  year={2004},
  volume={33},
  number={4},
  pages={937--951}
}

  164. Competitive online routing in geometric graphs


    Bose, P. and Morin, P.
    Theor. Comput. Sci., 324(2-3):273–288, 2004.
    @article{DBLP:journals/tcs/BoseM04,
  author={Prosenjit Bose and Pat Morin},
  title={Competitive online routing in geometric graphs},
  journal={Theor. Comput. Sci.},
  year={2004},
  volume={324},
  number={2-3},
  pages={273--288}
}

  165. Fast approximations for sums of distances, clustering and the fermat-weber problem


    Bose, P., Maheshwari, A., and Morin, P.
    Comput. Geom., 24(3):135–146, 2003.
    @article{DBLP:journals/comgeo/BoseMM03,
  author={Prosenjit Bose and Anil Maheshwari and Pat Morin},
  title={Fast approximations for sums of distances, clustering and the Fermat-Weber problem},
  journal={Comput. Geom.},
  year={2003},
  volume={24},
  number={3},
  pages={135--146}
}

  166. Translating a regular grid over a point set


    Bose, P., van Kreveld, M. J., Maheshwari, A., Morin, P., and Morrison, J.
    Comput. Geom., 25(1-2):21–34, 2003.
    @article{DBLP:journals/comgeo/BoseKMMM03,
  author={Prosenjit Bose and Marc J. van Kreveld and Anil Maheshwari and Pat Morin and Jason Morrison},
  title={Translating a regular grid over a point set},
  journal={Comput. Geom.},
  year={2003},
  volume={25},
  number={1-2},
  pages={21--34}
}

  167. Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces


    Bose, P., Kirkpatrick, D. G., and Li, Z.
    Comput. Geom., 26(3):209–219, 2003.
    @article{DBLP:journals/comgeo/BoseKL03,
  author={Prosenjit Bose and David G. Kirkpatrick and Zaiqing Li},
  title={Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces},
  journal={Comput. Geom.},
  year={2003},
  volume={26},
  number={3},
  pages={209--219}
}

  168. Properties of arrangement graphs


    Bose, P., Everett, H., and Wismath, S. K.
    Int. J. Comput. Geom. Appl., 13(6):447–462, 2003.
    @article{DBLP:journals/ijcga/BoseEW03,
  author={Prosenjit Bose and Hazel Everett and Stephen K. Wismath},
  title={Properties of Arrangement Graphs},
  journal={Int. J. Comput. Geom. Appl.},
  year={2003},
  volume={13},
  number={6},
  pages={447--462}
}

  169. Asymmetric communication protocols via hotlink assignments


    Bose, P., Krizanc, D., Langerman, S., and Morin, P.
    Theory Comput. Syst., 36(6):655–661, 2003.
    @article{DBLP:journals/mst/BoseKLM03,
  author={Prosenjit Bose and Danny Krizanc and Stefan Langerman and Pat Morin},
  title={Asymmetric Communication Protocols via Hotlink Assignments},
  journal={Theory Comput. Syst.},
  year={2003},
  volume={36},
  number={6},
  pages={655--661}
}

  170. Some aperture-angle optimization problems


    Bose, P., Hurtado, F., Omaña-Pulido, E., Snoeyink, J., and Toussaint, G. T.
    Algorithmica, 33(4):411–435, 2002.
    @article{DBLP:journals/algorithmica/BoseHOST02,
  author={Prosenjit Bose and Ferran Hurtado and Elsa Oma{\~{n}}a{-}Pulido and Jack Snoeyink and Godfried T. Toussaint},
  title={Some Aperture-Angle Optimization Problems},
  journal={Algorithmica},
  year={2002},
  volume={33},
  number={4},
  pages={411--435}
}

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

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

  173. On embedding an outer-planar graph in a point set


    Bose, P.
    Comput. Geom., 23(3):303–312, 2002.
    @article{DBLP:journals/comgeo/Bose02,
  author={Prosenjit Bose},
  title={On embedding an outer-planar graph in a point set},
  journal={Comput. Geom.},
  year={2002},
  volume={23},
  number={3},
  pages={303--312}
}

  174. Efficient visibility queries in simple polygons


    Bose, P., Lubiw, A., and Munro, J. I.
    Comput. Geom., 23(3):313–335, 2002.
    @article{DBLP:journals/comgeo/BoseLM02,
  author={Prosenjit Bose and Anna Lubiw and J. Ian Munro},
  title={Efficient visibility queries in simple polygons},
  journal={Comput. Geom.},
  year={2002},
  volume={23},
  number={3},
  pages={313--335}
}

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

  176. An improved algorithm for subdivision traversal without extra storage


    Bose, P. and Morin, P.
    Int. J. Comput. Geom. Appl., 12(4):297–308, 2002.
    @article{DBLP:journals/ijcga/BoseM02,
  author={Prosenjit Bose and Pat Morin},
  title={An Improved Algorithm for Subdivision Traversal without Extra Storage},
  journal={Int. J. Comput. Geom. Appl.},
  year={2002},
  volume={12},
  number={4},
  pages={297--308}
}

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

  178. Finding specified sections of arrangements: 2d results


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

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

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

  181. Efficient algorithms for petersen’s matching theorem


    Biedl, T. C., Bose, P., Demaine, E. D., and Lubiw, A.
    J. Algorithms, 38(1):110–134, 2001.
    @article{DBLP:journals/jal/BiedlBDL01,
  author={Therese C. Biedl and Prosenjit Bose and Erik D. Demaine and Anna Lubiw},
  title={Efficient Algorithms for Petersen's Matching Theorem},
  journal={J. Algorithms},
  year={2001},
  volume={38},
  number={1},
  pages={110--134}
}

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

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

  184. Filling polyhedral molds


    Bose, P., van Kreveld, M. J., and Toussaint, G. T.
    Comput. Aided Des., 30(4):245–254, 1998.
    @article{DBLP:journals/cad/BoseKT98,
  author={Prosenjit Bose and Marc J. van Kreveld and Godfried T. Toussaint},
  title={Filling polyhedral molds},
  journal={Comput. Aided Des.},
  year={1998},
  volume={30},
  number={4},
  pages={245--254}
}

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

  186. Intersections with random geometric objects


    Bose, P. and Devroye, L.
    Comput. Geom., 10(3):139–154, 1998.
    @article{DBLP:journals/comgeo/BoseD98,
  author={Prosenjit Bose and Luc Devroye},
  title={Intersections with random geometric objects},
  journal={Comput. Geom.},
  year={1998},
  volume={10},
  number={3},
  pages={139--154}
}

  187. Pattern matching for permutations


    Bose, P., Buss, J. F., and Lubiw, A.
    Inf. Process. Lett., 65(5):277–283, 1998.
    @article{DBLP:journals/ipl/BoseBL98,
  author={Prosenjit Bose and Jonathan F. Buss and Anna Lubiw},
  title={Pattern Matching for Permutations},
  journal={Inf. Process. Lett.},
  year={1998},
  volume={65},
  number={5},
  pages={277--283}
}

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

  189. Feasibility of design in stereolithography


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

  190. Determining the castability of simple polyhedra


    Bose, P., Bremner, D., and van Kreveld, M. J.
    Algorithmica, 19(1/2):84–113, 1997.
    @article{DBLP:journals/algorithmica/BoseBK97,
  author={Prosenjit Bose and David Bremner and Marc J. van Kreveld},
  title={Determining the Castability of Simple Polyhedra},
  journal={Algorithmica},
  year={1997},
  volume={19},
  number={1/2},
  pages={84--113}
}

  191. Characterizing and efficiently computing quadrangulations of planar point sets


    Bose, P. and Toussaint, G. T.
    Comput. Aided Geom. Des., 14(8):763–785, 1997.
    @article{DBLP:journals/cagd/BoseT97,
  author={Prosenjit Bose and Godfried T. Toussaint},
  title={Characterizing and efficiently computing quadrangulations of planar point sets},
  journal={Comput. Aided Geom. Des.},
  year={1997},
  volume={14},
  number={8},
  pages={763--785}
}

  192. Guarding polyhedral terrains


    Bose, P., Shermer, T. C., Toussaint, G. T., and Zhu, B.
    Comput. Geom., 7:173–185, 1997.
    @article{DBLP:journals/comgeo/BoseSTZ97,
  author={Prosenjit Bose and Thomas C. Shermer and Godfried T. Toussaint and Binhai Zhu},
  title={Guarding Polyhedral Terrains},
  journal={Comput. Geom.},
  year={1997},
  volume={7},
  pages={173--185}
}

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

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

  195. Characterizing proximity trees


    Bose, P., Lenhart, W. J., and Liotta, G.
    Algorithmica, 16(1):83–110, 1996.
    @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}
}

  196. All convex polyhedra can be clamped with parallel jaw grippers


    Bose, P., Bremner, D., and Toussaint, G. T.
    Comput. Geom., 6:291–302, 1996.
    @article{DBLP:journals/comgeo/BoseBT96,
  author={Prosenjit Bose and David Bremner and Godfried T. Toussaint},
  title={All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers},
  journal={Comput. Geom.},
  year={1996},
  volume={6},
  pages={291--302}
}

  197. Geometric and computational aspects of gravity casting


    Bose, P. and Toussaint, G. T.
    Comput. Aided Des., 27(6):455–464, 1995.
    @article{DBLP:journals/cad/BoseT95,
  author={Prosenjit Bose and Godfried T. Toussaint},
  title={Geometric and computational aspects of gravity casting},
  journal={Comput. Aided Des.},
  year={1995},
  volume={27},
  number={6},
  pages={455--464}
}

  198. Growing a tree from its branches


    Bose, P. and Toussaint, G. T.
    J. Algorithms, 19(1):86–103, 1995.
    @article{DBLP:journals/jal/BoseT95,
  author={Prosenjit Bose and Godfried T. Toussaint},
  title={Growing a Tree from Its Branches},
  journal={J. Algorithms},
  year={1995},
  volume={19},
  number={1},
  pages={86--103}
}

  199. Geometric and computational aspects of manufacturing processes


    Bose, P. and Toussaint, G. T.
    Comput. Graph., 18(4):487–497, 1994.
    @article{DBLP:journals/cg/BoseT94,
  author={Prosenjit Bose and Godfried T. Toussaint},
  title={Geometric and computational aspects of manufacturing processes},
  journal={Comput. Graph.},
  year={1994},
  volume={18},
  number={4},
  pages={487--497}
}

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

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

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

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

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

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

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

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

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

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

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

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

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

Conference papers

  1. Constrained generalized delaunay graphs are plane spanners


    Bose, P., Carufel, J.-L. D., and van Renssen, A.
    In Proc. Comp. Int. Inf. Sys. 2016, pages 281–293, 2017.
    @inproceedings{conf/5,
  author={Prosenjit Bose and Jean-Lou De Carufel and André van Renssen},
  title={Constrained Generalized Delaunay Graphs Are Plane Spanners},
  booktitle={Proc. Comp. Int. Inf. Sys. 2016},
  year={2017},
  publisher={Springer},
  pages={281--293}
}

  2. Affine invariant triangulations


    Bose, P., Cano, P., and Silveira, R.
    In CCCG, 2019.
    @inproceedings{conf69,
  author={Prosenjit Bose and Pilar Cano and Rodrigo Silveira},
  title={Affine Invariant Triangulations},
  booktitle={CCCG},
  year={2019}
}

  3. Flips in higher order delaunay triangulations


    Arseneva, E., Bose, P., Cano, P., and Silveira, R. I.
    In Extended Abstract - EuroCG, 2020.
    @inproceedings{conf84,
  author={Elena Arseneva and Prosenjit Bose and Pilar Cano and Rodrigo I. Silveira},
  title={Flips in Higher Order Delaunay triangulations},
  booktitle={Extended Abstract - EuroCG},
  year={2020}
}

  4. Expected complexity of routing in theta-6 and half-theta-6 graphs


    Bose, P., Carufel, J.-L. D., and Devillers, O.
    In Extended Abstract - EuroCG, 2020.
    @inproceedings{conf85,
  author={Prosenjit Bose and Jean-Lou De Carufel and Olivier Devillers},
  title={Expected Complexity of Routing in Theta-6 and Half-Theta-6 graphs},
  booktitle={Extended Abstract - EuroCG},
  year={2020}
}

  5. On the spanning and routing ratio of the directed $\Theta_6$-graph


    Akitaya, H., Biniaz, A., and Bose, P.
    In Extended Abstract - ICCG, 2020.
    @inproceedings{conf91,
  author={Hugo Akitaya and Ahmad Biniaz and Prosenjit Bose},
  title={On the Spanning and Routing Ratio of the Directed $\Theta_6$-graph},
  booktitle={Extended Abstract - ICCG},
  year={2020}
}

  6. The minimum moving spanning tree problem


    Akitaya, H., Biniaz, A., Bose, P., Carufel, J.-L. D., Maheshwari, A., da Silveira, L. F. S. X., and Smid, M.
    In Extended Abstract - ICCG, 2020.
    @inproceedings{conf92,
  author={Hugo 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},
  booktitle={Extended Abstract - ICCG},
  year={2020}
}

  7. Spanning ratio of shortest paths in weighted square tessellations


    Bose, P., Esteban, G., Orden, D., and Silveira, R.
    In Extended Abstract - EuroCG, 2022.
    @inproceedings{confguillermo,
  author={Prosenjit Bose and Guillermo Esteban and David Orden and Rodrigo Silveira},
  title={Spanning ratio of shortest paths in weighted square tessellations},
  booktitle={Extended Abstract - EuroCG},
  year={2022}
}

  8. Approximate shortest paths on weighted disks


    Bose, P., Carufel, J.-L. D., Esteban, G., and Maheshwari, A.
    In Extended Abstract - EGC, 2023.
    @inproceedings{confguillermo2,
  author={Prosenjit Bose and Jean-Lou De Carufel and Guillermo Esteban and Anil Maheshwari},
  title={Approximate shortest paths on weighted disks},
  booktitle={Extended Abstract - EGC},
  year={2023}
}

  9. Competitive online search trees on trees


    Bose, P., Cardinal, J., Iacono, J., Koumoutsos, G., and Langerman, S.
    In Highlights of Algorithms - conference presentation, 2020.
    @inproceedings{Halg85,
  author={Prosenjit Bose and Jean Cardinal and John Iacono and Grigorios Koumoutsos and Stefan Langerman},
  title={Competitive Online Search Trees on Trees},
  booktitle={Highlights of Algorithms - conference presentation},
  year={2020}
}

  10. Dynamic schnyder woods


    Bhore, S., Bose, P., Cardinal, J., Cano, P., and Iacono, J.
    In CCCG, 2023.
    @inproceedings{bbc100,
  author={Sujoy Bhore and Prosenjit Bose and Jean Cardinal and Pilar Cano and John Iacono},
  title={Dynamic Schnyder Woods},
  booktitle={CCCG},
  year={2023}
}

  11. Ccoskeg discs in simple polygons


    Bose, P., D’Angelo, A., and Durocher, S.
    In CCCG, 2023.
    @inproceedings{bdd112,
  author={Prosenjit Bose and Anthony D'Angelo and Stephane Durocher},
  title={CCOSKEG Discs in Simple Polygons},
  booktitle={CCCG},
  year={2023}
}

  12. Piercing unit geodesic disks


    Biniaz, A., Bose, P., and Shermer, T.
    In CCCG, 2023.
    @inproceedings{bbs110,
  author={Ahmad Biniaz and Prosenjit Bose and Thomas Shermer},
  title={Piercing Unit Geodesic Disks},
  booktitle={CCCG},
  year={2023}
}

  13. The exact routing and spanning ratio of arbitrary triangle delaunay graphs


    Bose, P., Carufel, J.-L. D., and Stuart, J.
    In CCCG, 2024.
    @inproceedings{bds113,
  author={Prosenjit Bose and Jean-Lou De Carufel and John Stuart},
  title={The Exact Routing and Spanning Ratio of Arbitrary Triangle Delaunay Graphs},
  booktitle={CCCG},
  year={2024}
}

  14. Computing shortest paths amid non-overlapping weighted disks


    Bose, P., Carufel, J.-L. D., and Maheshawari, A.
    In CCCG, 2024.
    @inproceedings{bdm114,
  author={Prosenjit Bose and Jean-Lou De Carufel and Anil Maheshawari},
  title={Computing Shortest Paths Amid Non-Overlapping Weighted Disks},
  booktitle={CCCG},
  year={2024}
}

  15. The exact spanning ratio of the parallelogram delaunay graph


    Bose, P., Carufel, J.-L. D., and Njoo, S.
    In ALGOWIN, 2024.
    @inproceedings{bdn118,
  author={Prosenjit Bose and Jean-Lou De Carufel and Sandrine Njoo},
  title={The Exact Spanning Ratio of the Parallelogram Delaunay Graph},
  booktitle={ALGOWIN},
  year={2024}
}

  16. The exact spanning ratio of the parallelogram delaunay graph


    Bose, P., Carufel, J. D., and Njoo, S.
    In ALGOWIN, pages 144–158, 2024.
    @inproceedings{DBLP:conf/algosensors/BoseCN24,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Sandrine Njoo},
  title={The Exact Spanning Ratio of the Parallelogram Delaunay Graph},
  booktitle={{ALGOWIN}},
  year={2024},
  publisher={Springer},
  volume={15026},
  series={Lecture Notes in Computer Science},
  pages={144--158}
}

  17. A parameterized algorithm for vertex and edge connectivity of embedded graphs


    Biedl, T., Bose, P., and Murali, K.
    In ESA, pages 24:1–24:15, 2024.
    @inproceedings{DBLP:conf/esa/BiedlB024,
  author={Therese Biedl and Prosenjit Bose and Karthik Murali},
  title={A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs},
  booktitle={{ESA}},
  year={2024},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={308},
  series={LIPIcs},
  pages={24:1--24:15}
}

  18. On k-planar graphs without short cycles


    Bekos, M. A., Bose, P., Büngener, A., Dujmovic, V., Hoffmann, M., Kaufmann, M., Morin, P., Odak, S., and Weinberger, A.
    In GD, pages 27:1–27:17, 2024.
    @inproceedings{DBLP:conf/gd/BekosBBD00MOW24,
  author={Michael A. Bekos and Prosenjit Bose and Aaron B{\"{u}}ngener and Vida Dujmovic and Michael Hoffmann and Michael Kaufmann and Pat Morin and Saeed Odak and Alexandra Weinberger},
  title={On k-Planar Graphs Without Short Cycles},
  booktitle={{GD}},
  year={2024},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={320},
  series={LIPIcs},
  pages={27:1--27:17}
}

  19. Noncrossing longest paths and cycles


    Aloupis, G., Biniaz, A., Bose, P., Carufel, J. D., Eppstein, D., Maheshwari, A., Odak, S., Smid, M., Tóth, C. D., and Valtr, P.
    In GD, pages 36:1–36:17, 2024.
    @inproceedings{DBLP:conf/gd/AloupisBBCEMOST24,
  author={Greg Aloupis and Ahmad Biniaz and Prosenjit Bose and Jean{-}Lou De Carufel and David Eppstein and Anil Maheshwari and Saeed Odak and Michiel Smid and Csaba D. T{\'{o}}th and Pavel Valtr},
  title={Noncrossing Longest Paths and Cycles},
  booktitle={{GD}},
  year={2024},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={320},
  series={LIPIcs},
  pages={36:1--36:17}
}

  20. Routing from pentagon to octagon delaunay graphs


    Bose, P., Carufel, J. D., and Stuart, J.
    In ISAAC, pages 14:1–14:16, 2024.
    @inproceedings{DBLP:conf/isaac/BoseCS24,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and John Stuart},
  title={Routing from Pentagon to Octagon Delaunay Graphs},
  booktitle={{ISAAC}},
  year={2024},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={322},
  series={LIPIcs},
  pages={14:1--14:16}
}

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


    Bose, P., Hill, D., Smid, M., and Tuttle, T.
    In ISAAC, pages 15:1–15:17, 2024.
    @inproceedings{DBLP:conf/isaac/BoseHST24,
  author={Prosenjit Bose and Darryl Hill and Michiel Smid and Tyler Tuttle},
  title={On the Spanning and Routing Ratios of the Yao-Four Graph},
  booktitle={{ISAAC}},
  year={2024},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={322},
  series={LIPIcs},
  pages={15:1--15:17}
}

  22. On the independence number of 1-planar graphs


    Biedl, T., Bose, P., and Miraftab, B.
    In SWAT, pages 13:1–13:13, 2024.
    @inproceedings{DBLP:conf/swat/BiedlBM24,
  author={Therese Biedl and Prosenjit Bose and Babak Miraftab},
  title={On the Independence Number of 1-Planar Graphs},
  booktitle={{SWAT}},
  year={2024},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={294},
  series={LIPIcs},
  pages={13:1--13:13}
}

  23. Piercing unit geodesic disks


    Biniaz, A., Bose, P., and Shermer, T. C.
    In CCCG, pages 43–49, 2023.
    @inproceedings{DBLP:conf/cccg/BiniazBS23,
  author={Ahmad Biniaz and Prosenjit Bose and Thomas C. Shermer},
  title={Piercing Unit Geodesic Disks},
  booktitle={{CCCG}},
  year={2023},
  pages={43--49}
}

  24. Dynamic schnyder woods


    Cano, P., Bhore, S., Bose, P., Cardinal, J., and Iacono, J.
    In CCCG, pages 97–104, 2023.
    @inproceedings{DBLP:conf/cccg/CanoBBCI23,
  author={Pilar Cano and Sujoy Bhore and Prosenjit Bose and Jean Cardinal and John Iacono},
  title={Dynamic Schnyder woods},
  booktitle={{CCCG}},
  year={2023},
  pages={97--104}
}

  25. CCOSKEG discs in simple polygons


    Bose, P., D’Angelo, A., and Durocher, S.
    In CCCG, pages 129–152, 2023.
    @inproceedings{DBLP:conf/cccg/BoseDD23,
  author={Prosenjit Bose and Anthony D'Angelo and Stephane Durocher},
  title={{CCOSKEG} Discs in Simple Polygons},
  booktitle={{CCCG}},
  year={2023},
  pages={129--152}
}

  26. Approximating the smallest k-enclosing geodesic disc in a simple polygon


    Bose, P., D’Angelo, A., and Durocher, S.
    In WADS, pages 179–192, 2023.
    @inproceedings{DBLP:conf/wads/BoseDD23,
  author={Prosenjit Bose and Anthony D'Angelo and Stephane Durocher},
  title={Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon},
  booktitle={{WADS}},
  year={2023},
  publisher={Springer},
  volume={14079},
  series={Lecture Notes in Computer Science},
  pages={179--192}
}

  27. A 13/9-approximation of the average-2\(\pi\)/3-mst


    Biniaz, A., Bose, P., and Devaney, P.
    In CCCG, pages 55–59, 2022.
    @inproceedings{DBLP:conf/cccg/BiniazBD22,
  author={Ahmad Biniaz and Prosenjit Bose and Patrick Devaney},
  title={A 13/9-approximation of the average-2{\(\pi\)}/3-MST},
  booktitle={{CCCG}},
  year={2022},
  pages={55--59}
}

  28. Weighted shortest path in equilateral triangular meshes


    Bose, P., Esteban, G., and Maheshwari, A.
    In CCCG, pages 60–67, 2022.
    @inproceedings{DBLP:conf/cccg/BoseEM22,
  author={Prosenjit Bose and Guillermo Esteban and Anil Maheshwari},
  title={Weighted shortest path in equilateral triangular meshes},
  booktitle={{CCCG}},
  year={2022},
  pages={60--67}
}

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


    Bose, P., Carufel, J. D., and Shermer, T. C.
    In ISAAC, pages 56:1–56:13, 2022.
    @inproceedings{DBLP:conf/isaac/BoseCS22,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Thomas C. Shermer},
  title={Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor},
  booktitle={{ISAAC}},
  year={2022},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={248},
  series={LIPIcs},
  pages={56:1--56:13}
}

  30. On the zombie number of various graph classes


    Bose, P., Carufel, J. D., and Shermer, T. C.
    In LATIN, pages 527–543, 2022.
    @inproceedings{DBLP:conf/latin/BoseCS22,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Thomas C. Shermer},
  title={On the Zombie Number of Various Graph Classes},
  booktitle={{LATIN}},
  year={2022},
  publisher={Springer},
  volume={13568},
  series={Lecture Notes in Computer Science},
  pages={527--543}
}

  31. Piercing pairwise intersecting convex shapes in the plane


    Bazargani, S., Biniaz, A., and Bose, P.
    In LATIN, pages 679–695, 2022.
    @inproceedings{DBLP:conf/latin/BazarganiBB22,
  author={Saman Bazargani and Ahmad Biniaz and Prosenjit Bose},
  title={Piercing Pairwise Intersecting Convex Shapes in the Plane},
  booktitle={{LATIN}},
  year={2022},
  publisher={Springer},
  volume={13568},
  series={Lecture Notes in Computer Science},
  pages={679--695}
}

  32. Local routing algorithms on euclidean spanners with small diameter


    Bonichon, N., Bose, P., and Garito, Y.
    In LATIN, pages 696–712, 2022.
    @inproceedings{DBLP:conf/latin/BonichonBG22,
  author={Nicolas Bonichon and Prosenjit Bose and Yan Garito},
  title={Local Routing Algorithms on Euclidean Spanners with Small Diameter},
  booktitle={{LATIN}},
  year={2022},
  publisher={Springer},
  volume={13568},
  series={Lecture Notes in Computer Science},
  pages={696--712}
}

  33. An optimal algorithm for product structure in planar graphs


    Bose, P., Morin, P., and Odak, S.
    In SWAT, pages 19:1–19:14, 2022.
    @inproceedings{DBLP:conf/swat/BoseMO22,
  author={Prosenjit Bose and Pat Morin and Saeed Odak},
  title={An Optimal Algorithm for Product Structure in Planar Graphs},
  booktitle={{SWAT}},
  year={2022},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={227},
  series={LIPIcs},
  pages={19:1--19:14}
}

  34. On approximating shortest paths in weighted triangular tessellations


    Bose, P., Esteban, G., Orden, D., and Silveira, R. I.
    In WALCOM, pages 409–421, 2022.
    @inproceedings{DBLP:conf/walcom/BoseEOS22,
  author={Prosenjit Bose and Guillermo Esteban and David Orden and Rodrigo I. Silveira},
  title={On Approximating Shortest Paths in Weighted Triangular Tessellations},
  booktitle={{WALCOM}},
  year={2022},
  publisher={Springer},
  volume={13174},
  series={Lecture Notes in Computer Science},
  pages={409--421}
}

  35. Simple linear time algorithms for piercing pairwise intersecting disks


    Biniaz, A., Bose, P., and Wang, Y.
    In CCCG, pages 228–236, 2021.
    @inproceedings{DBLP:conf/cccg/BiniazBW21,
  author={Ahmad Biniaz and Prosenjit Bose and Yunkai Wang},
  title={Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks},
  booktitle={{CCCG}},
  year={2021},
  pages={228--236}
}

  36. Fragile complexity of adaptive algorithms


    Bose, P., Cano, P., Fagerberg, R., Iacono, J., Jacob, R., and Langerman, S.
    In CIAC, pages 144–157, 2021.
    @inproceedings{DBLP:conf/ciac/BoseCFIJL21,
  author={Prosenjit Bose and Pilar Cano and Rolf Fagerberg and John Iacono and Riko Jacob and Stefan Langerman},
  title={Fragile Complexity of Adaptive Algorithms},
  booktitle={{CIAC}},
  year={2021},
  publisher={Springer},
  volume={12701},
  series={Lecture Notes in Computer Science},
  pages={144--157}
}

  37. Spanning properties of variants of the delaunay graph (invited talk)


    Bose, P.
    In ISAAC, pages 2:1–2:1, 2021.
    @inproceedings{DBLP:conf/isaac/Bose21,
  author={Prosenjit Bose},
  title={Spanning Properties of Variants of the Delaunay Graph (Invited Talk)},
  booktitle={{ISAAC}},
  year={2021},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={212},
  series={LIPIcs},
  pages={2:1--2:1}
}

  38. On the spanning and routing ratios of the directed $\textbackslashvartheta \_6\textdollar-graph


    Akitaya, H. A., Biniaz, A., and Bose, P.
    In WADS, pages 1–14, 2021.
    @inproceedings{DBLP:conf/wads/AkitayaBB21,
  author={Hugo A. Akitaya and Ahmad Biniaz and Prosenjit Bose},
  title={On the Spanning and Routing Ratios of the Directed {\textdollar}{\textbackslash}varTheta {\_}6{\textdollar}-Graph},
  booktitle={{WADS}},
  year={2021},
  publisher={Springer},
  volume={12808},
  series={Lecture Notes in Computer Science},
  pages={1--14}
}

  39. 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.
    In WADS, pages 15–28, 2021.
    @inproceedings{DBLP:conf/wads/AkitayaBBCMSS21,
  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},
  booktitle={{WADS}},
  year={2021},
  publisher={Springer},
  volume={12808},
  series={Lecture Notes in Computer Science},
  pages={15--28}
}

  40. Improved bounds on the spanning ratio of the theta-5-graph


    Bose, P., Hill, D., and Ooms, A.
    In WADS, pages 215–228, 2021.
    @inproceedings{DBLP:conf/wads/BoseHO21,
  author={Prosenjit Bose and Darryl Hill and Aur{\'{e}}lien Ooms},
  title={Improved Bounds on the Spanning Ratio of the Theta-5-Graph},
  booktitle={{WADS}},
  year={2021},
  publisher={Springer},
  volume={12808},
  series={Lecture Notes in Computer Science},
  pages={215--228}
}

  41. Routing on heavy-path wspd-spanners


    Bose, P. and Tuttle, T.
    In WADS, pages 613–626, 2021.
    @inproceedings{DBLP:conf/wads/BoseT21,
  author={Prosenjit Bose and Tyler Tuttle},
  title={Routing on Heavy-Path WSPD-Spanners},
  booktitle={{WADS}},
  year={2021},
  publisher={Springer},
  volume={12808},
  series={Lecture Notes in Computer Science},
  pages={613--626}
}

  42. Faster multi-sided one-bend boundary labelling


    Bose, P., Mehrabi, S., and Mondal, D.
    In WALCOM, pages 116–128, 2021.
    @inproceedings{DBLP:conf/walcom/Bose0M21,
  author={Prosenjit Bose and Saeed Mehrabi and Debajyoti Mondal},
  title={Faster Multi-sided One-Bend Boundary Labelling},
  booktitle={{WALCOM}},
  year={2021},
  publisher={Springer},
  volume={12635},
  series={Lecture Notes in Computer Science},
  pages={116--128}
}

  43. Non-crossing matching of online points


    Bose, P., Carmi, P., Durocher, S., Kamali, S., and Sajadpour, A.
    In CCCG, pages 233–239, 2020.
    @inproceedings{DBLP:conf/cccg/BoseCDKS20,
  author={Prosenjit Bose and Paz Carmi and Stephane Durocher and Shahin Kamali and Arezoo Sajadpour},
  title={Non-Crossing Matching of Online Points},
  booktitle={{CCCG}},
  year={2020},
  pages={233--239}
}

  44. On the restricted 1-steiner tree problem


    Bose, P., D’Angelo, A., and Durocher, S.
    In COCOON, pages 448–459, 2020.
    @inproceedings{DBLP:conf/cocoon/BoseDD20,
  author={Prosenjit Bose and Anthony D'Angelo and Stephane Durocher},
  title={On the Restricted 1-Steiner Tree Problem},
  booktitle={{COCOON}},
  year={2020},
  publisher={Springer},
  volume={12273},
  series={Lecture Notes in Computer Science},
  pages={448--459}
}

  45. Flips in higher order delaunay triangulations


    Arseneva, E., Bose, P., Cano, P., and Silveira, R. I.
    In LATIN, pages 223–234, 2020.
    @inproceedings{DBLP:conf/latin/ArsenevaBCS20,
  author={Elena Arseneva and Prosenjit Bose and Pilar Cano and Rodrigo I. Silveira},
  title={Flips in Higher Order Delaunay Triangulations},
  booktitle={{LATIN}},
  year={2020},
  publisher={Springer},
  volume={12118},
  series={Lecture Notes in Computer Science},
  pages={223--234}
}

  46. Competitive online search trees on trees


    Bose, P., Cardinal, J., Iacono, J., Koumoutsos, G., and Langerman, S.
    In SODA, pages 1878–1891, 2020.
    @inproceedings{DBLP:conf/soda/BoseCIKL20,
  author={Prosenjit Bose and Jean Cardinal and John Iacono and Grigorios Koumoutsos and Stefan Langerman},
  title={Competitive Online Search Trees on Trees},
  booktitle={{SODA}},
  year={2020},
  publisher={{SIAM}},
  pages={1878--1891}
}

  47. Bounded-angle minimum spanning trees


    Biniaz, A., Bose, P., Lubiw, A., and Maheshwari, A.
    In SWAT, pages 14:1–14:22, 2020.
    @inproceedings{DBLP:conf/swat/BiniazBLM20,
  author={Ahmad Biniaz and Prosenjit Bose and Anna Lubiw and Anil Maheshwari},
  title={Bounded-Angle Minimum Spanning Trees},
  booktitle={{SWAT}},
  year={2020},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={162},
  series={LIPIcs},
  pages={14:1--14:22}
}

  48. Parameterized complexity of two-interval pattern problem


    Bose, P., Mehrabi, S., and Mondal, D.
    In SWAT, pages 16:1–16:10, 2020.
    @inproceedings{DBLP:conf/swat/Bose0M20,
  author={Prosenjit Bose and Saeed Mehrabi and Debajyoti Mondal},
  title={Parameterized Complexity of Two-Interval Pattern Problem},
  booktitle={{SWAT}},
  year={2020},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={162},
  series={LIPIcs},
  pages={16:1--16:10}
}

  49. Drawing graphs as spanners


    Aichholzer, O., Borrazzo, M., Bose, P., Cardinal, J., Frati, F., Morin, P., and Vogtenhuber, B.
    In WG, pages 310–324, 2020.
    @inproceedings{DBLP:conf/wg/AichholzerBBCFM20,
  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},
  booktitle={{WG}},
  year={2020},
  publisher={Springer},
  volume={12301},
  series={Lecture Notes in Computer Science},
  pages={310--324}
}

  50. Three-coloring three-dimensional uniform hypergraphs


    Biniaz, A., Bose, P., Cardinal, J., and Payne, M. S.
    In CCCG, pages 23–28, 2019.
    @inproceedings{DBLP:conf/cccg/BiniazBCP19,
  author={Ahmad Biniaz and Prosenjit Bose and Jean Cardinal and Michael S. Payne},
  title={Three-Coloring Three-Dimensional Uniform Hypergraphs},
  booktitle={{CCCG}},
  year={2019},
  pages={23--28}
}

  51. Attraction-convexity and normal visibility


    Bose, P. and Shermer, T. C.
    In CCCG, pages 110–116, 2019.
    @inproceedings{DBLP:conf/cccg/BoseS19,
  author={Prosenjit Bose and Thomas C. Shermer},
  title={Attraction-convexity and Normal Visibility},
  booktitle={{CCCG}},
  year={2019},
  pages={110--116}
}

  52. Watchtower for k-crossing visibility


    Bahoo, Y., Bose, P., and Durocher, S.
    In CCCG, pages 203–209, 2019.
    @inproceedings{DBLP:conf/cccg/BahooBD19,
  author={Yeganeh Bahoo and Prosenjit Bose and Stephane Durocher},
  title={Watchtower for k-crossing Visibility},
  booktitle={{CCCG}},
  year={2019},
  pages={203--209}
}

  53. Ane invariant triangulations


    Bose, P., Cano, P., and Silveira, R. I.
    In CCCG, pages 250–256, 2019.
    @inproceedings{DBLP:conf/cccg/BoseCS19,
  author={Prosenjit Bose and Pilar Cano and Rodrigo I. Silveira},
  title={Ane invariant triangulations},
  booktitle={{CCCG}},
  year={2019},
  pages={250--256}
}

  54. Reconstructing a convex polygon from its \textbackslashomega \(\omega\) -cloud


    Arseneva, E., Bose, P., Carufel, J. D., and Verdonschot, S.
    In CSR, pages 25–37, 2019.
    @inproceedings{DBLP:conf/csr/ArsenevaBCV19,
  author={Elena Arseneva and Prosenjit Bose and Jean{-}Lou De Carufel and Sander Verdonschot},
  title={Reconstructing a Convex Polygon from Its {\textbackslash}omega {\(\omega\)} -cloud},
  booktitle={{CSR}},
  year={2019},
  publisher={Springer},
  volume={11532},
  series={Lecture Notes in Computer Science},
  pages={25--37}
}

  55. Computing the k-crossing visibility region of a point in a polygon


    Bahoo, Y., Bose, P., Durocher, S., and Shermer, T. C.
    In IWOCA, pages 10–21, 2019.
    @inproceedings{DBLP:conf/iwoca/BahooBDS19,
  author={Yeganeh Bahoo and Prosenjit Bose and Stephane Durocher and Thomas C. Shermer},
  title={Computing the k-Crossing Visibility Region of a Point in a Polygon},
  booktitle={{IWOCA}},
  year={2019},
  publisher={Springer},
  volume={11638},
  series={Lecture Notes in Computer Science},
  pages={10--21}
}

  56. On the spanning and routing ratio of theta-four


    Bose, P., Carufel, J. D., Hill, D., and Smid, M. H. M.
    In SODA, pages 2361–2370, 2019.
    @inproceedings{DBLP:conf/soda/BoseCHS19,
  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},
  booktitle={{SODA}},
  year={2019},
  publisher={{SIAM}},
  pages={2361--2370}
}

  57. Hamiltonicity for convex shape delaunay and gabriel graphs


    Bose, P., Cano, P., Saumell, M., and Silveira, R. I.
    In WADS, pages 196–210, 2019.
    @inproceedings{DBLP:conf/wads/BoseCSS19,
  author={Prosenjit Bose and Pilar Cano and Maria Saumell and Rodrigo I. Silveira},
  title={Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs},
  booktitle={{WADS}},
  year={2019},
  publisher={Springer},
  volume={11646},
  series={Lecture Notes in Computer Science},
  pages={196--210}
}

  58. 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. H. M.
    In WADS, pages 211–224, 2019.
    @inproceedings{DBLP:conf/wads/BoseCKM0MS19,
  author={Prosenjit Bose and Paz Carmi and J. Mark Keil and Anil Maheshwari and Saeed Mehrabi and Debajyoti Mondal and Michiel H. M. Smid},
  title={Computing Maximum Independent Set on Outerstring Graphs and Their Relatives},
  booktitle={{WADS}},
  year={2019},
  publisher={Springer},
  volume={11646},
  series={Lecture Notes in Computer Science},
  pages={211--224}
}

  59. 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.
    In SoCG, pages 8:1–8:14, 2018.
    @inproceedings{DBLP:conf/compgeom/BiniazBCMMS18,
  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},
  booktitle={SoCG},
  year={2018},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={99},
  series={LIPIcs},
  pages={8:1--8:14}
}

  60. Improved routing on the delaunay triangulation


    Bonichon, N., Bose, P., Carufel, J. D., Despré, V., Hill, D., and Smid, M. H. M.
    In ESA, pages 22:1–22:13, 2018.
    @inproceedings{DBLP:conf/esa/BonichonBCDHS18,
  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},
  booktitle={{ESA}},
  year={2018},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={112},
  series={LIPIcs},
  pages={22:1--22:13}
}

  61. 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.
    In GD, pages 371–384, 2018.
    @inproceedings{DBLP:conf/gd/ArsenevaBCDDFLT18,
  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},
  booktitle={{GD}},
  year={2018},
  publisher={Springer},
  volume={11282},
  series={Lecture Notes in Computer Science},
  pages={371--384}
}

  62. Geodesic obstacle representation of graphs


    Bose, P., Carmi, P., Dujmovic, V., Mehrabi, S., Montecchiani, F., Morin, P., and da Silveira, L. F. S. X.
    In ICALP, pages 23:1–23:13, 2018.
    @inproceedings{DBLP:conf/icalp/BoseCD0MMS18,
  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},
  booktitle={{ICALP}},
  year={2018},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={107},
  series={LIPIcs},
  pages={23:1--23:13}
}

  63. Boundary labeling for rectangular diagrams


    Bose, P., Carmi, P., Keil, J. M., Mehrabi, S., and Mondal, D.
    In SWAT, pages 12:1–12:14, 2018.
    @inproceedings{DBLP:conf/swat/BoseCK0M18,
  author={Prosenjit Bose and Paz Carmi and J. Mark Keil and Saeed Mehrabi and Debajyoti Mondal},
  title={Boundary Labeling for Rectangular Diagrams},
  booktitle={{SWAT}},
  year={2018},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={101},
  series={LIPIcs},
  pages={12:1--12:14}
}

  64. Gathering by repulsion


    Bose, P. and Shermer, T. C.
    In SWAT, pages 13:1–13:12, 2018.
    @inproceedings{DBLP:conf/swat/BoseS18,
  author={Prosenjit Bose and Thomas C. Shermer},
  title={Gathering by Repulsion},
  booktitle={{SWAT}},
  year={2018},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={101},
  series={LIPIcs},
  pages={13:1--13:12}
}

  65. Improved bounds for guarding plane graphs with edges


    Biniaz, A., Bose, P., Ooms, A., and Verdonschot, S.
    In SWAT, pages 14:1–14:12, 2018.
    @inproceedings{DBLP:conf/swat/BiniazBOV18,
  author={Ahmad Biniaz and Prosenjit Bose and Aur{\'{e}}lien Ooms and Sander Verdonschot},
  title={Improved Bounds for Guarding Plane Graphs with Edges},
  booktitle={{SWAT}},
  year={2018},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={101},
  series={LIPIcs},
  pages={14:1--14:12}
}

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


    Bose, P., Halperin, D., and Shamai, S.
    In CASE, pages 61–66, 2017.
    @inproceedings{DBLP:conf/case/BoseHS17,
  author={Prosenjit Bose and Dan Halperin and Shahar Shamai},
  title={On the separation of a polyhedron from its single-part mold},
  booktitle={{CASE}},
  year={2017},
  publisher={{IEEE}},
  pages={61--66}
}

  67. Power domination on triangular grids


    Bose, P., Pennarun, C., and Verdonschot, S.
    In CCCG, pages 2–6, 2017.
    @inproceedings{DBLP:conf/cccg/BosePV17,
  author={Prosenjit Bose and Claire Pennarun and Sander Verdonschot},
  title={Power Domination on Triangular Grids},
  booktitle={{CCCG}},
  year={2017},
  pages={2--6}
}

  68. Constrained routing between non-visible vertices


    Bose, P., Korman, M., van Renssen, A., and Verdonschot, S.
    In COCOON, pages 62–74, 2017.
    @inproceedings{DBLP:conf/cocoon/BoseKRV17,
  author={Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Constrained Routing Between Non-Visible Vertices},
  booktitle={{COCOON}},
  year={2017},
  publisher={Springer},
  volume={10392},
  series={Lecture Notes in Computer Science},
  pages={62--74}
}

  69. Self-approaching paths in simple polygons


    Bose, P., Kostitsyna, I., and Langerman, S.
    In SoCG, pages 21:1–21:15, 2017.
    @inproceedings{DBLP:conf/compgeom/BoseKL17,
  author={Prosenjit Bose and Irina Kostitsyna and Stefan Langerman},
  title={Self-Approaching Paths in Simple Polygons},
  booktitle={SoCG},
  year={2017},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={77},
  series={LIPIcs},
  pages={21:1--21:15}
}

  70. Routing on the visibility graph


    Bose, P., Korman, M., van Renssen, A., and Verdonschot, S.
    In ISAAC, pages 18:1–18:12, 2017.
    @inproceedings{DBLP:conf/isaac/BoseKRV17,
  author={Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Routing on the Visibility Graph},
  booktitle={{ISAAC}},
  year={2017},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={92},
  series={LIPIcs},
  pages={18:1--18:12}
}

  71. 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.
    In WADS, pages 193–204, 2017.
    @inproceedings{DBLP:conf/wads/BiniazBCCEMS17,
  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},
  booktitle={{WADS}},
  year={2017},
  publisher={Springer},
  volume={10389},
  series={Lecture Notes in Computer Science},
  pages={193--204}
}

  72. Local routing in spanners based on wspds


    Bose, P., Carufel, J. D., Dujmovic, V., and Paradis, F.
    In WADS, pages 205–216, 2017.
    @inproceedings{DBLP:conf/wads/BoseCDP17,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Vida Dujmovic and Fr{\'{e}}d{\'{e}}rik Paradis},
  title={Local Routing in Spanners Based on WSPDs},
  booktitle={{WADS}},
  year={2017},
  publisher={Springer},
  volume={10389},
  series={Lecture Notes in Computer Science},
  pages={205--216}
}

  73. Time-space trade-off for finding the \emphk-visibility region of a point in a polygon


    Bahoo, Y., Banyassady, B., Bose, P., Durocher, S., and Mulzer, W.
    In WALCOM, pages 308–319, 2017.
    @inproceedings{DBLP:conf/walcom/BahooBBDM17,
  author={Yeganeh Bahoo and Bahareh Banyassady and Prosenjit Bose and Stephane Durocher and Wolfgang Mulzer},
  title={Time-Space Trade-Off for Finding the \emph{k}-Visibility Region of a Point in a Polygon},
  booktitle={{WALCOM}},
  year={2017},
  publisher={Springer},
  volume={10167},
  series={Lecture Notes in Computer Science},
  pages={308--319}
}

  74. A faster algorithm for the minimum red-blue-purple spanning graph problem for points on a circle


    Biniaz, A., Bose, P., van Duijn, I., Maheshwari, A., and Smid, M. H. M.
    In CCCG, pages 140–146, 2016.
    @inproceedings{DBLP:conf/cccg/BiniazBDMS16,
  author={Ahmad Biniaz and Prosenjit Bose and Ingo van Duijn and Anil Maheshwari and Michiel H. M. Smid},
  title={A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle},
  booktitle={{CCCG}},
  year={2016},
  publisher={Simon Fraser University, Vancouver, British Columbia, Canada},
  pages={140--146}
}

  75. New bounds for facial nonrepetitive colouring


    Bose, P., Dujmovic, V., Morin, P., and Rioux-Maldague, L.
    In CCCG, pages 295–302, 2016.
    @inproceedings{DBLP:conf/cccg/BoseDMR16,
  author={Prosenjit Bose and Vida Dujmovic and Pat Morin and Lucas Rioux{-}Maldague},
  title={New Bounds for Facial Nonrepetitive Colouring},
  booktitle={{CCCG}},
  year={2016},
  publisher={Simon Fraser University, Vancouver, British Columbia, Canada},
  pages={295--302}
}

  76. Gabriel triangulations and angle-monotone graphs: local routing and recognition


    Bonichon, N., Bose, P., Carmi, P., Kostitsyna, I., Lubiw, A., and Verdonschot, S.
    In GD, pages 519–531, 2016.
    @inproceedings{DBLP:conf/gd/BonichonBCKLV16,
  author={Nicolas Bonichon and Prosenjit Bose and Paz Carmi and Irina Kostitsyna and Anna Lubiw and Sander Verdonschot},
  title={Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition},
  booktitle={{GD}},
  year={2016},
  publisher={Springer},
  volume={9801},
  series={Lecture Notes in Computer Science},
  pages={519--531}
}

  77. Towards plane spanners of degree 3


    Biniaz, A., Bose, P., Carufel, J. D., Gavoille, C., Maheshwari, A., and Smid, M. H. M.
    In ISAAC, pages 19:1–19:14, 2016.
    @inproceedings{DBLP:conf/isaac/BiniazBCGMS16,
  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},
  booktitle={{ISAAC}},
  year={2016},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={64},
  series={LIPIcs},
  pages={19:1--19:14}
}

  78. Essential constraints of edge-constrained proximity graphs


    Bose, P., Carufel, J. D., Shaikhet, A., and Smid, M. H. M.
    In IWOCA, pages 55–67, 2016.
    @inproceedings{DBLP:conf/iwoca/BoseCSS16,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Alina Shaikhet and Michiel H. M. Smid},
  title={Essential Constraints of Edge-Constrained Proximity Graphs},
  booktitle={{IWOCA}},
  year={2016},
  publisher={Springer},
  volume={9843},
  series={Lecture Notes in Computer Science},
  pages={55--67}
}

  79. Plane bichromatic trees of low degree


    Biniaz, A., Bose, P., Maheshwari, A., and Smid, M. H. M.
    In IWOCA, pages 68–80, 2016.
    @inproceedings{DBLP:conf/iwoca/BiniazBMS16,
  author={Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel H. M. Smid},
  title={Plane Bichromatic Trees of Low Degree},
  booktitle={{IWOCA}},
  year={2016},
  publisher={Springer},
  volume={9843},
  series={Lecture Notes in Computer Science},
  pages={68--80}
}

  80. Improved spanning ratio for low degree plane spanners


    Bose, P., Hill, D., and Smid, M. H. M.
    In LATIN, pages 249–262, 2016.
    @inproceedings{DBLP:conf/latin/BoseHS16,
  author={Prosenjit Bose and Darryl Hill and Michiel H. M. Smid},
  title={Improved Spanning Ratio for Low Degree Plane Spanners},
  booktitle={{LATIN}},
  year={2016},
  publisher={Springer},
  volume={9644},
  series={Lecture Notes in Computer Science},
  pages={249--262}
}

  81. A plane 1.88-spanner for points in convex position


    Amani, M., Biniaz, A., Bose, P., Carufel, J. D., Maheshwari, A., and Smid, M. H. M.
    In SWAT, pages 25:1–25:14, 2016.
    @inproceedings{DBLP:conf/swat/AmaniBBCMS16,
  author={Mahdi Amani and Ahmad Biniaz and Prosenjit Bose and Jean{-}Lou De Carufel and Anil Maheshwari and Michiel H. M. Smid},
  title={A Plane 1.88-Spanner for Points in Convex Position},
  booktitle={{SWAT}},
  year={2016},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={53},
  series={LIPIcs},
  pages={25:1--25:14}
}

  82. A general framework for searching on a line


    Bose, P. and Carufel, J. D.
    In WALCOM, pages 143–153, 2016.
    @inproceedings{DBLP:conf/walcom/BoseC16,
  author={Prosenjit Bose and Jean{-}Lou De Carufel},
  title={A General Framework for Searching on a Line},
  booktitle={{WALCOM}},
  year={2016},
  publisher={Springer},
  volume={9627},
  series={Lecture Notes in Computer Science},
  pages={143--153}
}

  83. One of ferran hurtado’s favorite topics - flips


    Bose, P.
    In CCCG, 2015.
    @inproceedings{DBLP:conf/cccg/Bose15,
  author={Prosenjit Bose},
  title={One of Ferran Hurtado's favorite topics - Flips},
  booktitle={{CCCG}},
  year={2015},
  publisher={Queen's University, Ontario, Canada}
}

  84. Constrained empty-rectangle delaunay graphs


    Bose, P., Carufel, J. D., and van Renssen, A.
    In CCCG, 2015.
    @inproceedings{DBLP:conf/cccg/BoseCR15,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Andr{\'{e}} van Renssen},
  title={Constrained Empty-Rectangle Delaunay Graphs},
  booktitle={{CCCG}},
  year={2015},
  publisher={Queen's University, Ontario, Canada}
}

  85. Flips in edge-labelled pseudo-triangulations


    Bose, P. and Verdonschot, S.
    In CCCG, 2015.
    @inproceedings{DBLP:conf/cccg/BoseV15,
  author={Prosenjit Bose and Sander Verdonschot},
  title={Flips in Edge-Labelled Pseudo-Triangulations},
  booktitle={{CCCG}},
  year={2015},
  publisher={Queen's University, Ontario, Canada}
}

  86. The shadows of a cycle cannot all be paths


    Viglietta, G., Bose, P., Carufel, J. D., Dobbins, M. G., and Kim, H.
    In CCCG, 2015.
    @inproceedings{DBLP:conf/cccg/VigliettaBCDK15,
  author={Giovanni Viglietta and Prosenjit Bose and Jean{-}Lou De Carufel and Michael Gene Dobbins and Heuna Kim},
  title={The Shadows of a Cycle Cannot All Be Paths},
  booktitle={{CCCG}},
  year={2015},
  publisher={Queen's University, Ontario, Canada}
}

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


    Ahn, H., Barba, L., Bose, P., Carufel, J. D., Korman, M., and Oh, E.
    In SoCG, pages 209–223, 2015.
    @inproceedings{DBLP:conf/compgeom/AhnBBCKO15,
  author={Hee{-}Kap Ahn and Luis Barba and Prosenjit Bose and Jean{-}Lou De Carufel and Matias Korman and Eunjin Oh},
  title={A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon},
  booktitle={SoCG},
  year={2015},
  publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  volume={34},
  series={LIPIcs},
  pages={209--223}
}

  88. Upper and lower bounds for online routing on delaunay triangulations


    Bonichon, N., Bose, P., Carufel, J. D., Perkovic, L., and van Renssen, A.
    In ESA, pages 203–214, 2015.
    @inproceedings{DBLP:conf/esa/BonichonBCPR15,
  author={Nicolas Bonichon and Prosenjit Bose and Jean{-}Lou De Carufel and Ljubomir Perkovic and Andr{\'{e}} van Renssen},
  title={Upper and Lower Bounds for Online Routing on Delaunay Triangulations},
  booktitle={{ESA}},
  year={2015},
  publisher={Springer},
  volume={9294},
  series={Lecture Notes in Computer Science},
  pages={203--214}
}

  89. Competitive local routing with constraints


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    In ISAAC, pages 23–34, 2015.
    @inproceedings{DBLP:conf/isaac/BoseFRV15,
  author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Competitive Local Routing with Constraints},
  booktitle={{ISAAC}},
  year={2015},
  publisher={Springer},
  volume={9472},
  series={Lecture Notes in Computer Science},
  pages={23--34}
}

  90. Local routing in convex subdivisions


    Bose, P., Durocher, S., Mondal, D., Peabody, M., Skala, M., and Wahid, M. A.
    In SOFSEM, pages 140–151, 2015.
    @inproceedings{DBLP:conf/sofsem/BoseDMPSW15,
  author={Prosenjit Bose and Stephane Durocher and Debajyoti Mondal and Maxime Peabody and Matthew Skala and Mohammad Abdul Wahid},
  title={Local Routing in Convex Subdivisions},
  booktitle={{SOFSEM}},
  year={2015},
  publisher={Springer},
  volume={8939},
  series={Lecture Notes in Computer Science},
  pages={140--151}
}

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


    Biniaz, A., Bose, P., Maheshwari, A., and Smid, M. H. M.
    In TTCS, pages 56–71, 2015.
    @inproceedings{DBLP:conf/ttcs/BiniazBMS15,
  author={Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel H. M. Smid},
  title={Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon},
  booktitle={{TTCS}},
  year={2015},
  publisher={Springer},
  volume={9541},
  series={Lecture Notes in Computer Science},
  pages={56--71}
}

  92. A general framework to generate sizing systems from 3d motion data applied to face mask design


    Bolkart, T., Bose, P., Shu, C., and Wuhrer, S.
    In 3DV, pages 425–431, 2014.
    @inproceedings{DBLP:conf/3dim/BolkartB0W14,
  author={Timo Bolkart and Prosenjit Bose and Chang Shu and Stefanie Wuhrer},
  title={A General Framework to Generate Sizing Systems from 3D Motion Data Applied to Face Mask Design},
  booktitle={3DV},
  year={2014},
  publisher={{IEEE} Computer Society},
  pages={425--431}
}

  93. Continuous yao graphs


    Barba, L., Bose, P., Carufel, J. D., Damian, M., Fagerberg, R., van Renssen, A., Taslakian, P., and Verdonschot, S.
    In CCCG, 2014.
    @inproceedings{DBLP:conf/cccg/BarbaBCDFRTV14,
  author={Luis Barba and Prosenjit Bose and Jean{-}Lou De Carufel and Mirela Damian and Rolf Fagerberg and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
  title={Continuous Yao Graphs},
  booktitle={{CCCG}},
  year={2014},
  publisher={Carleton University, Ottawa, Canada}
}

  94. Searching by panning and zooming


    Bose, P., Howat, J., and Morin, P.
    In CCCG, 2014.
    @inproceedings{DBLP:conf/cccg/BoseHM14,
  author={Prosenjit Bose and John Howat and Pat Morin},
  title={Searching by Panning and Zooming},
  booktitle={{CCCG}},
  year={2014},
  publisher={Carleton University, Ottawa, Canada}
}

  95. The convex hull of points on a sphere is a spanner


    Bose, P., Pratt, S., and Smid, M. H. M.
    In CCCG, 2014.
    @inproceedings{DBLP:conf/cccg/BosePS14,
  author={Prosenjit Bose and Simon Pratt and Michiel H. M. Smid},
  title={The Convex Hull of Points on a Sphere is a Spanner},
  booktitle={{CCCG}},
  year={2014},
  publisher={Carleton University, Ottawa, Canada}
}

  96. New and improved spanning ratios for yao graphs


    Barba, L., Bose, P., Damian, M., Fagerberg, R., Keng, W. L., O’Rourke, J., van Renssen, A., Taslakian, P., Verdonschot, S., and Xia, G.
    In SoCG, page 30, 2014.
    @inproceedings{DBLP:conf/compgeom/BarbaBDFKORTVX14,
  author={Luis Barba and Prosenjit Bose and Mirela Damian and Rolf Fagerberg and Wah Loon Keng and Joseph O'Rourke and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot and Ge Xia},
  title={New and Improved Spanning Ratios for Yao Graphs},
  booktitle={SoCG},
  year={2014},
  publisher={{ACM}},
  pages={30}
}

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


    Bose, P., Douïeb, K., Iacono, J., and Langerman, S.
    In ISAAC, pages 181–192, 2014.
    @inproceedings{DBLP:conf/isaac/BoseDIL14,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb and John Iacono and Stefan Langerman},
  title={The Power and Limitations of Static Binary Search Trees with Lazy Finger},
  booktitle={{ISAAC}},
  year={2014},
  publisher={Springer},
  volume={8889},
  series={Lecture Notes in Computer Science},
  pages={181--192}
}

  98. The price of order


    Bose, P., Morin, P., and van Renssen, A.
    In ISAAC, pages 313–325, 2014.
    @inproceedings{DBLP:conf/isaac/BoseMR14,
  author={Prosenjit Bose and Pat Morin and Andr{\'{e}} van Renssen},
  title={The Price of Order},
  booktitle={{ISAAC}},
  year={2014},
  publisher={Springer},
  volume={8889},
  series={Lecture Notes in Computer Science},
  pages={313--325}
}

  99. Optimal algorithms for constrained 1-center problems


    Barba, L., Bose, P., and Langerman, S.
    In LATIN, pages 84–95, 2014.
    @inproceedings{DBLP:conf/latin/BarbaBL14,
  author={Luis Barba and Prosenjit Bose and Stefan Langerman},
  title={Optimal Algorithms for Constrained 1-Center Problems},
  booktitle={{LATIN}},
  year={2014},
  publisher={Springer},
  volume={8392},
  series={Lecture Notes in Computer Science},
  pages={84--95}
}

  100. Upper bounds on the spanning ratio of constrained theta-graphs


    Bose, P. and van Renssen, A.
    In LATIN, pages 108–119, 2014.
    @inproceedings{DBLP:conf/latin/BoseR14,
  author={Prosenjit Bose and Andr{\'{e}} van Renssen},
  title={Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs},
  booktitle={{LATIN}},
  year={2014},
  publisher={Springer},
  volume={8392},
  series={Lecture Notes in Computer Science},
  pages={108--119}
}

  101. Biased predecessor search


    Bose, P., Fagerberg, R., Howat, J., and Morin, P.
    In LATIN, pages 755–764, 2014.
    @inproceedings{DBLP:conf/latin/BoseFHM14,
  author={Prosenjit Bose and Rolf Fagerberg and John Howat and Pat Morin},
  title={Biased Predecessor Search},
  booktitle={{LATIN}},
  year={2014},
  publisher={Springer},
  volume={8392},
  series={Lecture Notes in Computer Science},
  pages={755--764}
}

  102. Competitive online routing on delaunay triangulations


    Bose, P., Carufel, J. D., Durocher, S., and Taslakian, P.
    In SWAT, pages 98–109, 2014.
    @inproceedings{DBLP:conf/swat/BoseCDT14,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Stephane Durocher and Perouz Taslakian},
  title={Competitive Online Routing on Delaunay Triangulations},
  booktitle={{SWAT}},
  year={2014},
  publisher={Springer},
  volume={8503},
  series={Lecture Notes in Computer Science},
  pages={98--109}
}

  103. A history of distribution-sensitive data structures


    Bose, P., Howat, J., and Morin, P.
    In Space-Efficient Data Structures, Streams, and Algorithms, pages 133–149, 2013.
    @inproceedings{DBLP:conf/birthday/BoseHM13,
  author={Prosenjit Bose and John Howat and Pat Morin},
  title={A History of Distribution-Sensitive Data Structures},
  booktitle={Space-Efficient Data Structures, Streams, and Algorithms},
  year={2013},
  publisher={Springer},
  volume={8066},
  series={Lecture Notes in Computer Science},
  pages={133--149}
}

  104. Theta-3 is connected


    Aichholzer, O., Bae, S. W., Barba, L., Bose, P., Korman, M., van Renssen, A., Taslakian, P., and Verdonschot, S.
    In CCCG, 2013.
    @inproceedings{DBLP:conf/cccg/AichholzerBBBKRTV13,
  author={Oswin Aichholzer and Sang Won Bae and Luis Barba and Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
  title={Theta-3 is connected},
  booktitle={{CCCG}},
  year={2013},
  publisher={Carleton University, Ottawa, Canada}
}

  105. Computing covers of plane forests


    Barba, L., Beingessner, A., Bose, P., and Smid, M. H. M.
    In CCCG, 2013.
    @inproceedings{DBLP:conf/cccg/BarbaBBS13,
  author={Luis Barba and Alexis Beingessner and Prosenjit Bose and Michiel H. M. Smid},
  title={Computing Covers of Plane Forests},
  booktitle={{CCCG}},
  year={2013},
  publisher={Carleton University, Ottawa, Canada}
}

  106. Optimal data structures for farthest-point queries in cactus networks


    Bose, P., Carufel, J. D., Grimm, C., Maheshwari, A., and Smid, M. H. M.
    In CCCG, 2013.
    @inproceedings{DBLP:conf/cccg/BoseCGMS13,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Carsten Grimm and Anil Maheshwari and Michiel H. M. Smid},
  title={Optimal Data Structures for Farthest-Point Queries in Cactus Networks},
  booktitle={{CCCG}},
  year={2013},
  publisher={Carleton University, Ottawa, Canada}
}

  107. Robust geometric spanners


    Bose, P., Dujmovic, V., Morin, P., and Smid, M. H. M.
    In SoCG, pages 449–458, 2013.
    @inproceedings{DBLP:conf/compgeom/BoseDMS13,
  author={Prosenjit Bose and Vida Dujmovic and Pat Morin and Michiel H. M. Smid},
  title={Robust geometric spanners},
  booktitle={SoCG},
  year={2013},
  publisher={{ACM}},
  pages={449--458}
}

  108. Revisiting the problem of searching on a line


    Bose, P., Carufel, J. D., and Durocher, S.
    In ESA, pages 205–216, 2013.
    @inproceedings{DBLP:conf/esa/BoseCD13,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Stephane Durocher},
  title={Revisiting the Problem of Searching on a Line},
  booktitle={{ESA}},
  year={2013},
  publisher={Springer},
  volume={8125},
  series={Lecture Notes in Computer Science},
  pages={205--216}
}

  109. On the stretch factor of the theta-4 graph


    Barba, L., Bose, P., Carufel, J. D., van Renssen, A., and Verdonschot, S.
    In WADS, pages 109–120, 2013.
    @inproceedings{DBLP:conf/wads/BarbaBCRV13,
  author={Luis Barba and Prosenjit Bose and Jean{-}Lou De Carufel and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={On the Stretch Factor of the Theta-4 Graph},
  booktitle={{WADS}},
  year={2013},
  publisher={Springer},
  volume={8037},
  series={Lecture Notes in Computer Science},
  pages={109--120}
}

  110. On the spanning ratio of theta-graphs


    Bose, P., van Renssen, A., and Verdonschot, S.
    In WADS, pages 182–194, 2013.
    @inproceedings{DBLP:conf/wads/BoseRV13,
  author={Prosenjit Bose and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={On the Spanning Ratio of Theta-Graphs},
  booktitle={{WADS}},
  year={2013},
  publisher={Springer},
  volume={8037},
  series={Lecture Notes in Computer Science},
  pages={182--194}
}

  111. The θ 5-graph is a spanner


    Bose, P., Morin, P., van Renssen, A., and Verdonschot, S.
    In WG, pages 100–114, 2013.
    @inproceedings{DBLP:conf/wg/BoseMRV13,
  author={Prosenjit Bose and Pat Morin and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={The {\texttheta} 5-Graph is a Spanner},
  booktitle={{WG}},
  year={2013},
  publisher={Springer},
  volume={8165},
  series={Lecture Notes in Computer Science},
  pages={100--114}
}

  112. Visibility monotonic polygon deflation


    Bose, P., Dujmovic, V., Hoda, N., and Morin, P.
    In CCCG, pages 11–16, 2012.
    @inproceedings{DBLP:conf/cccg/BoseDHM12,
  author={Prosenjit Bose and Vida Dujmovic and Nima Hoda and Pat Morin},
  title={Visibility Monotonic Polygon Deflation},
  booktitle={{CCCG}},
  year={2012},
  pages={11--16}
}

  113. On farthest-point information in networks


    Bose, P., Carufel, J. D., Grimm, C., Maheshwari, A., and Smid, M. H. M.
    In CCCG, pages 199–204, 2012.
    @inproceedings{DBLP:conf/cccg/BoseCGMS12,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Carsten Grimm and Anil Maheshwari and Michiel H. M. Smid},
  title={On Farthest-Point Information in Networks},
  booktitle={{CCCG}},
  year={2012},
  pages={199--204}
}

  114. Competitive routing on a bounded-degree plane spanner


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    In CCCG, pages 285–290, 2012.
    @inproceedings{DBLP:conf/cccg/BoseFRV12,
  author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Competitive Routing on a Bounded-Degree Plane Spanner},
  booktitle={{CCCG}},
  year={2012},
  pages={285--290}
}

  115. Optimal bounds on theta-graphs: more is not always better


    Bose, P., Carufel, J. D., Morin, P., van Renssen, A., and Verdonschot, S.
    In CCCG, pages 291–296, 2012.
    @inproceedings{DBLP:conf/cccg/BoseCMRV12,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Pat Morin and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Optimal Bounds on Theta-Graphs: More is not Always Better},
  booktitle={{CCCG}},
  year={2012},
  pages={291--296}
}

  116. Flips


    Bose, P.
    In GD, page 1, 2012.
    @inproceedings{DBLP:conf/gd/Bose12,
  author={Prosenjit Bose},
  title={Flips},
  booktitle={{GD}},
  year={2012},
  publisher={Springer},
  volume={7704},
  series={Lecture Notes in Computer Science},
  pages={1}
}

  117. De-amortizing binary search trees


    Bose, P., Collette, S., Fagerberg, R., and Langerman, S.
    In ICALP (1), pages 121–132, 2012.
    @inproceedings{DBLP:conf/icalp/BoseCFL12,
  author={Prosenjit Bose and S{\'{e}}bastien Collette and Rolf Fagerberg and Stefan Langerman},
  title={De-amortizing Binary Search Trees},
  booktitle={{ICALP} {(1)}},
  year={2012},
  publisher={Springer},
  volume={7391},
  series={Lecture Notes in Computer Science},
  pages={121--132}
}

  118. On spanning properties of various delaunay graphs


    Bose, P.
    In ISVD, page 1, 2012.
    @inproceedings{DBLP:conf/isvd/Bose12,
  author={Prosenjit Bose},
  title={On Spanning Properties of Various Delaunay Graphs},
  booktitle={{ISVD}},
  year={2012},
  publisher={{IEEE} Computer Society},
  pages={1}
}

  119. On plane constrained bounded-degree spanners


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    In LATIN, pages 85–96, 2012.
    @inproceedings{DBLP:conf/latin/BoseFRV12,
  author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={On Plane Constrained Bounded-Degree Spanners},
  booktitle={{LATIN}},
  year={2012},
  publisher={Springer},
  volume={7256},
  series={Lecture Notes in Computer Science},
  pages={85--96}
}

  120. Competitive routing in the half-θ\(_\mbox6\)-graph


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    In SODA, pages 1319–1328, 2012.
    @inproceedings{DBLP:conf/soda/BoseFRV12,
  author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Competitive routing in the half-{\texttheta}\({}_{\mbox{6}}\)-graph},
  booktitle={{SODA}},
  year={2012},
  publisher={{SIAM}},
  pages={1319--1328}
}

  121. Isoperimetric triangular enclosure with a fixed angle


    Bose, P. and Carufel, J. D.
    In CCCG, 2011.
    @inproceedings{DBLP:conf/cccg/BoseC11,
  author={Prosenjit Bose and Jean{-}Lou De Carufel},
  title={Isoperimetric Triangular Enclosure with a Fixed Angle},
  booktitle={{CCCG}},
  year={2011}
}

  122. Making triangulations 4-connected using flips


    Bose, P., Jansens, D., van Renssen, A., Saumell, M., and Verdonschot, S.
    In CCCG, 2011.
    @inproceedings{DBLP:conf/cccg/BoseJRSV11,
  author={Prosenjit Bose and Dana Jansens and Andr{\'{e}} van Renssen and Maria Saumell and Sander Verdonschot},
  title={Making triangulations 4-connected using flips},
  booktitle={{CCCG}},
  year={2011}
}

  123. A history of flips in combinatorial triangulations


    Bose, P. and Verdonschot, S.
    In EGC, pages 29–44, 2011.
    @inproceedings{DBLP:conf/s-egc/BoseV11,
  author={Prosenjit Bose and Sander Verdonschot},
  title={A History of Flips in Combinatorial Triangulations},
  booktitle={{EGC}},
  year={2011},
  publisher={Springer},
  volume={7579},
  series={Lecture Notes in Computer Science},
  pages={29--44}
}

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


    Bose, P., Carmi, P., Damian, M., Flatland, R. Y., Katz, M. J., and Maheshwari, A.
    In WADS, pages 134–146, 2011.
    @inproceedings{DBLP:conf/wads/BoseCDFKM11,
  author={Prosenjit Bose and Paz Carmi and Mirela Damian and Robin Y. Flatland and Matthew J. Katz and Anil Maheshwari},
  title={Switching to Directional Antennas with Constant Increase in Radius and Hop Distance},
  booktitle={{WADS}},
  year={2011},
  publisher={Springer},
  volume={6844},
  series={Lecture Notes in Computer Science},
  pages={134--146}
}

  125. Some properties of higher order delaunay and gabriel graphs


    Bose, P., Collette, S., Hurtado, F., Korman, M., Langerman, S., Sacristán, V., and Saumell, M.
    In CCCG, pages 13–16, 2010.
    @inproceedings{DBLP:conf/cccg/BoseCHKLSS10,
  author={Prosenjit Bose and S{\'{e}}bastien Collette and Ferran Hurtado and Matias Korman and Stefan Langerman and Vera Sacrist{\'{a}}n and Maria Saumell},
  title={Some properties of higher order delaunay and gabriel graphs},
  booktitle={{CCCG}},
  year={2010},
  pages={13--16}
}

  126. On the perimeter of fat objects


    Bose, P., Cheong, O., and Dujmovic, V.
    In CCCG, pages 163–166, 2010.
    @inproceedings{DBLP:conf/cccg/BoseCD10,
  author={Prosenjit Bose and Otfried Cheong and Vida Dujmovic},
  title={On the perimeter of fat objects},
  booktitle={{CCCG}},
  year={2010},
  pages={163--166}
}

  127. Minimum enclosing area triangle with a fixed angle


    Bose, P. and Carufel, J. D.
    In CCCG, pages 171–174, 2010.
    @inproceedings{DBLP:conf/cccg/BoseC10,
  author={Prosenjit Bose and Jean{-}Lou De Carufel},
  title={Minimum enclosing area triangle with a fixed angle},
  booktitle={{CCCG}},
  year={2010},
  pages={171--174}
}

  128. Fast local searches and updates in bounded universes


    Bose, P., Douïeb, K., Dujmovic, V., Howat, J., and Morin, P.
    In CCCG, pages 261–264, 2010.
    @inproceedings{DBLP:conf/cccg/BoseDDHM10,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Vida Dujmovic and John Howat and Pat Morin},
  title={Fast local searches and updates in bounded universes},
  booktitle={{CCCG}},
  year={2010},
  pages={261--264}
}

  129. Common unfoldings of polyominoes and polycubes


    Aloupis, G., Bose, P., Collette, S., Demaine, E. D., Demaine, M. L., Douïeb, K., Dujmovic, V., Iacono, J., Langerman, S., and Morin, P.
    In CGGA, pages 44–54, 2010.
    @inproceedings{DBLP:conf/cgga/AloupisBCDDDDILM10,
  author={Greg Aloupis and Prosenjit Bose and S{\'{e}}bastien Collette and Erik D. Demaine and Martin L. Demaine and Karim Dou{\"{\i}}eb and Vida Dujmovic and John Iacono and Stefan Langerman and Pat Morin},
  title={Common Unfoldings of Polyominoes and Polycubes},
  booktitle={{CGGA}},
  year={2010},
  publisher={Springer},
  volume={7033},
  series={Lecture Notes in Computer Science},
  pages={44--54}
}

  130. Coverage with \emphk-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.
    In COCOA (2), pages 1–15, 2010.
    @inproceedings{DBLP:conf/cocoa/BallingerBBDDDFHILa10,
  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 \emph{k}-Transmitters in the Presence of Obstacles},
  booktitle={{COCOA} {(2)}},
  year={2010},
  publisher={Springer},
  volume={6509},
  series={Lecture Notes in Computer Science},
  pages={1--15}
}

  131. Global context descriptors for SURF and MSER feature descriptors


    Carmichael, G., Laganière, R., and Bose, P.
    In CRV, pages 309–316, 2010.
    @inproceedings{DBLP:conf/crv/CarmichaelLB10,
  author={Gail Carmichael and Robert Lagani{\`{e}}re and Prosenjit Bose},
  title={Global Context Descriptors for {SURF} and {MSER} Feature Descriptors},
  booktitle={{CRV}},
  year={2010},
  publisher={{IEEE} Computer Society},
  pages={309--316}
}

  132. Should static search trees ever be unbalanced?


    Bose, P. and Douïeb, K.
    In ISAAC (1), pages 109–120, 2010.
    @inproceedings{DBLP:conf/isaac/BoseD10,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb},
  title={Should Static Search Trees Ever Be Unbalanced?},
  booktitle={{ISAAC} {(1)}},
  year={2010},
  publisher={Springer},
  volume={6506},
  series={Lecture Notes in Computer Science},
  pages={109--120}
}

  133. \eMphpi/2-angle yao graphs are spanners


    Bose, P., Damian, M., Douïeb, K., O’Rourke, J., Seamone, B., Smid, M. H. M., and Wuhrer, S.
    In ISAAC (2), pages 446–457, 2010.
    @inproceedings{DBLP:conf/isaac/BoseDDOSSW10,
  author={Prosenjit Bose and Mirela Damian and Karim Dou{\"{\i}}eb and Joseph O'Rourke and Ben Seamone and Michiel H. M. Smid and Stefanie Wuhrer},
  title={\emph{pi}/2-Angle Yao Graphs Are Spanners},
  booktitle={{ISAAC} {(2)}},
  year={2010},
  publisher={Springer},
  volume={6507},
  series={Lecture Notes in Computer Science},
  pages={446--457}
}

  134. Skip lift: A probabilistic alternative to red-black trees


    Bose, P., Douïeb, K., and Morin, P.
    In IWOCA, pages 226–237, 2010.
    @inproceedings{DBLP:conf/iwoca/BoseDM10,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Pat Morin},
  title={Skip Lift: {A} Probabilistic Alternative to Red-Black Trees},
  booktitle={{IWOCA}},
  year={2010},
  publisher={Springer},
  volume={6460},
  series={Lecture Notes in Computer Science},
  pages={226--237}
}

  135. Communication-efficient construction of the plane localized delaunay graph


    Bose, P., Carmi, P., Smid, M. H. M., and Xu, D.
    In LATIN, pages 282–293, 2010.
    @inproceedings{DBLP:conf/latin/BoseCSX10,
  author={Prosenjit Bose and Paz Carmi and Michiel H. M. Smid and Daming Xu},
  title={Communication-Efficient Construction of the Plane Localized Delaunay Graph},
  booktitle={{LATIN}},
  year={2010},
  publisher={Springer},
  volume={6034},
  series={Lecture Notes in Computer Science},
  pages={282--293}
}

  136. Layered working-set trees


    Bose, P., Douïeb, K., Dujmovic, V., and Howat, J.
    In LATIN, pages 686–696, 2010.
    @inproceedings{DBLP:conf/latin/BoseDDH10,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Vida Dujmovic and John Howat},
  title={Layered Working-Set Trees},
  booktitle={{LATIN}},
  year={2010},
  publisher={Springer},
  volume={6034},
  series={Lecture Notes in Computer Science},
  pages={686--696}
}

  137. An \emphO(log log \emphn)-competitive binary search tree with optimal worst-case access times


    Bose, P., Douïeb, K., Dujmovic, V., and Fagerberg, R.
    In SWAT, pages 38–49, 2010.
    @inproceedings{DBLP:conf/swat/BoseDDF10,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Vida Dujmovic and Rolf Fagerberg},
  title={An \emph{O}(log log \emph{n})-Competitive Binary Search Tree with Optimal Worst-Case Access Times},
  booktitle={{SWAT}},
  year={2010},
  publisher={Springer},
  volume={6139},
  series={Lecture Notes in Computer Science},
  pages={38--49}
}

  138. Improved methods for generating quasi-gray codes


    Bose, P., Carmi, P., Jansens, D., Maheshwari, A., Morin, P., and Smid, M. H. M.
    In SWAT, pages 224–235, 2010.
    @inproceedings{DBLP:conf/swat/BoseCJMMS10,
  author={Prosenjit Bose and Paz Carmi and Dana Jansens and Anil Maheshwari and Pat Morin and Michiel H. M. Smid},
  title={Improved Methods For Generating Quasi-gray Codes},
  booktitle={{SWAT}},
  year={2010},
  publisher={Springer},
  volume={6139},
  series={Lecture Notes in Computer Science},
  pages={224--235}
}

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


    Abel, Z., Ballinger, B., Bose, P., Collette, S., Dujmovic, V., Hurtado, F., Kominers, S. D., Langerman, S., Pór, A., and Wood, D. R.
    In CCCG, pages 99–102, 2009.
    @inproceedings{DBLP:conf/cccg/AbelBBCDHKLPW09,
  author={Zachary Abel and Brad Ballinger and Prosenjit Bose and S{\'{e}}bastien Collette and Vida Dujmovic and Ferran Hurtado and Scott 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},
  booktitle={{CCCG}},
  year={2009},
  pages={99--102}
}

  140. The spanning ratio of the delaunay triangulation is greater than pi/2


    Bose, P., Devroye, L., Löffler, M., Snoeyink, J., and Verma, V.
    In CCCG, pages 165–167, 2009.
    @inproceedings{DBLP:conf/cccg/BoseDLSV09,
  author={Prosenjit Bose and Luc Devroye and Maarten L{\"{o}}ffler and Jack Snoeyink and Vishal Verma},
  title={The spanning ratio of the Delaunay triangulation is greater than pi/2},
  booktitle={{CCCG}},
  year={2009},
  pages={165--167}
}

  141. Relaxed gabriel graphs


    Bose, P., Cardinal, J., Collette, S., Demaine, E. D., Palop, B., Taslakian, P., and Zeh, N.
    In CCCG, pages 169–172, 2009.
    @inproceedings{DBLP:conf/cccg/BoseCCDPTZ09,
  author={Prosenjit Bose and Jean Cardinal and S{\'{e}}bastien Collette and Erik D. Demaine and Bel{\'{e}}n Palop and Perouz Taslakian and Norbert Zeh},
  title={Relaxed Gabriel Graphs},
  booktitle={{CCCG}},
  year={2009},
  pages={169--172}
}

  142. Posture invariant correspondence of triangular meshes in shape space


    Wuhrer, S., Shu, C., and Bose, P.
    In ICCV Workshops, pages 1574–1581, 2009.
    @inproceedings{DBLP:conf/iccvw/Wuhrer0B09,
  author={Stefanie Wuhrer and Chang Shu and Prosenjit Bose},
  title={Posture invariant correspondence of triangular meshes in shape space},
  booktitle={{ICCV} Workshops},
  year={2009},
  publisher={{IEEE} Computer Society},
  pages={1574--1581}
}

  143. Bounding the locality of distributed routing algorithms


    Bose, P., Carmi, P., and Durocher, S.
    In PODC, pages 250–259, 2009.
    @inproceedings{DBLP:conf/podc/BoseCD09,
  author={Prosenjit Bose and Paz Carmi and Stephane Durocher},
  title={Bounding the locality of distributed routing algorithms},
  booktitle={{PODC}},
  year={2009},
  publisher={{ACM}},
  pages={250--259}
}

  144. Filling holes in triangular meshes by curve unfolding


    Brunton, A., Wuhrer, S., Shu, C., Bose, P., and Demaine, E. D.
    In Shape Modeling International, pages 66–72, 2009.
    @inproceedings{DBLP:conf/smi/BruntonWSBD09,
  author={Alan Brunton and Stefanie Wuhrer and Chang Shu and Prosenjit Bose and Erik D. Demaine},
  title={Filling holes in triangular meshes by curve unfolding},
  booktitle={Shape Modeling International},
  year={2009},
  publisher={{IEEE} Computer Society},
  pages={66--72}
}

  145. Succinct geometric indexes supporting point location queries


    Bose, P., Chen, E. Y., He, M., Maheshwari, A., and Morin, P.
    In SODA, pages 635–644, 2009.
    @inproceedings{DBLP:conf/soda/BoseCHMM09,
  author={Prosenjit Bose and Eric Y. Chen and Meng He and Anil Maheshwari and Pat Morin},
  title={Succinct geometric indexes supporting point location queries},
  booktitle={{SODA}},
  year={2009},
  publisher={{SIAM}},
  pages={635--644}
}

  146. Succinct orthogonal range search structures on a grid with applications to text indexing


    Bose, P., He, M., Maheshwari, A., and Morin, P.
    In WADS, pages 98–109, 2009.
    @inproceedings{DBLP:conf/wads/BoseHMM09,
  author={Prosenjit Bose and Meng He and Anil Maheshwari and Pat Morin},
  title={Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing},
  booktitle={{WADS}},
  year={2009},
  publisher={Springer},
  volume={5664},
  series={Lecture Notes in Computer Science},
  pages={98--109}
}

  147. A distribution-sensitive dictionary with low space overhead


    Bose, P., Howat, J., and Morin, P.
    In WADS, pages 110–118, 2009.
    @inproceedings{DBLP:conf/wads/BoseHM09,
  author={Prosenjit Bose and John Howat and Pat Morin},
  title={A Distribution-Sensitive Dictionary with Low Space Overhead},
  booktitle={{WADS}},
  year={2009},
  publisher={Springer},
  volume={5664},
  series={Lecture Notes in Computer Science},
  pages={110--118}
}

  148. Efficient construction of near-optimal binary and multiway search trees


    Bose, P. and Douïeb, K.
    In WADS, pages 230–241, 2009.
    @inproceedings{DBLP:conf/wads/BoseD09,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb},
  title={Efficient Construction of Near-Optimal Binary and Multiway Search Trees},
  booktitle={{WADS}},
  year={2009},
  publisher={Springer},
  volume={5664},
  series={Lecture Notes in Computer Science},
  pages={230--241}
}

  149. Triangulating and guarding realistic polygons


    Aloupis, G., Bose, P., Dujmovic, V., Gray, C., Langerman, S., and Speckmann, B.
    In CCCG, 2008.
    @inproceedings{DBLP:conf/cccg/AloupisBDGLS08,
  author={Greg Aloupis and Prosenjit Bose and Vida Dujmovic and Chris Gray and Stefan Langerman and Bettina Speckmann},
  title={Triangulating and Guarding Realistic Polygons},
  booktitle={{CCCG}},
  year={2008}
}

  150. Smallest enclosing circle centered on a query line segment


    Bose, P., Langerman, S., and Roy, S.
    In CCCG, 2008.
    @inproceedings{DBLP:conf/cccg/BoseLR08,
  author={Prosenjit Bose and Stefan Langerman and Sasanka Roy},
  title={Smallest enclosing circle centered on a query line segment},
  booktitle={{CCCG}},
  year={2008}
}

  151. Isometric morphing of triangular meshes


    Bose, P., O’Rourke, J., Shu, C., and Wuhrer, S.
    In CCCG, 2008.
    @inproceedings{DBLP:conf/cccg/BoseOSW08,
  author={Prosenjit Bose and Joseph O'Rourke and Chang Shu and Stefanie Wuhrer},
  title={Isometric Morphing of Triangular Meshes},
  booktitle={{CCCG}},
  year={2008}
}

  152. On the stretch factor of convex delaunay graphs


    Bose, P., Carmi, P., Collette, S., and Smid, M. H. M.
    In ISAAC, pages 656–667, 2008.
    @inproceedings{DBLP:conf/isaac/BoseCCS08,
  author={Prosenjit Bose and Paz Carmi and S{\'{e}}bastien Collette and Michiel H. M. Smid},
  title={On the Stretch Factor of Convex Delaunay Graphs},
  booktitle={{ISAAC}},
  year={2008},
  publisher={Springer},
  volume={5369},
  series={Lecture Notes in Computer Science},
  pages={656--667}
}

  153. Spanners of complete k -partite geometric graphs


    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Morin, P., and Smid, M. H. M.
    In LATIN, pages 170–181, 2008.
    @inproceedings{DBLP:conf/latin/BoseCCMMS08,
  author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Anil Maheshwari and Pat Morin and Michiel H. M. Smid},
  title={Spanners of Complete k -Partite Geometric Graphs},
  booktitle={{LATIN}},
  year={2008},
  publisher={Springer},
  volume={4957},
  series={Lecture Notes in Computer Science},
  pages={170--181}
}

  154. Dynamic optimality for skip lists and b-trees


    Bose, P., Douïeb, K., and Langerman, S.
    In SODA, pages 1106–1114, 2008.
    @inproceedings{DBLP:conf/soda/BoseDL08,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Stefan Langerman},
  title={Dynamic optimality for skip lists and B-trees},
  booktitle={{SODA}},
  year={2008},
  publisher={{SIAM}},
  pages={1106--1114}
}

  155. Spanners of additively weighted point sets


    Bose, P., Carmi, P., and Couture, M.
    In SWAT, pages 367–377, 2008.
    @inproceedings{DBLP:conf/swat/BoseCC08,
  author={Prosenjit Bose and Paz Carmi and Mathieu Couture},
  title={Spanners of Additively Weighted Point Sets},
  booktitle={{SWAT}},
  year={2008},
  publisher={Springer},
  volume={5124},
  series={Lecture Notes in Computer Science},
  pages={367--377}
}

  156. Computing the greedy spanner in near-quadratic time


    Bose, P., Carmi, P., Farshi, M., Maheshwari, A., and Smid, M. H. M.
    In SWAT, pages 390–401, 2008.
    @inproceedings{DBLP:conf/swat/BoseCFMS08,
  author={Prosenjit Bose and Paz Carmi and Mohammad Farshi and Anil Maheshwari and Michiel H. M. Smid},
  title={Computing the Greedy Spanner in Near-Quadratic Time},
  booktitle={{SWAT}},
  year={2008},
  publisher={Springer},
  volume={5124},
  series={Lecture Notes in Computer Science},
  pages={390--401}
}

  157. A characterization of the degree sequences of 2-trees


    Bose, P., Dujmovic, V., Krizanc, D., Langerman, S., Morin, P., Wood, D. R., and Wuhrer, S.
    In ANALCO, pages 232–241, 2007.
    @inproceedings{DBLP:conf/analco/BoseDKLMWW07,
  author={Prosenjit Bose and Vida Dujmovic and Danny Krizanc and Stefan Langerman and Pat Morin and David R. Wood and Stefanie Wuhrer},
  title={A Characterization of the Degree Sequences of 2-trees},
  booktitle={{ANALCO}},
  year={2007},
  publisher={{SIAM}},
  pages={232--241}
}

  158. Optimal point set partitioning using rigid motion star placement


    Bose, P. and Morrison, J.
    In CCCG, pages 49–52, 2007.
    @inproceedings{DBLP:conf/cccg/BoseM07,
  author={Prosenjit Bose and Jason Morrison},
  title={Optimal Point Set Partitioning using Rigid Motion Star Placement},
  booktitle={{CCCG}},
  year={2007},
  publisher={Carleton University, Ottawa, Canada},
  pages={49--52}
}

  159. Vertex pops and popturns


    Aloupis, G., Ballinger, B., Bose, P., Damian, M., Demaine, E. D., Demaine, M. L., Flatland, R. Y., Hurtado, F., Langerman, S., O’Rourke, J., Taslakian, P., and Toussaint, G. T.
    In CCCG, pages 137–140, 2007.
    @inproceedings{DBLP:conf/cccg/AloupisBBDDDFHLOTT07,
  author={Greg Aloupis and Brad Ballinger and Prosenjit Bose and Mirela Damian and Erik D. Demaine and Martin L. Demaine and Robin Y. Flatland and Ferran Hurtado and Stefan Langerman and Joseph O'Rourke and Perouz Taslakian and Godfried T. Toussaint},
  title={Vertex Pops and Popturns},
  booktitle={{CCCG}},
  year={2007},
  publisher={Carleton University, Ottawa, Canada},
  pages={137--140}
}

  160. Approximations of geodesic distances for incomplete triangular manifolds


    Azouz, Z. B., Bose, P., Shu, C., and Wuhrer, S.
    In CCCG, pages 177–180, 2007.
    @inproceedings{DBLP:conf/cccg/AzouzBSW07,
  author={Zouhour Ben Azouz and Prosenjit Bose and Chang Shu and Stefanie Wuhrer},
  title={Approximations of Geodesic Distances for Incomplete Triangular Manifolds},
  booktitle={{CCCG}},
  year={2007},
  publisher={Carleton University, Ottawa, Canada},
  pages={177--180}
}

  161. Linear-space algorithms for distance preserving embedding


    Asano, T., Bose, P., Carmi, P., Maheshwari, A., Shu, C., Smid, M. H. M., and Wuhrer, S.
    In CCCG, pages 185–188, 2007.
    @inproceedings{DBLP:conf/cccg/AsanoBCMSSW07,
  author={Tetsuo Asano and Prosenjit Bose and Paz Carmi and Anil Maheshwari and Chang Shu and Michiel H. M. Smid and Stefanie Wuhrer},
  title={Linear-Space Algorithms for Distance Preserving Embedding},
  booktitle={{CCCG}},
  year={2007},
  publisher={Carleton University, Ottawa, Canada},
  pages={185--188}
}

  162. Traversing a set of points with a minimum number of turns


    Bereg, S., Bose, P., Dumitrescu, A., Hurtado, F., and Valtr, P.
    In SCG, pages 46–55, 2007.
    @inproceedings{DBLP:conf/compgeom/BeregBDHV07,
  author={Sergey Bereg and Prosenjit Bose and Adrian Dumitrescu and Ferran Hurtado and Pavel Valtr},
  title={Traversing a set of points with a minimum number of turns},
  booktitle={{SCG}},
  year={2007},
  publisher={{ACM}},
  pages={46--55}
}

  163. Location oblivious distributed unit disk graph coloring


    Couture, M., Barbeau, M., Bose, P., Carmi, P., and Kranakis, E.
    In SIROCCO, pages 222–233, 2007.
    @inproceedings{DBLP:conf/sirocco/CoutureBBCK07,
  author={Mathieu Couture and Michel Barbeau and Prosenjit Bose and Paz Carmi and Evangelos Kranakis},
  title={Location Oblivious Distributed Unit Disk Graph Coloring},
  booktitle={{SIROCCO}},
  year={2007},
  publisher={Springer},
  volume={4474},
  series={Lecture Notes in Computer Science},
  pages={222--233}
}

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


    Bose, P., Carmi, P., Couture, M., Smid, M. H. M., and Xu, D.
    In WADS, pages 300–311, 2007.
    @inproceedings{DBLP:conf/wads/BoseCCSX07,
  author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Michiel H. M. Smid and Daming Xu},
  title={On a Family of Strong Geometric Spanners That Admit Local Routing Strategies},
  booktitle={{WADS}},
  year={2007},
  publisher={Springer},
  volume={4619},
  series={Lecture Notes in Computer Science},
  pages={300--311}
}

  165. On generalized diamond spanners


    Bose, P., Lee, A., and Smid, M. H. M.
    In WADS, pages 325–336, 2007.
    @inproceedings{DBLP:conf/wads/BoseLS07,
  author={Prosenjit Bose and Aaron Lee and Michiel H. M. Smid},
  title={On Generalized Diamond Spanners},
  booktitle={{WADS}},
  year={2007},
  publisher={Springer},
  volume={4619},
  series={Lecture Notes in Computer Science},
  pages={325--336}
}

  166. Geometric spanners with small chromatic number


    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Smid, M. H. M., and Zeh, N.
    In WAOA, pages 75–88, 2007.
    @inproceedings{DBLP:conf/waoa/BoseCCMSZ07,
  author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Anil Maheshwari and Michiel H. M. Smid and Norbert Zeh},
  title={Geometric Spanners with Small Chromatic Number},
  booktitle={{WAOA}},
  year={2007},
  publisher={Springer},
  volume={4927},
  series={Lecture Notes in Computer Science},
  pages={75--88}
}

  167. Computing the tool path of an externally monotone polygon in linear time


    Bose, P., Bremner, D., and Souvaine, D. L.
    In CCCG, 2006.
    @inproceedings{DBLP:conf/cccg/BoseBS06,
  author={Prosenjit Bose and David Bremner and Diane L. Souvaine},
  title={Computing the Tool Path of an Externally Monotone Polygon in Linear Time},
  booktitle={{CCCG}},
  year={2006}
}

  168. Optimal polygon placement


    Bose, P. and Morrison, J.
    In CCCG, 2006.
    @inproceedings{DBLP:conf/cccg/BoseM06,
  author={Prosenjit Bose and Jason Morrison},
  title={Optimal Polygon Placement},
  booktitle={{CCCG}},
  year={2006}
}

  169. Rotationally monotone polygons


    Bose, P., Morin, P., Smid, M. H. M., and Wuhrer, S.
    In CCCG, 2006.
    @inproceedings{DBLP:conf/cccg/BoseMSW06,
  author={Prosenjit Bose and Pat Morin and Michiel H. M. Smid and Stefanie Wuhrer},
  title={Rotationally Monotone Polygons},
  booktitle={{CCCG}},
  year={2006}
}

  170. Lazy generation of building interiors in realtime


    Hahn, E., Bose, P., and Whitehead, A. D.
    In CCECE, pages 2441–2444, 2006.
    @inproceedings{DBLP:conf/ccece/HahnBW06,
  author={Evan Hahn and Prosenjit Bose and Anthony D. Whitehead},
  title={Lazy Generation of Building Interiors in Realtime},
  booktitle={{CCECE}},
  year={2006},
  publisher={{IEEE}},
  pages={2441--2444}
}

  171. Diamond triangulations contain spanners of bounded degree


    Bose, P., Smid, M. H. M., and Xu, D.
    In ISAAC, pages 173–182, 2006.
    @inproceedings{DBLP:conf/isaac/BoseSX06,
  author={Prosenjit Bose and Michiel H. M. Smid and Daming Xu},
  title={Diamond Triangulations Contain Spanners of Bounded Degree},
  booktitle={{ISAAC}},
  year={2006},
  publisher={Springer},
  volume={4288},
  series={Lecture Notes in Computer Science},
  pages={173--182}
}

  172. On the stretch factor of the constrained delaunay triangulation


    Bose, P. and Keil, J. M.
    In ISVD, pages 25–31, 2006.
    @inproceedings{DBLP:conf/isvd/BoseK06,
  author={Prosenjit Bose and J. Mark Keil},
  title={On the Stretch Factor of the Constrained Delaunay Triangulation},
  booktitle={{ISVD}},
  year={2006},
  publisher={{IEEE} Computer Society},
  pages={25--31}
}

  173. Data structures for halfplane proximity queries and incremental voronoi diagrams


    Aronov, B., Bose, P., Demaine, E. D., Gudmundsson, J., Iacono, J., Langerman, S., and Smid, M. H. M.
    In LATIN, pages 80–92, 2006.
    @inproceedings{DBLP:conf/latin/AronovBDGILS06,
  author={Boris Aronov and Prosenjit Bose and Erik D. Demaine and Joachim Gudmundsson and John Iacono and Stefan Langerman and Michiel H. M. Smid},
  title={Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams},
  booktitle={{LATIN}},
  year={2006},
  publisher={Springer},
  volume={3887},
  series={Lecture Notes in Computer Science},
  pages={80--92}
}

  174. Incremental construction of \emphk-dominating sets in wireless sensor networks


    Couture, M., Barbeau, M., Bose, P., and Kranakis, E.
    In OPODIS, pages 202–214, 2006.
    @inproceedings{DBLP:conf/opodis/CoutureBBK06,
  author={Mathieu Couture and Michel Barbeau and Prosenjit Bose and Evangelos Kranakis},
  title={Incremental Construction of \emph{k}-Dominating Sets in Wireless Sensor Networks},
  booktitle={{OPODIS}},
  year={2006},
  publisher={Springer},
  volume={4305},
  series={Lecture Notes in Computer Science},
  pages={202--214}
}

  175. Persistent realtime building interior generation


    Hahn, E., Bose, P., and Whitehead, A. D.
    In Sandbox@SIGGRAPH, pages 179–186, 2006.
    @inproceedings{DBLP:conf/siggraph/HahnBW06,
  author={Evan Hahn and Prosenjit Bose and Anthony D. Whitehead},
  title={Persistent realtime building interior generation},
  booktitle={Sandbox@SIGGRAPH},
  year={2006},
  publisher={{ACM}},
  pages={179--186}
}

  176. Simultaneous diagonal flips in plane triangulations


    Bose, P., Czyzowicz, J., Gao, Z., Morin, P., and Wood, D. R.
    In SODA, pages 212–221, 2006.
    @inproceedings{DBLP:conf/soda/BoseCGMW06,
  author={Prosenjit Bose and Jurek Czyzowicz and Zhicheng Gao and Pat Morin and David R. Wood},
  title={Simultaneous diagonal flips in plane triangulations},
  booktitle={{SODA}},
  year={2006},
  publisher={{ACM} Press},
  pages={212--221}
}

  177. Feature-based cut detection with automatic threshold selection


    Whitehead, A. D., Bose, P., and Laganière, R.
    In TRECVID, 2006.
    @inproceedings{DBLP:conf/trecvid/WhiteheadBL06,
  author={Anthony D. Whitehead and Prosenjit Bose and Robert Lagani{\`{e}}re},
  title={Feature-based cut detection with automatic threshold selection},
  booktitle={{TRECVID}},
  year={2006},
  publisher={National Institute of Standards and Technology {(NIST)}}
}

  178. Translating a star over a point set


    Bose, P. and Morrison, J.
    In CCCG, pages 179–182, 2005.
    @inproceedings{DBLP:conf/cccg/BoseM05,
  author={Prosenjit Bose and Jason Morrison},
  title={Translating a Star over a Point Set},
  booktitle={{CCCG}},
  year={2005},
  pages={179--182}
}

  179. High-speed texture-preserving digital image inpainting


    Whitehead, A. D., Bose, P., and Audet, V.
    In SIP, pages 526–531, 2005.
    @inproceedings{DBLP:conf/sip/WhiteheadBA05,
  author={Anthony D. Whitehead and Prosenjit Bose and Veronique Audet},
  title={High-speed texture-preserving digital image inpainting},
  booktitle={{SIP}},
  year={2005},
  publisher={{IASTED/ACTA} Press},
  pages={526--531}
}

  180. Approximate range mode and range median queries


    Bose, P., Kranakis, E., Morin, P., and Tang, Y.
    In STACS, pages 377–388, 2005.
    @inproceedings{DBLP:conf/stacs/BoseKMT05,
  author={Prosenjit Bose and Evangelos Kranakis and Pat Morin and Yihui Tang},
  title={Approximate Range Mode and Range Median Queries},
  booktitle={{STACS}},
  year={2005},
  publisher={Springer},
  volume={3404},
  series={Lecture Notes in Computer Science},
  pages={377--388}
}

  181. Temporal synchronization of video sequences in theory and in practice


    Whitehead, A. D., Laganière, R., and Bose, P.
    In WACV/MOTION, pages 132–137, 2005.
    @inproceedings{DBLP:conf/wacv/WhiteheadLB05,
  author={Anthony D. Whitehead and Robert Lagani{\`{e}}re and Prosenjit Bose},
  title={Temporal Synchronization of Video Sequences in Theory and in Practice},
  booktitle={{WACV/MOTION}},
  year={2005},
  publisher={{IEEE} Computer Society},
  pages={132--137}
}

  182. Induced subgraphs of bounded degree and bounded treewidth


    Bose, P., Dujmovic, V., and Wood, D. R.
    In WG, pages 175–186, 2005.
    @inproceedings{DBLP:conf/wg/BoseDW05,
  author={Prosenjit Bose and Vida Dujmovic and David R. Wood},
  title={Induced Subgraphs of Bounded Degree and Bounded Treewidth},
  booktitle={{WG}},
  year={2005},
  publisher={Springer},
  volume={3787},
  series={Lecture Notes in Computer Science},
  pages={175--186}
}

  183. On properties of higher-order delaunay graphs with applications


    Abellanas, M., Bose, P., García-López, J., Hurtado, F., Nicolás, M., and Ramos, P. A.
    In EuroCG, pages 119–122, 2005.
    @inproceedings{DBLP:conf/ewcg/AbellanasBGHNR05,
  author={Manuel Abellanas and Prosenjit Bose and Jes{\'{u}}s Garc{\'{\i}}a{-}L{\'{o}}pez and Ferran Hurtado and Mariano Nicol{\'{a}}s and Pedro A. Ramos},
  title={On properties of higher-order Delaunay graphs with applications},
  booktitle={EuroCG},
  year={2005},
  publisher={Technische Universiteit Eindhoven},
  pages={119--122}
}

  184. Computing nice sweeps for polyhedra and polygons


    Bose, P. and van Kreveld, M. J.
    In CCCG, pages 108–111, 2004.
    @inproceedings{DBLP:conf/cccg/BoseK04,
  author={Prosenjit Bose and Marc J. van Kreveld},
  title={Computing nice sweeps for polyhedra and polygons},
  booktitle={{CCCG}},
  year={2004},
  pages={108--111}
}

  185. On computing enclosing isosceles triangles and related problems


    Bose, P., Seara, C., and Sethia, S.
    In CCCG, pages 120–123, 2004.
    @inproceedings{DBLP:conf/cccg/BoseSS04,
  author={Prosenjit Bose and Carlos Seara and Saurabh Sethia},
  title={On computing enclosing isosceles triangles and related problems},
  booktitle={{CCCG}},
  year={2004},
  pages={120--123}
}

  186. Feature based cut detection with automatic threshold selection


    Whitehead, A. D., Bose, P., and Laganière, R.
    In CIVR, pages 410–418, 2004.
    @inproceedings{DBLP:conf/civr/WhiteheadBL04,
  author={Anthony D. Whitehead and Prosenjit Bose and Robert Lagani{\`{e}}re},
  title={Feature Based Cut Detection with Automatic Threshold Selection},
  booktitle={{CIVR}},
  year={2004},
  publisher={Springer},
  volume={3115},
  series={Lecture Notes in Computer Science},
  pages={410--418}
}

  187. Geodesic ham-sandwich cuts


    Bose, P., Demaine, E. D., Hurtado, F., Iacono, J., Langerman, S., and Morin, P.
    In SCG, pages 1–9, 2004.
    @inproceedings{DBLP:conf/compgeom/BoseDHILM04,
  author={Prosenjit Bose and Erik D. Demaine and Ferran Hurtado and John Iacono and Stefan Langerman and Pat Morin},
  title={Geodesic ham-sandwich cuts},
  booktitle={{SCG}},
  year={2004},
  publisher={{ACM}},
  pages={1--9}
}

  188. Reconfiguring triangulations with edge flips and point moves


    Aloupis, G., Bose, P., and Morin, P.
    In GD, pages 1–11, 2004.
    @inproceedings{DBLP:conf/gd/AloupisBM04,
  author={Greg Aloupis and Prosenjit Bose and Pat Morin},
  title={Reconfiguring Triangulations with Edge Flips and Point Moves},
  booktitle={{GD}},
  year={2004},
  publisher={Springer},
  volume={3383},
  series={Lecture Notes in Computer Science},
  pages={1--11}
}

  189. Partitions of complete geometric graphs into plane trees


    Bose, P., Hurtado, F., Rivera-Campo, E., and Wood, D. R.
    In GD, pages 71–81, 2004.
    @inproceedings{DBLP:conf/gd/BoseHRW04,
  author={Prosenjit Bose and Ferran Hurtado and Eduardo Rivera{-}Campo and David R. Wood},
  title={Partitions of Complete Geometric Graphs into Plane Trees},
  booktitle={{GD}},
  year={2004},
  publisher={Springer},
  volume={3383},
  series={Lecture Notes in Computer Science},
  pages={71--81}
}

  190. On local transformations in plane geometric graphs embedded on small grids


    Abellanas, M., Bose, P., Olaverri, A. G., Hurtado, F., Ramos, P. A., Rivera-Campo, E., and Tejel, J.
    In ICCSA (3), pages 22–31, 2004.
    @inproceedings{DBLP:conf/iccsa/AbellanasBOHRRT04,
  author={Manuel Abellanas and Prosenjit Bose and Alfredo Garc{\'{\i}}a Olaverri and Ferran Hurtado and Pedro A. Ramos and Eduardo Rivera{-}Campo and Javier Tejel},
  title={On Local Transformations in Plane Geometric Graphs Embedded on Small Grids},
  booktitle={{ICCSA} {(3)}},
  year={2004},
  publisher={Springer},
  volume={3045},
  series={Lecture Notes in Computer Science},
  pages={22--31}
}

  191. Weighted ham-sandwich cuts


    Bose, P. and Langerman, S.
    In JCDCG, pages 48–53, 2004.
    @inproceedings{DBLP:conf/jcdcg/BoseL04,
  author={Prosenjit Bose and Stefan Langerman},
  title={Weighted Ham-Sandwich Cuts},
  booktitle={{JCDCG}},
  year={2004},
  publisher={Springer},
  volume={3742},
  series={Lecture Notes in Computer Science},
  pages={48--53}
}

  192. Bounds for frequency estimation of packet streams


    Bose, P., Kranakis, E., Morin, P., and Tang, Y.
    In SIROCCO, pages 33–42, 2003.
    @inproceedings{DBLP:conf/sirocco/BoseKMT03,
  author={Prosenjit Bose and Evangelos Kranakis and Pat Morin and Yihui Tang},
  title={Bounds for Frequency Estimation of Packet Streams},
  booktitle={{SIROCCO}},
  year={2003},
  publisher={Carleton Scientific},
  volume={17},
  series={Proceedings in Informatics},
  pages={33--42}
}

  193. Approximating geometric bottleneck shortest paths


    Bose, P., Maheshwari, A., Narasimhan, G., Smid, M. H. M., and Zeh, N.
    In STACS, pages 38–49, 2003.
    @inproceedings{DBLP:conf/stacs/BoseMNSZ03,
  author={Prosenjit Bose and Anil Maheshwari and Giri Narasimhan and Michiel H. M. Smid and Norbert Zeh},
  title={Approximating Geometric Bottleneck Shortest Paths},
  booktitle={{STACS}},
  year={2003},
  publisher={Springer},
  volume={2607},
  series={Lecture Notes in Computer Science},
  pages={38--49}
}

  194. Ordered theta graphs


    Bose, P., Gudmundsson, J., and Morin, P.
    In CCCG, pages 17–21, 2002.
    @inproceedings{DBLP:conf/cccg/BoseGM02,
  author={Prosenjit Bose and Joachim Gudmundsson and Pat Morin},
  title={Ordered theta graphs},
  booktitle={{CCCG}},
  year={2002},
  pages={17--21}
}

  195. Computing signed permutations of polygons


    Aloupis, G., Bose, P., Demaine, E. D., Langerman, S., Meijer, H., Overmars, M. H., and Toussaint, G. T.
    In CCCG, pages 68–71, 2002.
    @inproceedings{DBLP:conf/cccg/AloupisBDLMOT02,
  author={Greg Aloupis and Prosenjit Bose and Erik D. Demaine and Stefan Langerman and Henk Meijer and Mark H. Overmars and Godfried T. Toussaint},
  title={Computing signed permutations of polygons},
  booktitle={{CCCG}},
  year={2002},
  pages={68--71}
}

  196. Light edges in degree-constrained graphs


    Bose, P., Smid, M. H. M., and Wood, D. R.
    In CCCG, pages 142–145, 2002.
    @inproceedings{DBLP:conf/cccg/BoseSW02,
  author={Prosenjit Bose and Michiel H. M. Smid and David R. Wood},
  title={Light edges in degree-constrained graphs},
  booktitle={{CCCG}},
  year={2002},
  pages={142--145}
}

  197. Constructing plane spanners of bounded degree and low weight


    Bose, P., Gudmundsson, J., and Smid, M. H. M.
    In ESA, pages 234–246, 2002.
    @inproceedings{DBLP:conf/esa/BoseGS02,
  author={Prosenjit Bose and Joachim Gudmundsson and Michiel H. M. Smid},
  title={Constructing Plane Spanners of Bounded Degree and Low Weight},
  booktitle={{ESA}},
  year={2002},
  publisher={Springer},
  volume={2461},
  series={Lecture Notes in Computer Science},
  pages={234--246}
}

  198. Succinct data structures for approximating convex functions with applications


    Bose, P., Devroye, L., and Morin, P.
    In JCDCG, pages 97–107, 2002.
    @inproceedings{DBLP:conf/jcdcg/BoseDM02,
  author={Prosenjit Bose and Luc Devroye and Pat Morin},
  title={Succinct Data Structures for Approximating Convex Functions with Applications},
  booktitle={{JCDCG}},
  year={2002},
  publisher={Springer},
  volume={2866},
  series={Lecture Notes in Computer Science},
  pages={97--107}
}

  199. Facility location constrained to a polygonal domain


    Bose, P. and Wang, Q.
    In LATIN, pages 153–164, 2002.
    @inproceedings{DBLP:conf/latin/BoseW02,
  author={Prosenjit Bose and Qingda Wang},
  title={Facility Location Constrained to a Polygonal Domain},
  booktitle={{LATIN}},
  year={2002},
  publisher={Springer},
  volume={2286},
  series={Lecture Notes in Computer Science},
  pages={153--164}
}

  200. On the spanning ratio of gabriel graphs and beta-skeletons


    Bose, P., Devroye, L., Evans, W. S., and Kirkpatrick, D. G.
    In LATIN, pages 479–493, 2002.
    @inproceedings{DBLP:conf/latin/BoseDEK02,
  author={Prosenjit Bose and Luc Devroye and William S. Evans and David G. Kirkpatrick},
  title={On the Spanning Ratio of Gabriel Graphs and beta-skeletons},
  booktitle={{LATIN}},
  year={2002},
  publisher={Springer},
  volume={2286},
  series={Lecture Notes in Computer Science},
  pages={479--493}
}

  201. Asymmetric communication protocols via hotlink assignments


    Bose, P., Krizanc, D., Langerman, S., and Morin, P.
    In SIROCCO, pages 33–39, 2002.
    @inproceedings{DBLP:conf/sirocco/BoseKLM02,
  author={Prosenjit Bose and Danny Krizanc and Stefan Langerman and Pat Morin},
  title={Asymmetric Communication Protocols via Hotlink Assignments},
  booktitle={{SIROCCO}},
  year={2002},
  publisher={Carleton Scientific},
  volume={13},
  series={Proceedings in Informatics},
  pages={33--39}
}

  202. Packing two disks into a polygonal environment


    Bose, P., Morin, P., and Vigneron, A.
    In COCOON, pages 142–149, 2001.
    @inproceedings{DBLP:conf/cocoon/BoseMV01,
  author={Prosenjit Bose and Pat Morin and Antoine Vigneron},
  title={Packing Two Disks into a Polygonal Environment},
  booktitle={{COCOON}},
  year={2001},
  publisher={Springer},
  volume={2108},
  series={Lecture Notes in Computer Science},
  pages={142--149}
}

  203. Competitive online routing in geometric graphs


    Bose, P. and Morin, P.
    In SIROCCO, pages 35–44, 2001.
    @inproceedings{DBLP:conf/sirocco/BoseM01,
  author={Prosenjit Bose and Pat Morin},
  title={Competitive Online Routing in Geometric Graphs},
  booktitle={{SIROCCO}},
  year={2001},
  publisher={Carleton Scientific},
  volume={8},
  series={Proceedings in Informatics},
  pages={35--44}
}

  204. The grid placement problem


    Bose, P., Maheshwari, A., Morin, P., and Morrison, J.
    In WADS, pages 180–191, 2001.
    @inproceedings{DBLP:conf/wads/BoseMMM01,
  author={Prosenjit Bose and Anil Maheshwari and Pat Morin and Jason Morrison},
  title={The Grid Placement Problem},
  booktitle={{WADS}},
  year={2001},
  publisher={Springer},
  volume={2125},
  series={Lecture Notes in Computer Science},
  pages={180--191}
}

  205. Flipping your lid


    Ahn, H., Bose, P., Czyzowicz, J., Hanusse, N., Kranakis, E., and Morin, P.
    In CCCG, 2000.
    @inproceedings{DBLP:conf/cccg/AhnBCHKM00,
  author={Hee{-}Kap Ahn and Prosenjit Bose and Jurek Czyzowicz and Nicolas Hanusse and Evangelos Kranakis and Pat Morin},
  title={Flipping your Lid},
  booktitle={{CCCG}},
  year={2000}
}

  206. Strategies for hotlink assignments


    Bose, P., Kranakis, E., Krizanc, D., Martin, M. V., Czyzowicz, J., Pelc, A., and Gasieniec, L.
    In ISAAC, pages 23–34, 2000.
    @inproceedings{DBLP:conf/isaac/BoseKKMCPG00,
  author={Prosenjit Bose and Evangelos Kranakis and Danny Krizanc and Miguel Vargas Martin and Jurek Czyzowicz and Andrzej Pelc and Leszek Gasieniec},
  title={Strategies for Hotlink Assignments},
  booktitle={{ISAAC}},
  year={2000},
  publisher={Springer},
  volume={1969},
  series={Lecture Notes in Computer Science},
  pages={23--34}
}

  207. Online routing in convex subdivisions


    Bose, P., Morin, P., Brodnik, A., Carlsson, S., Demaine, E. D., Fleischer, R., Munro, J. I., and López-Ortiz, A.
    In ISAAC, pages 47–59, 2000.
    @inproceedings{DBLP:conf/isaac/BoseMBCDFML00,
  author={Prosenjit Bose and Pat Morin and Andrej Brodnik and Svante Carlsson and Erik D. Demaine and Rudolf Fleischer and J. Ian Munro and Alejandro L{\'{o}}pez{-}Ortiz},
  title={Online Routing in Convex Subdivisions},
  booktitle={{ISAAC}},
  year={2000},
  publisher={Springer},
  volume={1969},
  series={Lecture Notes in Computer Science},
  pages={47--59}
}

  208. An improved algorithm for subdivision traversal without extra storage


    Bose, P. and Morin, P.
    In ISAAC, pages 444–455, 2000.
    @inproceedings{DBLP:conf/isaac/BoseM00,
  author={Prosenjit Bose and Pat Morin},
  title={An Improved Algorithm for Subdivision Traversal without Extra Storage},
  booktitle={{ISAAC}},
  year={2000},
  publisher={Springer},
  volume={1969},
  series={Lecture Notes in Computer Science},
  pages={444--455}
}

  209. Near optimal-partitioning of rectangles and prisms


    Bose, P., Czyzowicz, J., Kranakis, E., Krizanc, D., and Lessard, D.
    In CCCG, 1999.
    @inproceedings{DBLP:conf/cccg/BoseCKKL99,
  author={Prosenjit Bose and Jurek Czyzowicz and Evangelos Kranakis and Danny Krizanc and Dominic Lessard},
  title={Near optimal-partitioning of rectangles and prisms},
  booktitle={{CCCG}},
  year={1999}
}

  210. Routing with guaranteed delivery in ad hoc wireless networks


    Bose, P., Morin, P., Stojmenovic, I., and Urrutia, J.
    In DIAL-M, pages 48–55, 1999.
    @inproceedings{DBLP:conf/dialm/BoseMSU99,
  author={Prosenjit Bose and Pat Morin and Ivan Stojmenovic and Jorge Urrutia},
  title={Routing with guaranteed delivery in ad hoc wireless networks},
  booktitle={{DIAL-M}},
  year={1999},
  publisher={{ACM}},
  pages={48--55}
}

  211. Coarse grained parallel maximum matching in convex bipartite graphs


    Bose, P., Chan, A., Dehne, F. K. H. A., and Latzel, M.
    In IPPS/SPDP, pages 125–129, 1999.
    @inproceedings{DBLP:conf/ipps/BoseCDL99,
  author={Prosenjit Bose and Albert Chan and Frank K. H. A. Dehne and Markus Latzel},
  title={Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs},
  booktitle={{IPPS/SPDP}},
  year={1999},
  publisher={{IEEE} Computer Society},
  pages={125--129}
}

  212. Online routing in triangulations


    Bose, P. and Morin, P.
    In ISAAC, pages 113–122, 1999.
    @inproceedings{DBLP:conf/isaac/BoseM99,
  author={Prosenjit Bose and Pat Morin},
  title={Online Routing in Triangulations},
  booktitle={{ISAAC}},
  year={1999},
  publisher={Springer},
  volume={1741},
  series={Lecture Notes in Computer Science},
  pages={113--122}
}

  213. Station layouts in the presence of location constraints


    Bose, P., Kaklamanis, C., Kirousis, L. M., Kranakis, E., Krizanc, D., and Peleg, D.
    In ISAAC, pages 269–278, 1999.
    @inproceedings{DBLP:conf/isaac/BoseKKKKP99,
  author={Prosenjit Bose and Christos Kaklamanis and Lefteris M. Kirousis and Evangelos Kranakis and Danny Krizanc and David Peleg},
  title={Station Layouts in the Presence of Location Constraints},
  booktitle={{ISAAC}},
  year={1999},
  publisher={Springer},
  volume={1741},
  series={Lecture Notes in Computer Science},
  pages={269--278}
}

  214. Efficient algorithms for petersen’s matching theorem


    Biedl, T. C., Bose, P., Demaine, E. D., and Lubiw, A.
    In SODA, pages 130–139, 1999.
    @inproceedings{DBLP:conf/soda/BiedlBDL99,
  author={Therese C. Biedl and Prosenjit Bose and Erik D. Demaine and Anna Lubiw},
  title={Efficient Algorithms for Petersen's Matching Theorem},
  booktitle={{SODA}},
  year={1999},
  publisher={{ACM/SIAM}},
  pages={130--139}
}

  215. Optimizing constrained offset and scaled polygonal annuli


    Barequet, G., Bose, P., and Dickerson, M.
    In WADS, pages 62–73, 1999.
    @inproceedings{DBLP:conf/wads/BarequetBD99,
  author={Gill Barequet and Prosenjit Bose and Matthew Dickerson},
  title={Optimizing Constrained Offset and Scaled Polygonal Annuli},
  booktitle={{WADS}},
  year={1999},
  publisher={Springer},
  volume={1663},
  series={Lecture Notes in Computer Science},
  pages={62--73}
}

  216. Testing the quality of manufactured balls


    Bose, P. and Morin, P.
    In WADS, pages 145–156, 1999.
    @inproceedings{DBLP:conf/wads/BoseM99,
  author={Prosenjit Bose and Pat Morin},
  title={Testing the Quality of Manufactured Balls},
  booktitle={{WADS}},
  year={1999},
  publisher={Springer},
  volume={1663},
  series={Lecture Notes in Computer Science},
  pages={145--156}
}

  217. Recovering lines with fixed linear probes


    de Berg, M., Bose, P., Bremner, D., Evans, W. S., and Narayanan, L.
    In CCCG, 1998.
    @inproceedings{DBLP:conf/cccg/BergBBEN98,
  author={Mark de Berg and Prosenjit Bose and David Bremner and William S. Evans and Lata Narayanan},
  title={Recovering lines with fixed linear probes},
  booktitle={{CCCG}},
  year={1998}
}

  218. Detection of text-line orientation


    Bose, P., Caron, J., and Ghoudi, K.
    In CCCG, 1998.
    @inproceedings{DBLP:conf/cccg/BoseCG98,
  author={Prosenjit Bose and Jean{-}Denis Caron and Kilani Ghoudi},
  title={Detection of text-line orientation},
  booktitle={{CCCG}},
  year={1998}
}

  219. Cutting rectangles in equal area pieces


    Bose, P., Czyzowicz, J., and Lessard, D.
    In CCCG, 1998.
    @inproceedings{DBLP:conf/cccg/BoseCL98,
  author={Prosenjit Bose and Jurek Czyzowicz and Dominic Lessard},
  title={Cutting rectangles in equal area pieces},
  booktitle={{CCCG}},
  year={1998}
}

  220. Finding specified sections of arrangements: 2d results


    Bose, P., Hurtado, F., Meijer, H., Ramaswami, S., Rappaport, D., Sacristán, V., Shermer, T. C., and Toussaint, G. T.
    In CCCG, 1998.
    @inproceedings{DBLP:conf/cccg/BoseHMRRSST98,
  author={Prosenjit Bose and Ferran Hurtado and Henk Meijer and Suneeta Ramaswami and David Rappaport and Vera Sacrist{\'{a}}n and Thomas C. Shermer and Godfried T. Toussaint},
  title={Finding specified sections of arrangements: 2d results},
  booktitle={{CCCG}},
  year={1998}
}

  221. Testing the quality of manufactured disks and cylinders


    Bose, P. and Morin, P.
    In ISAAC, pages 129–138, 1998.
    @inproceedings{DBLP:conf/isaac/BoseM98,
  author={Prosenjit Bose and Pat Morin},
  title={Testing the Quality of Manufactured Disks and Cylinders},
  booktitle={{ISAAC}},
  year={1998},
  publisher={Springer},
  volume={1533},
  series={Lecture Notes in Computer Science},
  pages={129--138}
}

  222. Polygon cutting: revisited


    Bose, P., Czyzowicz, J., Kranakis, E., Krizanc, D., and Maheshwari, A.
    In JCDCG, pages 81–92, 1998.
    @inproceedings{DBLP:conf/jcdcg/BoseCKKM98,
  author={Prosenjit Bose and Jurek Czyzowicz and Evangelos Kranakis and Danny Krizanc and Anil Maheshwari},
  title={Polygon Cutting: Revisited},
  booktitle={{JCDCG}},
  year={1998},
  publisher={Springer},
  volume={1763},
  series={Lecture Notes in Computer Science},
  pages={81--92}
}

  223. Algorithms for packing two circles in a convex polygon


    Bose, P., Czyzowicz, J., Kranakis, E., and Maheshwari, A.
    In JCDCG, pages 93–103, 1998.
    @inproceedings{DBLP:conf/jcdcg/BoseCKM98,
  author={Prosenjit Bose and Jurek Czyzowicz and Evangelos Kranakis and Anil Maheshwari},
  title={Algorithms for Packing Two Circles in a Convex Polygon},
  booktitle={{JCDCG}},
  year={1998},
  publisher={Springer},
  volume={1763},
  series={Lecture Notes in Computer Science},
  pages={93--103}
}

  224. Separating an object from its cast


    Ahn, H., de Berg, M., Bose, P., Cheng, S., Halperin, D., Matousek, J., and Schwarzkopf, O.
    In SCG, pages 221–230, 1997.
    @inproceedings{DBLP:conf/compgeom/AhnBBCHMS97,
  author={Hee{-}Kap Ahn and Mark de Berg and Prosenjit Bose and Siu{-}Wing Cheng and Dan Halperin and Jir{\'{\i}} Matousek and Otfried Schwarzkopf},
  title={Separating an Object from its Cast},
  booktitle={{SCG}},
  year={1997},
  publisher={{ACM}},
  pages={221--230}
}

  225. On embedding an outer-planar graph in a point set


    Bose, P.
    In GD, pages 25–36, 1997.
    @inproceedings{DBLP:conf/gd/Bose97,
  author={Prosenjit Bose},
  title={On Embedding an Outer-Planar Graph in a Point Set},
  booktitle={{GD}},
  year={1997},
  publisher={Springer},
  volume={1353},
  series={Lecture Notes in Computer Science},
  pages={25--36}
}

  226. Computing constrained minimum-width annuli of point sets


    de Berg, M., Bose, P., Bremner, D., Ramaswami, S., and Wilfong, G. T.
    In WADS, pages 392–401, 1997.
    @inproceedings{DBLP:conf/wads/BergBBRW97,
  author={Mark de Berg and Prosenjit Bose and David Bremner and Suneeta Ramaswami and Gordon T. Wilfong},
  title={Computing Constrained Minimum-Width Annuli of Point Sets},
  booktitle={{WADS}},
  year={1997},
  publisher={Springer},
  volume={1272},
  series={Lecture Notes in Computer Science},
  pages={392--401}
}

  227. Diamonds are not a minimum weight triangulation’s best friend


    Bose, P., Devroye, L., and Evans, W. S.
    In CCCG, pages 68–73, 1996.
    @inproceedings{DBLP:conf/cccg/BoseDE96,
  author={Prosenjit Bose and Luc Devroye and William S. Evans},
  title={Diamonds Are Not a Minimum Weight Triangulation's Best Friend},
  booktitle={{CCCG}},
  year={1996},
  publisher={Carleton University Press},
  pages={68--73}
}

  228. Approximating shortest paths in arrangements of lines


    Bose, P., Evans, W. S., Kirkpatrick, D. G., McAllister, M., and Snoeyink, J.
    In CCCG, pages 143–148, 1996.
    @inproceedings{DBLP:conf/cccg/BoseEKMS96,
  author={Prosenjit Bose and William S. Evans and David G. Kirkpatrick and Michael McAllister and Jack Snoeyink},
  title={Approximating Shortest Paths in Arrangements of Lines},
  booktitle={{CCCG}},
  year={1996},
  publisher={Carleton University Press},
  pages={143--148}
}

  229. Efficient algorithms for guarding or illuminating the surface of a polyhedral terrain


    Bose, P., Kirkpatrick, D. G., and Li, Z.
    In CCCG, pages 217–222, 1996.
    @inproceedings{DBLP:conf/cccg/BoseKL96,
  author={Prosenjit Bose and David G. Kirkpatrick and Zaiqing Li},
  title={Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain},
  booktitle={{CCCG}},
  year={1996},
  publisher={Carleton University Press},
  pages={217--222}
}

  230. The complexity of rivers in triangulated terrains


    de Berg, M., Bose, P., Dobrindt, K., van Kreveld, M. J., Overmars, M. H., de Groot, M., Roos, T., Snoeyink, J., and Yu, S.
    In CCCG, pages 325–330, 1996.
    @inproceedings{DBLP:conf/cccg/BergBDKOGRSY96,
  author={Mark de Berg and Prosenjit Bose and Katrin Dobrindt and Marc J. van Kreveld and Mark H. Overmars and Marko de Groot and Thomas Roos and Jack Snoeyink and Sidi Yu},
  title={The Complexity of Rivers in Triangulated Terrains},
  booktitle={{CCCG}},
  year={1996},
  publisher={Carleton University Press},
  pages={325--330}
}

  231. Computing the constrained euclidean geodesic and link center of a simple polygon with application


    Bose, P. and Toussaint, G. T.
    In Computer Graphics International, pages 102–110, 1996.
    @inproceedings{DBLP:conf/cgi/BoseT96,
  author={Prosenjit Bose and Godfried T. Toussaint},
  title={Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application},
  booktitle={Computer Graphics International},
  year={1996},
  publisher={{IEEE} Computer Society},
  pages={102--110}
}

  232. On the sectional area of convex polytopes


    Avis, D., Bose, P., Toussaint, G. T., Shermer, T. C., Zhu, B., and Snoeyink, J.
    In SCG, pages C–11–C–12, 1996.
    @inproceedings{DBLP:conf/compgeom/AvisBTSZS96,
  author={David Avis and Prosenjit Bose and Godfried T. Toussaint and Thomas C. Shermer and Binhai Zhu and Jack Snoeyink},
  title={On the Sectional Area of Convex Polytopes},
  booktitle={{SCG}},
  year={1996},
  publisher={{ACM}},
  pages={C--11--C--12}
}

  233. On rectangle visibility graphs


    Bose, P., Dean, A. M., Hutchinson, J. P., and Shermer, T. C.
    In GD, pages 25–44, 1996.
    @inproceedings{DBLP:conf/gd/BoseDHS96,
  author={Prosenjit Bose and Alice M. Dean and Joan P. Hutchinson and Thomas C. Shermer},
  title={On Rectangle Visibility Graphs},
  booktitle={{GD}},
  year={1996},
  publisher={Springer},
  volume={1190},
  series={Lecture Notes in Computer Science},
  pages={25--44}
}

  234. Aperture angle optimization problems


    Bose, P., Hurtado, F., Omaña-Pulido, E., and Toussaint, G. T.
    In CCCG, pages 73–78, 1995.
    @inproceedings{DBLP:conf/cccg/BoseHOT95,
  author={Prosenjit Bose and Ferran Hurtado and Elsa Oma{\~{n}}a{-}Pulido and Godfried T. Toussaint},
  title={Aperture angle optimization problems},
  booktitle={{CCCG}},
  year={1995},
  publisher={Carleton University, Ottawa, Canada},
  pages={73--78}
}

  235. Drawing nice projections of objects in space


    Bose, P., Gómez, F., Ramos, P. A., and Toussaint, G. T.
    In GD, pages 52–63, 1995.
    @inproceedings{DBLP:conf/gd/BoseGRT95,
  author={Prosenjit Bose and Francisco G{\'{o}}mez and Pedro A. Ramos and Godfried T. Toussaint},
  title={Drawing Nice Projections of Objects in Space},
  booktitle={{GD}},
  year={1995},
  publisher={Springer},
  volume={1027},
  series={Lecture Notes in Computer Science},
  pages={52--63}
}

  236. Optimal algorithms to embed trees in a point set


    Bose, P., McAllister, M., and Snoeyink, J.
    In GD, pages 64–75, 1995.
    @inproceedings{DBLP:conf/gd/BoseMS95,
  author={Prosenjit Bose and Michael McAllister and Jack Snoeyink},
  title={Optimal Algorithms to Embed Trees in a Point Set},
  booktitle={{GD}},
  year={1995},
  publisher={Springer},
  volume={1027},
  series={Lecture Notes in Computer Science},
  pages={64--75}
}

  237. No quadrangulation is extremely odd


    Bose, P. and Toussaint, G. T.
    In ISAAC, pages 372–381, 1995.
    @inproceedings{DBLP:conf/isaac/BoseT95,
  author={Prosenjit Bose and Godfried T. Toussaint},
  title={No Quadrangulation is Extremely Odd},
  booktitle={{ISAAC}},
  year={1995},
  publisher={Springer},
  volume={1004},
  series={Lecture Notes in Computer Science},
  pages={372--381}
}

  238. All convex polyhedra can be clamped with parallel jaw grippers


    Bose, P., Bremner, D., and Toussaint, G. T.
    In CCCG, pages 344–349, 1994.
    @inproceedings{DBLP:conf/cccg/BoseBT94,
  author={Prosenjit Bose and David Bremner and Godfried T. Toussaint},
  title={All Convex Polyhedra can be Clamped with Parallel Jaw Grippers},
  booktitle={{CCCG}},
  year={1994},
  publisher={University of Saskatchewan},
  pages={344--349}
}

  239. K-guarding polygons on the plane


    Belleville, P., Bose, P., Czyzowicz, J., Urrutia, J., and Zaks, J.
    In CCCG, pages 381–386, 1994.
    @inproceedings{DBLP:conf/cccg/BellevilleBCUZ94,
  author={Patrice Belleville and Prosenjit Bose and Jurek Czyzowicz and Jorge Urrutia and Joseph Zaks},
  title={K-Guarding Polygons on the Plane},
  booktitle={{CCCG}},
  year={1994},
  publisher={University of Saskatchewan},
  pages={381--386}
}

  240. Determining the castability of simple polyhedra


    Bose, P., Bremner, D., and van Kreveld, M. J.
    In SCG, pages 123–131, 1994.
    @inproceedings{DBLP:conf/compgeom/BoseBK94,
  author={Prosenjit Bose and David Bremner and Marc J. van Kreveld},
  title={Determining the Castability of Simple Polyhedra},
  booktitle={{SCG}},
  year={1994},
  publisher={{ACM}},
  pages={123--131}
}

  241. Proximity constraints and representable trees


    Bose, P., Battista, G. D., Lenhart, W. J., and Liotta, G.
    In GD, pages 340–351, 1994.
    @inproceedings{DBLP:conf/gd/BoseBLL94,
  author={Prosenjit Bose and Giuseppe Di Battista and William J. Lenhart and Giuseppe Liotta},
  title={Proximity Constraints and Representable Trees},
  booktitle={{GD}},
  year={1994},
  publisher={Springer},
  volume={894},
  series={Lecture Notes in Computer Science},
  pages={340--351}
}

  242. Every set of disjoint line segments admits a binary tree


    Bose, P., Houle, M. E., and Toussaint, G. T.
    In ISAAC, pages 20–28, 1994.
    @inproceedings{DBLP:conf/isaac/BoseHT94,
  author={Prosenjit Bose and Michael E. Houle and Godfried T. Toussaint},
  title={Every Set of Disjoint Line Segments Admits a Binary Tree},
  booktitle={{ISAAC}},
  year={1994},
  publisher={Springer},
  volume={834},
  series={Lecture Notes in Computer Science},
  pages={20--28}
}

  243. The floodlight problem


    Bose, P., Guibas, L. J., Lubiw, A., Overmars, M. H., Souvaine, D. L., and Urrutia, J.
    In CCCG, pages 399–404, 1993.
    @inproceedings{DBLP:conf/cccg/BoseGLOSU93,
  author={Prosenjit Bose and Leonidas J. Guibas and Anna Lubiw and Mark H. Overmars and Diane L. Souvaine and Jorge Urrutia},
  title={The Floodlight Problem},
  booktitle={{CCCG}},
  year={1993},
  publisher={University of Waterloo},
  pages={399--404}
}

  244. Feasability of design in stereolithography


    Asberg, B., Blanco, G., Bose, P., Garcia-Lopez, J., Overmars, M. H., Toussaint, G. T., Wilfong, G. T., and Zhu, B.
    In FSTTCS, pages 228–237, 1993.
    @inproceedings{DBLP:conf/fsttcs/AsbergBBGOTWZ93,
  author={Boudewijn Asberg and Gregoria Blanco and Prosenjit Bose and Jesus Garcia{-}Lopez and Mark H. Overmars and Godfried T. Toussaint and Gordon T. Wilfong and Binhai Zhu},
  title={Feasability of Design in Stereolithography},
  booktitle={{FSTTCS}},
  year={1993},
  publisher={Springer},
  volume={761},
  series={Lecture Notes in Computer Science},
  pages={228--237}
}

  245. Pattern matching for permutations


    Bose, P., Buss, J. F., and Lubiw, A.
    In WADS, pages 200–209, 1993.
    @inproceedings{DBLP:conf/wads/BoseBL93,
  author={Prosenjit Bose and Jonathan F. Buss and Anna Lubiw},
  title={Pattern Matching for Permutations},
  booktitle={{WADS}},
  year={1993},
  publisher={Springer},
  volume={709},
  series={Lecture Notes in Computer Science},
  pages={200--209}
}

  246. Filling polyhedral molds


    Bose, P., van Kreveld, M. J., and Toussaint, G. T.
    In WADS, pages 210–221, 1993.
    @inproceedings{DBLP:conf/wads/BoseKT93,
  author={Prosenjit Bose and Marc J. van Kreveld and Godfried T. Toussaint},
  title={Filling Polyhedral Molds},
  booktitle={{WADS}},
  year={1993},
  publisher={Springer},
  volume={709},
  series={Lecture Notes in Computer Science},
  pages={210--221}
}

  247. Visual enhancement of 3d images of rock faces for rock mass characterization


    Lai, P., Sampson, C., and Bose, P.
    In 47th US Rock Mechanics/Geomechanics Symposium. American Rock Mechanics Association, 2013.
    @inproceedings{conf/lai2013visual,
  author={Po Lai and Claire Sampson and Prosenjit Bose},
  title={Visual Enhancement of 3D Images of Rock Faces for Rock Mass Characterization},
  booktitle={47th US Rock Mechanics/Geomechanics Symposium},
  year={2013},
  organization={American Rock Mechanics Association}
}

  248. Geometric and computational aspects of injection molding


    Bose, P. and Toussaint, G.
    In Proc. Third International Conf. on CAD and Computer Graphics, pages 237–242, 1993.
    @inproceedings{conf/bose1993geometric,
  author={Prosenjit Bose and Godfried Toussaint},
  title={Geometric and computational aspects of injection molding},
  booktitle={Proc. Third International Conf. on CAD and Computer Graphics},
  year={1993},
  pages={237--242}
}

  249. On a visibility representation for graphs in three dimensions


    Bose, P., Everett, H., Fekete, S., Lubiw, A., Meijer, H., Romanik, K., Shermer, T., and Whitesides, S.
    In Proc. Graph Drawing’93, pages 38–39, 1993.
    @inproceedings{conf/bose1993visibility,
  author={Prosenjit Bose and Hazel Everett and Sandor Fekete and Anna Lubiw and Henk Meijer and Kathleen Romanik and Tom Shermer and Sue Whitesides},
  title={On a visibility representation for graphs in three dimensions},
  booktitle={Proc. Graph Drawing’93},
  year={1993},
  pages={38--39}
}

Arxiv

  1. Approximating the smallest k-enclosing geodesic disc in a simple polygon


    Bose, P., D’Angelo, A., and Durocher, S.
    CoRR, abs/2402.00336, 2024.
    @article{DBLP:journal/corr/abs-2402-00336,
  author={Prosenjit Bose and Anthony D'Angelo and Stephane Durocher},
  title={Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon},
  journal={CoRR},
  year={2024},
  volume={abs/2402.00336}
}

  2. Approximating shortest paths in weighted square and hexagonal meshes


    Bose, P., Esteban, G., Orden, D., and Silveira, R. I.
    CoRR, abs/2404.07562, 2024.
    @article{DBLP:journal/corr/abs-2404-07562,
  author={Prosenjit Bose and Guillermo Esteban and David Orden and Rodrigo I. Silveira},
  title={Approximating shortest paths in weighted square and hexagonal meshes},
  journal={CoRR},
  year={2024},
  volume={abs/2404.07562}
}

  3. A parameterized algorithm for vertex and edge connectivity of embedded graphs


    Biedl, T., Bose, P., and Murali, K.
    CoRR, abs/2407.00586, 2024.
    @article{DBLP:journal/corr/abs-2407-00586,
  author={Therese Biedl and Prosenjit Bose and Karthik Murali},
  title={A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs},
  journal={CoRR},
  year={2024},
  volume={abs/2407.00586}
}

  4. On \emphk-planar graphs without short cycles


    Bekos, M. A., Bose, P., Büngener, A., Dujmovic, V., Hoffmann, M., Kaufmann, M., Morin, P., Odak, S., and Weinberger, A.
    CoRR, abs/2408.16085, 2024.
    @article{DBLP:journal/corr/abs-2408-16085,
  author={Michael A. Bekos and Prosenjit Bose and Aaron B{\"{u}}ngener and Vida Dujmovic and Michael Hoffmann and Michael Kaufmann and Pat Morin and Saeed Odak and Alexandra Weinberger},
  title={On \emph{k}-planar Graphs without Short Cycles},
  journal={CoRR},
  year={2024},
  volume={abs/2408.16085}
}

  5. Computing shortest paths amid non-overlapping weighted disks


    Bose, P., Carufel, J. D., Esteban, G., and Maheshwari, A.
    CoRR, abs/2409.08869, 2024.
    @article{DBLP:journal/corr/abs-2409-08869,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Guillermo Esteban and Anil Maheshwari},
  title={Computing shortest paths amid non-overlapping weighted disks},
  journal={CoRR},
  year={2024},
  volume={abs/2409.08869}
}

  6. On 1-planar graphs with bounded cop-number


    Bose, P., Carufel, J. D., Maheshwari, A., and Murali, K.
    CoRR, abs/2409.16279, 2024.
    @article{DBLP:journal/corr/abs-2409-16279,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Anil Maheshwari and Karthik Murali},
  title={On 1-Planar Graphs with Bounded Cop-Number},
  journal={CoRR},
  year={2024},
  volume={abs/2409.16279}
}

  7. Noncrossing longest paths and cycles


    Aloupis, G., Biniaz, A., Bose, P., Carufel, J. D., Eppstein, D., Maheshwari, A., Odak, S., Smid, M., Tóth, C. D., and Valtr, P.
    CoRR, abs/2410.05580, 2024.
    @article{DBLP:journal/corr/abs-2410-05580,
  author={Greg Aloupis and Ahmad Biniaz and Prosenjit Bose and Jean{-}Lou De Carufel and David Eppstein and Anil Maheshwari and Saeed Odak and Michiel Smid and Csaba D. T{\'{o}}th and Pavel Valtr},
  title={Noncrossing Longest Paths and Cycles},
  journal={CoRR},
  year={2024},
  volume={abs/2410.05580}
}

  8. On the \emphd-independence number in 1-planar graphs


    Biedl, T., Bose, P., and Miraftab, B.
    CoRR, abs/2411.02686, 2024.
    @article{DBLP:journal/corr/abs-2411-02686,
  author={Therese Biedl and Prosenjit Bose and Babak Miraftab},
  title={On the \emph{d}-independence number in 1-planar graphs},
  journal={CoRR},
  year={2024},
  volume={abs/2411.02686}
}

  9. The basis number of 1-planar graphs


    Bazargani, S., Biedl, T., Bose, P., Maheshwari, A., and Miraftab, B.
    CoRR, abs/2412.18595, 2024.
    @article{DBLP:journal/corr/abs-2412-18595,
  author={Saman Bazargani and Therese Biedl and Prosenjit Bose and Anil Maheshwari and Babak Miraftab},
  title={The basis number of 1-planar graphs},
  journal={CoRR},
  year={2024},
  volume={abs/2412.18595}
}

  10. On the restricted k-steiner tree problem


    Bose, P., D’Angelo, A., and Durocher, S.
    CoRR, abs/2306.08504, 2023.
    @article{DBLP:journal/corr/abs-2306-08504,
  author={Prosenjit Bose and Anthony D'Angelo and Stephane Durocher},
  title={On the Restricted k-Steiner Tree Problem},
  journal={CoRR},
  year={2023},
  volume={abs/2306.08504}
}

  11. Connected dominating sets in triangulations


    Bose, P., Dujmovic, V., Houdrouge, H., Morin, P., and Odak, S.
    CoRR, abs/2312.03399, 2023.
    @article{DBLP:journal/corr/abs-2312-03399,
  author={Prosenjit Bose and Vida Dujmovic and Hussein Houdrouge and Pat Morin and Saeed Odak},
  title={Connected Dominating Sets in Triangulations},
  journal={CoRR},
  year={2023},
  volume={abs/2312.03399}
}

  12. On separating path and tree systems in graphs


    Biniaz, A., Bose, P., Carufel, J. D., Maheshwari, A., Miraftab, B., Odak, S., Smid, M., Smorodinsky, S., and Yuditsky, Y.
    CoRR, abs/2312.14295, 2023.
    @article{DBLP:journal/corr/abs-2312-14295,
  author={Ahmad Biniaz and Prosenjit Bose and Jean{-}Lou De Carufel and Anil Maheshwari and Babak Miraftab and Saeed Odak and Michiel Smid and Shakhar Smorodinsky and Yelena Yuditsky},
  title={On Separating Path and Tree Systems in Graphs},
  journal={CoRR},
  year={2023},
  volume={abs/2312.14295}
}

  13. The exact spanning ratio of the parallelogram delaunay graph


    Bose, P., Carufel, J. D., and Njoo, S.
    CoRR, abs/2312.14305, 2023.
    @article{DBLP:journal/corr/abs-2312-14305,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Sandrine Njoo},
  title={The Exact Spanning Ratio of the Parallelogram Delaunay Graph},
  journal={CoRR},
  year={2023},
  volume={abs/2312.14305}
}

  14. Routing on heavy path WSPD spanners


    Bose, P. and Tuttle, T.
    CoRR, abs/2312.15145, 2023.
    @article{DBLP:journal/corr/abs-2312-15145,
  author={Prosenjit Bose and Tyler Tuttle},
  title={Routing on Heavy Path {WSPD} Spanners},
  journal={CoRR},
  year={2023},
  volume={abs/2312.15145}
}

  15. An optimal algorithm for product structure in planar graphs


    Bose, P., Morin, P., and Odak, S.
    CoRR, abs/2202.08870, 2022.
    @article{DBLP:journal/corr/abs-2202-08870,
  author={Prosenjit Bose and Pat Morin and Saeed Odak},
  title={An Optimal Algorithm for Product Structure in Planar Graphs},
  journal={CoRR},
  year={2022},
  volume={abs/2202.08870}
}

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


    Bose, P., Carufel, J. D., and Shermer, T. C.
    CoRR, abs/2204.11926, 2022.
    @article{DBLP:journal/corr/abs-2204-11926,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Thomas C. Shermer},
  title={Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor},
  journal={CoRR},
  year={2022},
  volume={abs/2204.11926}
}

  17. Linear versus centred chromatic numbers


    Bose, P., Dujmovic, V., Houdrouge, H., Javarsineh, M., and Morin, P.
    CoRR, abs/2205.15096, 2022.
    @article{DBLP:journal/corr/abs-2205-15096,
  author={Prosenjit Bose and Vida Dujmovic and Hussein Houdrouge and Mehrnoosh Javarsineh and Pat Morin},
  title={Linear versus centred chromatic numbers},
  journal={CoRR},
  year={2022},
  volume={abs/2205.15096}
}

  18. Fragile complexity of adaptive algorithms


    Bose, P., Cano, P., Fagerberg, R., Iacono, J., Jacob, R., and Langerman, S.
    CoRR, abs/2102.00338, 2021.
    @article{DBLP:journal/corr/abs-2102-00338,
  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={CoRR},
  year={2021},
  volume={abs/2102.00338}
}

  19. Separating layered treewidth and row treewidth


    Bose, P., Dujmovic, V., Javarsineh, M., Morin, P., and Wood, D. R.
    CoRR, abs/2105.01230, 2021.
    @article{DBLP:journal/corr/abs-2105-01230,
  author={Prosenjit Bose and Vida Dujmovic and Mehrnoosh Javarsineh and Pat Morin and David R. Wood},
  title={Separating layered treewidth and row treewidth},
  journal={CoRR},
  year={2021},
  volume={abs/2105.01230}
}

  20. Improved spanning on theta-5


    Bose, P., Hill, D., and Ooms, A.
    CoRR, abs/2106.01236, 2021.
    @article{DBLP:journal/corr/abs-2106-01236,
  author={Prosenjit Bose and Darryl Hill and Aur{\'{e}}lien Ooms},
  title={Improved Spanning on Theta-5},
  journal={CoRR},
  year={2021},
  volume={abs/2106.01236}
}

  21. Dynamic schnyder woods


    Bhore, S., Bose, P., Cano, P., Cardinal, J., and Iacono, J.
    CoRR, abs/2106.14451, 2021.
    @article{DBLP:journal/corr/abs-2106-14451,
  author={Sujoy Bhore and Prosenjit Bose and Pilar Cano and Jean Cardinal and John Iacono},
  title={Dynamic Schnyder Woods},
  journal={CoRR},
  year={2021},
  volume={abs/2106.14451}
}

  22. On approximating shortest paths in weighted triangular tessellations


    Bose, P., Esteban, G., Orden, D., and Silveira, R. I.
    CoRR, abs/2111.13912, 2021.
    @article{DBLP:journal/corr/abs-2111-13912,
  author={Prosenjit Bose and Guillermo Esteban and David Orden and Rodrigo I. Silveira},
  title={On approximating shortest paths in weighted triangular tessellations},
  journal={CoRR},
  year={2021},
  volume={abs/2111.13912}
}

  23. Parameterized complexity of two-interval pattern problem


    Bose, P., Mehrabi, S., and Mondal, D.
    CoRR, abs/2002.05099, 2020.
    @article{DBLP:journal/corr/abs-2002-05099,
  author={Prosenjit Bose and Saeed Mehrabi and Debajyoti Mondal},
  title={Parameterized Complexity of Two-Interval Pattern Problem},
  journal={CoRR},
  year={2020},
  volume={abs/2002.05099}
}

  24. Drawing graphs as spanners


    Aichholzer, O., Borrazzo, M., Bose, P., Cardinal, J., Frati, F., Morin, P., and Vogtenhuber, B.
    CoRR, abs/2002.05580, 2020.
    @article{DBLP:journal/corr/abs-2002-05580,
  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={CoRR},
  year={2020},
  volume={abs/2002.05580}
}

  25. (faster) multi-sided boundary labelling


    Bose, P., Mehrabi, S., and Mondal, D.
    CoRR, abs/2002.09740, 2020.
    @article{DBLP:journal/corr/abs-2002-09740,
  author={Prosenjit Bose and Saeed Mehrabi and Debajyoti Mondal},
  title={(Faster) Multi-Sided Boundary Labelling},
  journal={CoRR},
  year={2020},
  volume={abs/2002.09740}
}

  26. Asymptotically optimal vertex ranking of planar graphs


    Bose, P., Dujmovic, V., Javarsineh, M., and Morin, P.
    CoRR, abs/2007.06455, 2020.
    @article{DBLP:journal/corr/abs-2007-06455,
  author={Prosenjit Bose and Vida Dujmovic and Mehrnoosh Javarsineh and Pat Morin},
  title={Asymptotically Optimal Vertex Ranking of Planar Graphs},
  journal={CoRR},
  year={2020},
  volume={abs/2007.06455}
}

  27. Affine invariant triangulations


    Bose, P., Cano, P., and Silveira, R. I.
    CoRR, abs/2011.02197, 2020.
    @article{DBLP:journal/corr/abs-2011-02197,
  author={Prosenjit Bose and Pilar Cano and Rodrigo I. Silveira},
  title={Affine invariant triangulations},
  journal={CoRR},
  year={2020},
  volume={abs/2011.02197}
}

  28. 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. H. M.
    CoRR, abs/1903.07024, 2019.
    @article{DBLP:journal/corr/abs-1903-07024,
  author={Prosenjit Bose and Paz Carmi and J. Mark Keil and Anil Maheshwari and Saeed Mehrabi and Debajyoti Mondal and Michiel H. M. Smid},
  title={Computing Maximum Independent Set on Outerstring Graphs and Their Relatives},
  journal={CoRR},
  year={2019},
  volume={abs/1903.07024}
}

  29. Competitive online search trees on trees


    Bose, P., Cardinal, J., Iacono, J., Koumoutsos, G., and Langerman, S.
    CoRR, abs/1908.00848, 2019.
    @article{DBLP:journal/corr/abs-1908-00848,
  author={Prosenjit Bose and Jean Cardinal and John Iacono and Grigorios Koumoutsos and Stefan Langerman},
  title={Competitive Online Search Trees on Trees},
  journal={CoRR},
  year={2019},
  volume={abs/1908.00848}
}

  30. Expected complexity of routing in $\(\Theta\)$ 6 and half-$\(\Theta\)$ 6 graphs


    Bose, P., Carufel, J. D., and Devillers, O.
    CoRR, abs/1910.14289, 2019.
    @article{DBLP:journal/corr/abs-1910-14289,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Olivier Devillers},
  title={Expected Complexity of Routing in {\textdollar}{\(\Theta\)}{\textdollar} 6 and Half-{\textdollar}{\(\Theta\)}{\textdollar} 6 Graphs},
  journal={CoRR},
  year={2019},
  volume={abs/1910.14289}
}

  31. Reconstructing a convex polygon from its \(\omega\)-cloud


    Bose, P., Carufel, J. D., Khramtcova, E., and Verdonschot, S.
    CoRR, abs/1801.02162, 2018.
    @article{DBLP:journal/corr/abs-1801-02162,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Elena Khramtcova and Sander Verdonschot},
  title={Reconstructing a convex polygon from its {\(\omega\)}-cloud},
  journal={CoRR},
  year={2018},
  volume={abs/1801.02162}
}

  32. 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.
    CoRR, abs/1802.09505, 2018.
    @article{DBLP:journal/corr/abs-1802-09505,
  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={CoRR},
  year={2018},
  volume={abs/1802.09505}
}

  33. Routing on the visibility graph


    Bose, P., Korman, M., van Renssen, A., and Verdonschot, S.
    CoRR, abs/1803.02979, 2018.
    @article{DBLP:journal/corr/abs-1803-02979,
  author={Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Routing on the Visibility Graph},
  journal={CoRR},
  year={2018},
  volume={abs/1803.02979}
}

  34. Geodesic obstacle representation of graphs


    Bose, P., Carmi, P., Dujmovic, V., Mehrabi, S., Montecchiani, F., Morin, P., and da Silveira, L. F. S. X.
    CoRR, abs/1803.03705, 2018.
    @article{DBLP:journal/corr/abs-1803-03705,
  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={CoRR},
  year={2018},
  volume={abs/1803.03705}
}

  35. Boundary labeling for rectangular diagrams


    Bose, P., Carmi, P., Keil, J. M., Mehrabi, S., and Mondal, D.
    CoRR, abs/1803.10812, 2018.
    @article{DBLP:journal/corr/abs-1803-10812,
  author={Prosenjit Bose and Paz Carmi and J. Mark Keil and Saeed Mehrabi and Debajyoti Mondal},
  title={Boundary Labeling for Rectangular Diagrams},
  journal={CoRR},
  year={2018},
  volume={abs/1803.10812}
}

  36. Improved bounds for guarding plane graphs with edges


    Biniaz, A., Bose, P., Ooms, A., and Verdonschot, S.
    CoRR, abs/1804.07150, 2018.
    @article{DBLP:journal/corr/abs-1804-07150,
  author={Ahmad Biniaz and Prosenjit Bose and Aur{\'{e}}lien Ooms and Sander Verdonschot},
  title={Improved Bounds for Guarding Plane Graphs with Edges},
  journal={CoRR},
  year={2018},
  volume={abs/1804.07150}
}

  37. On the spanning and routing ratio of theta-four


    Bose, P., Carufel, J. D., Hill, D., and Smid, M. H. M.
    CoRR, abs/1808.01298, 2018.
    @article{DBLP:journal/corr/abs-1808-01298,
  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={CoRR},
  year={2018},
  volume={abs/1808.01298}
}

  38. 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.
    CoRR, abs/1808.10738, 2018.
    @article{DBLP:journal/corr/abs-1808-10738,
  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={CoRR},
  year={2018},
  volume={abs/1808.10738}
}

  39. Gathering by repulsion


    Bose, P. and Shermer, T. C.
    CoRR, abs/1809.09792, 2018.
    @article{DBLP:journal/corr/abs-1809-09792,
  author={Prosenjit Bose and Thomas C. Shermer},
  title={Gathering by Repulsion},
  journal={CoRR},
  year={2018},
  volume={abs/1809.09792}
}

  40. Near-optimal o(k)-robust geometric spanners


    Bose, P., Carmi, P., Dujmovic, V., and Morin, P.
    CoRR, abs/1812.09913, 2018.
    @article{DBLP:journal/corr/abs-1812-09913,
  author={Prosenjit Bose and Paz Carmi and Vida Dujmovic and Pat Morin},
  title={Near-Optimal O(k)-Robust Geometric Spanners},
  journal={CoRR},
  year={2018},
  volume={abs/1812.09913}
}

  41. Self-approaching paths in simple polygons


    Bose, P., Kostitsyna, I., and Langerman, S.
    CoRR, abs/1703.06107, 2017.
    @article{DBLP:journal/corr/BoseKL17,
  author={Prosenjit Bose and Irina Kostitsyna and Stefan Langerman},
  title={Self-approaching paths in simple polygons},
  journal={CoRR},
  year={2017},
  volume={abs/1703.06107}
}

  42. On plane constrained bounded-degree spanners


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    CoRR, abs/1704.03596, 2017.
    @article{DBLP:journal/corr/BoseFRV17,
  author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={On Plane Constrained Bounded-Degree Spanners},
  journal={CoRR},
  year={2017},
  volume={abs/1704.03596}
}

  43. Art gallery localization


    Bose, P., Carufel, J. D., Shaikhet, A., and Smid, M. H. M.
    CoRR, abs/1706.06938, 2017.
    @article{DBLP:journal/corr/BoseCSS17,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Alina Shaikhet and Michiel H. M. Smid},
  title={Art Gallery Localization},
  journal={CoRR},
  year={2017},
  volume={abs/1706.06938}
}

  44. Optimal art gallery localization is np-hard


    Bose, P., Carufel, J. D., Shaikhet, A., and Smid, M. H. M.
    CoRR, abs/1706.08016, 2017.
    @article{DBLP:journal/corr/BoseCSS17a,
  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={CoRR},
  year={2017},
  volume={abs/1706.08016}
}

  45. Biased predecessor search


    Bose, P., Fagerberg, R., Howat, J., and Morin, P.
    CoRR, abs/1707.01182, 2017.
    @article{DBLP:journal/corr/BoseFHM17,
  author={Prosenjit Bose and Rolf Fagerberg and John Howat and Pat Morin},
  title={Biased Predecessor Search},
  journal={CoRR},
  year={2017},
  volume={abs/1707.01182}
}

  46. Power domination on triangular grids


    Bose, P., Pennarun, C., and Verdonschot, S.
    CoRR, abs/1707.02760, 2017.
    @article{DBLP:journal/corr/BosePV17,
  author={Prosenjit Bose and Claire Pennarun and Sander Verdonschot},
  title={Power domination on triangular grids},
  journal={CoRR},
  year={2017},
  volume={abs/1707.02760}
}

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


    Bose, P., Halperin, D., and Shamai, S.
    CoRR, abs/1708.04203, 2017.
    @article{DBLP:journal/corr/abs-1708-04203,
  author={Prosenjit Bose and Dan Halperin and Shahar Shamai},
  title={On the Separation of a Polyhedron from Its Single-Part Mold},
  journal={CoRR},
  year={2017},
  volume={abs/1708.04203}
}

  48. Constrained routing between non-visible vertices


    Bose, P., Korman, M., van Renssen, A., and Verdonschot, S.
    CoRR, abs/1710.08060, 2017.
    @article{DBLP:journal/corr/abs-1710-08060,
  author={Prosenjit Bose and Matias Korman and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Constrained Routing Between Non-Visible Vertices},
  journal={CoRR},
  year={2017},
  volume={abs/1710.08060}
}

  49. The price of order


    Bose, P., Morin, P., and van Renssen, A.
    CoRR, abs/1602.00399, 2016.
    @article{DBLP:journal/corr/BoseMR16,
  author={Prosenjit Bose and Pat Morin and Andr{\'{e}} van Renssen},
  title={The Price of Order},
  journal={CoRR},
  year={2016},
  volume={abs/1602.00399}
}

  50. Constrained generalized delaunay graphs are plane spanners


    Bose, P., Carufel, J. D., and van Renssen, A.
    CoRR, abs/1602.07365, 2016.
    @article{DBLP:journal/corr/BoseCR16,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Andr{\'{e}} van Renssen},
  title={Constrained Generalized Delaunay Graphs Are Plane Spanners},
  journal={CoRR},
  year={2016},
  volume={abs/1602.07365}
}

  51. Time-space trade-off for finding the k-visibility region of a point in a polygon


    Bahoo, Y., Banyassady, B., Bose, P., Durocher, S., and Mulzer, W.
    CoRR, abs/1603.02853, 2016.
    @article{DBLP:journal/corr/BahooBBDM16,
  author={Yeganeh Bahoo and Bahareh Banyassady and Prosenjit Bose and Stephane Durocher and Wolfgang Mulzer},
  title={Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon},
  journal={CoRR},
  year={2016},
  volume={abs/1603.02853}
}

  52. Towards plane spanners of degree 3


    Biniaz, A., Bose, P., Carufel, J. D., Gavoille, C., Maheshwari, A., and Smid, M. H. M.
    CoRR, abs/1606.08824, 2016.
    @article{DBLP:journal/corr/BiniazBCGMS16,
  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={CoRR},
  year={2016},
  volume={abs/1606.08824}
}

  53. Essential constraints of edge-constrained proximity graphs


    Bose, P., Carufel, J. D., Shaikhet, A., and Smid, M. H. M.
    CoRR, abs/1607.01294, 2016.
    @article{DBLP:journal/corr/BoseCSS16,
  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={CoRR},
  year={2016},
  volume={abs/1607.01294}
}

  54. Gabriel triangulations and angle-monotone graphs: local routing and recognition


    Bonichon, N., Bose, P., Carmi, P., Kostitsyna, I., Lubiw, A., and Verdonschot, S.
    CoRR, abs/1608.08892, 2016.
    @article{DBLP:journal/corr/BonichonBCKLV16,
  author={Nicolas Bonichon and Prosenjit Bose and Paz Carmi and Irina Kostitsyna and Anna Lubiw and Sander Verdonschot},
  title={Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition},
  journal={CoRR},
  year={2016},
  volume={abs/1608.08892}
}

  55. Spanning trees in multipartite geometric graphs


    Biniaz, A., Bose, P., Eppstein, D., Maheshwari, A., Morin, P., and Smid, M. H. M.
    CoRR, abs/1611.01661, 2016.
    @article{DBLP:journal/corr/BiniazBEMMS16,
  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={CoRR},
  year={2016},
  volume={abs/1611.01661}
}

  56. Algorithms for sensor systems - 11th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2015, patras, greece, september 17-18, 2015, revised selected papers


    Bose, P., Gasieniec, L. A., Römer, K., and Wattenhofer, R., editors.
    Volume 9536 of Lecture Notes in Computer Science. Springer, 2015.
    @proceedings{DBLP:conf/algosensors/2015,
  editor={Prosenjit Bose and Leszek Antoni Gasieniec and Kay R{\"{o}}mer and Roger Wattenhofer},
  title={Algorithms for Sensor Systems - 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} 2015, Patras, Greece, September 17-18, 2015, Revised Selected Papers},
  year={2015},
  publisher={Springer},
  volume={9536},
  series={Lecture Notes in Computer Science}
}

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


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

  58. Upper and lower bounds for competitive online routing on delaunay triangulations


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

  59. Packing plane perfect matchings into a point set


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

  60. Probing convex polygons with a wedge


    Bose, P., Carufel, J. D., Shaikhet, A., and Smid, M. H. M.
    CoRR, abs/1506.02572, 2015.
    @article{DBLP:journal/corr/BoseCSS15,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Alina Shaikhet and Michiel H. M. Smid},
  title={Probing Convex Polygons with a Wedge},
  journal={CoRR},
  year={2015},
  volume={abs/1506.02572}
}

  61. Improved spanning ratio for low degree plane spanners


    Bose, P., Hill, D., and Smid, M. H. M.
    CoRR, abs/1506.09061, 2015.
    @article{DBLP:journal/corr/BoseHS15,
  author={Prosenjit Bose and Darryl Hill and Michiel H. M. Smid},
  title={Improved Spanning Ratio for Low Degree Plane Spanners},
  journal={CoRR},
  year={2015},
  volume={abs/1506.09061}
}

  62. The shadows of a cycle cannot all be paths


    Bose, P., Carufel, J. D., Dobbins, M. G., Kim, H., and Viglietta, G.
    CoRR, abs/1507.02355, 2015.
    @article{DBLP:journal/corr/BoseCDKV15,
  author={Prosenjit Bose and Jean{-}Lou De Carufel and Michael Gene Dobbins and Heuna Kim and Giovanni Viglietta},
  title={The Shadows of a Cycle Cannot All Be Paths},
  journal={CoRR},
  year={2015},
  volume={abs/1507.02355}
}

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


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

  64. Flips in edge-labelled pseudo-triangulations


    Bose, P. and Verdonschot, S.
    CoRR, abs/1512.01485, 2015.
    @article{DBLP:journal/corr/BoseV15,
  author={Prosenjit Bose and Sander Verdonschot},
  title={Flips in Edge-Labelled Pseudo-Triangulations},
  journal={CoRR},
  year={2015},
  volume={abs/1512.01485}
}

  65. Plane bichromatic trees of low degree


    Biniaz, A., Bose, P., Maheshwari, A., and Smid, M. H. M.
    CoRR, abs/1512.02730, 2015.
    @article{DBLP:journal/corr/BiniazBMS15a,
  author={Ahmad Biniaz and Prosenjit Bose and Anil Maheshwari and Michiel H. M. Smid},
  title={Plane Bichromatic Trees of Low Degree},
  journal={CoRR},
  year={2015},
  volume={abs/1512.02730}
}

  66. Upper bounds on the spanning ratio of constrained theta-graphs


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

  67. Towards tight bounds on theta-graphs


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

  68. Theta-3 is connected


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

  69. Continuous yao graphs


    Barba, L., Bose, P., Carufel, J. D., Damian, M., Fagerberg, R., van Renssen, A., Taslakian, P., and Verdonschot, S.
    CoRR, abs/1408.4099, 2014.
    @article{DBLP:journal/corr/BarbaBCDFRTV14,
  author={Luis Barba and Prosenjit Bose and Jean{-}Lou De Carufel and Mirela Damian and Rolf Fagerberg and Andr{\'{e}} van Renssen and Perouz Taslakian and Sander Verdonschot},
  title={Continuous Yao Graphs},
  journal={CoRR},
  year={2014},
  volume={abs/1408.4099}
}

  70. Towards a general framework for searching on a line and searching on \textdollarm$ rays


    Bose, P. and Carufel, J. D.
    CoRR, abs/1408.6812, 2014.
    @article{DBLP:journal/corr/BoseC14,
  author={Prosenjit Bose and Jean{-}Lou De Carufel},
  title={Towards a General Framework for Searching on a Line and Searching on {\textdollar}m{\textdollar} Rays},
  journal={CoRR},
  year={2014},
  volume={abs/1408.6812}
}

  71. Optimal local routing on delaunay triangulations defined by empty equilateral triangles


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    CoRR, abs/1409.6397, 2014.
    @article{DBLP:journal/corr/BoseFRV14,
  author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Optimal local routing on Delaunay triangulations defined by empty equilateral triangles},
  journal={CoRR},
  year={2014},
  volume={abs/1409.6397}
}

  72. Optimal data structures for farthest-point queries in cactus networks


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

  73. Competitive local routing with constraints


    Bose, P., Fagerberg, R., van Renssen, A., and Verdonschot, S.
    CoRR, abs/1412.0760, 2014.
    @article{DBLP:journal/corr/BoseFRV14a,
  author={Prosenjit Bose and Rolf Fagerberg and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={Competitive Local Routing with Constraints},
  journal={CoRR},
  year={2014},
  volume={abs/1412.0760}
}

  74. On the stretch factor of the theta-4 graph


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

  75. Network farthest-point diagrams


    Bose, P., Dannies, K., Carufel, J. D., Doell, C., Grimm, C., Maheshwari, A., Schirra, S., and Smid, M. H. M.
    CoRR, abs/1304.1909, 2013.
    @article{DBLP:journal/corr/abs-1304-1909,
  author={Prosenjit Bose and Kai Dannies and Jean{-}Lou De Carufel and Christoph Doell and Carsten Grimm and Anil Maheshwari and Stefan Schirra and Michiel H. M. Smid},
  title={Network Farthest-Point Diagrams},
  journal={CoRR},
  year={2013},
  volume={abs/1304.1909}
}

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


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

  77. New and improved spanning ratios for yao graphs


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

  78. Revisiting the problem of searching on a line


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

  79. Flipping edge-labelled triangulations


    Bose, P., Lubiw, A., Pathak, V., and Verdonschot, S.
    CoRR, abs/1310.1166, 2013.
    @article{DBLP:journal/corr/BoseLPV13,
  author={Prosenjit Bose and Anna Lubiw and Vinayak Pathak and Sander Verdonschot},
  title={Flipping Edge-Labelled Triangulations},
  journal={CoRR},
  year={2013},
  volume={abs/1310.1166}
}

  80. Computing covers of plane forests


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

  81. Robust geometric spanners


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

  82. Coloring and guarding arrangements


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

  83. A history of flips in combinatorial triangulations


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

  84. Visibility-monotonic polygon deflation


    Bose, P., Dujmovic, V., Hoda, N., and Morin, P.
    CoRR, abs/1206.1982, 2012.
    @article{DBLP:journal/corr/abs-1206-1982,
  author={Prosenjit Bose and Vida Dujmovic and Nima Hoda and Pat Morin},
  title={Visibility-Monotonic Polygon Deflation},
  journal={CoRR},
  year={2012},
  volume={abs/1206.1982}
}

  85. The theta-5-graph is a spanner


    Bose, P., Morin, P., van Renssen, A., and Verdonschot, S.
    CoRR, abs/1212.0570, 2012.
    @article{DBLP:journal/corr/abs-1212-0570,
  author={Prosenjit Bose and Pat Morin and Andr{\'{e}} van Renssen and Sander Verdonschot},
  title={The theta-5-graph is a spanner},
  journal={CoRR},
  year={2012},
  volume={abs/1212.0570}
}

  86. Automatically creating design models from 3d anthropometry data


    Wuhrer, S., Shu, C., and Bose, P.
    CoRR, abs/1108.4572, 2011.
    @article{DBLP:journal/corr/abs-1108-4572,
  author={Stefanie Wuhrer and Chang Shu and Prosenjit Bose},
  title={Automatically Creating Design Models from 3D Anthropometry Data},
  journal={CoRR},
  year={2011},
  volume={abs/1108.4572}
}

  87. Making triangulations 4-connected using flips


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

  88. De-amortizing binary search trees


    Bose, P., Collette, S., Fagerberg, R., and Langerman, S.
    CoRR, abs/1111.1665, 2011.
    @article{DBLP:journal/corr/abs-1111-1665,
  author={Prosenjit Bose and S{\'{e}}bastien Collette and Rolf Fagerberg and Stefan Langerman},
  title={De-amortizing Binary Search Trees},
  journal={CoRR},
  year={2011},
  volume={abs/1111.1665}
}

  89. Point location in disconnected planar subdivisions


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

  90. Pi/2-angle yao graphs are spanners


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

  91. Odds-on trees


    Bose, P., Devroye, L., Douïeb, K., Dujmovic, V., King, J., and Morin, P.
    CoRR, abs/1002.1092, 2010.
    @article{DBLP:journal/corr/abs-1002-1092,
  author={Prosenjit Bose and Luc Devroye and Karim Dou{\"{\i}}eb and Vida Dujmovic and James King and Pat Morin},
  title={Odds-On Trees},
  journal={CoRR},
  year={2010},
  volume={abs/1002.1092}
}

  92. An o(loglog n)-competitive binary search tree with optimal worst-case access times


    Bose, P., Douïeb, K., Dujmovic, V., and Fagerberg, R.
    CoRR, abs/1003.0139, 2010.
    @article{DBLP:journal/corr/abs-1003-0139,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb and Vida Dujmovic and Rolf Fagerberg},
  title={An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times},
  journal={CoRR},
  year={2010},
  volume={abs/1003.0139}
}

  93. The dilation of the delaunay triangulation is greater than \(\pi\)/2


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

  94. Should static search trees ever be unbalanced?


    Bose, P. and Douïeb, K.
    CoRR, abs/1006.3715, 2010.
    @article{DBLP:journal/corr/abs-1006-3715,
  author={Prosenjit Bose and Karim Dou{\"{\i}}eb},
  title={Should Static Search Trees Ever Be Unbalanced?},
  journal={CoRR},
  year={2010},
  volume={abs/1006.3715}
}

  95. Minimum enclosing area triangle with a fixed angle


    Bose, P. and Carufel, J. D.
    CoRR, abs/1009.3006, 2010.
    @article{DBLP:journal/corr/abs-1009-3006,
  author={Prosenjit Bose and Jean{-}Lou De Carufel},
  title={Minimum Enclosing Area Triangle with a Fixed Angle},
  journal={CoRR},
  year={2010},
  volume={abs/1009.3006}
}

  96. Improved methods for generating quasi-gray codes


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

  97. 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.
    CoRR, abs/0904.0262, 2009.
    @article{DBLP:journal/corr/AbelBBCDHKLPW09,
  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={CoRR},
  year={2009},
  volume={abs/0904.0262}
}

  98. Layered working-set trees


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

  99. Spanners of additively weighted point sets


    Bose, P., Carmi, P., and Couture, M.
    CoRR, abs/0801.4013, 2008.
    @article{DBLP:journal/corr/abs-0801-4013,
  author={Prosenjit Bose and Paz Carmi and Mathieu Couture},
  title={Spanners of Additively Weighted Point Sets},
  journal={CoRR},
  year={2008},
  volume={abs/0801.4013}
}

  100. On the stretch factor of convex delaunay graphs


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

  101. Morphing of triangular meshes in shape space


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

  102. Succinct geometric indexes supporting point location queries


    Bose, P., Chen, E. Y., He, M., Maheshwari, A., and Morin, P.
    CoRR, abs/0805.4147, 2008.
    @article{DBLP:journal/corr/abs-0805-4147,
  author={Prosenjit Bose and Eric Y. Chen and Meng He and Anil Maheshwari and Pat Morin},
  title={Succinct Geometric Indexes Supporting Point Location Queries},
  journal={CoRR},
  year={2008},
  volume={abs/0805.4147}
}

  103. Communication-efficient construction of the plane localized delaunay graph


    Bose, P., Carmi, P., Smid, M. H. M., and Xu, D.
    CoRR, abs/0809.2956, 2008.
    @article{DBLP:journal/corr/abs-0809-2956,
  author={Prosenjit Bose and Paz Carmi and Michiel H. M. Smid and Daming Xu},
  title={Communication-Efficient Construction of the Plane Localized Delaunay Graph},
  journal={CoRR},
  year={2008},
  volume={abs/0809.2956}
}

  104. Proceedings of the 19th annual canadian conference on computational geometry, CCCG 2007, august 20-22, 2007, carleton university, ottawa, canada


    Bose, P., editor.
    Carleton University, Ottawa, Canada, 2007.
    @proceedings{DBLP:conf/cccg/2007,
  editor={Prosenjit Bose},
  title={Proceedings of the 19th Annual Canadian Conference on Computational Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa, Canada},
  year={2007},
  publisher={Carleton University, Ottawa, Canada}
}

  105. A polynomial bound for untangling geometric planar graphs


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

  106. Geometric spanners with small chromatic number


    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Smid, M. H. M., and Zeh, N.
    CoRR, abs/0711.0114, 2007.
    @article{DBLP:journal/corr/abs-0711-0114,
  author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Anil Maheshwari and Michiel H. M. Smid and Norbert Zeh},
  title={Geometric Spanners With Small Chromatic Number},
  journal={CoRR},
  year={2007},
  volume={abs/0711.0114}
}

  107. Spanners of complete \textdollark\textdollar-partite geometric graphs


    Bose, P., Carmi, P., Couture, M., Maheshwari, A., Morin, P., and Smid, M. H. M.
    CoRR, abs/0712.0554, 2007.
    @article{DBLP:journal/corr/abs-0712-0554,
  author={Prosenjit Bose and Paz Carmi and Mathieu Couture and Anil Maheshwari and Pat Morin and Michiel H. M. Smid},
  title={Spanners of Complete {\textdollar}k{\textdollar}-Partite Geometric Graphs},
  journal={CoRR},
  year={2007},
  volume={abs/0712.0554}
}

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


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

  109. A characterization of the degree sequences of 2-trees


    Bose, P., Dujmovic, V., Krizanc, D., Langerman, S., Morin, P., Wood, D. R., and Wuhrer, S.
    CoRR, abs/cs/0605011, 2006.
    @article{DBLP:journal/corr/abs-cs-0605011,
  author={Prosenjit Bose and Vida Dujmovic and Danny Krizanc and Stefan Langerman and Pat Morin and David R. Wood and Stefanie Wuhrer},
  title={A Characterization of the Degree Sequences of 2-Trees},
  journal={CoRR},
  year={2006},
  volume={abs/cs/0605011}
}

  110. Data structures for halfplane proximity queries and incremental voronoi diagrams


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

  111. Simultaneous diagonal flips in plane triangulations


    Bose, P., Czyzowicz, J., Gao, Z., Morin, P., and Wood, D. R.
    CoRR, abs/math/0509478, 2005.
    @article{DBLP:journal/corr/abs-math-0509478,
  author={Prosenjit Bose and Jurek Czyzowicz and Zhicheng Gao and Pat Morin and David R. Wood},
  title={Simultaneous Diagonal Flips in Plane Triangulations},
  journal={CoRR},
  year={2005},
  volume={abs/math/0509478}
}

  112. Algorithms and computation, 13th international symposium, ISAAC 2002 vancouver, bc, canada, november 21-23, 2002, proceedings


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

Generated by Publy 0.9.  Last modified on 4 March 2025.