( en | de | ru )

 

Disambiguation of "Parekh, Ojas"

Author of the publication

copydeleteadd this publication to your clipboard
Probing a Set of Trajectories to Maximize Captured Information

, , , , , , and . CoRR, (2020)

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

Iterative Packing for Demand and Hypergraph Matching.. IPCO, volume 6655 of Lecture Notes in Computer Science, page 349-361. Springer, (2011)Geometric Hitting Set for Segments of Few Orientations., , , , and . CoRR, (2016)Edge dominating and hypomatchable sets.. SODA, page 287-291. ACM/SIAM, (2002)An explicit vector algorithm for high-girth MaxCut., , and . SOSA, page 238-246. SIAM, (2022)Randomized Approximation Algorithms for Query Optimization Problems on Two Processors., , and . ESA, volume 2461 of Lecture Notes in Computer Science, page 649-661. Springer, (2002)Path Hitting in Acyclic Graphs., and . Algorithmica, 52 (4): 466-486 (2008)Synergies Between Operations Research and Quantum Information Science.. INFORMS J. Comput., 35 (2): 266-273 (2023)Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems., and . ESA, volume 204 of LIPIcs, page 74:1-74:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems., and . Algorithmica, 62 (1-2): 633-634 (2012)Path Hitting in Acyclic Graphs., and . ESA, volume 4168 of Lecture Notes in Computer Science, page 564-575. Springer, (2006)