Subhash Suri

Affiliations: 
Computer Science University of California, Santa Barbara, Santa Barbara, CA, United States 
Google:
"Subhash Suri"
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Bandyapadhyay S, Kumar N, Suri S, et al. (2020) Improved approximation bounds for the minimum constraint removal problem Computational Geometry: Theory and Applications. 90: 101650
Schibler T, Suri S. (2020) K-dominance in multidimensional data: Theory and applications Computational Geometry: Theory and Applications. 87: 101594
Hershberger J, Kumar N, Suri S. (2020) Shortest Paths in the Plane with Obstacle Violations Algorithmica. 82: 1813-1832
Bandyapadhyay S, Maheshwari A, Mehrabi S, et al. (2019) Approximating dominating set on intersection graphs of rectangles and L-frames Computational Geometry: Theory and Applications. 82: 32-44
Cieslak M, Brennan T, Meiring W, et al. (2017) Analytic tractography: A closed-form solution for estimating local white matter connectivity with diffusion MRI. Neuroimage
Dijk TCv, Fink M, Fischer N, et al. (2017) Block Crossings in Storyline Visualizations Journal of Graph Algorithms and Applications. 21: 873-913
Fink M, Hershberger J, Kumar N, et al. (2017) Hyperplane separability and convexity of probabilistic point sets Journal of Computational Geometry. 8: 32-57
Agarwal PK, Kumar N, Sintos S, et al. (2017) Range-max queries on uncertain data Journal of Computer and System Sciences. 94: 118-134
Kumar N, Suri S. (2016) Containment and evasion in stochastic point data Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9644: 576-589
Hoffmann F, Kriegel K, Suri S, et al. (2015) Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries Leibniz International Proceedings in Informatics, Lipics. 34: 421-435
See more...