dblp.uni-trier.dewww.uni-trier.de

Danny Segev Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
21EEAnupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev: Scheduling with Outliers. APPROX-RANDOM 2009: 149-162
20EEAnupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev: Scheduling with Outliers CoRR abs/0906.2020: (2009)
19EELeah 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
18EEChandra Chekuri, Guy Even, Anupam Gupta, Danny Segev: Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA 2008: 532-541
17EEOjas Parekh, Danny Segev: Path Hitting in Acyclic Graphs. Algorithmica 52(4): 466-486 (2008)
16EERefael Hassin, Danny Segev: Rounding to an integral program. Oper. Res. Lett. 36(3): 321-326 (2008)
2007
15EEIftah Gamzu, Danny Segev: Improved Online Algorithms for the Sorting Buffer Problem. STACS 2007: 658-669
14EEDan 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
13EERefael Hassin, Jérôme Monnot, Danny Segev: The Complexity of Bottleneck Labeled Graph Problems. WG 2007: 328-340
12EERefael 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
11EEJochen Könemann, Ojas Parekh, Danny Segev: A Unified Approach to Approximating Partial Covering Problems. ESA 2006: 468-479
10EEOjas Parekh, Danny Segev: Path Hitting in Acyclic Graphs. ESA 2006: 564-575
9EEDanny Segev, Gil Segev: Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing. ESA 2006: 600-611
8EERefael Hassin, Jérôme Monnot, Danny Segev: Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS 2006: 480-491
7EERefael Hassin, Danny Segev: Robust subgraphs for trees and paths. ACM Transactions on Algorithms 2(2): 263-281 (2006)
6EEAsaf Levin, Danny Segev: Partial multicuts in trees. Theor. Comput. Sci. 369(1-3): 384-395 (2006)
2005
5EERefael Hassin, Danny Segev: The Set Cover with Pairs Problem. FSTTCS 2005: 164-176
4EERefael Hassin, Danny Segev: The Multi-radius Cover Problem. WADS 2005: 24-35
3EEAsaf Levin, Danny Segev: Partial Multicuts in Trees. WAOA 2005: 320-333
2EERefael Hassin, Danny Segev: Rounding to an Integral Program. WEA 2005: 44-54
2004
1EERefael Hassin, Danny Segev: Robust Subgraphs for Trees and Paths. SWAT 2004: 51-63

Coauthor Index

1Chandra Chekuri [18]
2Leah Epstein [19]
3Guy Even [18]
4Dan Feldman [14]
5Amos Fiat [14]
6Iftah Gamzu [15]
7Anupam Gupta [18] [20] [21]
8Refael Hassin [1] [2] [4] [5] [7] [8] [12] [13] [16]
9Jochen Könemann [11]
10Ravishankar Krishnaswamy [20] [21]
11Amit Kumar [20] [21]
12Asaf Levin [3] [6] [19]
13Julián Mestre [19]
14Jérôme Monnot [8] [12] [13]
15Ojas Parekh [10] [11] [17]
16Gil Segev [9]
17Micha Sharir [14]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)