![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 33 | Jochen Könemann, Ojas Parekh, Danny Segev: A Unified Approach to Approximating Partial Covering Problems. Algorithmica 59(4): 489-509 (2011) | |
| 17 | Ojas Parekh, Danny Segev: Path Hitting in Acyclic Graphs. Algorithmica 52(4): 466-486 (2008) | |
| 11 | Jochen Könemann, Ojas Parekh, Danny Segev: A Unified Approach to Approximating Partial Covering Problems. ESA 2006: 468-479 | |
| 10 | Ojas Parekh, Danny Segev: Path Hitting in Acyclic Graphs. ESA 2006: 564-575 |
Selection of 4 from 37 records - Danny Segev has 26 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page