Danny Segev

Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan: Approximation algorithms for orienting mixed graphs. Theor. Comput. Sci. 483: 96-103 (2013)

Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann: Improved Bounds for Online Preemptive Matching. STACS 2013: 389-399

Dima Blokh, Danny Segev, Roded Sharan: Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations. CPM 2012: 70-82

Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann: Improved Bounds for Online Preemptive Matching. CoRR abs/1207.1788 (2012)

Jochen Könemann, Ojas Parekh, Danny Segev: A Unified Approach to Approximating Partial Covering Problems. Algorithmica 59(4): 489-509 (2011)

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)

Danny Segev: Approximating k-generalized connectivity via collapsing HSTs. J. Comb. Optim. 21(3): 364-382 (2011)

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)

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)

Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan: Approximation Algorithms for Orienting Mixed Graphs. CPM 2011: 416-428

Danny Segev, Gil Segev: Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. Algorithmica 56(4): 529-549 (2010)

Refael Hassin, Jérôme Monnot, Danny Segev: The Complexity of Bottleneck Labeled Graph Problems. Algorithmica 58(2): 245-262 (2010)

Iftah Gamzu, Danny Segev: A polylogarithmic approximation for computing non-metric terminal Steiner trees. Inf. Process. Lett. 110(18-19): 826-829 (2010)

Iftah Gamzu, Danny Segev: A Sublogarithmic Approximation for Highway and Tollbooth Pricing. ICALP (1) 2010: 582-593

Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev: Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS 2010: 347-358

Iftah Gamzu, Danny Segev, Roded Sharan: Improved Orientations of Physical Networks. WABI 2010: 215-225

Iftah Gamzu, Danny Segev: A Sublogarithmic Approximation for Highway and Tollbooth Pricing. CoRR abs/1002.2084 (2010)

Iftah Gamzu, Danny Segev: Improved online algorithms for the sorting buffer problem on line metrics. ACM Transactions on Algorithms 6(1) (2009)

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

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

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)

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

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

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

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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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