The SCEAS System
| |||||||

## Search the dblp DataBase
Ojas Parekh:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - 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] - Ojas Parekh, Danny Segev
**Path Hitting in Acyclic Graphs.**[Citation Graph (0, 0)][DBLP] ESA, 2006, pp:564-575 [Conf] - Ojas Parekh
**Edge dominating and hypomatchable sets.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:287-291 [Conf] - 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] - 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] - André Berger, Ojas Parekh
**Linear Time Algorithms for Generalized Edge Dominating Set Problems.**[Citation Graph (0, 0)][DBLP] WADS, 2005, pp:233-243 [Conf] - 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] - Ojas Parekh
**Forestation in Hypergraphs: Linear k-Trees.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2003, v:10, n:, pp:- [Journal] - 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] - Robert D. Carr, Ojas Parekh
**A 1/2-integral relaxation for the**[Citation Graph (0, 0)][DBLP]*A*-matching problem. Oper. Res. Lett., 2006, v:34, n:4, pp:445-450 [Journal] - Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha
**An approximation algorithm for the edge-dilation**[Citation Graph (0, 0)][DBLP]*k*-center problem^{, }. Oper. Res. Lett., 2004, v:32, n:5, pp:491-495 [Journal] - 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] - 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] **Constraint processing in relational database systems: from theory to implementation.**[Citation Graph (, )][DBLP]**Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.**[Citation Graph (, )][DBLP]**Linear Time Algorithms for Generalized Edge Dominating Set Problems.**[Citation Graph (, )][DBLP]**Path Hitting in Acyclic Graphs.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |