The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ojas Parekh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
    Improved approximations for tour and tree covers. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:184-193 [Conf]
  2. Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh
    A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:132-142 [Conf]
  3. Jochen Könemann, Ojas Parekh, Danny Segev
    A Unified Approach to Approximating Partial Covering Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:468-479 [Conf]
  4. Eduardo Sany Laber, Ojas Parekh, R. Ravi
    Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:649-661 [Conf]
  5. Ojas Parekh, Danny Segev
    Path Hitting in Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:564-575 [Conf]
  6. Ojas Parekh
    Edge dominating and hypomatchable sets. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:287-291 [Conf]
  7. Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo
    Finding effective support-tree preconditioners. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:176-185 [Conf]
  8. Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha
    Approximation Algorithms for Edge-Dilation k-Center Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:210-219 [Conf]
  9. André Berger, Ojas Parekh
    Linear Time Algorithms for Generalized Edge Dominating Set Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:233-243 [Conf]
  10. Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
    Improved Approximations for Tour and Tree Covers. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:3, pp:441-449 [Journal]
  11. Ojas Parekh
    Forestation in Hypergraphs: Linear k-Trees. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  12. Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh
    A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:3, pp:317-326 [Journal]
  13. Robert D. Carr, Ojas Parekh
    A 1/2-integral relaxation for the A-matching problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:4, pp:445-450 [Journal]
  14. Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha
    An approximation algorithm for the edge-dilation k-center problem, . [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:5, pp:491-495 [Journal]
  15. Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh
    Compacting cuts: a new linear formulation for minimum cut. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:43-52 [Conf]
  16. André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
    Approximability of the capacitated b-edge dominating set problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:202-213 [Journal]

  17. Constraint processing in relational database systems: from theory to implementation. [Citation Graph (, )][DBLP]


  18. Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. [Citation Graph (, )][DBLP]


  19. Linear Time Algorithms for Generalized Edge Dominating Set Problems. [Citation Graph (, )][DBLP]


  20. Path Hitting in Acyclic Graphs. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002