( en | de | ru )

 

Disambiguation of "Parekh, Ojas"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Hildegard Parekh

Niranjan Parekh

René-Ojas Woltering

 

Other publications of authors with the same name

Linear Time Algorithms for Generalized Edge Dominating Set Problems., and . Algorithmica, 50 (2): 244-254 (2008)A Unified Approach to Approximating Partial Covering Problems., , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 468-479. Springer, (2006)The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut., and . FOCS, page 498-506. IEEE, (2022)Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model., , and . CoRR, (2023)Spiking network algorithms for scientific computing., , , , and . ICRC, page 1-8. IEEE Computer Society, (2016)Improved approximations for tour and tree covers., , , and . APPROX, volume 1913 of Lecture Notes in Computer Science, page 184-193. Springer, (2000)Dynamic Programming with Spiking Neural Computing., , , , , and . ICONS, page 20:1-20:9. ACM, (2019)Constraint processing in relational database systems: from theory to implementation., , , , and . SAC, page 2066-2070. ACM, (2010)Finding effective support-tree preconditioners., , , , and . SPAA, page 176-185. ACM, (2005)Provable Advantages for Graph Algorithms in Spiking Neural Networks., , , , , , and . SPAA, page 35-47. ACM, (2021)