The Set Cover with Pairs Problem. - Refael Hassin; Danny Segev (FSTTCS, 2005)

The Multi-radius Cover Problem. - Refael Hassin; Danny Segev (WADS, 2005)

Robust subgraphs for trees and paths. - Refael Hassin; Danny Segev (ACM Trans. Algorithms, 2006)

Partial multicuts in trees. - Asaf Levin; Danny Segev (Theor. Comput. Sci., 2006)

Bi-criteria linear-time approximations for generalized k-mean/median/center. - Dan Feldman; Amos Fiat; Micha Sharir; Danny Segev (SCG, 2007)

Improved Online Algorithms for the Sorting Buffer Problem. - Iftah Gamzu; Danny Segev (STACS, 2007)

Approximation algorithms and hardness results for labeled connectivity problems. - Refael Hassin; Jérôme Monnot; Danny Segev (J. Comb. Optim., 2007)

Approximation algorithms for NP-hard problems in combinatorial optimization - Danny Segev (2007)

Path Hitting in Acyclic Graphs. - Ojas Parekh; Danny Segev (Algorithmica, 2008)

Rounding to an integral program. - Refael Hassin; Danny Segev (Oper. Res. Lett., 2008)

Scheduling with Outliers. - Anupam Gupta 001; Ravishankar Krishnaswamy; Amit Kumar 001; Danny Segev (APPROX-RANDOM, 2009)

Improved online algorithms for the sorting buffer problem on line metrics. - Iftah Gamzu; Danny Segev (ACM Trans. Algorithms, 2009)

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

Improved Orientations of Physical Networks. - Iftah Gamzu; Danny Segev; Roded Sharan (WABI, 2010)

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

Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. - Danny Segev; Gil Segev 001 (Algorithmica, 2010)

A polylogarithmic approximation for computing non-metric terminal Steiner trees. - Iftah Gamzu; Danny Segev (Inf. Process. Lett., 2010)

A Unified Approach to Approximating Partial Covering Problems. - Jochen Könemann; Ojas Parekh; Danny Segev (Algorithmica, 2011)

On the Approximability of Reachability-Preserving Network Orientations. - Michael Elberfeld; Vineet Bafna; Iftah Gamzu; Alexander Medvedovsky; Danny Segev; Dana Silverbush; Uri Zwick; Roded Sharan (Internet Math., 2011)

Approximating k-generalized connectivity via collapsing HSTs. - Danny Segev (J. Comb. Optim., 2011)

Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. - Leah Epstein; Asaf Levin; Julián Mestre; Danny Segev (SIAM J. Discret. Math., 2011)

Set connectivity problems in undirected graphs and the directed steiner network problem. - Chandra Chekuri; Guy Even; Anupam Gupta 001; Danny Segev (ACM Trans. Algorithms, 2011)

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations. - Dima Blokh; Danny Segev; Roded Sharan (CPM, 2012)

Improved Bounds for Online Preemptive Matching. - Leah Epstein; Asaf Levin; Danny Segev; Oren Weimann (STACS, 2013)

The Approximability of Shortest Path-Based Graph Orientations of Protein-Protein Interaction Networks. - Dima Blokh; Danny Segev; Roded Sharan (J. Comput. Biol., 2013)

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

Mobile facility location: combinatorial filtering via weighted occupancy. - Amitai Armon; Iftah Gamzu; Danny Segev (J. Comb. Optim., 2014)

An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem. - Danny Segev (Math. Oper. Res., 2014)

Assortment Optimization Under the Mallows model. - Antoine Désir; Vineet Goyal; Srikanth Jagabathula; Danny Segev (NIPS, 2016)

Assortment Optimization under a Random Swap based Distribution over Permutations Model. - Antoine Désir; Vineet Goyal; Danny Segev (EC, 2016)

Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand. - Vineet Goyal; Retsef Levi; Danny Segev (Oper. Res., 2016)

The Approximability of Partial Vertex Covers in Trees. - Vahan Mkrtchyan; Ojas Parekh; Danny Segev; K. Subramani 001 (SOFSEM, 2017)

A Sublogarithmic Approximation for Tollbooth Pricing on Trees. - Iftah Gamzu; Danny Segev (Math. Oper. Res., 2017)

Improved bounds for randomized preemptive online matching. - Leah Epstein; Asaf Levin; Danny Segev; Oren Weimann (Inf. Comput., 2018)

The Approximability of Assortment Optimization Under Ranking Preferences. - Ali Aouad; Vivek F. Farias; Retsef Levi; Danny Segev (Oper. Res., 2018)

Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences. - Ali Aouad; Retsef Levi; Danny Segev (Oper. Res., 2018)

Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. - Niv Buchbinder; Danny Segev; Yevgeny Tkach (Algorithmica, 2019)

Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States? - Danny Segev (Algorithmica, 2019)

Scheduling Promotion Vehicles to Boost Profits. - Lennart Baardman; Maxime C. Cohen; Kiran Panchamgam; Georgia Perakis; Danny Segev (Manag. Sci., 2019)

Approximation Algorithms for Dynamic Assortment Optimization Models. - Ali Aouad; Retsef Levi; Danny Segev (Math. Oper. Res., 2019)

The ordered k-median problem: surrogate models and approximation algorithms. - Ali Aouad; Danny Segev (Math. Program., 2019)

A polynomial-time approximation scheme for the airplane refueling problem. - Iftah Gamzu; Danny Segev (J. Sched., 2019)

The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures. - Refael Hassin; R. Ravi 001; F. Sibel Salman; Danny Segev (Algorithmica, 2020)

An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem. - Ali Aouad; Danny Segev (CoRR, 2020)

Constrained Assortment Optimization Under the Markov Chain-based Choice Model. - Antoine Désir; Vineet Goyal; Danny Segev; Chun Ye (Manag. Sci., 2020)

Efficient Approximation Schemes for Stochastic Probing and Prophet Problems. - Danny Segev; Sahil Singla 001 (EC, 2021)

Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice. - Antoine Désir; Vineet Goyal; Srikanth Jagabathula; Danny Segev (Oper. Res., 2021)

Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences. - Ali Aouad; Danny Segev (Manag. Sci., 2021)

Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers. - Danny Segev (CoRR, 2022)

A Constructive Prophet Inequality Approach to The Adaptive ProbeMax Problem. - Guillermo Gallego 001; Danny Segev (CoRR, 2022)

Technical Note - The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays. - Jacob B. Feldman; Danny Segev (Oper. Res., 2022)

Technical Note - Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model. - Danny Segev (Oper. Res., 2022)

A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems. - Danny Segev; Yaron Shaposhnik (Oper. Res., 2022)

The Continuous-Time Joint Replenishment Problem: ε-Optimal Policies via Pairwise Alignment. - Danny Segev (CoRR, 2023)

Approximation algorithms for the generalized incremental knapsack problem. - Yuri Faenza; Danny Segev; Lingyi Zhang (Math. Program., 2023)

The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model? - Ali Aouad; Jacob B. Feldman; Danny Segev (Manag. Sci., 2023)

The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications. - Ali Aouad; Danny Segev (Oper. Res., 2023)

Technical Note - An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem. - Ali Aouad; Danny Segev (Oper. Res., 2023)

Improved Approximation Guarantees for Joint Replenishment in Continuous Time. - Danny Segev (CoRR, 2024)

Revenue Maximization in Choice-Based Matching Markets. - Dan Nissim; Danny Segev; Alfredo Torrico (CoRR, 2024)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem. - Danny Segev (CoRR, 2024)

Assortment Optimization Under the Multi-Purchase Multinomial Logit Choice Model. - Yicheng Bai; Jacob B. Feldman; Danny Segev; Huseyin Topaloglu; Laura Wagner (Oper. Res., 2024)

Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings. - Alon Rieger; Danny Segev (Math. Program., 2024)

The Continuous-Time Joint Replenishment Problem: ϵ-Optimal Policies via Pairwise Alignment. - Danny Segev (Manag. Sci., 2025)

Dynamic Pricing with Menu Costs: Approximation Schemes and Applications to Grocery Retail. - Jacob B. Feldman; Danny Segev (Manuf. Serv. Oper. Manag., 2025)

New Approximation Guarantees for The Inventory Staggering Problem. - Noga Alon; Danny Segev (CoRR, 2025)

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time. - Danny Segev (CoRR, 2025)