Author of the publication

Geometric Hitting Set for Segments of Few Orientations.

, , , , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 145-157. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Spiking Neural Algorithms for Markov Process Random Walk., , , and . IJCNN, page 1-8. IEEE, (2018)Provable Neuromorphic Advantages for Computing Shortest Paths., , , , , , and . SPAA, page 497-499. ACM, (2020)Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication., , , and . SPAA, page 67-76. ACM, (2018)Finding effective support-tree preconditioners., , , , and . SPAA, page 176-185. ACM, (2005)Approximation Algorithms for Edge-Dilation k-Center Problems., , , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 210-219. Springer, (2002)An Improved Quantum Max Cut Approximation via Maximum Matching., and . ICALP, volume 297 of LIPIcs, page 105:1-105:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Probing a Set of Trajectories to Maximize Captured Information., , , , , , and . SEA, volume 160 of LIPIcs, page 5:1-5:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Complexity Classification of Product State Problems for Local Hamiltonians., , , , and . ITCS, volume 325 of LIPIcs, page 63:1-63:32. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2025)Approximation Algorithms for Partial Vertex Covers in Trees., , and . Int. J. Found. Comput. Sci., 35 (4): 387-407 (June 2024)Provable Advantages for Graph Algorithms in Spiking Neural Networks., , , , , , and . SPAA, page 35-47. ACM, (2021)