Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Danny Segev
2010 – today
- 2013
[j15]Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan: Approximation algorithms for orienting mixed graphs. Theor. Comput. Sci. 483: 96-103 (2013)- [c20]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann: Improved Bounds for Online Preemptive Matching. STACS 2013: 389-399
- 2012
- [c19]Dima Blokh, Danny Segev, Roded Sharan: Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations. CPM 2012: 70-82
- [i4]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann: Improved Bounds for Online Preemptive Matching. CoRR abs/1207.1788 (2012)
- 2011
- [j14]Jochen Könemann, Ojas Parekh, Danny Segev: A Unified Approach to Approximating Partial Covering Problems. Algorithmica 59(4): 489-509 (2011)
- [j13]Michael Elberfeld, Vineet Bafna, Iftah Gamzu, Alexander Medvedovsky, Danny Segev, Dana Silverbush, Uri Zwick, Roded Sharan: On the Approximability of Reachability-Preserving Network Orientations. Internet Mathematics 7(4): 209-232 (2011)
- [j12]Danny Segev: Approximating k-generalized connectivity via collapsing HSTs. J. Comb. Optim. 21(3): 364-382 (2011)
- [j11]Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev: Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. SIAM J. Discrete Math. 25(3): 1251-1265 (2011)
- [j10]Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev: Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Transactions on Algorithms 7(2): 18 (2011)
- [c18]Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan: Approximation Algorithms for Orienting Mixed Graphs. CPM 2011: 416-428
- 2010
- [j9]Danny Segev, Gil Segev: Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. Algorithmica 56(4): 529-549 (2010)
- [j8]Refael Hassin, Jérôme Monnot, Danny Segev: The Complexity of Bottleneck Labeled Graph Problems. Algorithmica 58(2): 245-262 (2010)
- [j7]Iftah Gamzu, Danny Segev: A polylogarithmic approximation for computing non-metric terminal Steiner trees. Inf. Process. Lett. 110(18-19): 826-829 (2010)
- [c17]Iftah Gamzu, Danny Segev: A Sublogarithmic Approximation for Highway and Tollbooth Pricing. ICALP (1) 2010: 582-593
- [c16]Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev: Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS 2010: 347-358
- [c15]Iftah Gamzu, Danny Segev, Roded Sharan: Improved Orientations of Physical Networks. WABI 2010: 215-225
- [i3]Iftah Gamzu, Danny Segev: A Sublogarithmic Approximation for Highway and Tollbooth Pricing. CoRR abs/1002.2084 (2010)
2000 – 2009
- 2009
- [j6]Iftah Gamzu, Danny Segev: Improved online algorithms for the sorting buffer problem on line metrics. ACM Transactions on Algorithms 6(1) (2009)
- [c14]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev: Scheduling with Outliers. APPROX-RANDOM 2009: 149-162
- [i2]Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev: Scheduling with Outliers. CoRR abs/0906.2020 (2009)
- [i1]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
- [j5]
- [j4]
- [c13]Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev: Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA 2008: 532-541
- 2007
- [j3]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)
- [c12]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
- [c11]Iftah Gamzu, Danny Segev: Improved Online Algorithms for the Sorting Buffer Problem. STACS 2007: 658-669
- [c10]Refael Hassin, Jérôme Monnot, Danny Segev: The Complexity of Bottleneck Labeled Graph Problems. WG 2007: 328-340
- 2006
- [j2]Refael Hassin, Danny Segev: Robust subgraphs for trees and paths. ACM Transactions on Algorithms 2(2): 263-281 (2006)
- [j1]
- [c9]Jochen Könemann, Ojas Parekh, Danny Segev: A Unified Approach to Approximating Partial Covering Problems. ESA 2006: 468-479
- [c8]
- [c7]
- [c6]Refael Hassin, Jérôme Monnot, Danny Segev: Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS 2006: 480-491
- 2005
- [c5]
- [c4]
- [c3]
- [c2]
- 2004
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-20 00:46 CEST by the dblp team