default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProsenjit Bose
Prosenjit K. Bose
Person information
- affiliation: Carleton University, Ottawa, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j194]Prosenjit Bose, Jean-Lou De Carufel
, Thomas C. Shermer:
Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor. Discret. Math. 348(1): 114220 (2025)- 2024
- [j193]Prosenjit Bose, Tyler Tuttle:
Routing on heavy path WSPD spanners. Comput. Geom. 123: 102121 (2024) - [j192]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): 872-892 (2024) - [j191]Prosenjit Bose, Darryl Hill, Aurélien Ooms:
Improved spanning ratio of the Theta-5 graph. J. Comput. Geom. 15(1): 66-87 (2024) - [j190]Prosenjit Bose, Guillermo Esteban, Anil Maheshwari:
A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes. Theor. Comput. Sci. 1001: 114583 (2024) - [c229]Therese Biedl, Prosenjit Bose, Karthik Murali:
A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. ESA 2024: 24:1-24:15 - [c228]Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger:
On k-Planar Graphs Without Short Cycles. GD 2024: 27:1-27:17 - [c227]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. GD 2024: 36:1-36:17 - [c226]Prosenjit Bose, Jean-Lou De Carufel, John Stuart:
Routing from Pentagon to Octagon Delaunay Graphs. ISAAC 2024: 14:1-14:16 - [c225]Prosenjit Bose, Darryl Hill, Michiel Smid, Tyler Tuttle:
On the Spanning and Routing Ratios of the Yao-Four Graph. ISAAC 2024: 15:1-15:17 - [c224]Therese Biedl, Prosenjit Bose, Babak Miraftab:
On the Independence Number of 1-Planar Graphs. SWAT 2024: 13:1-13:13 - [i108]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon. CoRR abs/2402.00336 (2024) - [i107]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
Approximating shortest paths in weighted square and hexagonal meshes. CoRR abs/2404.07562 (2024) - [i106]Therese Biedl, Prosenjit Bose, Karthik Murali:
A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. CoRR abs/2407.00586 (2024) - [i105]Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger:
On k-planar Graphs without Short Cycles. CoRR abs/2408.16085 (2024) - [i104]Prosenjit Bose, Jean-Lou De Carufel, Guillermo Esteban, Anil Maheshwari:
Computing shortest paths amid non-overlapping weighted disks. CoRR abs/2409.08869 (2024) - [i103]Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Karthik Murali:
On 1-Planar Graphs with Bounded Cop-Number. CoRR abs/2409.16279 (2024) - [i102]Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, Pavel Valtr:
Noncrossing Longest Paths and Cycles. CoRR abs/2410.05580 (2024) - 2023
- [j189]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
On approximating shortest paths in weighted triangular tessellations. Artif. Intell. 318: 103898 (2023) - [j188]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: 101946 (2023) - [j187]Ahmad Biniaz, Prosenjit Bose, Yunkai Wang:
Simple linear time algorithms for piercing pairwise intersecting disks. Comput. Geom. 114: 102011 (2023) - [j186]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): 495-549 (2023) - [j185]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): 1-18 (2023) - [j184]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. ACM Trans. Algorithms 19(3): 25:1-25:19 (2023) - [c223]Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer:
Piercing Unit Geodesic Disks. CCCG 2023: 43-49 - [c222]Pilar Cano, Sujoy Bhore, Prosenjit Bose, Jean Cardinal, John Iacono:
Dynamic Schnyder woods. CCCG 2023: 97-104 - [c221]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
CCOSKEG Discs in Simple Polygons. CCCG 2023: 129-152 - [c220]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon. WADS 2023: 179-192 - [i101]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
On the Restricted k-Steiner Tree Problem. CoRR abs/2306.08504 (2023) - [i100]Prosenjit Bose, Vida Dujmovic, Hussein Houdrouge, Pat Morin, Saeed Odak:
Connected Dominating Sets in Triangulations. CoRR abs/2312.03399 (2023) - [i99]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 abs/2312.14295 (2023) - [i98]Prosenjit Bose, Jean-Lou De Carufel, Sandrine Njoo:
The Exact Spanning Ratio of the Parallelogram Delaunay Graph. CoRR abs/2312.14305 (2023) - [i97]Prosenjit Bose, Tyler Tuttle:
Routing on Heavy Path WSPD Spanners. CoRR abs/2312.15145 (2023) - 2022
- [j183]Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. Algorithmica 84(1): 150-175 (2022) - [j182]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: 101852 (2022) - [j181]Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose:
On the spanning and routing ratios of the directed Θ6-graph. Comput. Geom. 105-106: 101881 (2022) - [j180]Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. Discret. Comput. Geom. 68(3): 774-795 (2022) - [j179]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) - [j178]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
On the restricted k-Steiner tree problem. J. Comb. Optim. 44(4): 2893-2918 (2022) - [j177]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized complexity of two-interval pattern problem. Theor. Comput. Sci. 902: 21-28 (2022) - [j176]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile complexity of adaptive algorithms. Theor. Comput. Sci. 919: 92-102 (2022) - [c219]Ahmad Biniaz, Prosenjit Bose, Patrick Devaney:
A 13/9-approximation of the average-2π/3-MST. CCCG 2022: 55-59 - [c218]Prosenjit Bose, Guillermo Esteban, Anil Maheshwari:
Weighted shortest path in equilateral triangular meshes. CCCG 2022: 60-67 - [c217]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. ISAAC 2022: 56:1-56:13 - [c216]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
On the Zombie Number of Various Graph Classes. LATIN 2022: 527-543 - [c215]Saman Bazargani, Ahmad Biniaz, Prosenjit Bose:
Piercing Pairwise Intersecting Convex Shapes in the Plane. LATIN 2022: 679-695 - [c214]Nicolas Bonichon, Prosenjit Bose, Yan Garito:
Local Routing Algorithms on Euclidean Spanners with Small Diameter. LATIN 2022: 696-712 - [c213]Prosenjit Bose, Pat Morin, Saeed Odak:
An Optimal Algorithm for Product Structure in Planar Graphs. SWAT 2022: 19:1-19:14 - [c212]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
On Approximating Shortest Paths in Weighted Triangular Tessellations. WALCOM 2022: 409-421 - [i96]Prosenjit Bose, Pat Morin, Saeed Odak:
An Optimal Algorithm for Product Structure in Planar Graphs. CoRR abs/2202.08870 (2022) - [i95]Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor. CoRR abs/2204.11926 (2022) - [i94]Prosenjit Bose, Vida Dujmovic, Hussein Houdrouge, Mehrnoosh Javarsineh, Pat Morin:
Linear versus centred chromatic numbers. CoRR abs/2205.15096 (2022) - 2021
- [j175]Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira:
Affine invariant triangulations. Comput. Aided Geom. Des. 91: 102039 (2021) - [j174]Prosenjit Bose, Thomas C. Shermer:
Attraction-convexity and normal visibility. Comput. Geom. 96: 101748 (2021) - [j173]Prosenjit Bose, Paz Carmi, Thomas C. Shermer:
Piercing pairwise intersecting geodesic disks. Comput. Geom. 98: 101774 (2021) - [j172]Jean-Lou De Carufel, Prosenjit Bose, Frédérik Paradis, Vida Dujmovic:
Local routing in WSPD-based spanners. J. Comput. Geom. 12(1): 1-34 (2021) - [j171]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Constrained routing between non-visible vertices. Theor. Comput. Sci. 861: 144-154 (2021) - [c211]Ahmad Biniaz, Prosenjit Bose, Yunkai Wang:
Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks. CCCG 2021: 228-236 - [c210]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile Complexity of Adaptive Algorithms. CIAC 2021: 144-157 - [c209]Prosenjit Bose:
Spanning Properties of Variants of the Delaunay Graph (Invited Talk). ISAAC 2021: 2:1-2:1 - [c208]Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose:
On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph. WADS 2021: 1-14 - [c207]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: 15-28 - [c206]Prosenjit Bose, Darryl Hill, Aurélien Ooms:
Improved Bounds on the Spanning Ratio of the Theta-5-Graph. WADS 2021: 215-228 - [c205]Prosenjit Bose, Tyler Tuttle:
Routing on Heavy-Path WSPD-Spanners. WADS 2021: 613-626 - [c204]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Faster Multi-sided One-Bend Boundary Labelling. WALCOM 2021: 116-128 - [i93]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile Complexity of Adaptive Algorithms. CoRR abs/2102.00338 (2021) - [i92]Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood:
Separating layered treewidth and row treewidth. CoRR abs/2105.01230 (2021) - [i91]Prosenjit Bose, Darryl Hill, Aurélien Ooms:
Improved Spanning on Theta-5. CoRR abs/2106.01236 (2021) - [i90]Sujoy Bhore, Prosenjit Bose, Pilar Cano, Jean Cardinal, John Iacono:
Dynamic Schnyder Woods. CoRR abs/2106.14451 (2021) - [i89]Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo I. Silveira:
On approximating shortest paths in weighted triangular tessellations. CoRR abs/2111.13912 (2021) - 2020
- [j170]Prosenjit Bose, Irina Kostitsyna, Stefan Langerman:
Self-approaching paths in simple polygons. Comput. Geom. 87: 101595 (2020) - [j169]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Optimal Art Gallery Localization is NP-hard. Comput. Geom. 88: 101607 (2020) - [j168]Prosenjit Bose, Pilar Cano, Maria Saumell, Rodrigo I. Silveira:
Hamiltonicity for convex shape Delaunay and Gabriel graphs. Comput. Geom. 89: 101629 (2020) - [j167]Prosenjit Bose, Thomas C. Shermer:
Gathering by repulsion. Comput. Geom. 90: 101627 (2020) - [j166]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): 1-17 (2020) - [j165]Prosenjit Bose, Valentin Gledel, Claire Pennarun, Sander Verdonschot:
Power domination on triangular grids with triangular and hexagonal shape. J. Comb. Optim. 40(2): 482-500 (2020) - [j164]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): 212-234 (2020) - [j163]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): 418-432 (2020) - [j162]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): 1292-1306 (2020) - [c203]Prosenjit Bose, Paz Carmi, Stephane Durocher, Shahin Kamali, Arezoo Sajadpour:
Non-Crossing Matching of Online Points. CCCG 2020: 233-239 - [c202]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
On the Restricted 1-Steiner Tree Problem. COCOON 2020: 448-459 - [c201]Elena Arseneva, Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira:
Flips in Higher Order Delaunay Triangulations. LATIN 2020: 223-234 - [c200]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. SODA 2020: 1878-1891 - [c199]Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. SWAT 2020: 14:1-14:22 - [c198]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized Complexity of Two-Interval Pattern Problem. SWAT 2020: 16:1-16:10 - [c197]Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. WG 2020: 310-324 - [i88]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized Complexity of Two-Interval Pattern Problem. CoRR abs/2002.05099 (2020) - [i87]Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. CoRR abs/2002.05580 (2020) - [i86]Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
(Faster) Multi-Sided Boundary Labelling. CoRR abs/2002.09740 (2020) - [i85]Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin:
Asymptotically Optimal Vertex Ranking of Planar Graphs. CoRR abs/2007.06455 (2020) - [i84]Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira:
Affine invariant triangulations. CoRR abs/2011.02197 (2020)
2010 – 2019
- 2019
- [j161]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. Algorithmica 81(4): 1392-1415 (2019) - [j160]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): 1512-1534 (2019) - [j159]Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot:
Improved Bounds for Guarding Plane Graphs with Edges. Graphs Comb. 35(2): 437-450 (2019) - [j158]Prosenjit Bose, André van Renssen:
Spanning Properties of Yao and 휃-Graphs in the Presence of Constraints. Int. J. Comput. Geom. Appl. 29(2): 95-120 (2019) - [j157]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): 579-602 (2019) - [j156]Yeganeh Bahoo, Bahareh Banyassady, Prosenjit K. Bose, Stephane Durocher, Wolfgang Mulzer:
A time-space trade-off for computing the k-visibility region of a point in a polygon. Theor. Comput. Sci. 789: 13-21 (2019) - [c196]Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne:
Three-Coloring Three-Dimensional Uniform Hypergraphs. CCCG 2019: 23-28 - [c195]Prosenjit Bose, Thomas C. Shermer:
Attraction-convexity and Normal Visibility. CCCG 2019: 110-116 - [c194]Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher:
Watchtower for k-crossing Visibility. CCCG 2019: 203-209 - [c193]Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira:
Ane invariant triangulations. CCCG 2019: 250-256 - [c192]Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot:
Reconstructing a Convex Polygon from Its \omega ω -cloud. CSR 2019: 25-37 - [c191]Yeganeh Bahoo, Prosenjit Bose, Stephane Durocher, Thomas C. Shermer:
Computing the k-Crossing Visibility Region of a Point in a Polygon. IWOCA 2019: 10-21 - [c190]Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid:
On the Spanning and Routing Ratio of Theta-Four. SODA 2019: 2361-2370 - [c189]Prosenjit Bose, Pilar Cano, Maria Saumell, Rodrigo I. Silveira:
Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs. WADS 2019: 196-210 - [c188]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: 211-224 - [i83]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 abs/1903.07024 (2019) - [i82]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. CoRR abs/1908.00848 (2019) - [i81]Prosenjit Bose, Jean-Lou De Carufel, Olivier Devillers:
Expected Complexity of Routing in $Θ$ 6 and Half-$Θ$ 6 Graphs. CoRR abs/1910.14289 (2019) - 2018
- [j155]Prosenjit Bose, Darryl Hill, Michiel H. M. Smid:
Improved Spanning Ratio for Low Degree Plane Spanners. Algorithmica 80(3): 935-976 (2018) - [j154]Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. Algorithmica 80(11): 3177-3191 (2018) - [j153]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): 3316-3334 (2018) - [j152]Davood Bakhshesh, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, Mohammad Farshi, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao graphs. Comput. Geom. 67: 42-52 (2018) - [j151]Prosenjit Bose, Pedro Ramos:
Editorial: Special issue in memory of Dr. Ferran Hurtado. Comput. Geom. 68: 1 (2018) - [j150]Prosenjit Bose, Anna Lubiw, Vinayak Pathak, Sander Verdonschot:
Flipping edge-labelled triangulations. Comput. Geom. 68: 309-326 (2018) - [j149]Prosenjit Bose, Jean-Lou De Carufel, André van Renssen:
Constrained generalized Delaunay graphs are plane spanners. Comput. Geom. 74: 50-65 (2018) - [j148]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. Discret. Comput. Geom. 59(4): 864-885 (2018) - [j147]Prosenjit Bose, Matias Korman, Sander Verdonschot, André van Renssen:
Routing on the visibility graph. J. Comput. Geom. 9(1): 430-453 (2018) - [c187]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster Algorithms for some Optimization Problems on Collinear Points. SoCG 2018: 8:1-8:14 - [c186]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel H. M. Smid:
Improved Routing on the Delaunay Triangulation. ESA 2018: 22:1-22:13 - [c185]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini:
Pole Dancing: 3D Morphs for Tree Drawings. GD 2018: 371-384 - [c184]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira:
Geodesic Obstacle Representation of Graphs. ICALP 2018: 23:1-23:13 - [c183]Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. SWAT 2018: 12:1-12:14 - [c182]Prosenjit Bose, Thomas C. Shermer:
Gathering by Repulsion. SWAT 2018: 13:1-13:12 - [c181]Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot:
Improved Bounds for Guarding Plane Graphs with Edges. SWAT 2018: 14:1-14:12 - [i80]Prosenjit Bose, Jean-Lou De Carufel, Elena Khramtcova, Sander Verdonschot:
Reconstructing a convex polygon from its ω-cloud. CoRR abs/1801.02162 (2018) - [i79]Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid:
Faster Algorithms for some Optimization Problems on Collinear Points. CoRR abs/1802.09505 (2018) - [i78]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Routing on the Visibility Graph. CoRR abs/1803.02979 (2018) - [i77]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira:
Geodesic Obstacle Representation of Graphs. CoRR abs/1803.03705 (2018) - [i76]Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. CoRR abs/1803.10812 (2018) - [i75]Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot:
Improved Bounds for Guarding Plane Graphs with Edges. CoRR abs/1804.07150 (2018) - [i74]Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid:
On the Spanning and Routing Ratio of Theta-Four. CoRR abs/1808.01298 (2018) - [i73]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini:
Pole Dancing: 3D Morphs for Tree Drawings. CoRR abs/1808.10738 (2018) - [i72]Prosenjit Bose, Thomas C. Shermer:
Gathering by Repulsion. CoRR abs/1809.09792 (2018) - [i71]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Pat Morin:
Near-Optimal O(k)-Robust Geometric Spanners. CoRR abs/1812.09913 (2018) - 2017
- [j146]Prosenjit Bose, Sander Verdonschot:
Flips in edge-labelled pseudo-triangulations. Comput. Geom. 60: 45-54 (2017) - [j145]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. Discret. Comput. Geom. 58(2): 482-504 (2017) - [j144]Prosenjit Bose, Vida Dujmovic, Pat Morin, Lucas Rioux-Maldague:
New Bounds for Facial Nonrepetitive Colouring. Graphs Comb. 33(4): 817-832 (2017) - [j143]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian:
Competitive Online Routing on Delaunay Triangulations. Int. J. Comput. Geom. Appl. 27(4): 241-254 (2017) - [j142]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. J. Graph Algorithms Appl. 21(4): 389-415 (2017) - [j141]Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem. J. Graph Algorithms Appl. 21(4): 527-546 (2017) - [j140]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards plane spanners of degree 3. J. Comput. Geom. 8(1): 11-31 (2017) - [j139]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive local routing with constraints. J. Comput. Geom. 8(1): 125-152 (2017) - [j138]Prosenjit Bose, Jean-Lou De Carufel:
A general framework for searching on a line. Theor. Comput. Sci. 703: 1-17 (2017) - [c180]Prosenjit Bose, Dan Halperin, Shahar Shamai:
On the separation of a polyhedron from its single-part mold. CASE 2017: 61-66 - [c179]Prosenjit Bose, Claire Pennarun, Sander Verdonschot:
Power Domination on Triangular Grids. CCCG 2017: 2-6 - [c178]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Constrained Routing Between Non-Visible Vertices. COCOON 2017: 62-74 - [c177]Prosenjit Bose, Irina Kostitsyna, Stefan Langerman:
Self-Approaching Paths in Simple Polygons. SoCG 2017: 21:1-21:15 - [c176]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Routing on the Visibility Graph. ISAAC 2017: 18:1-18:12 - [c175]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. WADS 2017: 193-204 - [c174]Prosenjit Bose, Jean-Lou De Carufel, Vida Dujmovic, Frédérik Paradis:
Local Routing in Spanners Based on WSPDs. WADS 2017: 205-216 - [c173]Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer:
Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon. WALCOM 2017: 308-319 - [i70]Prosenjit Bose, Irina Kostitsyna, Stefan Langerman:
Self-approaching paths in simple polygons. CoRR abs/1703.06107 (2017) - [i69]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. CoRR abs/1704.03596 (2017) - [i68]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Art Gallery Localization. CoRR abs/1706.06938 (2017) - [i67]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Optimal Art Gallery Localization is NP-hard. CoRR abs/1706.08016 (2017) - [i66]Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin:
Biased Predecessor Search. CoRR abs/1707.01182 (2017) - [i65]Prosenjit Bose, Claire Pennarun, Sander Verdonschot:
Power domination on triangular grids. CoRR abs/1707.02760 (2017) - [i64]Prosenjit Bose, Dan Halperin, Shahar Shamai:
On the Separation of a Polyhedron from Its Single-Part Mold. CoRR abs/1708.04203 (2017) - [i63]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Constrained Routing Between Non-Visible Vertices. CoRR abs/1710.08060 (2017) - 2016
- [j137]Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin:
Biased Predecessor Search. Algorithmica 76(4): 1097-1105 (2016) - [j136]Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman:
The Power and Limitations of Static Binary Search Trees with Lazy Finger. Algorithmica 76(4): 1264-1275 (2016) - [j135]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon. Comput. Geom. 57: 27-39 (2016) - [j134]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Probing convex polygons with a wedge. Comput. Geom. 58: 34-59 (2016) - [j133]Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. 56(4): 836-859 (2016) - [j132]Prosenjit Bose, Pat Morin, André van Renssen:
The Price of Order. Int. J. Comput. Geom. Appl. 26(3-4): 135-150 (2016) - [j131]Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu:
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. J. Comput. Geom. 7(1): 444-472 (2016) - [j130]Ahmad Biniaz, Mahdi Amani, Anil Maheshwari, Michiel H. M. Smid, Prosenjit Bose, Jean-Lou De Carufel:
A plane 1.88-spanner for points in convex position. J. Comput. Geom. 7(1): 520-539 (2016) - [j129]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Towards tight bounds on theta-graphs: More is not always better. Theor. Comput. Sci. 616: 70-93 (2016) - [c172]Ahmad Biniaz, Prosenjit Bose, Ingo van Duijn, Anil Maheshwari, Michiel H. M. Smid:
A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle. CCCG 2016: 140-146 - [c171]Prosenjit Bose, Vida Dujmovic, Pat Morin, Lucas Rioux-Maldague:
New Bounds for Facial Nonrepetitive Colouring. CCCG 2016: 295-302 - [c170]Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot:
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. GD 2016: 519-531 - [c169]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. ISAAC 2016: 19:1-19:14 - [c168]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. IWOCA 2016: 55-67 - [c167]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. IWOCA 2016: 68-80 - [c166]Prosenjit Bose, Darryl Hill, Michiel H. M. Smid:
Improved Spanning Ratio for Low Degree Plane Spanners. LATIN 2016: 249-262 - [c165]Mahdi Amani, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
A Plane 1.88-Spanner for Points in Convex Position. SWAT 2016: 25:1-25:14 - [c164]Prosenjit Bose, Jean-Lou De Carufel:
A General Framework for Searching on a Line. WALCOM 2016: 143-153 - [i62]Prosenjit Bose, Pat Morin, André van Renssen:
The Price of Order. CoRR abs/1602.00399 (2016) - [i61]Prosenjit Bose, Jean-Lou De Carufel, André van Renssen:
Constrained Generalized Delaunay Graphs Are Plane Spanners. CoRR abs/1602.07365 (2016) - [i60]Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer:
Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon. CoRR abs/1603.02853 (2016) - [i59]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid:
Towards Plane Spanners of Degree 3. CoRR abs/1606.08824 (2016) - [i58]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Essential Constraints of Edge-Constrained Proximity Graphs. CoRR abs/1607.01294 (2016) - [i57]Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot:
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. CoRR abs/1608.08892 (2016) - [i56]Ahmad Biniaz, Prosenjit Bose, David Eppstein, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanning Trees in Multipartite Geometric Graphs. CoRR abs/1611.01661 (2016) - 2015
- [j128]Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin:
Visibility-monotonic polygon deflation. Contributions Discret. Math. 10(1) (2015) - [j127]Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The θ5-graph is a spanner. Comput. Geom. 48(2): 108-119 (2015) - [j126]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Reprint of: Theta-3 is connected. Comput. Geom. 48(5): 407-414 (2015) - [j125]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Packing Plane Perfect Matchings into a Point Set. Discret. Math. Theor. Comput. Sci. 17(2): 119-142 (2015) - [j124]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. J. Graph Algorithms Appl. 19(1): 11-41 (2015) - [j123]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and improved spanning ratios for Yao graphs. J. Comput. Geom. 6(2): 19-53 (2015) - [j122]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles. SIAM J. Comput. 44(6): 1626-1649 (2015) - [j121]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher:
Searching on a line: A complete characterization of the optimal solution. Theor. Comput. Sci. 569: 24-42 (2015) - [c163]Prosenjit Bose:
One of Ferran Hurtado's favorite topics - Flips. CCCG 2015 - [c162]Prosenjit Bose, Jean-Lou De Carufel, André van Renssen:
Constrained Empty-Rectangle Delaunay Graphs. CCCG 2015 - [c161]Prosenjit Bose, Sander Verdonschot:
Flips in Edge-Labelled Pseudo-Triangulations. CCCG 2015 - [c160]Giovanni Viglietta, Prosenjit Bose, Jean-Lou De Carufel, Michael Gene Dobbins, Heuna Kim:
The Shadows of a Cycle Cannot All Be Paths. CCCG 2015 - [c159]Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. SoCG 2015: 209-223 - [c158]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Online Routing on Delaunay Triangulations. ESA 2015: 203-214 - [c157]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Local Routing with Constraints. ISAAC 2015: 23-34 - [c156]Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid:
Local Routing in Convex Subdivisions. SOFSEM 2015: 140-151 - [c155]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon. TTCS 2015: 56-71 - [e3]Prosenjit Bose, Leszek Antoni Gasieniec, Kay Römer, Roger Wattenhofer:
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. Lecture Notes in Computer Science 9536, Springer 2015, ISBN 978-3-319-28471-2 [contents] - [i55]Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A linear-time algorithm for the geodesic center of a simple polygon. CoRR abs/1501.00561 (2015) - [i54]Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen:
Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. CoRR abs/1501.01783 (2015) - [i53]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Packing Plane Perfect Matchings into a Point Set. CoRR abs/1501.03686 (2015) - [i52]Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid:
Probing Convex Polygons with a Wedge. CoRR abs/1506.02572 (2015) - [i51]Prosenjit Bose, Darryl Hill, Michiel H. M. Smid:
Improved Spanning Ratio for Low Degree Plane Spanners. CoRR abs/1506.09061 (2015) - [i50]Prosenjit Bose, Jean-Lou De Carufel, Michael Gene Dobbins, Heuna Kim, Giovanni Viglietta:
The Shadows of a Cycle Cannot All Be Paths. CoRR abs/1507.02355 (2015) - [i49]Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, Michiel H. M. Smid:
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere. CoRR abs/1507.06856 (2015) - [i48]Prosenjit Bose, Sander Verdonschot:
Flips in Edge-Labelled Pseudo-Triangulations. CoRR abs/1512.01485 (2015) - [i47]Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel H. M. Smid:
Plane Bichromatic Trees of Low Degree. CoRR abs/1512.02730 (2015) - 2014
- [j120]Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari:
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Algorithmica 69(2): 397-409 (2014) - [j119]Prosenjit Bose, Jean-Lou De Carufel:
Minimum-area enclosing triangle with a fixed angle. Comput. Geom. 47(1): 90-109 (2014) - [j118]Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot:
Making triangulations 4-connected using flips. Comput. Geom. 47(2): 187-197 (2014) - [j117]Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann:
Triangulating and guarding realistic polygons. Comput. Geom. 47(2): 296-306 (2014) - [j116]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. Comput. Geom. 47(9): 910-917 (2014) - [j115]P. Lai, Claire Samson, Prosenjit Bose:
Surface roughness of rock faces through the curvature of triangulated meshes. Comput. Geosci. 70: 229-237 (2014) - [c154]Timo Bolkart, Prosenjit Bose, Chang Shu, Stefanie Wuhrer:
A General Framework to Generate Sizing Systems from 3D Motion Data Applied to Face Mask Design. 3DV 2014: 425-431 - [c153]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CCCG 2014 - [c152]Prosenjit Bose, John Howat, Pat Morin:
Searching by Panning and Zooming. CCCG 2014 - [c151]Prosenjit Bose, Simon Pratt, Michiel H. M. Smid:
The Convex Hull of Points on a Sphere is a Spanner. CCCG 2014 - [c150]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and Improved Spanning Ratios for Yao Graphs. SoCG 2014: 30 - [c149]Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman:
The Power and Limitations of Static Binary Search Trees with Lazy Finger. ISAAC 2014: 181-192 - [c148]Prosenjit Bose, Pat Morin, André van Renssen:
The Price of Order. ISAAC 2014: 313-325 - [c147]Luis Barba, Prosenjit Bose, Stefan Langerman:
Optimal Algorithms for Constrained 1-Center Problems. LATIN 2014: 84-95 - [c146]Prosenjit Bose, André van Renssen:
Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs. LATIN 2014: 108-119 - [c145]Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin:
Biased Predecessor Search. LATIN 2014: 755-764 - [c144]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian:
Competitive Online Routing on Delaunay Triangulations. SWAT 2014: 98-109 - [i46]Prosenjit Bose, André van Renssen:
Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs. CoRR abs/1401.2127 (2014) - [i45]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Towards Tight Bounds on Theta-Graphs. CoRR abs/1404.6233 (2014) - [i44]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. CoRR abs/1404.7186 (2014) - [i43]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CoRR abs/1408.4099 (2014) - [i42]Prosenjit Bose, Jean-Lou De Carufel:
Towards a General Framework for Searching on a Line and Searching on $m$ Rays. CoRR abs/1408.6812 (2014) - [i41]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles. CoRR abs/1409.6397 (2014) - [i40]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CoRR abs/1411.1879 (2014) - [i39]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Local Routing with Constraints. CoRR abs/1412.0760 (2014) - 2013
- [j114]Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi, Sébastien Collette, Matthew J. Katz, Stefan Langerman:
Stable Roommates Spanner. Comput. Geom. 46(2): 120-130 (2013) - [j113]Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristán, Maria Saumell:
Some properties of k-Delaunay and k-Gabriel graphs. Comput. Geom. 46(2): 131-139 (2013) - [j112]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin:
Fast local searches and updates in bounded universes. Comput. Geom. 46(2): 181-189 (2013) - [j111]Prosenjit Bose, Michiel H. M. Smid:
On plane geometric spanners: A survey and open problems. Comput. Geom. 46(7): 818-830 (2013) - [j110]Prosenjit Bose, Paz Carmi, Stephane Durocher:
Bounding the locality of distributed routing algorithms. Distributed Comput. 26(1): 39-58 (2013) - [j109]Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian:
Coloring and Guarding Arrangements. Discret. Math. Theor. Comput. Sci. 15(3): 139-154 (2013) - [j108]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, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 25(2): 208-233 (2013) - [j107]Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. J. Comput. Geom. 4(1): 182-211 (2013) - [j106]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust Geometric Spanners. SIAM J. Comput. 42(4): 1720-1736 (2013) - [c143]Prosenjit Bose, John Howat, Pat Morin:
A History of Distribution-Sensitive Data Structures. Space-Efficient Data Structures, Streams, and Algorithms 2013: 133-149 - [c142]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. CCCG 2013 - [c141]Luis Barba, Alexis Beingessner, Prosenjit Bose, Michiel H. M. Smid:
Computing Covers of Plane Forests. CCCG 2013 - [c140]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
Optimal Data Structures for Farthest-Point Queries in Cactus Networks. CCCG 2013 - [c139]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust geometric spanners. SoCG 2013: 449-458 - [c138]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher:
Revisiting the Problem of Searching on a Line. ESA 2013: 205-216 - [c137]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot:
On the Stretch Factor of the Theta-4 Graph. WADS 2013: 109-120 - [c136]Prosenjit Bose, André van Renssen, Sander Verdonschot:
On the Spanning Ratio of Theta-Graphs. WADS 2013: 182-194 - [c135]Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The θ 5-Graph is a Spanner. WG 2013: 100-114 - [i38]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot:
On the stretch factor of the Theta-4 graph. CoRR abs/1303.5473 (2013) - [i37]Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. CoRR abs/1304.1909 (2013) - [i36]Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman:
The Power and Limitations of Static Binary Search Trees with Lazy Finger. CoRR abs/1304.6897 (2013) - [i35]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot:
New and Improved Spanning Ratios for Yao Graphs. CoRR abs/1307.5829 (2013) - [i34]Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher:
Revisiting the Problem of Searching on a Line. CoRR abs/1310.1048 (2013) - [i33]Prosenjit Bose, Anna Lubiw, Vinayak Pathak, Sander Verdonschot:
Flipping Edge-Labelled Triangulations. CoRR abs/1310.1166 (2013) - [i32]Luis Barba, Alexis Beingessner, Prosenjit Bose, Michiel H. M. Smid:
Computing Covers of Plane Forests. CoRR abs/1311.4860 (2013) - 2012
- [j105]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat:
Layered Working-Set Trees. Algorithmica 63(1-2): 476-489 (2012) - [j104]Prosenjit Bose, Paz Carmi:
Editorial. Comput. Geom. 45(9): 475 (2012) - [j103]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
π/2-Angle Yao Graphs are Spanners. Int. J. Comput. Geom. Appl. 22(1): 61-82 (2012) - [j102]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristán Adinolfi, Maria Saumell, David R. Wood:
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. Int. J. Comput. Geom. Appl. 22(5): 439-470 (2012) - [j101]Stefanie Wuhrer, Chang Shu, Prosenjit Bose:
Automatically Creating Design Models From 3D Anthropometry Data. J. Comput. Inf. Sci. Eng. 12(4) (2012) - [j100]Prosenjit Bose, John Howat, Pat Morin:
A distribution-sensitive dictionary with low space overhead. J. Discrete Algorithms 10: 140-145 (2012) - [j99]Prosenjit Bose, Karim Douïeb, Pat Morin:
Skip lift: A probabilistic alternative to red-black trees. J. Discrete Algorithms 14: 13-20 (2012) - [j98]Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi:
On bounded degree plane strong geometric spanners. J. Discrete Algorithms 15: 16-31 (2012) - [j97]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. ACM Trans. Algorithms 8(2): 10:1-10:26 (2012) - [c134]Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin:
Visibility Monotonic Polygon Deflation. CCCG 2012: 11-16 - [c133]Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid:
On Farthest-Point Information in Networks. CCCG 2012: 199-204 - [c132]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Routing on a Bounded-Degree Plane Spanner. CCCG 2012: 285-290 - [c131]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Optimal Bounds on Theta-Graphs: More is not Always Better. CCCG 2012: 291-296 - [c130]Prosenjit Bose:
Flips. GD 2012: 1 - [c129]Prosenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman:
De-amortizing Binary Search Trees. ICALP (1) 2012: 121-132 - [c128]Prosenjit Bose:
On Spanning Properties of Various Delaunay Graphs. ISVD 2012: 1 - [c127]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. LATIN 2012: 85-96 - [c126]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive routing in the half-θ6-graph. SODA 2012: 1319-1328 - [i31]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust Geometric Spanners. CoRR abs/1204.4679 (2012) - [i30]Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian:
Coloring and Guarding Arrangements. CoRR abs/1205.5162 (2012) - [i29]Prosenjit Bose, Sander Verdonschot:
A History of Flips in Combinatorial Triangulations. CoRR abs/1206.0303 (2012) - [i28]Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin:
Visibility-Monotonic Polygon Deflation. CoRR abs/1206.1982 (2012) - [i27]Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The theta-5-graph is a spanner. CoRR abs/1212.0570 (2012) - 2011
- [j96]Michel Barbeau, Prosenjit Bose, Paz Carmi, Mathieu Couture, Evangelos Kranakis:
Location-Oblivious Distributed Unit Disk Graph Coloring. Algorithmica 60(2): 236-249 (2011) - [j95]Prosenjit Bose, Otfried Cheong, Vida Dujmovic:
A note on the perimeter of fat objects. Comput. Geom. 44(1): 1-8 (2011) - [j94]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
Almost all Delaunay triangulations have stretch factor greater than pi/2. Comput. Geom. 44(2): 121-127 (2011) - [j93]Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu:
On a family of strong geometric spanners that admit local routing strategies. Comput. Geom. 44(6-7): 319-328 (2011) - [j92]Prosenjit Bose, Anil Maheshwari, Chang Shu, Stefanie Wuhrer:
A survey of geodesic paths on 3D surfaces. Comput. Geom. 44(9): 486-498 (2011) - [j91]Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood:
Every Large Point Set contains Many Collinear Points or an Empty Pentagon. Graphs Comb. 27(1): 47-60 (2011) - [j90]Prosenjit Bose, Mercè Mora, Carlos Seara, Saurabh Sethia:
On Computing Enclosing Isosceles Triangles and Related Problems. Int. J. Comput. Geom. Appl. 21(1): 25-45 (2011) - [j89]Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
Computing Signed Permutations of Polygons. Int. J. Comput. Geom. Appl. 21(1): 87-100 (2011) - [j88]Prosenjit Bose, Paz Carmi, Mathieu Couture:
Spanners of additively weighted point sets. J. Discrete Algorithms 9(3): 287-298 (2011) - [c125]Prosenjit Bose, Jean-Lou De Carufel:
Isoperimetric Triangular Enclosure with a Fixed Angle. CCCG 2011 - [c124]Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot:
Making triangulations 4-connected using flips. CCCG 2011 - [c123]Prosenjit Bose, Sander Verdonschot:
A History of Flips in Combinatorial Triangulations. EGC 2011: 29-44 - [c122]Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari:
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. WADS 2011: 134-146 - [i26]Stefanie Wuhrer, Chang Shu, Prosenjit Bose:
Automatically Creating Design Models from 3D Anthropometry Data. CoRR abs/1108.4572 (2011) - [i25]Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot:
Making triangulations 4-connected using flips. CoRR abs/1110.6473 (2011) - [i24]Prosenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman:
De-amortizing Binary Search Trees. CoRR abs/1111.1665 (2011) - 2010
- [j87]Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica 58(3): 711-729 (2010) - [j86]Alan Brunton, Stefanie Wuhrer, Chang Shu, Prosenjit Bose, Erik D. Demaine:
Filling Holes in Triangular Meshes Using Digital Images by Curve Unfolding. Int. J. Shape Model. 16(1-2): 151-171 (2010) - [j85]Stefanie Wuhrer, Prosenjit Bose, Chang Shu, Joseph O'Rourke, Alan Brunton:
Morphing of Triangular Meshes in Shape Space. Int. J. Shape Model. 16(1-2): 195-212 (2010) - [j84]Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Sigma-local graphs. J. Discrete Algorithms 8(1): 15-23 (2010) - [j83]Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid:
On the Stretch Factor of Convex Delaunay Graphs. J. Comput. Geom. 1(1): 41-56 (2010) - [c121]Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristán, Maria Saumell:
Some properties of higher order delaunay and gabriel graphs. CCCG 2010: 13-16 - [c120]Prosenjit Bose, Otfried Cheong, Vida Dujmovic:
On the perimeter of fat objects. CCCG 2010: 163-166 - [c119]Prosenjit Bose, Jean-Lou De Carufel:
Minimum enclosing area triangle with a fixed angle. CCCG 2010: 171-174 - [c118]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin:
Fast local searches and updates in bounded universes. CCCG 2010: 261-264 - [c117]Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Common Unfoldings of Polyominoes and Polycubes. CGGA 2010: 44-54 - [c116]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, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-Transmitters in the Presence of Obstacles. COCOA (2) 2010: 1-15 - [c115]Gail Carmichael, Robert Laganière, Prosenjit Bose:
Global Context Descriptors for SURF and MSER Feature Descriptors. CRV 2010: 309-316 - [c114]Prosenjit Bose, Karim Douïeb:
Should Static Search Trees Ever Be Unbalanced? ISAAC (1) 2010: 109-120 - [c113]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
pi/2-Angle Yao Graphs Are Spanners. ISAAC (2) 2010: 446-457 - [c112]Prosenjit Bose, Karim Douïeb, Pat Morin:
Skip Lift: A Probabilistic Alternative to Red-Black Trees. IWOCA 2010: 226-237 - [c111]Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu:
Communication-Efficient Construction of the Plane Localized Delaunay Graph. LATIN 2010: 282-293 - [c110]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat:
Layered Working-Set Trees. LATIN 2010: 686-696 - [c109]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg:
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. SWAT 2010: 38-49 - [c108]Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Improved Methods For Generating Quasi-gray Codes. SWAT 2010: 224-235 - [i23]Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin:
Point Location in Disconnected Planar Subdivisions. CoRR abs/1001.2763 (2010) - [i22]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
Pi/2-Angle Yao Graphs are Spanners. CoRR abs/1001.2913 (2010) - [i21]Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin:
Odds-On Trees. CoRR abs/1002.1092 (2010) - [i20]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg:
An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. CoRR abs/1003.0139 (2010) - [i19]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
The dilation of the Delaunay triangulation is greater than π/2. CoRR abs/1006.0291 (2010) - [i18]Prosenjit Bose, Karim Douïeb:
Should Static Search Trees Ever Be Unbalanced? CoRR abs/1006.3715 (2010) - [i17]Prosenjit Bose, Jean-Lou De Carufel:
Minimum Enclosing Area Triangle with a Fixed Angle. CoRR abs/1009.3006 (2010) - [i16]Dana Jansens, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Improved Methods For Generating Quasi-Gray Codes. CoRR abs/1010.0905 (2010)
2000 – 2009
- 2009
- [j82]Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer:
Clamshell Casting. Algorithmica 55(4): 666-702 (2009) - [j81]Prosenjit Bose, Ferran Hurtado:
Flips in planar graphs. Comput. Geom. 42(1): 60-80 (2009) - [j80]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric spanners with small chromatic number. Comput. Geom. 42(2): 134-146 (2009) - [j79]Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer:
A linear-space algorithm for distance preserving graph embedding. Comput. Geom. 42(4): 289-304 (2009) - [j78]Prosenjit Bose, Asish Mukhopadhyay:
Editorial CCCG 2005. Comput. Geom. 42(5): 363 (2009) - [j77]Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer:
Rotationally monotone polygons. Comput. Geom. 42(5): 471-483 (2009) - [j76]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin:
Connectivity-preserving transformations of binary images. Comput. Vis. Image Underst. 113(10): 1027-1038 (2009) - [j75]Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr:
Traversing a Set of Points with a Minimum Number of Turns. Discret. Comput. Geom. 41(4): 513-532 (2009) - [j74]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood:
A Polynomial Bound for Untangling Geometric Planar Graphs. Discret. Comput. Geom. 42(4): 570-585 (2009) - [j73]Prosenjit Bose, Michiel H. M. Smid, Daming Xu:
Delaunay and diamond Triangulations contain Spanners of Bounded Degree. Int. J. Comput. Geom. Appl. 19(2): 119-140 (2009) - [j72]Manuel Abellanas, Prosenjit Bose, Jesús García-López, Ferran Hurtado, Carlos M. Nicolás, Pedro Ramos:
On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs. Int. J. Comput. Geom. Appl. 19(6): 595-615 (2009) - [j71]Prosenjit Bose:
A note on the lower bound of edge guards of polyhedral terrains. Int. J. Comput. Math. 86(4): 577-583 (2009) - [j70]Rossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette, Michiel H. M. Smid, Stefanie Wuhrer:
Algorithms for optimal outlier removal. J. Discrete Algorithms 7(2): 239-248 (2009) - [j69]Derek Bradley, Gerhard Roth, Prosenjit Bose:
Augmented reality on cloth with realistic illumination. Mach. Vis. Appl. 20(2): 85-92 (2009) - [j68]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete k-Partite Geometric Graphs. SIAM J. Comput. 38(5): 1803-1820 (2009) - [c107]Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood:
Every Large Point Set contains Many Collinear Points or an Empty Pentagon. CCCG 2009: 99-102 - [c106]Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, Vishal Verma:
The spanning ratio of the Delaunay triangulation is greater than pi/2. CCCG 2009: 165-167 - [c105]Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh:
Relaxed Gabriel Graphs. CCCG 2009: 169-172 - [c104]Stefanie Wuhrer, Chang Shu, Prosenjit Bose:
Posture invariant correspondence of triangular meshes in shape space. ICCV Workshops 2009: 1574-1581 - [c103]Prosenjit Bose, Paz Carmi, Stephane Durocher:
Bounding the locality of distributed routing algorithms. PODC 2009: 250-259 - [c102]Alan Brunton, Stefanie Wuhrer, Chang Shu, Prosenjit Bose, Erik D. Demaine:
Filling holes in triangular meshes by curve unfolding. Shape Modeling International 2009: 66-72 - [c101]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct geometric indexes supporting point location queries. SODA 2009: 635-644 - [c100]Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin:
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. WADS 2009: 98-109 - [c99]Prosenjit Bose, John Howat, Pat Morin:
A Distribution-Sensitive Dictionary with Low Space Overhead. WADS 2009: 110-118 - [c98]Prosenjit Bose, Karim Douïeb:
Efficient Construction of Near-Optimal Binary and Multiway Search Trees. WADS 2009: 230-241 - [i15]Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood:
Every Large Point Set contains Many Collinear Points or an Empty Pentagon. CoRR abs/0904.0262 (2009) - [i14]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat:
Layered Working-Set Trees. CoRR abs/0907.2071 (2009) - 2008
- [j67]Mathieu Couture, Michel Barbeau, Prosenjit Bose, Evangelos Kranakis:
Incremental Construction of k-Dominating Sets in Wireless Sensor Networks. Ad Hoc Sens. Wirel. Networks 5(1-2): 47-68 (2008) - [j66]Prosenjit Bose, Thomas Fevens:
Editorial. Comput. Geom. 39(1): 1 (2008) - [j65]Manuel Abellanas, Prosenjit Bose, Alfredo García Olaverri, Ferran Hurtado, Pedro Ramos, Eduardo Rivera-Campo, Javier Tejel:
On local transformations in plane geometric graphs embedded on small grids. Comput. Geom. 39(2): 65-77 (2008) - [j64]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin, Stefan Langerman, David R. Wood:
A Polynomial Bound for Untangling Geometric Planar Graphs. Electron. Notes Discret. Math. 31: 213-218 (2008) - [j63]Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Yihui Tang:
On the false-positive rate of Bloom filters. Inf. Process. Lett. 108(4): 210-213 (2008) - [j62]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer:
A Characterization of the degree sequences of 2-trees. J. Graph Theory 58(3): 191-209 (2008) - [j61]Albert Chan, Frank K. H. A. Dehne, Prosenjit Bose, Markus Latzel:
Coarse grained parallel algorithms for graph matching. Parallel Comput. 34(1): 47-62 (2008) - [c97]Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann:
Triangulating and Guarding Realistic Polygons. CCCG 2008 - [c96]Prosenjit Bose, Stefan Langerman, Sasanka Roy:
Smallest enclosing circle centered on a query line segment. CCCG 2008 - [c95]Prosenjit Bose, Joseph O'Rourke, Chang Shu, Stefanie Wuhrer:
Isometric Morphing of Triangular Meshes. CCCG 2008 - [c94]Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid:
On the Stretch Factor of Convex Delaunay Graphs. ISAAC 2008: 656-667 - [c93]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete k -Partite Geometric Graphs. LATIN 2008: 170-181 - [c92]Prosenjit Bose, Karim Douïeb, Stefan Langerman:
Dynamic optimality for skip lists and B-trees. SODA 2008: 1106-1114 - [c91]Prosenjit Bose, Paz Carmi, Mathieu Couture:
Spanners of Additively Weighted Point Sets. SWAT 2008: 367-377 - [c90]Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid:
Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401 - [i13]Prosenjit Bose, Paz Carmi, Mathieu Couture:
Spanners of Additively Weighted Point Sets. CoRR abs/0801.4013 (2008) - [i12]Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid:
On the Stretch Factor of Convex Delaunay Graphs. CoRR abs/0804.1041 (2008) - [i11]Stefanie Wuhrer, Prosenjit Bose, Chang Shu, Joseph O'Rourke, Alan Brunton:
Morphing of Triangular Meshes in Shape Space. CoRR abs/0805.0162 (2008) - [i10]Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin:
Succinct Geometric Indexes Supporting Point Location Queries. CoRR abs/0805.4147 (2008) - [i9]Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu:
Communication-Efficient Construction of the Plane Localized Delaunay Graph. CoRR abs/0809.2956 (2008) - 2007
- [j60]Greg Aloupis, Prosenjit Bose, Pat Morin:
Reconfiguring Triangulations with Edge Flips and Point Moves. Algorithmica 47(4): 367-378 (2007) - [j59]Prosenjit Bose, Luc Devroye:
On the stabbing number of a random Delaunay triangulation. Comput. Geom. 36(2): 89-105 (2007) - [j58]Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold:
Space-efficient geometric divide-and-conquer algorithms. Comput. Geom. 37(3): 209-227 (2007) - [j57]Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin:
Geodesic Ham-Sandwich Cuts. Discret. Comput. Geom. 37(3): 325-339 (2007) - [j56]Prosenjit Bose, Narcís Coll, Ferran Hurtado, Joan Antoni Sellarès:
A General Approximation Algorithm for Planar Maps with Applications. Int. J. Comput. Geom. Appl. 17(6): 529-554 (2007) - [j55]Stefanie Wuhrer, Chang Shu, Prosenjit Bose, Zouhour Ben Azouz:
Posture Invariant Correspondence of Incomplete Triangular Manifolds. Int. J. Shape Model. 13(2): 139-157 (2007) - [j54]Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood:
Simultaneous diagonal flips in plane triangulations. J. Graph Theory 54(4): 307-330 (2007) - [c89]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer:
A Characterization of the Degree Sequences of 2-trees. ANALCO 2007: 232-241 - [c88]Prosenjit Bose, Jason Morrison:
Optimal Point Set Partitioning using Rigid Motion Star Placement. CCCG 2007: 49-52 - [c87]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:
Vertex Pops and Popturns. CCCG 2007: 137-140 - [c86]Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stefanie Wuhrer:
Approximations of Geodesic Distances for Incomplete Triangular Manifolds. CCCG 2007: 177-180 - [c85]Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer:
Linear-Space Algorithms for Distance Preserving Embedding. CCCG 2007: 185-188 - [c84]Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr:
Traversing a set of points with a minimum number of turns. SCG 2007: 46-55 - [c83]Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis:
Location Oblivious Distributed Unit Disk Graph Coloring. SIROCCO 2007: 222-233 - [c82]Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu:
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies. WADS 2007: 300-311 - [c81]Prosenjit Bose, Aaron Lee, Michiel H. M. Smid:
On Generalized Diamond Spanners. WADS 2007: 325-336 - [c80]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88 - [e2]Prosenjit Bose:
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada. Carleton University, Ottawa, Canada 2007, ISBN 978-0-7709-0520-0 [contents] - [i8]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood:
A polynomial bound for untangling geometric planar graphs. CoRR abs/0710.1641 (2007) - [i7]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric Spanners With Small Chromatic Number. CoRR abs/0711.0114 (2007) - [i6]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete $k$-Partite Geometric Graphs. CoRR abs/0712.0554 (2007) - [i5]Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu:
On a family of strong geometric spanners that admit local routing strategies. CoRR abs/cs/0702117 (2007) - 2006
- [j53]Prosenjit Bose, Vida Dujmovic, David R. Wood:
Induced Subgraphs of Bounded Degree and Bounded Treewidth. Contributions Discret. Math. 1(1) (2006) - [j52]Sergey Bereg, Prosenjit Bose, David G. Kirkpatrick:
Equitable subdivisions within polygonal regions. Comput. Geom. 34(1): 20-27 (2006) - [j51]Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood:
Partitions of complete geometric graphs into plane trees. Comput. Geom. 34(2): 116-125 (2006) - [j50]Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann:
Area-preserving approximations of polygonal paths. J. Discrete Algorithms 4(4): 554-566 (2006) - [j49]Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick:
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. SIAM J. Discret. Math. 20(2): 412-427 (2006) - [c79]Prosenjit Bose, David Bremner, Diane L. Souvaine:
Computing the Tool Path of an Externally Monotone Polygon in Linear Time. CCCG 2006 - [c78]Prosenjit Bose, Jason Morrison:
Optimal Polygon Placement. CCCG 2006 - [c77]Prosenjit Bose, Pat Morin, Michiel H. M. Smid, Stefanie Wuhrer:
Rotationally Monotone Polygons. CCCG 2006 - [c76]Evan Hahn, Prosenjit Bose, Anthony D. Whitehead:
Lazy Generation of Building Interiors in Realtime. CCECE 2006: 2441-2444 - [c75]Prosenjit Bose, Michiel H. M. Smid, Daming Xu:
Diamond Triangulations Contain Spanners of Bounded Degree. ISAAC 2006: 173-182 - [c74]Prosenjit Bose, J. Mark Keil:
On the Stretch Factor of the Constrained Delaunay Triangulation. ISVD 2006: 25-31 - [c73]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. LATIN 2006: 80-92 - [c72]Mathieu Couture, Michel Barbeau, Prosenjit Bose, Evangelos Kranakis:
Incremental Construction of k-Dominating Sets in Wireless Sensor Networks. OPODIS 2006: 202-214 - [c71]Evan Hahn, Prosenjit Bose, Anthony D. Whitehead:
Persistent realtime building interior generation. Sandbox@SIGGRAPH 2006: 179-186 - [c70]Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood:
Simultaneous diagonal flips in plane triangulations. SODA 2006: 212-221 - [c69]Anthony D. Whitehead, Prosenjit Bose, Robert Laganière:
Feature-based cut detection with automatic threshold selection. TRECVID 2006 - [i4]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer:
A Characterization of the Degree Sequences of 2-Trees. CoRR abs/cs/0605011 (2006) - 2005
- [j48]Prosenjit Bose, Pat Morin:
Guest Editors' Foreword. Algorithmica 42(1): 1-2 (2005) - [j47]Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid:
Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica 42(3-4): 249-264 (2005) - [j46]Prosenjit Bose, Marc J. van Kreveld:
Generalizing Monotonicity: on Recognizing Special Classes of Polygons and Polyhedra. Int. J. Comput. Geom. Appl. 15(6): 591-608 (2005) - [j45]Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich:
Optimizing a constrained convex polygonal annulus. J. Discrete Algorithms 3(1): 1-26 (2005) - [c68]Prosenjit Bose, Jason Morrison:
Translating a Star over a Point Set. CCCG 2005: 179-182 - [c67]Anthony D. Whitehead, Prosenjit Bose, Veronique Audet:
High-speed texture-preserving digital image inpainting. SIP 2005: 526-531 - [c66]Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang:
Approximate Range Mode and Range Median Queries. STACS 2005: 377-388 - [c65]Anthony D. Whitehead, Robert Laganière, Prosenjit Bose:
Temporal Synchronization of Video Sequences in Theory and in Practice. WACV/MOTION 2005: 132-137 - [c64]Prosenjit Bose, Vida Dujmovic, David R. Wood:
Induced Subgraphs of Bounded Degree and Bounded Treewidth. WG 2005: 175-186 - [i3]Manuel Abellanas, Prosenjit Bose, Jesús García-López, Ferran Hurtado, Mariano Nicolás, Pedro A. Ramos:
On properties of higher-order Delaunay graphs with applications. EuroCG 2005: 119-122 - [i2]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. CoRR abs/cs/0512091 (2005) - [i1]Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood:
Simultaneous Diagonal Flips in Plane Triangulations. CoRR abs/math/0509478 (2005) - 2004
- [j44]Prosenjit Bose, Pat Morin:
Testing the Quality of Manufactured Disks and Balls. Algorithmica 38(1): 161-177 (2004) - [j43]Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin:
On simplifying dot maps. Comput. Geom. 27(1): 43-62 (2004) - [j42]Prosenjit Bose, Joachim Gudmundsson, Pat Morin:
Ordered theta graphs. Comput. Geom. 28(1): 11-18 (2004) - [j41]Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh:
Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3): 233-249 (2004) - [j40]Prosenjit Bose, Michiel H. M. Smid, David R. Wood:
Light edges in degree-constrained graphs. Discret. Math. 282(1-3): 35-41 (2004) - [j39]Prosenjit Bose, Pat Morin, Antoine Vigneron:
Packing two disks into a polygonal environment. J. Discrete Algorithms 2(3): 373-380 (2004) - [j38]Prosenjit Bose, Jurek Czyzowicz, Pat Morin, David R. Wood:
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing. J. Graph Algorithms Appl. 8: 21-26 (2004) - [j37]Prosenjit Bose, Pat Morin:
Online Routing in Triangulations. SIAM J. Comput. 33(4): 937-951 (2004) - [j36]Prosenjit Bose, Pat Morin:
Competitive online routing in geometric graphs. Theor. Comput. Sci. 324(2-3): 273-288 (2004) - [c63]Prosenjit Bose, Marc J. van Kreveld:
Computing nice sweeps for polyhedra and polygons. CCCG 2004: 108-111 - [c62]Prosenjit Bose, Carlos Seara, Saurabh Sethia:
On computing enclosing isosceles triangles and related problems. CCCG 2004: 120-123 - [c61]Anthony D. Whitehead, Prosenjit Bose, Robert Laganière:
Feature Based Cut Detection with Automatic Threshold Selection. CIVR 2004: 410-418 - [c60]Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin:
Geodesic ham-sandwich cuts. SCG 2004: 1-9 - [c59]Greg Aloupis, Prosenjit Bose, Pat Morin:
Reconfiguring Triangulations with Edge Flips and Point Moves. GD 2004: 1-11 - [c58]Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood:
Partitions of Complete Geometric Graphs into Plane Trees. GD 2004: 71-81 - [c57]Manuel Abellanas, Prosenjit Bose, Alfredo García Olaverri, Ferran Hurtado, Pedro A. Ramos, Eduardo Rivera-Campo, Javier Tejel:
On Local Transformations in Plane Geometric Graphs Embedded on Small Grids. ICCSA (3) 2004: 22-31 - [c56]Prosenjit Bose, Stefan Langerman:
Weighted Ham-Sandwich Cuts. JCDCG 2004: 48-53 - 2003
- [j35]Prosenjit Bose, Anil Maheshwari, Pat Morin:
Fast approximations for sums of distances, clustering and the Fermat-Weber problem. Comput. Geom. 24(3): 135-146 (2003) - [j34]Prosenjit Bose, Marc J. van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison:
Translating a regular grid over a point set. Comput. Geom. 25(1-2): 21-34 (2003) - [j33]Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li:
Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces. Comput. Geom. 26(3): 209-219 (2003) - [j32]Prosenjit Bose, Hazel Everett, Stephen K. Wismath:
Properties of Arrangement Graphs. Int. J. Comput. Geom. Appl. 13(6): 447-462 (2003) - [j31]Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin:
Asymmetric Communication Protocols via Hotlink Assignments. Theory Comput. Syst. 36(6): 655-661 (2003) - [c55]Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang:
Bounds for Frequency Estimation of Packet Streams. SIROCCO 2003: 33-42 - [c54]Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh:
Approximating Geometric Bottleneck Shortest Paths. STACS 2003: 38-49 - 2002
- [j30]Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint:
Some Aperture-Angle Optimization Problems. Algorithmica 33(4): 411-435 (2002) - [j29]Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an object from its cast. Comput. Aided Des. 34(8): 547-559 (2002) - [j28]Prosenjit Bose, Suneeta Ramaswami, Godfried T. Toussaint, Alain Turki:
Experimental results on quadrangulations of sets of fixed points. Comput. Aided Geom. Des. 19(7): 533-552 (2002) - [j27]Prosenjit Bose:
On embedding an outer-planar graph in a point set. Comput. Geom. 23(3): 303-312 (2002) - [j26]Prosenjit Bose, Anna Lubiw, J. Ian Munro:
Efficient visibility queries in simple polygons. Comput. Geom. 23(3): 313-335 (2002) - [j25]Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro:
Online Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. 12(4): 283-296 (2002) - [j24]Prosenjit Bose, Pat Morin:
An Improved Algorithm for Subdivision Traversal without Extra Storage. Int. J. Comput. Geom. Appl. 12(4): 297-308 (2002) - [j23]Prosenjit Bose, Luc Devroye, William S. Evans:
Diamonds are Not a Minimum Weight Triangulation's Best Friend. Int. J. Comput. Geom. Appl. 12(6): 445-454 (2002) - [j22]Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding Specified Sections of Arrangements: 2D Results. J. Math. Model. Algorithms 1(1): 3-16 (2002) - [j21]Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Krizanc, David Peleg:
Station Layouts in the Presence of Location Constraints. J. Interconnect. Networks 3(1-2): 1-17 (2002) - [c53]Prosenjit Bose, Joachim Gudmundsson, Pat Morin:
Ordered theta graphs. CCCG 2002: 17-21 - [c52]Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
Computing signed permutations of polygons. CCCG 2002: 68-71 - [c51]Prosenjit Bose, Michiel H. M. Smid, David R. Wood:
Light edges in degree-constrained graphs. CCCG 2002: 142-145 - [c50]Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid:
Constructing Plane Spanners of Bounded Degree and Low Weight. ESA 2002: 234-246 - [c49]Prosenjit Bose, Luc Devroye, Pat Morin:
Succinct Data Structures for Approximating Convex Functions with Applications. JCDCG 2002: 97-107 - [c48]Prosenjit Bose, Qingda Wang:
Facility Location Constrained to a Polygonal Domain. LATIN 2002: 153-164 - [c47]Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick:
On the Spanning Ratio of Gabriel Graphs and beta-skeletons. LATIN 2002: 479-493 - [c46]Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin:
Asymmetric Communication Protocols via Hotlink Assignments. SIROCCO 2002: 33-39 - [e1]Prosenjit Bose, Pat Morin:
Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings. Lecture Notes in Computer Science 2518, Springer 2002, ISBN 3-540-00142-5 [contents] - 2001
- [j20]Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint:
Every Set of Disjoint Line Segments Admits a Binary Tree. Discret. Comput. Geom. 26(3): 387-410 (2001) - [j19]Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw:
Efficient Algorithms for Petersen's Matching Theorem. J. Algorithms 38(1): 110-134 (2001) - [j18]Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia:
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. Wirel. Networks 7(6): 609-616 (2001) - [c45]Prosenjit Bose, Pat Morin, Antoine Vigneron:
Packing Two Disks into a Polygonal Environment. COCOON 2001: 142-149 - [c44]Prosenjit Bose, Pat Morin:
Competitive Online Routing in Geometric Graphs. SIROCCO 2001: 35-44 - [c43]Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison:
The Grid Placement Problem. WADS 2001: 180-191 - 2000
- [c42]Hee-Kap Ahn, Prosenjit Bose, Jurek Czyzowicz, Nicolas Hanusse, Evangelos Kranakis, Pat Morin:
Flipping your Lid. CCCG 2000 - [c41]Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec:
Strategies for Hotlink Assignments. ISAAC 2000: 23-34 - [c40]Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz:
Online Routing in Convex Subdivisions. ISAAC 2000: 47-59 - [c39]Prosenjit Bose, Pat Morin:
An Improved Algorithm for Subdivision Traversal without Extra Storage. ISAAC 2000: 444-455
1990 – 1999
- 1999
- [j17]Prosenjit Bose, Francisco Gómez, Pedro Ramos, Godfried Toussaint:
Drawing Nice Projections of Objects in Space. J. Vis. Commun. Image Represent. 10(2): 155-172 (1999) - [c38]Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Dominic Lessard:
Near optimal-partitioning of rectangles and prisms. CCCG 1999 - [c37]Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia:
Routing with guaranteed delivery in ad hoc wireless networks. DIAL-M 1999: 48-55 - [c36]Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne, Markus Latzel:
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs. IPPS/SPDP 1999: 125-129 - [c35]Prosenjit Bose, Pat Morin:
Online Routing in Triangulations. ISAAC 1999: 113-122 - [c34]Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg:
Station Layouts in the Presence of Location Constraints. ISAAC 1999: 269-278 - [c33]Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw:
Efficient Algorithms for Petersen's Matching Theorem. SODA 1999: 130-139 - [c32]Gill Barequet, Prosenjit Bose, Matthew Dickerson:
Optimizing Constrained Offset and Scaled Polygonal Annuli. WADS 1999: 62-73 - [c31]Prosenjit Bose, Pat Morin:
Testing the Quality of Manufactured Balls. WADS 1999: 145-156 - 1998
- [j16]Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint:
Filling polyhedral molds. Comput. Aided Des. 30(4): 245-254 (1998) - [j15]Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong:
Computing constrained minimum-width annuli of point sets. Comput. Aided Des. 30(4): 267-275 (1998) - [j14]Prosenjit Bose, Luc Devroye:
Intersections with random geometric objects. Comput. Geom. 10(3): 139-154 (1998) - [j13]Prosenjit Bose, Jonathan F. Buss, Anna Lubiw:
Pattern Matching for Permutations. Inf. Process. Lett. 65(5): 277-283 (1998) - [j12]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:
A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. 2(3): 1-16 (1998) - [c30]Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan:
Recovering lines with fixed linear probes. CCCG 1998 - [c29]Prosenjit Bose, Jean-Denis Caron, Kilani Ghoudi:
Detection of text-line orientation. CCCG 1998 - [c28]Prosenjit Bose, Jurek Czyzowicz, Dominic Lessard:
Cutting rectangles in equal area pieces. CCCG 1998 - [c27]Prosenjit Bose, Ferran Hurtado, Henk Meijer, Suneeta Ramaswami, David Rappaport, Vera Sacristán, Thomas C. Shermer, Godfried T. Toussaint:
Finding specified sections of arrangements: 2d results. CCCG 1998 - [c26]Prosenjit Bose, Pat Morin:
Testing the Quality of Manufactured Disks and Cylinders. ISAAC 1998: 129-138 - [c25]Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari:
Polygon Cutting: Revisited. JCDCG 1998: 81-92 - [c24]Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari:
Algorithms for Packing Two Circles in a Convex Polygon. JCDCG 1998: 93-103 - 1997
- [j11]Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu:
Feasibility of Design in Stereolithography. Algorithmica 19(1/2): 61-83 (1997) - [j10]Prosenjit Bose, David Bremner, Marc J. van Kreveld:
Determining the Castability of Simple Polyhedra. Algorithmica 19(1/2): 84-113 (1997) - [j9]Prosenjit Bose, Godfried T. Toussaint:
Characterizing and efficiently computing quadrangulations of planar point sets. Comput. Aided Geom. Des. 14(8): 763-785 (1997) - [j8]Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu:
Guarding Polyhedral Terrains. Comput. Geom. 7: 173-185 (1997) - [j7]Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia:
The Floodlight Problem. Int. J. Comput. Geom. Appl. 7(1/2): 153-163 (1997) - [j6]Prosenjit Bose, Michael McAllister, Jack Snoeyink:
Optimal Algorithms to Embed Trees in a Point Set. J. Graph Algorithms Appl. 1(2): 1-15 (1997) - [c23]Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an Object from its Cast. SCG 1997: 221-230 - [c22]Prosenjit Bose:
On Embedding an Outer-Planar Graph in a Point Set. GD 1997: 25-36 - [c21]Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong:
Computing Constrained Minimum-Width Annuli of Point Sets. WADS 1997: 392-401 - 1996
- [j5]Prosenjit Bose, William J. Lenhart, Giuseppe Liotta:
Characterizing Proximity Trees. Algorithmica 16(1): 83-110 (1996) - [j4]Prosenjit Bose, David Bremner, Godfried T. Toussaint:
All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. Comput. Geom. 6: 291-302 (1996) - [c20]Prosenjit Bose, Luc Devroye, William S. Evans:
Diamonds Are Not a Minimum Weight Triangulation's Best Friend. CCCG 1996: 68-73 - [c19]Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink:
Approximating Shortest Paths in Arrangements of Lines. CCCG 1996: 143-148 - [c18]Prosenjit Bose, David G. Kirkpatrick, Zaiqing Li:
Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain. CCCG 1996: 217-222 - [c17]Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu:
The Complexity of Rivers in Triangulated Terrains. CCCG 1996: 325-330 - [c16]Prosenjit Bose, Godfried T. Toussaint:
Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Application. Computer Graphics International 1996: 102-110 - [c15]David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink:
On the Sectional Area of Convex Polytopes. SCG 1996: C-11-C-12 - [c14]Prosenjit Bose, Alice M. Dean, Joan P. Hutchinson, Thomas C. Shermer:
On Rectangle Visibility Graphs. GD 1996: 25-44 - 1995
- [j3]Prosenjit Bose, Godfried T. Toussaint:
Geometric and computational aspects of gravity casting. Comput. Aided Des. 27(6): 455-464 (1995) - [j2]Prosenjit Bose, Godfried T. Toussaint:
Growing a Tree from Its Branches. J. Algorithms 19(1): 86-103 (1995) - [c13]Prosenjit Bose, Ferran Hurtado, Elsa Omaña-Pulido, Godfried T. Toussaint:
Aperture angle optimization problems. CCCG 1995: 73-78 - [c12]Prosenjit Bose, Francisco Gómez, Pedro A. Ramos, Godfried T. Toussaint:
Drawing Nice Projections of Objects in Space. GD 1995: 52-63 - [c11]Prosenjit Bose, Michael McAllister, Jack Snoeyink:
Optimal Algorithms to Embed Trees in a Point Set. GD 1995: 64-75 - [c10]Prosenjit Bose, Godfried T. Toussaint:
No Quadrangulation is Extremely Odd. ISAAC 1995: 372-381 - 1994
- [j1]Prosenjit Bose, Godfried T. Toussaint:
Geometric and computational aspects of manufacturing processes. Comput. Graph. 18(4): 487-497 (1994) - [c9]Prosenjit Bose, David Bremner, Godfried T. Toussaint:
All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. CCCG 1994: 344-349 - [c8]Patrice Belleville, Prosenjit Bose, Jurek Czyzowicz, Jorge Urrutia, Joseph Zaks:
K-Guarding Polygons on the Plane. CCCG 1994: 381-386 - [c7]Prosenjit Bose, David Bremner, Marc J. van Kreveld:
Determining the Castability of Simple Polyhedra. SCG 1994: 123-131 - [c6]Prosenjit Bose, Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta:
Proximity Constraints and Representable Trees. GD 1994: 340-351 - [c5]Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint:
Every Set of Disjoint Line Segments Admits a Binary Tree. ISAAC 1994: 20-28 - 1993
- [c4]Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia:
The Floodlight Problem. CCCG 1993: 399-404 - [c3]Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose, Jesus Garcia-Lopez, Mark H. Overmars, Godfried T. Toussaint, Gordon T. Wilfong, Binhai Zhu:
Feasability of Design in Stereolithography. FSTTCS 1993: 228-237 - [c2]Prosenjit Bose, Jonathan F. Buss, Anna Lubiw:
Pattern Matching for Permutations. WADS 1993: 200-209 - [c1]Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint:
Filling Polyhedral Molds. WADS 1993: 210-221
Coauthor Index
[j188] [j182] [j173] [j163] [c203] [c188] [i83] [c187] [c184] [c183] [i79] [i77] [i76] [i71] [j131] [c170] [i57] [i49] [j120] [j114] [j110] [j104] [j98] [j96] [j93] [j88] [c122] [j87] [j83] [c111] [c108] [i16] [j80] [j79] [j68] [c103] [c94] [c93] [c91] [c90] [i13] [i12] [i9] [c85] [c83] [c82] [c80] [i7] [i6] [i5]
[j194] [j192] [c227] [c226] [i104] [i103] [i102] [j186] [j185] [i99] [i98] [c217] [c216] [i95] [j172] [c207] [j169] [j164] [j160] [c192] [c190] [i81] [j152] [j149] [c186] [i80] [i74] [j145] [j143] [j142] [j140] [j138] [c175] [c174] [i68] [i67] [j134] [j133] [j131] [j130] [j129] [c169] [c168] [c165] [c164] [i61] [i59] [i58] [j124] [j121] [c162] [c160] [c159] [c158] [i55] [i54] [i52] [i50] [i49] [j119] [c153] [c144] [i45] [i43] [i42] [i40] [j107] [c140] [c138] [c137] [i38] [i37] [i34] [c133] [c131] [c125] [c119] [i17]
[c228] [i105] [j188] [i100] [j179] [i94] [j172] [i92] [i85] [j157] [c185] [c184] [i77] [i73] [i71] [j144] [c174] [c171] [j128] [j117] [j112] [j108] [j106] [c139] [j105] [j102] [c134] [i31] [i28] [j95] [j91] [c120] [c118] [c117] [c116] [c110] [c109] [i23] [i21] [i20] [j76] [j74] [c107] [i15] [i14] [j64] [j62] [c97] [c89] [i8] [j53] [i4] [c64]
[j184] [j176] [c210] [i93] [j170] [c200] [j157] [i82] [j153] [c185] [i73] [c177] [i70] [j136] [j117] [c149] [c147] [j114] [j113] [j109] [i36] [j102] [c129] [i30] [j91] [j89] [i24] [j84] [c121] [c117] [j74] [c107] [i15] [j64] [j62] [c97] [c96] [c92] [j57] [c89] [c87] [i8] [c73] [i4] [i2] [c60] [c56] [j31] [c52] [c46]
[j190] [c227] [i104] [i103] [i102] [j185] [i99] [j183] [j182] [c218] [c207] [j163] [c199] [j160] [c188] [i83] [j154] [j148] [c187] [i79] [j141] [j140] [c175] [j135] [j131] [j130] [c172] [c169] [c167] [c165] [i59] [i56] [j125] [j124] [c155] [i53] [i49] [i47] [j120] [i40] [j107] [c140] [i37] [j97] [c133] [j92] [c122] [j87] [j84] [c108] [i16] [j80] [j79] [j70] [j68] [c101] [c100] [j63] [c93] [c90] [i10] [j58] [c85] [c80] [i7] [i6] [j41] [j35] [j34] [c54] [c43] [c25] [c24]
[c228] [i105] [j188] [i100] [j180] [j179] [c213] [i96] [i94] [i92] [c197] [i87] [i85] [j154] [c184] [i77] [i71] [j144] [i66] [j137] [j132] [j129] [c171] [i62] [i56] [j128] [j127] [c152] [c148] [c145] [i45] [j112] [j108] [j106] [c143] [c139] [c135] [j100] [j99] [j97] [c134] [c131] [i31] [i28] [i27] [j84] [c118] [c117] [c116] [c112] [c108] [i23] [i21] [i16] [j82] [j77] [j76] [j74] [j70] [j68] [c101] [c100] [c99] [j64] [j63] [j62] [c93] [i10] [j60] [j58] [j57] [j54] [c89] [i8] [i6] [c77] [c70] [i4] [j48] [c66] [i1] [j44] [j43] [j42] [j39] [j38] [j37] [j36] [c60] [c59] [j35] [j34] [j31] [c55] [j25] [j24] [c53] [c49] [c46] [e1] [j18] [c45] [c44] [c43] [c42] [c40] [c39] [c37] [c35] [c31] [c26]
[j171] [j161] [j158] [j152] [j149] [j147] [i78] [j145] [j139] [c178] [c176] [i69] [i63] [j132] [j129] [i62] [i61] [j127] [j126] [j123] [j122] [c162] [c158] [c157] [i54] [j118] [j116] [c153] [c150] [c148] [c146] [i46] [i45] [i44] [i43] [i41] [i39] [c142] [c137] [c136] [c135] [i38] [i35] [c132] [c131] [c127] [c126] [i27] [c124] [i25]
Michiel H. M. Smid
aka: Michiel Smid
aka: Michiel Smid
[j192] [c227] [c225] [i102] [j186] [j185] [i99] [j182] [c207] [j169] [j163] [j160] [c190] [c188] [i83] [j155] [j154] [j153] [j148] [c187] [c186] [i79] [i74] [j142] [j141] [j140] [c175] [i68] [i67] [j135] [j134] [j131] [j130] [c172] [c169] [c168] [c167] [c166] [c165] [i59] [i58] [i56] [j125] [j124] [c155] [i53] [i52] [i51] [i49] [i47] [c151] [i40] [j111] [j107] [j106] [c141] [c140] [c139] [i37] [i32] [j103] [c133] [i31] [j93] [j87] [j84] [j83] [c113] [c111] [c108] [i22] [i16] [j82] [j80] [j79] [j77] [j73] [j70] [j68] [j63] [c94] [c93] [c90] [i12] [i9] [j58] [c85] [c82] [c81] [c80] [i7] [i6] [i5] [c77] [c75] [c73] [j47] [i2] [j41] [j40] [c54] [c51] [c50]
Godfried T. Toussaint
aka: Godfried Toussaint
aka: Godfried Toussaint
[j171] [j165] [j161] [j159] [c192] [j152] [j150] [j147] [c181] [i80] [i78] [i75] [j146] [j139] [c179] [c178] [c176] [i69] [i65] [i63] [j129] [c170] [i57] [j127] [j126] [j123] [j122] [c161] [c157] [i48] [j118] [j116] [c153] [c150] [i45] [i44] [i43] [i41] [i39] [c142] [c137] [c136] [c135] [i38] [i35] [i33] [c132] [c131] [c127] [c126] [i29] [i27] [c124] [c123] [i25]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
