Feasability of Design in Stereolithography. - Boudewijn Asberg; Gregoria Blanco; Prosenjit Bose; Jesus Garcia-Lopez; Mark H. Overmars; Godfried T. Toussaint; Gordon T. Wilfong; Binhai Zhu (FSTTCS, 1993)

K-Guarding Polygons on the Plane. - Patrice Belleville; Prosenjit Bose; Jurek Czyzowicz; Jorge Urrutia; Joseph Zaks (CCCG, 1994)

Proximity Constraints and Representable Trees. - Prosenjit Bose; Giuseppe Di Battista; William J. Lenhart; Giuseppe Liotta (GD, 1994)

Geometric and computational aspects of manufacturing processes. - Prosenjit Bose; Godfried T. Toussaint (Comput. Graph., 1994)

Aperture angle optimization problems. - Prosenjit Bose; Ferran Hurtado; Elsa Omaña-Pulido; Godfried T. Toussaint (CCCG, 1995)

No Quadrangulation is Extremely Odd. - Prosenjit Bose; Godfried T. Toussaint (ISAAC, 1995)

Geometric and computational aspects of gravity casting. - Prosenjit Bose; Godfried T. Toussaint (Comput. Aided Des., 1995)

Growing a Tree from Its Branches. - Prosenjit Bose; Godfried T. Toussaint (J. Algorithms, 1995)

The Complexity of Rivers in Triangulated Terrains. - Mark de Berg; Prosenjit Bose; Katrin Dobrindt; Marc J. van Kreveld; Mark H. Overmars; Marko de Groot; Thomas Roos; Jack Snoeyink; Sidi Yu (CCCG, 1996)

Approximating Shortest Paths in Arrangements of Lines. - Prosenjit Bose; William S. Evans; David G. Kirkpatrick; Michael McAllister; Jack Snoeyink (CCCG, 1996)

Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. - Prosenjit Bose; David G. Kirkpatrick; Zaiqing Li (CCCG, 1996)

Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application. - Prosenjit Bose; Godfried T. Toussaint (Computer Graphics International, 1996)

On the Sectional Area of Convex Polytopes. - David Avis; Prosenjit Bose; Godfried T. Toussaint; Thomas C. Shermer; Binhai Zhu; Jack Snoeyink (SCG, 1996)

On Rectangle Visibility Graphs. - Prosenjit Bose; Alice M. Dean; Joan P. Hutchinson; Thomas C. Shermer (GD, 1996)

Characterizing Proximity Trees. - Prosenjit Bose; William J. Lenhart; Giuseppe Liotta (Algorithmica, 1996)

All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. - Prosenjit Bose; David Bremner; Godfried T. Toussaint (Comput. Geom., 1996)

Feasibility of Design in Stereolithography. - Boudewijn Asberg; Gregoria Blanco; Prosenjit Bose; Jesus Garcia-Lopez; Mark H. Overmars; Godfried T. Toussaint; Gordon T. Wilfong; Binhai Zhu (Algorithmica, 1997)

Determining the Castability of Simple Polyhedra. - Prosenjit Bose; David Bremner; Marc J. van Kreveld (Algorithmica, 1997)

Characterizing and efficiently computing quadrangulations of planar point sets. - Prosenjit Bose; Godfried T. Toussaint (Comput. Aided Geom. Des., 1997)

Guarding Polyhedral Terrains. - Prosenjit Bose; Thomas C. Shermer; Godfried T. Toussaint; Binhai Zhu (Comput. Geom., 1997)

The Floodlight Problem. - Prosenjit Bose; Leonidas J. Guibas; Anna Lubiw; Mark H. Overmars; Diane L. Souvaine; Jorge Urrutia (Int. J. Comput. Geom. Appl., 1997)

Optimal Algorithms to Embed Trees in a Point Set. - Prosenjit Bose; Michael McAllister; Jack Snoeyink (J. Graph Algorithms Appl., 1997)

Recovering lines with fixed linear probes. - Mark de Berg; Prosenjit Bose; David Bremner; William S. Evans; Lata Narayanan (CCCG, 1998)

Detection of text-line orientation. - Prosenjit Bose; Jean-Denis Caron; Kilani Ghoudi (CCCG, 1998)

Cutting rectangles in equal area pieces. - Prosenjit Bose; Jurek Czyzowicz; Dominic Lessard (CCCG, 1998)

Testing the Quality of Manufactured Disks and Cylinders. - Prosenjit Bose; Pat Morin (ISAAC, 1998)

Polygon Cutting: Revisited. - Prosenjit Bose; Jurek Czyzowicz; Evangelos Kranakis; Danny Krizanc; Anil Maheshwari (JCDCG, 1998)

Algorithms for Packing Two Circles in a Convex Polygon. - Prosenjit Bose; Jurek Czyzowicz; Evangelos Kranakis; Anil Maheshwari (JCDCG, 1998)

Computing constrained minimum-width annuli of point sets. - Mark de Berg; Prosenjit Bose; David Bremner; Suneeta Ramaswami; Gordon T. Wilfong (Comput. Aided Des., 1998)

Filling polyhedral molds. - Prosenjit Bose; Marc J. van Kreveld; Godfried T. Toussaint (Comput. Aided Des., 1998)

Intersections with random geometric objects. - Prosenjit Bose; Luc Devroye (Comput. Geom., 1998)

Pattern Matching for Permutations. - Prosenjit Bose; Jonathan F. Buss; Anna Lubiw (Inf. Process. Lett., 1998)

A Visibility Representation for Graphs in Three Dimensions. - Prosenjit Bose; Hazel Everett; Sándor P. Fekete; Michael E. Houle; Anna Lubiw; Henk Meijer; Kathleen Romanik; Günter Rote; Thomas C. Shermer; Sue Whitesides; Christian Zelle (J. Graph Algorithms Appl., 1998)

Near optimal-partitioning of rectangles and prisms. - Prosenjit Bose; Jurek Czyzowicz; Evangelos Kranakis; Danny Krizanc; Dominic Lessard (CCCG, 1999)

Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs. - Prosenjit Bose; Albert Chan; Frank K. H. A. Dehne; Markus Latzel (IPPS/SPDP, 1999)

Optimizing Constrained Offset and Scaled Polygonal Annuli. - Gill Barequet; Prosenjit Bose; Matthew Dickerson (WADS, 1999)

Testing the Quality of Manufactured Balls. - Prosenjit Bose; Pat Morin (WADS, 1999)

Drawing Nice Projections of Objects in Space. - Prosenjit Bose; Francisco Gómez 001; Pedro Ramos 001; Godfried Toussaint (J. Vis. Commun. Image Represent., 1999)

Flipping your Lid. - Hee-Kap Ahn; Prosenjit Bose; Jurek Czyzowicz; Nicolas Hanusse; Evangelos Kranakis; Pat Morin (CCCG, 2000)

Strategies for Hotlink Assignments. - Prosenjit Bose; Evangelos Kranakis; Danny Krizanc; Miguel Vargas Martin; Jurek Czyzowicz; Andrzej Pelc; Leszek Gasieniec (ISAAC, 2000)

The Grid Placement Problem. - Prosenjit Bose; Anil Maheshwari; Pat Morin; Jason Morrison (WADS, 2001)

Every Set of Disjoint Line Segments Admits a Binary Tree. - Prosenjit Bose; Michael E. Houle; Godfried T. Toussaint (Discret. Comput. Geom., 2001)

Efficient Algorithms for Petersen's Matching Theorem. - Therese C. Biedl; Prosenjit Bose; Erik D. Demaine; Anna Lubiw (J. Algorithms, 2001)

Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. - Prosenjit Bose; Pat Morin; Ivan Stojmenovic; Jorge Urrutia (Wirel. Networks, 2001)

Succinct Data Structures for Approximating Convex Functions with Applications. - Prosenjit Bose; Luc Devroye; Pat Morin (JCDCG, 2002)

Facility Location Constrained to a Polygonal Domain. - Prosenjit Bose; Qingda Wang (LATIN, 2002)

Some Aperture-Angle Optimization Problems. - Prosenjit Bose; Ferran Hurtado; Elsa Omaña-Pulido; Jack Snoeyink; Godfried T. Toussaint (Algorithmica, 2002)

Separating an object from its cast. - Hee-Kap Ahn; Mark de Berg; Prosenjit Bose; Siu-Wing Cheng; Dan Halperin; Jirí Matousek 001; Otfried Schwarzkopf (Comput. Aided Des., 2002)

Experimental results on quadrangulations of sets of fixed points. - Prosenjit Bose; Suneeta Ramaswami; Godfried T. Toussaint; Alain Turki (Comput. Aided Geom. Des., 2002)

On embedding an outer-planar graph in a point set. - Prosenjit Bose (Comput. Geom., 2002)

Efficient visibility queries in simple polygons. - Prosenjit Bose; Anna Lubiw; J. Ian Munro (Comput. Geom., 2002)

Online Routing in Convex Subdivisions. - Prosenjit Bose; Andrej Brodnik; Svante Carlsson; Erik D. Demaine; Rudolf Fleischer; Alejandro López-Ortiz; Pat Morin; J. Ian Munro (Int. J. Comput. Geom. Appl., 2002)

Diamonds are Not a Minimum Weight Triangulation's Best Friend. - Prosenjit Bose; Luc Devroye; William S. Evans (Int. J. Comput. Geom. Appl., 2002)

An Improved Algorithm for Subdivision Traversal without Extra Storage. - Prosenjit Bose; Pat Morin (Int. J. Comput. Geom. Appl., 2002)

Finding Specified Sections of Arrangements: 2D Results. - Prosenjit Bose; Ferran Hurtado; Henk Meijer; Suneeta Ramaswami; David Rappaport; Vera Sacristán; Thomas C. Shermer; Godfried T. Toussaint (J. Math. Model. Algorithms, 2002)

Station Layouts in the Presence of Location Constraints. - Prosenjit Bose; Evangelos Kranakis; Christos Kaklamanis; Lefteris M. Kirousis; Danny Krizanc; David Peleg (J. Interconnect. Networks, 2002)

Bounds for Frequency Estimation of Packet Streams. - Prosenjit Bose; Evangelos Kranakis; Pat Morin; Yihui Tang (SIROCCO, 2003)

Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. - Prosenjit Bose; David G. Kirkpatrick; Zaiqing Li (Comput. Geom., 2003)

Translating a regular grid over a point set. - Prosenjit Bose; Marc J. van Kreveld; Anil Maheshwari; Pat Morin; Jason Morrison (Comput. Geom., 2003)

Fast approximations for sums of distances, clustering and the Fermat-Weber problem. - Prosenjit Bose; Anil Maheshwari; Pat Morin (Comput. Geom., 2003)

Properties of Arrangement Graphs. - Prosenjit Bose; Hazel Everett; Stephen K. Wismath (Int. J. Comput. Geom. Appl., 2003)

Asymmetric Communication Protocols via Hotlink Assignments. - Prosenjit Bose; Danny Krizanc; Stefan Langerman; Pat Morin (Theory Comput. Syst., 2003)

Computing nice sweeps for polyhedra and polygons. - Prosenjit Bose; Marc J. van Kreveld (CCCG, 2004)

On computing enclosing isosceles triangles and related problems. - Prosenjit Bose; Carlos Seara; Saurabh Sethia (CCCG, 2004)

Feature Based Cut Detection with Automatic Threshold Selection. - Anthony D. Whitehead; Prosenjit Bose; Robert Laganière (CIVR, 2004)

Weighted Ham-Sandwich Cuts. - Prosenjit Bose; Stefan Langerman (JCDCG, 2004)

Testing the Quality of Manufactured Disks and Balls. - Prosenjit Bose; Pat Morin (Algorithmica, 2004)

On simplifying dot maps. - Mark de Berg; Prosenjit Bose; Otfried Cheong; Pat Morin (Comput. Geom., 2004)

Ordered theta graphs. - Prosenjit Bose; Joachim Gudmundsson; Pat Morin (Comput. Geom., 2004)

Approximating geometric bottleneck shortest paths. - Prosenjit Bose; Anil Maheshwari; Giri Narasimhan; Michiel H. M. Smid; Norbert Zeh (Comput. Geom., 2004)

Light edges in degree-constrained graphs. - Prosenjit Bose; Michiel H. M. Smid; David R. Wood (Discret. Math., 2004)

Packing two disks into a polygonal environment. - Prosenjit Bose; Pat Morin; Antoine Vigneron (J. Discrete Algorithms, 2004)

The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. - Prosenjit Bose; Jurek Czyzowicz; Pat Morin; David R. Wood (J. Graph Algorithms Appl., 2004)

Online Routing in Triangulations. - Prosenjit Bose; Pat Morin (SIAM J. Comput., 2004)

Competitive online routing in geometric graphs. - Prosenjit Bose; Pat Morin (Theor. Comput. Sci., 2004)

Translating a Star over a Point Set. - Prosenjit Bose; Jason Morrison (CCCG, 2005)

On properties of higher-order Delaunay graphs with applications. - Manuel Abellanas; Prosenjit Bose; Jesús García-López; Ferran Hurtado; Mariano Nicolás; Pedro A. Ramos (EuroCG, 2005)

High-speed texture-preserving digital image inpainting. - Anthony D. Whitehead; Prosenjit Bose; Veronique Audet (SIP, 2005)

Approximate Range Mode and Range Median Queries. - Prosenjit Bose; Evangelos Kranakis; Pat Morin; Yihui Tang (STACS, 2005)

Temporal Synchronization of Video Sequences in Theory and in Practice. - Anthony D. Whitehead; Robert Laganière; Prosenjit Bose (WACV/MOTION, 2005)

Constructing Plane Spanners of Bounded Degree and Low Weight. - Prosenjit Bose; Joachim Gudmundsson; Michiel H. M. Smid (Algorithmica, 2005)

Guest Editors' Foreword. - Prosenjit Bose; Pat Morin (Algorithmica, 2005)

Generalizing Monotonicity: on Recognizing Special Classes of Polygons and Polyhedra. - Prosenjit Bose; Marc J. van Kreveld (Int. J. Comput. Geom. Appl., 2005)

Optimizing a constrained convex polygonal annulus. - Gill Barequet; Prosenjit Bose; Matthew T. Dickerson; Michael T. Goodrich (J. Discrete Algorithms, 2005)

Computing the Tool Path of an Externally Monotone Polygon in Linear Time. - Prosenjit Bose; David Bremner; Diane L. Souvaine (CCCG, 2006)

Optimal Polygon Placement. - Prosenjit Bose; Jason Morrison (CCCG, 2006)

Lazy Generation of Building Interiors in Realtime. - Evan Hahn; Prosenjit Bose; Anthony D. Whitehead (CCECE, 2006)

Diamond Triangulations Contain Spanners of Bounded Degree. - Prosenjit Bose; Michiel H. M. Smid; Daming Xu (ISAAC, 2006)

On the Stretch Factor of the Constrained Delaunay Triangulation. - Prosenjit Bose; J. Mark Keil (ISVD, 2006)

Incremental Construction of k-Dominating Sets in Wireless Sensor Networks. - Mathieu Couture; Michel Barbeau; Prosenjit Bose; Evangelos Kranakis (OPODIS, 2006)

Persistent realtime building interior generation. - Evan Hahn; Prosenjit Bose; Anthony D. Whitehead (Sandbox@SIGGRAPH, 2006)

Induced Subgraphs of Bounded Degree and Bounded Treewidth. - Prosenjit Bose; Vida Dujmovic; David R. Wood (Contributions Discret. Math., 2006)

Equitable subdivisions within polygonal regions. - Sergey Bereg; Prosenjit Bose; David G. Kirkpatrick (Comput. Geom., 2006)

Partitions of complete geometric graphs into plane trees. - Prosenjit Bose; Ferran Hurtado; Eduardo Rivera-Campo; David R. Wood (Comput. Geom., 2006)

Area-preserving approximations of polygonal paths. - Prosenjit Bose; Sergio Cabello; Otfried Cheong; Joachim Gudmundsson; Marc J. van Kreveld; Bettina Speckmann (J. Discrete Algorithms, 2006)

On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. - Prosenjit Bose; Luc Devroye; William S. Evans; David G. Kirkpatrick (SIAM J. Discret. Math., 2006)

Vertex Pops and Popturns. - Greg Aloupis; Brad Ballinger; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Martin L. Demaine; Robin Y. Flatland; Ferran Hurtado; Stefan Langerman; Joseph O'Rourke; Perouz Taslakian; Godfried T. Toussaint (CCCG, 2007)

Linear-Space Algorithms for Distance Preserving Embedding. - Tetsuo Asano; Prosenjit Bose; Paz Carmi; Anil Maheshwari; Chang Shu 001; Michiel H. M. Smid; Stefanie Wuhrer (CCCG, 2007)

Approximations of Geodesic Distances for Incomplete Triangular Manifolds. - Zouhour Ben Azouz; Prosenjit Bose; Chang Shu 001; Stefanie Wuhrer (CCCG, 2007)

Optimal Point Set Partitioning using Rigid Motion Star Placement. - Prosenjit Bose; Jason Morrison (CCCG, 2007)

On Generalized Diamond Spanners. - Prosenjit Bose; Aaron Lee; Michiel H. M. Smid (WADS, 2007)

Reconfiguring Triangulations with Edge Flips and Point Moves. - Greg Aloupis; Prosenjit Bose; Pat Morin (Algorithmica, 2007)

On the stabbing number of a random Delaunay triangulation. - Prosenjit Bose; Luc Devroye (Comput. Geom., 2007)

Space-efficient geometric divide-and-conquer algorithms. - Prosenjit Bose; Anil Maheshwari; Pat Morin; Jason Morrison; Michiel H. M. Smid; Jan Vahrenhold (Comput. Geom., 2007)

Geodesic Ham-Sandwich Cuts. - Prosenjit Bose; Erik D. Demaine; Ferran Hurtado; John Iacono; Stefan Langerman; Pat Morin (Discret. Comput. Geom., 2007)

A General Approximation Algorithm for Planar Maps with Applications. - Prosenjit Bose; Narcís Coll; Ferran Hurtado; Joan Antoni Sellarès (Int. J. Comput. Geom. Appl., 2007)

Posture Invariant Correspondence of Incomplete Triangular Manifolds. - Stefanie Wuhrer; Chang Shu 001; Prosenjit Bose; Zouhour Ben Azouz (Int. J. Shape Model., 2007)

Simultaneous diagonal flips in plane triangulations. - Prosenjit Bose; Jurek Czyzowicz; Zhicheng Gao; Pat Morin; David R. Wood (J. Graph Theory, 2007)

Smallest enclosing circle centered on a query line segment. - Prosenjit Bose; Stefan Langerman; Sasanka Roy (CCCG, 2008)

Isometric Morphing of Triangular Meshes. - Prosenjit Bose; Joseph O'Rourke; Chang Shu 001; Stefanie Wuhrer (CCCG, 2008)

Dynamic optimality for skip lists and B-trees. - Prosenjit Bose; Karim Douïeb; Stefan Langerman (SODA, 2008)

Incremental Construction of k-Dominating Sets in Wireless Sensor Networks. - Mathieu Couture; Michel Barbeau; Prosenjit Bose; Evangelos Kranakis (Ad Hoc Sens. Wirel. Networks, 2008)

On local transformations in plane geometric graphs embedded on small grids. - Manuel Abellanas; Prosenjit Bose; Alfredo García Olaverri; Ferran Hurtado; Pedro Ramos 001; Eduardo Rivera-Campo; Javier Tejel (Comput. Geom., 2008)

Editorial. - Prosenjit Bose; Thomas Fevens (Comput. Geom., 2008)

A Polynomial Bound for Untangling Geometric Planar Graphs. - Prosenjit Bose; Vida Dujmovic; Ferran Hurtado; Pat Morin; Stefan Langerman; David R. Wood (Electron. Notes Discret. Math., 2008)

On the false-positive rate of Bloom filters. - Prosenjit Bose; Hua Guo; Evangelos Kranakis; Anil Maheshwari; Pat Morin; Jason Morrison; Michiel H. M. Smid; Yihui Tang (Inf. Process. Lett., 2008)

A Characterization of the degree sequences of 2-trees. - Prosenjit Bose; Vida Dujmovic; Danny Krizanc; Stefan Langerman; Pat Morin; David R. Wood; Stefanie Wuhrer (J. Graph Theory, 2008)

Coarse grained parallel algorithms for graph matching. - Albert Chan; Frank K. H. A. Dehne; Prosenjit Bose; Markus Latzel (Parallel Comput., 2008)

Relaxed Gabriel Graphs. - Prosenjit Bose; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Belén Palop; Perouz Taslakian; Norbert Zeh (CCCG, 2009)

The spanning ratio of the Delaunay triangulation is greater than pi/2. - Prosenjit Bose; Luc Devroye; Maarten Löffler; Jack Snoeyink; Vishal Verma (CCCG, 2009)

Posture invariant correspondence of triangular meshes in shape space. - Stefanie Wuhrer; Chang Shu 001; Prosenjit Bose (ICCV Workshops, 2009)

Filling holes in triangular meshes by curve unfolding. - Alan Brunton; Stefanie Wuhrer; Chang Shu 001; Prosenjit Bose; Erik D. Demaine (Shape Modeling International, 2009)

Efficient Construction of Near-Optimal Binary and Multiway Search Trees. - Prosenjit Bose; Karim Douïeb (WADS, 2009)

Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. - Prosenjit Bose; Meng He 001; Anil Maheshwari; Pat Morin (WADS, 2009)

Clamshell Casting. - Prosenjit Bose; Pat Morin; Michiel H. M. Smid; Stefanie Wuhrer (Algorithmica, 2009)

A linear-space algorithm for distance preserving graph embedding. - Tetsuo Asano; Prosenjit Bose; Paz Carmi; Anil Maheshwari; Chang Shu 001; Michiel H. M. Smid; Stefanie Wuhrer (Comput. Geom., 2009)

Geometric spanners with small chromatic number. - Prosenjit Bose; Paz Carmi; Mathieu Couture; Anil Maheshwari; Michiel H. M. Smid; Norbert Zeh (Comput. Geom., 2009)

Flips in planar graphs. - Prosenjit Bose; Ferran Hurtado (Comput. Geom., 2009)

Editorial CCCG 2005. - Prosenjit Bose; Asish Mukhopadhyay (Comput. Geom., 2009)

Rotationally monotone polygons. - Prosenjit Bose; Pat Morin; Michiel H. M. Smid; Stefanie Wuhrer (Comput. Geom., 2009)

Connectivity-preserving transformations of binary images. - Prosenjit Bose; Vida Dujmovic; Ferran Hurtado; Pat Morin (Comput. Vis. Image Underst., 2009)

Traversing a Set of Points with a Minimum Number of Turns. - Sergey Bereg; Prosenjit Bose; Adrian Dumitrescu; Ferran Hurtado; Pavel Valtr 001 (Discret. Comput. Geom., 2009)

On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs. - Manuel Abellanas; Prosenjit Bose; Jesús García-López; Ferran Hurtado; Carlos M. Nicolás; Pedro Ramos 001 (Int. J. Comput. Geom. Appl., 2009)

Delaunay and diamond Triangulations contain Spanners of Bounded Degree. - Prosenjit Bose; Michiel H. M. Smid; Daming Xu (Int. J. Comput. Geom. Appl., 2009)

A note on the lower bound of edge guards of polyhedral terrains. - Prosenjit Bose (Int. J. Comput. Math., 2009)

Algorithms for optimal outlier removal. - Rossen Atanassov; Prosenjit Bose; Mathieu Couture; Anil Maheshwari; Pat Morin; Michel Paquette; Michiel H. M. Smid; Stefanie Wuhrer (J. Discrete Algorithms, 2009)

Augmented reality on cloth with realistic illumination. - Derek Bradley; Gerhard Roth; Prosenjit Bose (Mach. Vis. Appl., 2009)

Spanners of Complete k-Partite Geometric Graphs. - Prosenjit Bose; Paz Carmi; Mathieu Couture; Anil Maheshwari; Pat Morin; Michiel H. M. Smid (SIAM J. Comput., 2009)

Minimum enclosing area triangle with a fixed angle. - Prosenjit Bose; Jean-Lou De Carufel (CCCG, 2010)

On the perimeter of fat objects. - Prosenjit Bose; Otfried Cheong; Vida Dujmovic (CCCG, 2010)

Some properties of higher order delaunay and gabriel graphs. - Prosenjit Bose; Sébastien Collette; Ferran Hurtado; Matias Korman; Stefan Langerman; Vera Sacristán; Maria Saumell (CCCG, 2010)

Common Unfoldings of Polyominoes and Polycubes. - Greg Aloupis; Prosenjit Bose; Sébastien Collette; Erik D. Demaine; Martin L. Demaine; Karim Douïeb; Vida Dujmovic; John Iacono; Stefan Langerman; Pat Morin (CGGA, 2010)

Coverage with k-Transmitters in the Presence of Obstacles. - Brad Ballinger; Nadia M. Benbernou; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Ferran Hurtado; John Iacono; Anna Lubiw; Pat Morin; Vera Sacristán Adinolfi; et al. (COCOA (2), 2010)

Global Context Descriptors for SURF and MSER Feature Descriptors. - Gail Carmichael; Robert Laganière; Prosenjit Bose (CRV, 2010)

Should Static Search Trees Ever Be Unbalanced? - Prosenjit Bose; Karim Douïeb (ISAAC (1), 2010)

pi/2-Angle Yao Graphs Are Spanners. - Prosenjit Bose; Mirela Damian; Karim Douïeb; Joseph O'Rourke; Ben Seamone; Michiel H. M. Smid; Stefanie Wuhrer (ISAAC (2), 2010)

Communication-Efficient Construction of the Plane Localized Delaunay Graph. - Prosenjit Bose; Paz Carmi; Michiel H. M. Smid; Daming Xu (LATIN, 2010)

Improved Methods For Generating Quasi-gray Codes. - Prosenjit Bose; Paz Carmi; Dana Jansens; Anil Maheshwari; Pat Morin; Michiel H. M. Smid (SWAT, 2010)

An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. - Prosenjit Bose; Karim Douïeb; Vida Dujmovic; Rolf Fagerberg (SWAT, 2010)

Computing the Greedy Spanner in Near-Quadratic Time. - Prosenjit Bose; Paz Carmi; Mohammad Farshi; Anil Maheshwari; Michiel H. M. Smid (Algorithmica, 2010)

Point Location in Disconnected Planar Subdivisions - Prosenjit Bose; Luc Devroye; Karim Douïeb; Vida Dujmovic; James King 001; Pat Morin (CoRR, 2010)

Pi/2-Angle Yao Graphs are Spanners - Prosenjit Bose; Mirela Damian; Karim Douïeb; Joseph O'Rourke; Ben Seamone; Michiel H. M. Smid; Stefanie Wuhrer (CoRR, 2010)

Odds-On Trees - Prosenjit Bose; Luc Devroye; Karim Douïeb; Vida Dujmovic; James King 001; Pat Morin (CoRR, 2010)

An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times - Prosenjit Bose; Karim Douïeb; Vida Dujmovic; Rolf Fagerberg (CoRR, 2010)

The dilation of the Delaunay triangulation is greater than π/2 - Prosenjit Bose; Luc Devroye; Maarten Löffler; Jack Snoeyink; Vishal Verma (CoRR, 2010)

Filling Holes in Triangular Meshes Using Digital Images by Curve Unfolding. - Alan Brunton; Stefanie Wuhrer; Chang Shu 001; Prosenjit Bose; Erik D. Demaine (Int. J. Shape Model., 2010)

Morphing of Triangular Meshes in Shape Space. - Stefanie Wuhrer; Prosenjit Bose; Chang Shu 001; Joseph O'Rourke; Alan Brunton (Int. J. Shape Model., 2010)

Sigma-local graphs. - Prosenjit Bose; Sébastien Collette; Stefan Langerman; Anil Maheshwari; Pat Morin; Michiel H. M. Smid (J. Discrete Algorithms, 2010)

On the Stretch Factor of Convex Delaunay Graphs. - Prosenjit Bose; Paz Carmi; Sébastien Collette; Michiel H. M. Smid (J. Comput. Geom., 2010)

Isoperimetric Triangular Enclosure with a Fixed Angle. - Prosenjit Bose; Jean-Lou De Carufel (CCCG, 2011)

A History of Flips in Combinatorial Triangulations. - Prosenjit Bose; Sander Verdonschot (EGC, 2011)

Location-Oblivious Distributed Unit Disk Graph Coloring. - Michel Barbeau; Prosenjit Bose; Paz Carmi; Mathieu Couture; Evangelos Kranakis (Algorithmica, 2011)

On a family of strong geometric spanners that admit local routing strategies. - Prosenjit Bose; Paz Carmi; Mathieu Couture; Michiel H. M. Smid; Daming Xu (Comput. Geom., 2011)

A note on the perimeter of fat objects. - Prosenjit Bose; Otfried Cheong; Vida Dujmovic (Comput. Geom., 2011)

Almost all Delaunay triangulations have stretch factor greater than pi/2. - Prosenjit Bose; Luc Devroye; Maarten Löffler; Jack Snoeyink; Vishal Verma (Comput. Geom., 2011)

A survey of geodesic paths on 3D surfaces. - Prosenjit Bose; Anil Maheshwari; Chang Shu 001; Stefanie Wuhrer (Comput. Geom., 2011)

Every Large Point Set contains Many Collinear Points or an Empty Pentagon. - Zachary Abel; Brad Ballinger; Prosenjit Bose; Sébastien Collette; Vida Dujmovic; Ferran Hurtado; Scott Duke Kominers; Stefan Langerman; Attila Pór; David R. Wood (Graphs Comb., 2011)

Computing Signed Permutations of Polygons. - Greg Aloupis; Prosenjit Bose; Erik D. Demaine; Stefan Langerman; Henk Meijer; Mark H. Overmars; Godfried T. Toussaint (Int. J. Comput. Geom. Appl., 2011)

On Computing Enclosing Isosceles Triangles and Related Problems. - Prosenjit Bose; Mercè Mora; Carlos Seara; Saurabh Sethia (Int. J. Comput. Geom. Appl., 2011)

Spanners of additively weighted point sets. - Prosenjit Bose; Paz Carmi; Mathieu Couture (J. Discrete Algorithms, 2011)

On Farthest-Point Information in Networks. - Prosenjit Bose; Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2012)

Optimal Bounds on Theta-Graphs: More is not Always Better. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (CCCG, 2012)

Competitive Routing on a Bounded-Degree Plane Spanner. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (CCCG, 2012)

Flips. - Prosenjit Bose (GD, 2012)

De-amortizing Binary Search Trees. - Prosenjit Bose; Sébastien Collette; Rolf Fagerberg; Stefan Langerman (ICALP (1), 2012)

On Spanning Properties of Various Delaunay Graphs. - Prosenjit Bose (ISVD, 2012)

Competitive routing in the half-θ6-graph. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (SODA, 2012)

Layered Working-Set Trees. - Prosenjit Bose; Karim Douïeb; Vida Dujmovic; John Howat (Algorithmica, 2012)

Editorial. - Prosenjit Bose; Paz Carmi (Comput. Geom., 2012)

The theta-5-graph is a spanner - Prosenjit Bose; Pat Morin; André van Renssen; Sander Verdonschot (CoRR, 2012)

π/2-Angle Yao Graphs are Spanners. - Prosenjit Bose; Mirela Damian; Karim Douïeb; Joseph O'Rourke; Ben Seamone; Michiel H. M. Smid; Stefanie Wuhrer (Int. J. Comput. Geom. Appl., 2012)

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. - Prosenjit Bose; Vida Dujmovic; Ferran Hurtado; John Iacono; Stefan Langerman; Henk Meijer; Vera Sacristán Adinolfi; Maria Saumell; David R. Wood (Int. J. Comput. Geom. Appl., 2012)

Automatically Creating Design Models From 3D Anthropometry Data. - Stefanie Wuhrer; Chang Shu 001; Prosenjit Bose (J. Comput. Inf. Sci. Eng., 2012)

On bounded degree plane strong geometric spanners. - Prosenjit Bose; Paz Carmi; Lilach Chaitman-Yerushalmi (J. Discrete Algorithms, 2012)

Skip lift: A probabilistic alternative to red-black trees. - Prosenjit Bose; Karim Douïeb; Pat Morin (J. Discrete Algorithms, 2012)

A distribution-sensitive dictionary with low space overhead. - Prosenjit Bose; John Howat; Pat Morin (J. Discrete Algorithms, 2012)

Succinct geometric indexes supporting point location queries. - Prosenjit Bose; Eric Y. Chen; Meng He 001; Anil Maheshwari; Pat Morin (ACM Trans. Algorithms, 2012)

A History of Distribution-Sensitive Data Structures. - Prosenjit Bose; John Howat; Pat Morin (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

Computing Covers of Plane Forests. - Luis Barba; Alexis Beingessner; Prosenjit Bose; Michiel H. M. Smid (CCCG, 2013)

Revisiting the Problem of Searching on a Line. - Prosenjit Bose; Jean-Lou De Carufel; Stephane Durocher (ESA, 2013)

On the Stretch Factor of the Theta-4 Graph. - Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; André van Renssen; Sander Verdonschot (WADS, 2013)

On the Spanning Ratio of Theta-Graphs. - Prosenjit Bose; André van Renssen; Sander Verdonschot (WADS, 2013)

The θ 5-Graph is a Spanner. - Prosenjit Bose; Pat Morin; André van Renssen; Sander Verdonschot (WG, 2013)

Stable Roommates Spanner. - Prosenjit Bose; Paz Carmi; Lilach Chaitman-Yerushalmi; Sébastien Collette; Matthew J. Katz; Stefan Langerman (Comput. Geom., 2013)

Some properties of k-Delaunay and k-Gabriel graphs. - Prosenjit Bose; Sébastien Collette; Ferran Hurtado; Matias Korman; Stefan Langerman; Vera Sacristán; Maria Saumell (Comput. Geom., 2013)

Fast local searches and updates in bounded universes. - Prosenjit Bose; Karim Douïeb; Vida Dujmovic; John Howat; Pat Morin (Comput. Geom., 2013)

On plane geometric spanners: A survey and open problems. - Prosenjit Bose; Michiel H. M. Smid (Comput. Geom., 2013)

New and Improved Spanning Ratios for Yao Graphs. - Luis Barba; Prosenjit Bose; Mirela Damian; Rolf Fagerberg; Joseph O'Rourke; André van Renssen; Perouz Taslakian; Sander Verdonschot (CoRR, 2013)

Bounding the locality of distributed routing algorithms. - Prosenjit Bose; Paz Carmi; Stephane Durocher (Distributed Comput., 2013)

Coloring and Guarding Arrangements. - Prosenjit Bose; Jean Cardinal; Sébastien Collette; Ferran Hurtado; Matias Korman; Stefan Langerman; Perouz Taslakian (Discret. Math. Theor. Comput. Sci., 2013)

Coverage with k-transmitters in the presence of obstacles. - Brad Ballinger; Nadia M. Benbernou; Prosenjit Bose; Mirela Damian; Erik D. Demaine; Vida Dujmovic; Robin Y. Flatland; Ferran Hurtado; John Iacono; Anna Lubiw; Pat Morin; Vera Sacristán Adinolfi; et al. (J. Comb. Optim., 2013)

Network Farthest-Point Diagrams. - Prosenjit Bose; Kai Dannies; Jean-Lou De Carufel; Christoph Doell; Carsten Grimm; Anil Maheshwari; Stefan Schirra; Michiel H. M. Smid (J. Comput. Geom., 2013)

Robust Geometric Spanners. - Prosenjit Bose; Vida Dujmovic; Pat Morin; Michiel H. M. Smid (SIAM J. Comput., 2013)

A General Framework to Generate Sizing Systems from 3D Motion Data Applied to Face Mask Design. - Timo Bolkart; Prosenjit Bose; Chang Shu 001; Stefanie Wuhrer (3DV, 2014)

Continuous Yao Graphs. - Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Mirela Damian; Rolf Fagerberg; André van Renssen; Perouz Taslakian; Sander Verdonschot (CCCG, 2014)

Searching by Panning and Zooming. - Prosenjit Bose; John Howat; Pat Morin (CCCG, 2014)

The Convex Hull of Points on a Sphere is a Spanner. - Prosenjit Bose; Simon Pratt; Michiel H. M. Smid (CCCG, 2014)

Optimal Algorithms for Constrained 1-Center Problems. - Luis Barba; Prosenjit Bose; Stefan Langerman (LATIN, 2014)

Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs. - Prosenjit Bose; André van Renssen (LATIN, 2014)

Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. - Prosenjit Bose; Paz Carmi; Mirela Damian; Robin Y. Flatland; Matthew J. Katz; Anil Maheshwari (Algorithmica, 2014)

Theta-3 is connected. - Oswin Aichholzer; Sang Won Bae 001; Luis Barba; Prosenjit Bose; Matias Korman; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2014)

Triangulating and guarding realistic polygons. - Greg Aloupis; Prosenjit Bose; Vida Dujmovic; Chris Gray; Stefan Langerman; Bettina Speckmann (Comput. Geom., 2014)

Minimum-area enclosing triangle with a fixed angle. - Prosenjit Bose; Jean-Lou De Carufel (Comput. Geom., 2014)

Making triangulations 4-connected using flips. - Prosenjit Bose; Dana Jansens; André van Renssen; Maria Saumell; Sander Verdonschot (Comput. Geom., 2014)

Towards a General Framework for Searching on a Line and Searching on $m$ Rays. - Prosenjit Bose; Jean-Lou De Carufel (CoRR, 2014)

Towards Tight Bounds on Theta-Graphs. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (CoRR, 2014)

Surface roughness of rock faces through the curvature of triangulated meshes. - P. Lai; Claire Samson; Prosenjit Bose (Comput. Geosci., 2014)

One of Ferran Hurtado's favorite topics - Flips. - Prosenjit Bose (CCCG, 2015)

Constrained Empty-Rectangle Delaunay Graphs. - Prosenjit Bose; Jean-Lou De Carufel; André van Renssen (CCCG, 2015)

The Shadows of a Cycle Cannot All Be Paths. - Giovanni Viglietta; Prosenjit Bose; Jean-Lou De Carufel; Michael Gene Dobbins; Heuna Kim (CCCG, 2015)

Visibility-monotonic polygon deflation. - Prosenjit Bose; Vida Dujmovic; Nima Hoda; Pat Morin (Contributions Discret. Math., 2015)

Reprint of: Theta-3 is connected. - Oswin Aichholzer; Sang Won Bae 001; Luis Barba; Prosenjit Bose; Matias Korman; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2015)

The θ5-graph is a spanner. - Prosenjit Bose; Pat Morin; André van Renssen; Sander Verdonschot (Comput. Geom., 2015)

Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. - Nicolas Bonichon; Prosenjit Bose; Jean-Lou De Carufel; Ljubomir Perkovic; André van Renssen (CoRR, 2015)

Packing Plane Perfect Matchings into a Point Set. - Ahmad Biniaz; Prosenjit Bose; Anil Maheshwari; Michiel H. M. Smid (Discret. Math. Theor. Comput. Sci., 2015)

Optimal Data Structures for Farthest-Point Queries in Cactus Networks. - Prosenjit Bose; Jean-Lou De Carufel; Carsten Grimm; Anil Maheshwari; Michiel H. M. Smid (J. Graph Algorithms Appl., 2015)

New and improved spanning ratios for Yao graphs. - Luis Barba; Prosenjit Bose; Mirela Damian; Rolf Fagerberg; Wah Loon Keng; Joseph O'Rourke; André van Renssen; Perouz Taslakian; Sander Verdonschot; Ge Xia (J. Comput. Geom., 2015)

Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (SIAM J. Comput., 2015)

Searching on a line: A complete characterization of the optimal solution. - Prosenjit Bose; Jean-Lou De Carufel; Stephane Durocher (Theor. Comput. Sci., 2015)

A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. - Ahmad Biniaz; Prosenjit Bose; Ingo van Duijn; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2016)

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. - Nicolas Bonichon; Prosenjit Bose; Paz Carmi; Irina Kostitsyna; Anna Lubiw; Sander Verdonschot (GD, 2016)

The Power and Limitations of Static Binary Search Trees with Lazy Finger. - Prosenjit Bose; Karim Douïeb; John Iacono; Stefan Langerman (Algorithmica, 2016)

Biased Predecessor Search. - Prosenjit Bose; Rolf Fagerberg; John Howat; Pat Morin (Algorithmica, 2016)

Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. - Ahmad Biniaz; Prosenjit Bose; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2016)

Probing convex polygons with a wedge. - Prosenjit Bose; Jean-Lou De Carufel; Alina Shaikhet; Michiel H. M. Smid (Comput. Geom., 2016)

Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon. - Yeganeh Bahoo; Bahareh Banyassady; Prosenjit Bose; Stephane Durocher; Wolfgang Mulzer (CoRR, 2016)

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. - Hee-Kap Ahn; Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Matias Korman; Eunjin Oh 001 (Discret. Comput. Geom., 2016)

The Price of Order. - Prosenjit Bose; Pat Morin; André van Renssen (Int. J. Comput. Geom. Appl., 2016)

A plane 1.88-spanner for points in convex position. - Ahmad Biniaz; Mahdi Amani; Anil Maheshwari; Michiel H. M. Smid; Prosenjit Bose; Jean-Lou De Carufel (J. Comput. Geom., 2016)

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. - Michiel H. M. Smid; Prosenjit Bose; Paz Carmi; Mirela Damian; Jean-Lou De Carufel; Darryl Hill; Anil Maheshwari; Yuyang Liu (J. Comput. Geom., 2016)

Towards tight bounds on theta-graphs: More is not always better. - Prosenjit Bose; Jean-Lou De Carufel; Pat Morin; André van Renssen; Sander Verdonschot (Theor. Comput. Sci., 2016)

On the separation of a polyhedron from its single-part mold. - Prosenjit Bose; Dan Halperin; Shahar Shamai (CASE, 2017)

Power Domination on Triangular Grids. - Prosenjit Bose; Claire Pennarun; Sander Verdonschot (CCCG, 2017)

Local Routing in Spanners Based on WSPDs. - Prosenjit Bose; Jean-Lou De Carufel; Vida Dujmovic; Frédérik Paradis (WADS, 2017)

Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon. - Yeganeh Bahoo; Bahareh Banyassady; Prosenjit Bose; Stephane Durocher; Wolfgang Mulzer (WALCOM, 2017)

Flips in edge-labelled pseudo-triangulations. - Prosenjit Bose; Sander Verdonschot (Comput. Geom., 2017)

Art Gallery Localization. - Prosenjit Bose; Jean-Lou De Carufel; Alina Shaikhet; Michiel H. M. Smid (CoRR, 2017)

Upper and Lower Bounds for Online Routing on Delaunay Triangulations. - Nicolas Bonichon; Prosenjit Bose; Jean-Lou De Carufel; Ljubomir Perkovic; André van Renssen (Discret. Comput. Geom., 2017)

New Bounds for Facial Nonrepetitive Colouring. - Prosenjit Bose; Vida Dujmovic; Pat Morin; Lucas Rioux-Maldague (Graphs Comb., 2017)

Competitive Online Routing on Delaunay Triangulations. - Prosenjit Bose; Jean-Lou De Carufel; Stephane Durocher; Perouz Taslakian (Int. J. Comput. Geom. Appl., 2017)

Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. - Ahmad Biniaz; Prosenjit Bose; Ingo van Duijn; Anil Maheshwari; Michiel H. M. Smid (J. Graph Algorithms Appl., 2017)

Essential Constraints of Edge-Constrained Proximity Graphs. - Prosenjit Bose; Jean-Lou De Carufel; Alina Shaikhet; Michiel H. M. Smid (J. Graph Algorithms Appl., 2017)

Towards plane spanners of degree 3. - Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Cyril Gavoille; Anil Maheshwari; Michiel H. M. Smid (J. Comput. Geom., 2017)

Competitive local routing with constraints. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (J. Comput. Geom., 2017)

A general framework for searching on a line. - Prosenjit Bose; Jean-Lou De Carufel (Theor. Comput. Sci., 2017)

Boundary Labeling for Rectangular Diagrams. - Prosenjit Bose; Paz Carmi; J. Mark Keil; Saeed Mehrabi 001; Debajyoti Mondal (SWAT, 2018)

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. - Boris Aronov; Prosenjit Bose; Erik D. Demaine; Joachim Gudmundsson; John Iacono; Stefan Langerman; Michiel H. M. Smid (Algorithmica, 2018)

Spanning Trees in Multipartite Geometric Graphs. - Ahmad Biniaz; Prosenjit Bose; David Eppstein; Anil Maheshwari; Pat Morin; Michiel H. M. Smid (Algorithmica, 2018)

Improved Spanning Ratio for Low Degree Plane Spanners. - Prosenjit Bose; Darryl Hill; Michiel H. M. Smid (Algorithmica, 2018)

Continuous Yao graphs. - Davood Bakhshesh; Luis Barba; Prosenjit Bose; Jean-Lou De Carufel; Mirela Damian; Rolf Fagerberg; Mohammad Farshi; André van Renssen; Perouz Taslakian; Sander Verdonschot (Comput. Geom., 2018)

Constrained generalized Delaunay graphs are plane spanners. - Prosenjit Bose; Jean-Lou De Carufel; André van Renssen (Comput. Geom., 2018)

Flipping edge-labelled triangulations. - Prosenjit Bose; Anna Lubiw; Vinayak Pathak; Sander Verdonschot (Comput. Geom., 2018)

Editorial: Special issue in memory of Dr. Ferran Hurtado. - Prosenjit Bose; Pedro Ramos 001 (Comput. Geom., 2018)

Reconstructing a convex polygon from its ω-cloud. - Prosenjit Bose; Jean-Lou De Carufel; Elena Khramtcova; Sander Verdonschot (CoRR, 2018)

Near-Optimal O(k)-Robust Geometric Spanners. - Prosenjit Bose; Paz Carmi; Vida Dujmovic; Pat Morin (CoRR, 2018)

Plane Bichromatic Trees of Low Degree. - Ahmad Biniaz; Prosenjit Bose; Anil Maheshwari; Michiel H. M. Smid (Discret. Comput. Geom., 2018)

Routing on the visibility graph. - Prosenjit Bose; Matias Korman; Sander Verdonschot; André van Renssen (J. Comput. Geom., 2018)

Watchtower for k-crossing Visibility. - Yeganeh Bahoo; Prosenjit Bose; Stephane Durocher (CCCG, 2019)

Three-Coloring Three-Dimensional Uniform Hypergraphs. - Ahmad Biniaz; Prosenjit Bose; Jean Cardinal; Michael S. Payne (CCCG, 2019)

Ane invariant triangulations. - Prosenjit Bose; Pilar Cano; Rodrigo I. Silveira (CCCG, 2019)

Reconstructing a Convex Polygon from Its omega ω -cloud. - Elena Arseneva; Prosenjit Bose; Jean-Lou De Carufel; Sander Verdonschot (CSR, 2019)

Computing the k-Crossing Visibility Region of a Point in a Polygon. - Yeganeh Bahoo; Prosenjit Bose; Stephane Durocher; Thomas C. Shermer (IWOCA, 2019)

On the Spanning and Routing Ratio of Theta-Four. - Prosenjit Bose; Jean-Lou De Carufel; Darryl Hill; Michiel H. M. Smid (SODA, 2019)

Maximum Plane Trees in Multipartite Geometric Graphs. - Ahmad Biniaz; Prosenjit Bose; Kimberly Crosbie; Jean-Lou De Carufel; David Eppstein; Anil Maheshwari; Michiel H. M. Smid (Algorithmica, 2019)

On Plane Constrained Bounded-Degree Spanners. - Prosenjit Bose; Rolf Fagerberg; André van Renssen; Sander Verdonschot (Algorithmica, 2019)

Expected Complexity of Routing in $Θ$ 6 and Half-$Θ$ 6 Graphs. - Prosenjit Bose; Jean-Lou De Carufel; Olivier Devillers (CoRR, 2019)

Improved Bounds for Guarding Plane Graphs with Edges. - Ahmad Biniaz; Prosenjit Bose; Aurélien Ooms; Sander Verdonschot (Graphs Comb., 2019)

Spanning Properties of Yao and 휃-Graphs in the Presence of Constraints. - Prosenjit Bose; André van Renssen (Int. J. Comput. Geom. Appl., 2019)

Pole Dancing: 3D Morphs for Tree Drawings. - Elena Arseneva; Prosenjit Bose; Pilar Cano; Anthony D'Angelo; Vida Dujmovic; Fabrizio Frati; Stefan Langerman; Alessandra Tappini (J. Graph Algorithms Appl., 2019)

A time-space trade-off for computing the k-visibility region of a point in a polygon. - Yeganeh Bahoo; Bahareh Banyassady; Prosenjit K. Bose; Stephane Durocher; Wolfgang Mulzer (Theor. Comput. Sci., 2019)

Non-Crossing Matching of Online Points. - Prosenjit Bose; Paz Carmi; Stephane Durocher; Shahin Kamali; Arezoo Sajadpour (CCCG, 2020)

On the Restricted 1-Steiner Tree Problem. - Prosenjit Bose; Anthony D'Angelo; Stephane Durocher (COCOON, 2020)

Flips in Higher Order Delaunay Triangulations. - Elena Arseneva; Prosenjit Bose; Pilar Cano; Rodrigo I. Silveira (LATIN, 2020)

Optimal Art Gallery Localization is NP-hard. - Prosenjit Bose; Jean-Lou De Carufel; Alina Shaikhet; Michiel H. M. Smid (Comput. Geom., 2020)

Hamiltonicity for convex shape Delaunay and Gabriel graphs. - Prosenjit Bose; Pilar Cano; Maria Saumell; Rodrigo I. Silveira (Comput. Geom., 2020)

Self-approaching paths in simple polygons. - Prosenjit Bose; Irina Kostitsyna; Stefan Langerman (Comput. Geom., 2020)

Gathering by repulsion. - Prosenjit Bose; Thomas C. Shermer (Comput. Geom., 2020)

(Faster) Multi-Sided Boundary Labelling. - Prosenjit Bose; Saeed Mehrabi 001; Debajyoti Mondal (CoRR, 2020)

Asymptotically Optimal Vertex Ranking of Planar Graphs. - Prosenjit Bose; Vida Dujmovic; Mehrnoosh Javarsineh; Pat Morin (CoRR, 2020)

Local Routing in Convex Subdivisions. - Prosenjit Bose; Stephane Durocher; Debajyoti Mondal; Maxime Peabody; Matthew Skala; Mohammad Abdul Wahid (Int. J. Comput. Geom. Appl., 2020)

Power domination on triangular grids with triangular and hexagonal shape. - Prosenjit Bose; Valentin Gledel; Claire Pennarun; Sander Verdonschot (J. Comb. Optim., 2020)

Faster algorithms for some optimization problems on collinear points. - Ahmad Biniaz; Prosenjit Bose; Paz Carmi; Anil Maheshwari; J. Ian Munro; Michiel H. M. Smid (J. Comput. Geom., 2020)

Expected Complexity of Routing in $ Theta_6$ and Half-$ Theta_6$ Graphs. - Prosenjit Bose; Jean-Lou De Carufel; Olivier Devillers (J. Comput. Geom., 2020)

Computing the k-Visibility Region of a Point in a Polygon. - Yeganeh Bahoo; Prosenjit Bose; Stephane Durocher; Thomas C. Shermer (Theory Comput. Syst., 2020)

Spanning Properties of Variants of the Delaunay Graph (Invited Talk). - Prosenjit Bose (ISAAC, 2021)

On the Spanning and Routing Ratios of the Directed $ varTheta _6$-Graph. - Hugo A. Akitaya; Ahmad Biniaz; Prosenjit Bose (WADS, 2021)

Improved Bounds on the Spanning Ratio of the Theta-5-Graph. - Prosenjit Bose; Darryl Hill; Aurélien Ooms (WADS, 2021)

Faster Multi-sided One-Bend Boundary Labelling. - Prosenjit Bose; Saeed Mehrabi 001; Debajyoti Mondal (WALCOM, 2021)

Affine invariant triangulations. - Prosenjit Bose; Pilar Cano; Rodrigo I. Silveira (Comput. Aided Geom. Des., 2021)

Piercing pairwise intersecting geodesic disks. - Prosenjit Bose; Paz Carmi; Thomas C. Shermer (Comput. Geom., 2021)

Attraction-convexity and normal visibility. - Prosenjit Bose; Thomas C. Shermer (Comput. Geom., 2021)

Improved Spanning on Theta-5. - Prosenjit Bose; Darryl Hill; Aurélien Ooms (CoRR, 2021)

Local routing in WSPD-based spanners. - Jean-Lou De Carufel; Prosenjit Bose; Frédérik Paradis; Vida Dujmovic (J. Comput. Geom., 2021)

Constrained routing between non-visible vertices. - Prosenjit Bose; Matias Korman; André van Renssen; Sander Verdonschot (Theor. Comput. Sci., 2021)

A 13/9-approximation of the average-2π/3-MST. - Ahmad Biniaz; Prosenjit Bose; Patrick Devaney (CCCG, 2022)

Weighted shortest path in equilateral triangular meshes. - Prosenjit Bose; Guillermo Esteban; Anil Maheshwari (CCCG, 2022)

Piercing Pairwise Intersecting Convex Shapes in the Plane. - Saman Bazargani; Ahmad Biniaz; Prosenjit Bose (LATIN, 2022)

Local Routing Algorithms on Euclidean Spanners with Small Diameter. - Nicolas Bonichon; Prosenjit Bose; Yan Garito (LATIN, 2022)

On the Zombie Number of Various Graph Classes. - Prosenjit Bose; Jean-Lou De Carufel; Thomas C. Shermer (LATIN, 2022)

An Optimal Algorithm for Product Structure in Planar Graphs. - Prosenjit Bose; Pat Morin; Saeed Odak (SWAT, 2022)

Bounded-Angle Minimum Spanning Trees. - Ahmad Biniaz; Prosenjit Bose; Anna Lubiw; Anil Maheshwari (Algorithmica, 2022)

On the spanning and routing ratios of the directed Θ6-graph. - Hugo A. Akitaya; Ahmad Biniaz; Prosenjit Bose (Comput. Geom., 2022)

Computing maximum independent set on outerstring graphs and their relatives. - Prosenjit Bose; Paz Carmi; J. Mark Keil; Anil Maheshwari; Saeed Mehrabi 001; Debajyoti Mondal; Michiel Smid (Comput. Geom., 2022)

Linear versus centred chromatic numbers. - Prosenjit Bose; Vida Dujmovic; Hussein Houdrouge; Mehrnoosh Javarsineh; Pat Morin (CoRR, 2022)

Drawing Graphs as Spanners. - Oswin Aichholzer; Manuel Borrazzo; Prosenjit Bose; Jean Cardinal; Fabrizio Frati; Pat Morin; Birgit Vogtenhuber (Discret. Comput. Geom., 2022)

Separating layered treewidth and row treewidth. - Prosenjit Bose; Vida Dujmovic; Mehrnoosh Javarsineh; Pat Morin; David R. Wood (Discret. Math. Theor. Comput. Sci., 2022)

On the restricted k-Steiner tree problem. - Prosenjit Bose; Anthony D'Angelo; Stephane Durocher (J. Comb. Optim., 2022)

Fragile complexity of adaptive algorithms. - Prosenjit Bose; Pilar Cano; Rolf Fagerberg; John Iacono; Riko Jacob; Stefan Langerman (Theor. Comput. Sci., 2022)

Parameterized complexity of two-interval pattern problem. - Prosenjit Bose; Saeed Mehrabi 001; Debajyoti Mondal (Theor. Comput. Sci., 2022)

CCOSKEG Discs in Simple Polygons. - Prosenjit Bose; Anthony D'Angelo; Stephane Durocher (CCCG, 2023)

Dynamic Schnyder woods. - Pilar Cano; Sujoy Bhore; Prosenjit Bose; Jean Cardinal; John Iacono (CCCG, 2023)

Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon. - Prosenjit Bose; Anthony D'Angelo; Stephane Durocher (WADS, 2023)

Geodesic obstacle representation of graphs. - Prosenjit Bose; Paz Carmi; Vida Dujmovic; Saeed Mehrabi 001; Fabrizio Montecchiani; Pat Morin; Luís Fernando Schultz Xavier da Silveira (Comput. Geom., 2023)

Connected Dominating Sets in Triangulations. - Prosenjit Bose; Vida Dujmovic; Hussein Houdrouge; Pat Morin; Saeed Odak (CoRR, 2023)

The Minimum Moving Spanning Tree Problem. - Hugo A. Akitaya; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Luís Fernando Schultz Xavier da Silveira; Michiel Smid (J. Graph Algorithms Appl., 2023)

On approximating shortest paths in weighted triangular tessellations. - Prosenjit Bose; Guillermo Esteban; David Orden; Rodrigo I. Silveira (Artif. Intell., 2023)

Competitive Online Search Trees on Trees. - Prosenjit Bose; Jean Cardinal; John Iacono; Grigorios Koumoutsos; Stefan Langerman (ACM Trans. Algorithms, 2023)

Simple linear time algorithms for piercing pairwise intersecting disks. - Ahmad Biniaz; Prosenjit Bose; Yunkai Wang (Comput. Geom., 2023)

Improved Routing on the Delaunay Triangulation. - Nicolas Bonichon; Prosenjit Bose; Jean-Lou De Carufel; Vincent Despré; Darryl Hill; Michiel Smid (Discret. Comput. Geom., 2023)

Computing shortest paths amid non-overlapping weighted disks. - Prosenjit Bose; Jean-Lou De Carufel; Guillermo Esteban; Anil Maheshwari (CCCG, 2024)

The Exact Routing and Spanning Ratio of arbitrary triangle Delaunay graphs. - John Stuart; Jean-Lou De Carufel; Prosenjit Bose (CCCG, 2024)

A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. - Therese Biedl; Prosenjit Bose; Karthik Murali 001 (ESA, 2024)

Noncrossing Longest Paths and Cycles. - Greg Aloupis; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; David Eppstein; Anil Maheshwari; Saeed Odak; Michiel Smid; Csaba D. Tóth; Pavel Valtr 001 (GD, 2024)

On k-Planar Graphs Without Short Cycles. - Michael A. Bekos; Prosenjit Bose; Aaron Büngener; Vida Dujmovic; Michael Hoffmann 001; Michael Kaufmann 001; Pat Morin; Saeed Odak; Alexandra Weinberger (GD, 2024)

Routing from Pentagon to Octagon Delaunay Graphs. - Prosenjit Bose; Jean-Lou De Carufel; John Stuart (ISAAC, 2024)

On the Spanning and Routing Ratios of the Yao-Four Graph. - Prosenjit Bose; Darryl Hill; Michiel Smid; Tyler Tuttle (ISAAC, 2024)

On the Independence Number of 1-Planar Graphs. - Therese Biedl; Prosenjit Bose; Babak Miraftab (SWAT, 2024)

Routing on heavy path WSPD spanners. - Prosenjit Bose; Tyler Tuttle (Comput. Geom., 2024)

Approximating shortest paths in weighted square and hexagonal meshes. - Prosenjit Bose; Guillermo Esteban; David Orden; Rodrigo I. Silveira (CoRR, 2024)

On k-planar Graphs without Short Cycles. - Michael A. Bekos; Prosenjit Bose; Aaron Büngener; Vida Dujmovic; Michael Hoffmann 001; Michael Kaufmann 001; Pat Morin; Saeed Odak; Alexandra Weinberger (CoRR, 2024)

On the d-independence number in 1-planar graphs. - Therese Biedl; Prosenjit Bose; Babak Miraftab (CoRR, 2024)

The basis number of 1-planar graphs. - Saman Bazargani; Therese Biedl; Prosenjit Bose; Anil Maheshwari; Babak Miraftab (CoRR, 2024)

Improved spanning ratio of the Theta-5 graph. - Prosenjit Bose; Darryl Hill; Aurélien Ooms (J. Comput. Geom., 2024)

A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes. - Prosenjit Bose; Guillermo Esteban; Anil Maheshwari (Theor. Comput. Sci., 2024)

On the Spanning and Routing Ratio of the Directed Theta-Four Graph. - Prosenjit Bose; Jean-Lou De Carufel; Darryl Hill; Michiel Smid (Discret. Comput. Geom., 2024)

Cops and Robbers for Graphs on Surfaces with Crossings. - Prosenjit Bose; Pat Morin; Karthik Murali 001 (MFCS, 2025)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs. - Ahmad Biniaz; Prosenjit Bose; Chaeyoon Chung; Jean-Lou De Carufel; John Iacono; Anil Maheshwari; Saeed Odak; Michiel Smid; Csaba D. Tóth (WADS, 2025)

Constructing and Routing on Geometric Spanners (Invited Talk). - Prosenjit Bose (WADS, 2025)

Online Routing in Directed Yao₄^∞ Graphs. - Prosenjit Bose; Jean-Lou De Carufel; John Stuart (WADS, 2025)

On Geodesic Disks Enclosing Many Points. - Prosenjit Bose; Guillermo Esteban; David Orden; Rodrigo I. Silveira; Tyler Tuttle (WADS, 2025)

Approximating average bounded-angle minimum spanning trees. - Ahmad Biniaz; Prosenjit Bose; Patrick Devaney (Comput. Geom., 2025)

Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor. - Prosenjit Bose; Jean-Lou De Carufel; Thomas C. Shermer (Discret. Math., 2025)

On Separating Path and Tree Systems in Graphs. - Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Babak Miraftab; Saeed Odak; Michiel Smid; Shakhar Smorodinsky; Yelena Yuditsky (Discret. Math. Theor. Comput. Sci., 2025)

On 1-planar graphs with bounded cop-number. - Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Karthik Murali 001 (Theor. Comput. Sci., 2025)

The exact spanning ratio of the parallelogram Delaunay graph. - Prosenjit Bose; Jean-Lou De Carufel; Sandrine Njoo (Theor. Comput. Sci., 2025)

Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs. - Prosenjit Bose; Jean-Lou De Carufel; John Stuart (CoRR, 2025)

An Improved Bound for Plane Covering Paths. - Hugo A. Akitaya; Greg Aloupis; Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Cyril Gavoille; John Iacono; Linda Kleist; Michiel Smid; Diane L. Souvaine; Leonidas Theocharous (CoRR, 2025)

Piercing unit geodesic disks. - Ahmad Biniaz; Prosenjit Bose; Thomas C. Shermer (Comput. Geom., 2026)