Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

* | 2009 | |
---|---|---|

21 | EE | Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev: Scheduling with Outliers. APPROX-RANDOM 2009: 149-162 |

20 | EE | Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev: Scheduling with Outliers CoRR abs/0906.2020: (2009) |

19 | EE | Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev: Improved approximation guarantees for weighted matching in the semi-streaming model CoRR abs/0907.0305: (2009) |

2008 | ||

18 | EE | Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev: Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA 2008: 532-541 |

17 | EE | Ojas Parekh, Danny Segev: Path Hitting in Acyclic Graphs. Algorithmica 52(4): 466-486 (2008) |

16 | EE | Refael Hassin, Danny Segev: Rounding to an integral program. Oper. Res. Lett. 36(3): 321-326 (2008) |

2007 | ||

15 | EE | Iftah Gamzu, Danny Segev: Improved Online Algorithms for the Sorting Buffer Problem. STACS 2007: 658-669 |

14 | EE | Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev: Bi-criteria linear-time approximations for generalized k-mean/median/center. Symposium on Computational Geometry 2007: 19-26 |

13 | EE | Refael Hassin, Jérôme Monnot, Danny Segev: The Complexity of Bottleneck Labeled Graph Problems. WG 2007: 328-340 |

12 | EE | Refael Hassin, Jérôme Monnot, Danny Segev: Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. 14(4): 437-453 (2007) |

2006 | ||

11 | EE | Jochen Könemann, Ojas Parekh, Danny Segev: A Unified Approach to Approximating Partial Covering Problems. ESA 2006: 468-479 |

10 | EE | Ojas Parekh, Danny Segev: Path Hitting in Acyclic Graphs. ESA 2006: 564-575 |

9 | EE | Danny Segev,
Gil Segev:
Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing.
ESA 2006: 600-611 |

8 | EE | Refael Hassin, Jérôme Monnot, Danny Segev: Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS 2006: 480-491 |

7 | EE | Refael Hassin, Danny Segev: Robust subgraphs for trees and paths. ACM Transactions on Algorithms 2(2): 263-281 (2006) |

6 | EE | Asaf Levin, Danny Segev: Partial multicuts in trees. Theor. Comput. Sci. 369(1-3): 384-395 (2006) |

2005 | ||

5 | EE | Refael Hassin, Danny Segev: The Set Cover with Pairs Problem. FSTTCS 2005: 164-176 |

4 | EE | Refael Hassin, Danny Segev: The Multi-radius Cover Problem. WADS 2005: 24-35 |

3 | EE | Asaf Levin, Danny Segev: Partial Multicuts in Trees. WAOA 2005: 320-333 |

2 | EE | Refael Hassin, Danny Segev: Rounding to an Integral Program. WEA 2005: 44-54 |

2004 | ||

1 | EE | Refael Hassin, Danny Segev: Robust Subgraphs for Trees and Paths. SWAT 2004: 51-63 |

1 | Chandra Chekuri | [18] |

2 | Leah Epstein | [19] |

3 | Guy Even | [18] |

4 | Dan Feldman | [14] |

5 | Amos Fiat | [14] |

6 | Iftah Gamzu | [15] |

7 | Anupam Gupta | [18] [20] [21] |

8 | Refael Hassin | [1] [2] [4] [5] [7] [8] [12] [13] [16] |

9 | Jochen Könemann | [11] |

10 | Ravishankar Krishnaswamy | [20] [21] |

11 | Amit Kumar | [20] [21] |

12 | Asaf Levin | [3] [6] [19] |

13 | Julián Mestre | [19] |

14 | Jérôme Monnot | [8] [12] [13] |

15 | Ojas Parekh | [10] [11] [17] |

16 | Gil Segev | [9] |

17 | Micha Sharir | [14] |