| 2017 | ESA | Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. | Niv Buchbinder, Danny Segev, Yevgeny Tkach |
| 2017 | SOFSEM | The Approximability of Partial Vertex Covers in Trees. | Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani |
| 2013 | STACS | Improved Bounds for Online Preemptive Matching. | Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann |
| 2012 | CPM | Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations. | Dima Blokh, Danny Segev, Roded Sharan |
| 2011 | CPM | Approximation Algorithms for Orienting Mixed Graphs. | Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan |
| 2010 | ICALP | A Sublogarithmic Approximation for Highway and Tollbooth Pricing. | Iftah Gamzu, Danny Segev |
| 2010 | STACS | Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. | Leah Epstein, Asaf Levin, Julin Mestre, Danny Segev |
| 2010 | WABI | Improved Orientations of Physical Networks. | Iftah Gamzu, Danny Segev, Roded Sharan |
| 2008 | SODA | Set connectivity problems in undirected graphs and the directed Steiner network problem. | Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev |
| 2007 | STACS | Improved Online Algorithms for the Sorting Buffer Problem. | Iftah Gamzu, Danny Segev |
| 2007 | WG | The Complexity of Bottleneck Labeled Graph Problems. | Refael Hassin, Jrme Monnot, Danny Segev |
| 2006 | ESA | A Unified Approach to Approximating Partial Covering Problems. | Jochen Knemann, Ojas Parekh, Danny Segev |
| 2006 | ESA | Path Hitting in Acyclic Graphs. | Ojas Parekh, Danny Segev |
| 2006 | ESA | Approximate | Danny Segev, Gil Segev |
| 2006 | MFCS | Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. | Refael Hassin, Jrme Monnot, Danny Segev |
| 2005 | WADS | The Multi-radius Cover Problem. | Refael Hassin, Danny Segev |
| 2005 | WAOA | Partial Multicuts in Trees. | Asaf Levin, Danny Segev |