Point Location in Disconnected Planar Subdivisions

Prosenjit Bose, Luc Devroye, Karim Douieb +3

Faster Algorithms for some Optimization Problems on Collinear Points

Ahmad Biniaz, Prosenjit Bose, Paz Carmi +3

Revisiting the Problem of Searching on a Line

Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams

Boris Aronov, Prosenjit Bose, Erik D. Demaine +4

Optimal Data Structures for Farthest-Point Queries in Cactus Networks

Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm +2

Morphing of Triangular Meshes in Shape Space

Stefanie Wuhrer, Prosenjit Bose, Chang Shu +2

Biased Predecessor Search

Prosenjit Bose, Rolf Fagerberg, John Howat +1

Induced Subgraphs of Bounded Degree and Bounded Treewidth

Prosenjit Bose, Vida Dujmovic, David R. Wood

New and Improved Spanning Ratios for Yao Graphs

Luis Barba, Prosenjit Bose, Mirela Damian +7

Succinct Geometric Indexes Supporting Point Location Queries

Prosenjit Bose, Eric Y. Chen, Meng He +2

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition

Nicolas Bonichon, Prosenjit Bose, Paz Carmi +3

Towards a General Framework for Searching on a Line and Searching on $m$ Rays

Prosenjit Bose, Jean-Lou De Carufel

Continuous Yao Graphs

Luis Barba, Prosenjit Bose, Jean-Lou De Carufel +5

On the stretch factor of the Theta-4 graph

Luis Barba, Prosenjit Bose, Jean-Lou De Carufel +2

Competitive Online Search Trees on Trees

Prosenjit Bose, Jean Cardinal, John Iacono +2

The paper introduces an online data structure for searching in tree‑shaped spaces that extends the binary search tree model and achieves an O(log log n) competitive ratio using a n…

Boundary Labeling for Rectangular Diagrams

Prosenjit Bose, Paz Carmi, J. Mark Keil +2

Geometric Spanners With Small Chromatic Number

Prosenjit Bose, Paz Carmi, Mathieu Couture +3

Gathering by Repulsion

Prosenjit Bose, Thomas Shermer

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

Prosenjit Bose, Paz Carmi, Mathieu Couture +2

The $θ_5$-graph is a spanner

Prosenjit Bose, Pat Morin, André van Renssen +1

Automatically Creating Design Models from 3D Anthropometry Data

Stefanie Wuhrer, Chang Shu, Prosenjit Bose

A Characterization of the Degree Sequences of 2-Trees

Prosenjit Bose, Vida Dujmović, Danny Krizanc +4

Coloring and Guarding Arrangements

Prosenjit Bose, Jean Cardinal, Sébastien Collette +4

Spanners of Additively Weighted Point Sets

Prosenjit Bose, Paz Carmi, Mathieu Couture

De-amortizing Binary Search Trees

Prosenjit Bose, Sébastien Collette, Rolf Fagerberg +1

Towards Plane Spanners of Degree 3

Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel +3

Essential Constraints of Edge-Constrained Proximity Graphs

Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet +1

A History of Flips in Combinatorial Triangulations

Prosenjit Bose, Sander Verdonschot

Odds-On Trees

Prosenjit Bose, Luc Devroye, Karim Douieb +3

Power domination on triangular grids

Prosenjit Bose, Claire Pennarun, Sander Verdonschot

Every Large Point Set contains Many Collinear Points or an Empty Pentagon

Zachary Abel, Brad Ballinger, Prosenjit Bose +7

Geodesic Obstacle Representation of Graphs

Prosenjit Bose, Paz Carmi, Vida Dujmovic +4

Visibility-Monotonic Polygon Deflation

Prosenjit Bose, Vida Dujmović, Nima Hoda +1

Improved Bounds for Guarding Plane Graphs with Edges

Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms +1

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

Hee-Kap Ahn, Luis Barba, Prosenjit Bose +3

Pi/2-Angle Yao Graphs are Spanners

Prosenjit Bose, Mirela Damian, Karim Douieb +4

New Bounds for Facial Nonrepetitive Colouring

Prosenjit Bose, Vida Dujmović, Pat Morin +1

Layered Working-Set Trees

Prosenjit Bose, Karim Douïeb, Vida Dujmović +1

Routing on the Visibility Graph

Prosenjit Bose, Matias Korman, André van Renssen +1

Making triangulations 4-connected using flips

Prosenjit Bose, Dana Jansens, André van Renssen +2

Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations

Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel +2

An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times

Prosenjit Bose, Karim Douïeb, Vida Dujmovic +1

The Shadows of a Cycle Cannot All Be Paths

Prosenjit Bose, Jean-Lou De Carufel, Michael G. Dobbins +2

Communication-Efficient Construction of the Plane Localized Delaunay Graph

Prosenjit Bose, Paz Carmi, Michiel Smid +1

On the Stretch Factor of Convex Delaunay Graphs

Prosenjit Bose, Paz Carmi, Sebastien Collette +1

Reconstructing a convex polygon from its $ω$-cloud

Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel +1

Art Gallery Localization

Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet +1

Self-approaching paths in simple polygons

Prosenjit Bose, Irina Kostitsyna, Stefan Langerman

Spanners of Complete $k$-Partite Geometric Graphs

Prosenjit Bose, Paz Carmi, Mathieu Couture +3

On Plane Constrained Bounded-Degree Spanners

Prosenjit Bose, Rolf Fagerberg, André van Renssen +1

Theta-3 is connected

Oswin Aichholzer, Sang Won Bae, Luis Barba +5

Robust Geometric Spanners

Prosenjit Bose, Vida Dujmovic, Pat Morin +1

Simultaneous Diagonal Flips in Plane Triangulations

Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao +2

Towards Tight Bounds on Theta-Graphs

Prosenjit Bose, Jean-Lou De Carufel, Pat Morin +2

A polynomial bound for untangling geometric planar graphs

Prosenjit Bose, Vida Dujmovic, Ferran Hurtado +3

On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere

Prosenjit Bose, Paz Carmi, Mirela Damian +5

Competitive Local Routing with Constraints

Prosenjit Bose, Rolf Fagerberg, André van Renssen +1

The Price of Order

Prosenjit Bose, Pat Morin, André van Renssen

Improved Spanning Ratio for Low Degree Plane Spanners

Prosenjit Bose, Darryl Hill, Michiel Smid

Computing Covers of Plane Forests

Luis Barba, Alexis Beingessner, Prosenjit Bose +1

Flips in Edge-Labelled Pseudo-Triangulations

Prosenjit Bose, Sander Verdonschot

Network Farthest-Point Diagrams

Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel +5

Improved Methods For Generating Quasi-Gray Codes

Dana Jansens, Prosenjit Bose, Paz Carmi +3

The Power and Limitations of Static Binary Search Trees with Lazy Finger

Prosenjit Bose, Karim Douïeb, John Iacono +1

Near-Optimal $O(k)$-Robust Geometric Spanners

Prosenjit Bose, Paz Carmi, Vida Dujmovic +1

Optimal local routing on Delaunay triangulations defined by empty equilateral triangles

Prosenjit Bose, Rolf Fagerberg, André van Renssen +1

Optimal Art Gallery Localization is NP-hard

Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet +1

The dilation of the Delaunay triangulation is greater than π/2

Prosenjit Bose, Luc Devroye, Maarten Löffler +2

Spanning Trees in Multipartite Geometric Graphs

Ahmad Biniaz, Prosenjit Bose, David Eppstein +3

Flipping Edge-Labelled Triangulations

Prosenjit Bose, Anna Lubiw, Vinayak Pathak +1

Packing Plane Perfect Matchings into a Point Set

Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari +1

Minimum-Area Enclosing Triangle with a Fixed Angle

Prosenjit Bose, Jean-Lou De Carufel

Plane Bichromatic Trees of Low Degree

Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari +1

Spanning Properties of Yao and $Θ$-Graphs in the Presence of Constraints

Prosenjit Bose, André van Renssen

Should Static Search Trees Ever Be Unbalanced?

Prosenjit Bose, Karim Douïeb

Constrained Generalized Delaunay Graphs Are Plane Spanners

Prosenjit Bose, Jean-Lou De Carufel, André van Renssen

Probing Convex Polygons with a Wedge

Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet +1

Pole Dancing: 3D Morphs for Tree Drawings

Elena Arseneva, Prosenjit Bose, Pilar Cano +5