E-LIB Suche - Ergebnisse für: Suri, Subhash

1

Algorithms and Data Structures: 18th International Symposiu..

Lecture Notes in Computer Science, 14079

Morin, Pat ; Suri, Subhash - 1st ed. 2023 . , 2023

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

2

The maximum exposure problem:

Kumar, Neeraj ; Sintos, Stavros ; Suri, Subhash
Computational Geometry. 104 (2022) - p. 101861 , 2022

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

3

Dynamic Geometric Set Cover and Hitting Set:

Agarwal, Pankaj ; Chang, Hsien-Chih ; Suri, Subhash..
ACM Transactions on Algorithms. 18 (2022) 4 - p. 1-37 , 2022

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

4

A Near-Optimal Algorithm for Shortest Paths Among Curved Ob..:

Hershberger, John ; Suri, Subhash ; Yildiz, Hakan
SIAM Journal on Computing. 51 (2022) 4 - p. 1296-1340 , 2022

Link: https://doi.org/10.1137/..

5

A Constant Factor Approximation for Navigating Through Conn..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Kumar, Neeraj ; Lokshtanov, Daniel ; Saurabh, Saket. - p. 822-839 , 2021

Link: https://doi.org/10.1137/..

6

A constant factor approximation for navigating through conn..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Kumar, Neeraj ; Lokshtanov, Daniel ; Saurabh, Saket. - p. 822-839 , 2021

Link: https://dl.acm.org/doi/1..

7

K-dominance in multidimensional data: Theory and applicatio..:

Schibler, Thomas ; Suri, Subhash
Computational Geometry. 87 (2020) - p. 101594 , 2020

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

8

Shortest Paths in the Plane with Obstacle Violations:

Hershberger, John ; Kumar, Neeraj ; Suri, Subhash
Algorithmica. 82 (2020) 7 - p. 1813-1832 , 2020

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

9

Improved approximation bounds for the minimum constraint re..:

Bandyapadhyay, Sayan ; Kumar, Neeraj ; Suri, Subhash.
Computational Geometry. 90 (2020) - p. 101650 , 2020

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

10

Approximating dominating set on intersection graphs of rect..:

Bandyapadhyay, Sayan ; Maheshwari, Anil ; Mehrabi, Saeed.
Computational Geometry. 82 (2019) - p. 32-44 , 2019

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

11

Tight bounds for conflict-free chromatic guarding of orthog..:

Hoffmann, Frank ; Kriegel, Klaus ; Suri, Subhash..
Computational Geometry. 73 (2018) - p. 24-34 , 2018

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

12

Analytic tractography: A closed-form solution for estimatin..:

Cieslak, Matthew ; Brennan, Tegan ; Meiring, Wendy...
NeuroImage. 169 (2018) - p. 473-484 , 2018

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

13

Range-max queries on uncertain data:

Agarwal, Pankaj K. ; Kumar, Nirman ; Sintos, Stavros.
Journal of Computer and System Sciences. 94 (2018) - p. 118-134 , 2018

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

14

Block Crossings in Storyline Visualizations:

van Dijk, Thomas C. ; Fink, Martin ; Fischer, Norbert...
Journal of Graph Algorithms and Applications. 21 (2017) 5 - p. 873-913 , 2017

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

15

Convex Hulls Under Uncertainty:

Agarwal, Pankaj K. ; Har-Peled, Sariel ; Suri, Subhash..
Algorithmica. 79 (2016) 2 - p. 340-367 , 2016

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