| 2008 |
|---|
| 20 | EE | Jochen Könemann,
Ojas Parekh,
David Pritchard:
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.
WAOA 2008: 1-14 |
| 19 | EE | André Berger,
Ojas Parekh:
Linear Time Algorithms for Generalized Edge Dominating Set Problems.
Algorithmica 50(2): 244-254 (2008) |
| 18 | EE | Ojas Parekh,
Danny Segev:
Path Hitting in Acyclic Graphs.
Algorithmica 52(4): 466-486 (2008) |
| 17 | EE | Ojas Parekh:
Approximation algorithms for partially covering with edges.
Theor. Comput. Sci. 400(1-3): 159-168 (2008) |
| 2007 |
|---|
| 16 | EE | Robert D. Carr,
Goran Konjevod,
Greg Little,
Venkatesh Natarajan,
Ojas Parekh:
Compacting cuts: a new linear formulation for minimum cut.
SODA 2007: 43-52 |
| 15 | EE | André Berger,
Takuro Fukunaga,
Hiroshi Nagamochi,
Ojas Parekh:
Approximability of the capacitated b-edge dominating set problem.
Theor. Comput. Sci. 385(1-3): 202-213 (2007) |
| 2006 |
|---|
| 14 | EE | Jochen Könemann,
Ojas Parekh,
Danny Segev:
A Unified Approach to Approximating Partial Covering Problems.
ESA 2006: 468-479 |
| 13 | EE | Ojas Parekh,
Danny Segev:
Path Hitting in Acyclic Graphs.
ESA 2006: 564-575 |
| 12 | EE | Robert D. Carr,
Ojas Parekh:
A 1/2-integral relaxation for the A-matching problem.
Oper. Res. Lett. 34(4): 445-450 (2006) |
| 2005 |
|---|
| 11 | EE | Bruce M. Maggs,
Gary L. Miller,
Ojas Parekh,
R. Ravi,
Shan Leung Maverick Woo:
Finding effective support-tree preconditioners.
SPAA 2005: 176-185 |
| 10 | EE | André Berger,
Ojas Parekh:
Linear Time Algorithms for Generalized Edge Dominating Set Problems.
WADS 2005: 233-243 |
| 2004 |
|---|
| 9 | EE | Jochen Könemann,
Yanjun Li,
Ojas Parekh,
Amitabh Sinha:
An approximation algorithm for the edge-dilation k-center problem, .
Oper. Res. Lett. 32(5): 491-495 (2004) |
| 2003 |
|---|
| 8 | EE | Jochen Könemann,
Goran Konjevod,
Ojas Parekh,
Amitabh Sinha:
Improved Approximations for Tour and Tree Covers.
Algorithmica 38(3): 441-449 (2003) |
| 7 | EE | Ojas Parekh:
Forestation in Hypergraphs: Linear k-Trees.
Electr. J. Comb. 10: (2003) |
| 2002 |
|---|
| 6 | EE | Eduardo Sany Laber,
Ojas Parekh,
R. Ravi:
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors.
ESA 2002: 649-661 |
| 5 | EE | Ojas Parekh:
Edge dominating and hypomatchable sets.
SODA 2002: 287-291 |
| 4 | EE | Jochen Könemann,
Yanjun Li,
Ojas Parekh,
Amitabh Sinha:
Approximation Algorithms for Edge-Dilation k-Center Problems.
SWAT 2002: 210-219 |
| 2001 |
|---|
| 3 | | 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.
J. Comb. Optim. 5(3): 317-326 (2001) |
| 2000 |
|---|
| 2 | EE | Jochen Könemann,
Goran Konjevod,
Ojas Parekh,
Amitabh Sinha:
Improved approximations for tour and tree covers.
APPROX 2000: 184-193 |
| 1 | | 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.
ESA 2000: 132-142 |
