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 |