PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Parekh, Ojas"

Author of the publication

copydeleteadd this publication to your clipboard
Constraint processing in relational database systems: from theory to implementation.

, , , , and . SAC, page 2066-2070. ACM, (2010)

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.

No persons found for author name Parekh, Ojas
add a person with the name Parekh, Ojas
 

Other publications of authors with the same name

Linear Time Algorithms for Generalized Edge Dominating Set Problems., and . Algorithmica, 50 (2): 244-254 (2008)Approximation Algorithms for k-hurdle Problems., , , and . Algorithmica, 59 (1): 81-93 (2011)A Unified Approach to Approximating Partial Covering Problems., , and . Algorithmica, 59 (4): 489-509 (2011)A 2110-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem., , , and . J. Comb. Optim., 5 (3): 317-326 (2001)Generalized Hypergraph Matching via Iterated Packing and Local Ratio., and . CoRR, (2016)Constraint processing in relational database systems: from theory to implementation., , , , and . SAC, page 2066-2070. ACM, (2010)Spiking network algorithms for scientific computing., , , , and . ICRC, page 1-8. IEEE Computer Society, (2016)A Unified Approach to Approximating Partial Covering Problems., , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 468-479. Springer, (2006)Dynamic Programming with Spiking Neural Computing., , , , , and . ICONS, page 20:1-20:9. ACM, (2019)Improved approximations for tour and tree covers., , , and . APPROX, volume 1913 of Lecture Notes in Computer Science, page 184-193. Springer, (2000)