Prosenjit Bose

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 173

Top Venues

Publications

Prosenjit Bose, Guillermo Esteban, Anil Maheshwari
A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes. Theor. Comput. Sci. 1001 (2024)
Therese Biedl, Prosenjit Bose, Babak Miraftab
On the Independence Number of 1-Planar Graphs. SWAT (2024)
Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel Smid
On the Spanning and Routing Ratio of the Directed Theta-Four Graph. Discret. Comput. Geom. 71 (3) (2024)
Prosenjit Bose, Tyler Tuttle
Routing on heavy path WSPD spanners. Comput. Geom. 123 (2024)
Prosenjit Bose, Anthony D'Angelo, Stephane Durocher
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon. CoRR (2024)
Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira
Approximating shortest paths in weighted square and hexagonal meshes. CoRR (2024)
Therese Biedl, Prosenjit Bose, Karthik Murali
A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. CoRR (2024)
Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono
Dynamic Schnyder woods. CCCG (2023)
Prosenjit Bose, Jean-Lou De Carufel, Sandrine Njoo
The Exact Spanning Ratio of the Parallelogram Delaunay Graph. CoRR (2023)
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira
Geodesic obstacle representation of graphs. Comput. Geom. 109 (2023)
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid
The Minimum Moving Spanning Tree Problem. J. Graph Algorithms Appl. 27 (1) (2023)
Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid
Improved Routing on the Delaunay Triangulation. Discret. Comput. Geom. 70 (3) (2023)
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Competitive Online Search Trees on Trees. ACM Trans. Algorithms 19 (3) (2023)
Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira
On approximating shortest paths in weighted triangular tessellations. Artif. Intell. 318 (2023)
Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer
Piercing Unit Geodesic Disks. CCCG (2023)
Prosenjit Bose, Vida Dujmovic, Hussein Houdrouge, Pat Morin, Saeed Odak
Connected Dominating Sets in Triangulations. CoRR (2023)
Prosenjit Bose, Anthony D'Angelo, Stephane Durocher
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon. WADS (2023)
Prosenjit Bose, Anthony D'Angelo, Stephane Durocher
CCOSKEG Discs in Simple Polygons. CCCG (2023)
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky
On Separating Path and Tree Systems in Graphs. CoRR (2023)
Ahmad Biniaz, Prosenjit Bose, Yunkai Wang
Simple linear time algorithms for piercing pairwise intersecting disks. Comput. Geom. 114 (2023)
Prosenjit Bose, Tyler Tuttle
Routing on Heavy Path WSPD Spanners. CoRR (2023)
Prosenjit Bose, Anthony D'Angelo, Stephane Durocher
On the Restricted k-Steiner Tree Problem. CoRR (2023)
Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood
Separating layered treewidth and row treewidth. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Prosenjit Bose, Vida Dujmovic, Hussein Houdrouge, Mehrnoosh Javarsineh, Pat Morin
Linear versus centred chromatic numbers. CoRR (2022)
Prosenjit Bose, Pat Morin, Saeed Odak
An Optimal Algorithm for Product Structure in Planar Graphs. SWAT (2022)
Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari
Bounded-Angle Minimum Spanning Trees. Algorithmica 84 (1) (2022)
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber
Drawing Graphs as Spanners. Discret. Comput. Geom. 68 (3) (2022)
Ahmad Biniaz, Prosenjit Bose, Patrick Devaney
A 13/9-approximation of the average-2π/3-MST. CCCG (2022)
Prosenjit Bose, Guillermo Esteban, Anil Maheshwari
Weighted shortest path in equilateral triangular meshes. CCCG (2022)
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
Fragile complexity of adaptive algorithms. Theor. Comput. Sci. 919 (2022)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel Smid
Computing maximum independent set on outerstring graphs and their relatives. Comput. Geom. 103 (2022)
Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira
On Approximating Shortest Paths in Weighted Triangular Tessellations. WALCOM (2022)
Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. ISAAC (2022)
Nicolas Bonichon, Prosenjit Bose, Yan Garito
Local Routing Algorithms on Euclidean Spanners with Small Diameter. LATIN (2022)
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose
-graph. Comput. Geom. (2022)
Prosenjit Bose, Anthony D'Angelo, Stephane Durocher
On the restricted k-Steiner tree problem. J. Comb. Optim. 44 (4) (2022)
Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal
Parameterized complexity of two-interval pattern problem. Theor. Comput. Sci. 902 (2022)
Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer
On the Zombie Number of Various Graph Classes. LATIN (2022)
Saman Bazargani, Ahmad Biniaz, Prosenjit Bose
Piercing Pairwise Intersecting Convex Shapes in the Plane. LATIN (2022)
Prosenjit Bose, Pat Morin, Saeed Odak
An Optimal Algorithm for Product Structure in Planar Graphs. CoRR (2022)
Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. CoRR (2022)
Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira
Affine invariant triangulations. Comput. Aided Geom. Des. 91 (2021)
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid
The Minimum Moving Spanning Tree Problem. WADS (2021)
Ahmad Biniaz, Prosenjit Bose, Yunkai Wang
Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks. CCCG (2021)
Prosenjit Bose
Spanning Properties of Variants of the Delaunay Graph (Invited Talk). ISAAC (2021)
Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira
On approximating shortest paths in weighted triangular tessellations. CoRR (2021)
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
Fragile Complexity of Adaptive Algorithms. CoRR (2021)
Prosenjit Bose, Darryl Hill, Aurélien Ooms
Improved Spanning on Theta-5. CoRR (2021)
Prosenjit Bose, Darryl Hill, Aurélien Ooms
Improved Bounds on the Spanning Ratio of the Theta-5-Graph. WADS (2021)
Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal
Faster Multi-sided One-Bend Boundary Labelling. WALCOM (2021)
Sujoy Bhore, Prosenjit Bose, Pilar Cano, Jean Cardinal, John Iacono
Dynamic Schnyder Woods. CoRR (2021)
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
Fragile Complexity of Adaptive Algorithms. CIAC (2021)
Prosenjit Bose, Paz Carmi, Thomas C. Shermer
Piercing pairwise intersecting geodesic disks. Comput. Geom. 98 (2021)
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose
On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph. WADS (2021)
Prosenjit Bose, Tyler Tuttle
Routing on Heavy-Path WSPD-Spanners. WADS (2021)
Jean-Lou De Carufel, Prosenjit Bose, Frédérik Paradis, Vida Dujmovic
Local routing in WSPD-based spanners. J. Comput. Geom. 12 (1) (2021)
Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood
Separating layered treewidth and row treewidth. CoRR (2021)
Prosenjit Bose, Thomas C. Shermer
Attraction-convexity and normal visibility. Comput. Geom. 96 (2021)
Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot
Constrained routing between non-visible vertices. Theor. Comput. Sci. 861 (2021)
Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal
Parameterized Complexity of Two-Interval Pattern Problem. SWAT (2020)
Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer
Computing the k-Visibility Region of a Point in a Polygon. Theory Comput. Syst. 64 (7) (2020)
Prosenjit Bose, Jean-Lou De Carufel, Olivier Devillers
Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs. J. Comput. Geom. 11 (1) (2020)
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
Optimal Art Gallery Localization is NP-hard. Comput. Geom. 88 (2020)
Prosenjit Bose, Irina Kostitsyna, Stefan Langerman
Self-approaching paths in simple polygons. Comput. Geom. 87 (2020)
Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal
Parameterized Complexity of Two-Interval Pattern Problem. CoRR (2020)
Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin
Asymptotically Optimal Vertex Ranking of Planar Graphs. CoRR (2020)
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber
Drawing Graphs as Spanners. WG (2020)
Prosenjit Bose, Valentin Gledel, Claire Pennarun, Sander Verdonschot
Power domination on triangular grids with triangular and hexagonal shape. J. Comb. Optim. 40 (2) (2020)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster algorithms for some optimization problems on collinear points. J. Comput. Geom. 11 (1) (2020)
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Competitive Online Search Trees on Trees. SODA (2020)
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber
Drawing Graphs as Spanners. CoRR (2020)
Prosenjit Bose, Anthony D'Angelo, Stephane Durocher
On the Restricted 1-Steiner Tree Problem. COCOON (2020)
Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira
Affine invariant triangulations. CoRR (2020)
Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal
(Faster) Multi-Sided Boundary Labelling. CoRR (2020)
Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari
Bounded-Angle Minimum Spanning Trees. SWAT (2020)
Prosenjit Bose, Pilar Cano, Maria Saumell, Rodrigo I. Silveira
Hamiltonicity for convex shape Delaunay and Gabriel graphs. Comput. Geom. 89 (2020)
Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid
Local Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. 30 (1) (2020)
Elena Arseneva, Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira
Flips in Higher Order Delaunay Triangulations. LATIN (2020)
Prosenjit Bose, Thomas C. Shermer
Gathering by repulsion. Comput. Geom. 90 (2020)
Prosenjit Bose, Paz Carmi, Stephane Durocher, Shahin Kamali, Arezoo Sajadpour
Non-Crossing Matching of Online Points. CCCG (2020)
Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer
Computing the k-Crossing Visibility Region of a Point in a Polygon. IWOCA (2019)
Prosenjit Bose, Pilar Cano, Maria Saumell, Rodrigo I. Silveira
Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs. WADS (2019)
Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid
Maximum Plane Trees in Multipartite Geometric Graphs. Algorithmica 81 (4) (2019)
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Competitive Online Search Trees on Trees. CoRR (2019)
Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid
On the Spanning and Routing Ratio of Theta-Four. SODA (2019)
Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne
Three-Coloring Three-Dimensional Uniform Hypergraphs. CCCG (2019)
Prosenjit Bose, André van Renssen
Spanning Properties of Yao and 휃-Graphs in the Presence of Constraints. Int. J. Comput. Geom. Appl. 29 (2) (2019)
Prosenjit Bose, Thomas C. Shermer
Attraction-convexity and Normal Visibility. CCCG (2019)
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
On Plane Constrained Bounded-Degree Spanners. Algorithmica 81 (4) (2019)
Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher
Watchtower for k-crossing Visibility. CCCG (2019)
Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot
Improved Bounds for Guarding Plane Graphs with Edges. Graphs Comb. 35 (2) (2019)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. WADS (2019)
Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot
Reconstructing a Convex Polygon from Its \omega ω -cloud. CSR (2019)
Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira
Ane invariant triangulations. CCCG (2019)
Prosenjit Bose, Jean-Lou De Carufel, Olivier Devillers
Expected Complexity of Routing in $Θ$ 6 and Half-$Θ$ 6 Graphs. CoRR (2019)
Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini
Pole Dancing: 3D Morphs for Tree Drawings. J. Graph Algorithms Appl. 23 (3) (2019)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. CoRR (2019)
Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot
Improved Bounds for Guarding Plane Graphs with Edges. SWAT (2018)
Prosenjit Bose, Anna Lubiw, Vinayak Pathak, Sander Verdonschot
Flipping edge-labelled triangulations. Comput. Geom. 68 (2018)
Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica 80 (11) (2018)

Prosenjit Bose.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Prosenjit Bose