Saurabh Ray
According to our database1,
Saurabh Ray
authored at least 61 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Discret. Comput. Geom., April, 2024
Proceedings of the 11th International Network Optimization Conference, 2024
Proceedings of the 40th International Symposium on Computational Geometry, 2024
2023
2022
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022
2021
Threshold Rounding for the Standard LP Relaxation of some Geometric Stabbing Problems.
CoRR, 2021
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021
2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
Discrete Helly type theorems.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
2019
A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs.
Theor. Comput. Sci., 2019
2018
Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677-683].
J. Symb. Comput., 2018
Discret. Appl. Math., 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
2016
2015
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces.
SIAM J. Comput., 2015
Discret. Comput. Geom., 2015
Comput. Geom., 2015
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015
Proceedings of the Algorithms - ESA 2015, 2015
2014
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
2013
CoRR, 2013
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013
2012
Discret. Comput. Geom., 2012
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012
2011
Proceedings of the Algorithms - ESA 2011, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
2010
J. Symb. Comput., 2010
Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension.
Comput. Geom., 2010
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
2009
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009
2008
Comput. Geom., 2008
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008
2007
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007
Conflict-free coloring for rectangle ranges using <i>O</i>(<i>n</i><sup>.382</sup>) colors.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007