E-LIB Suche - Ergebnisse für: Bose, Prosenjit

1

A Steiner-point-based algorithm for approximate shortest pa..:

Bose, Prosenjit ; Esteban, Guillermo ; Maheshwari, Anil
Theoretical Computer Science. 1001 (2024) - p. 114583 , 2024

Link: https://doi.org/10.1016/..

2

Routing on heavy path WSPD spanners:

Bose, Prosenjit ; Tuttle, Tyler
Computational Geometry. , 2024

Link: https://doi.org/10.1016/..

3

Improved Routing on the Delaunay Triangulation:

Bonichon, Nicolas ; Bose, Prosenjit ; De Carufel, Jean-Lou...
Discrete & Computational Geometry. 70 (2023) 3 - p. 495-549 , 2023

Link: https://doi.org/10.1007/..

4

On the Spanning and Routing Ratio of the Directed Theta-Fou..:

Bose, Prosenjit ; De Carufel, Jean-Lou ; Hill, Darryl.
Discrete & Computational Geometry. 71 (2023) 3 - p. 872-892 , 2023

Link: https://doi.org/10.1007/..

5

Approximating the Smallest k-Enclosing Geodesic Disc in a S..:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,

Bose, Prosenjit ; D'Angelo, Anthony ; Durocher, Stephane - p. 179-192 , 2023

Link: https://doi.org/10.1007/..

6

Simple linear time algorithms for piercing pairwise interse..:

Biniaz, Ahmad ; Bose, Prosenjit ; Wang, Yunkai
Computational Geometry. 114 (2023) - p. 102011 , 2023

Link: https://doi.org/10.1016/..

7

The Minimum Moving Spanning Tree Problem:

Akitaya, Hugo A. ; Biniaz, Ahmad ; Bose, Prosenjit...
Journal of Graph Algorithms and Applications. 27 (2023) 1 - p. 1-18 , 2023

Link: https://doi.org/10.7155/..

8

Geodesic obstacle representation of graphs:

Bose, Prosenjit ; Carmi, Paz ; Dujmović, Vida...
Computational Geometry. 109 (2023) - p. 101946 , 2023

Link: https://doi.org/10.1016/..

9

On approximating shortest paths in weighted triangular tess..:

Bose, Prosenjit ; Esteban, Guillermo ; Orden, David.
Artificial Intelligence. 318 (2023) - p. 103898 , 2023

Link: https://doi.org/10.1016/..

10

Competitive Online Search Trees on Trees:

Bose, Prosenjit ; Cardinal, Jean ; Iacono, John..
ACM Transactions on Algorithms. 19 (2023) 3 - p. 1-19 , 2023

Link: https://doi.org/10.1145/..

11

On Approximating Shortest Paths in Weighted Triangular Tess..:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,

Bose, Prosenjit ; Esteban, Guillermo ; Orden, David. - p. 409-421 , 2022

Link: https://doi.org/10.1007/..

12

Piercing Pairwise Intersecting Convex Shapes in the Plane:

, In: LATIN 2022: Theoretical Informatics; Lecture Notes in Computer Science,

Bazargani, Saman ; Biniaz, Ahmad ; Bose, Prosenjit - p. 679-695 , 2022

Link: https://doi.org/10.1007/..

13

Fragile complexity of adaptive algorithms:

Bose, Prosenjit ; Cano, Pilar ; Fagerberg, Rolf...
Theoretical Computer Science. 919 (2022) - p. 92-102 , 2022

Link: https://doi.org/10.1016/..

14

On the spanning and routing ratios of the directed Θ6-graph:

Akitaya, Hugo A. ; Biniaz, Ahmad ; Bose, Prosenjit
Computational Geometry. 105-106 (2022) - p. 101881 , 2022

Link: https://doi.org/10.1016/..

15

Local Routing Algorithms on Euclidean Spanners with Small D..:

, In: LATIN 2022: Theoretical Informatics; Lecture Notes in Computer Science,

Bonichon, Nicolas ; Bose, Prosenjit ; Garito, Yan - p. 696-712 , 2022

Link: https://doi.org/10.1007/..