Stop the war!Остановите войну!
for scientists:
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
- 2023
[j188]Prosenjit Bose, Guillermo Esteban
, David Orden, Rodrigo I. Silveira:
On approximating shortest paths in weighted triangular tessellations. Artif. Intell. 318: 103898 (2023)- [j187]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) - [j186]Ahmad Biniaz, Prosenjit Bose, Yunkai Wang:
Simple linear time algorithms for piercing pairwise intersecting disks. Comput. Geom. 114: 102011 (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) - [c220]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon. WADS 2023: 179-192 - [i97]Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
On the Restricted k-Steiner Tree Problem. CoRR abs/2306.08504 (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]