 | 2009 |
|---|
| 12 |       | Nir Halman,
Chung-Lun Li,
David Simchi-Levi:
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks.
Oper. Res. Lett. 37(4): 239-244 (2009) |
| 2008 |
|---|
| 11 | | Nir Halman,
Chung-Lun Li,
David Simchi-Levi:
Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks.
APPROX-RANDOM 2008: 91-103 |
| 10 | | Nir Halman,
Diego Klabjan,
Chung-Lun Li,
James B. Orlin,
David Simchi-Levi:
Fully polynomial time approximation schemes for stochastic dynamic programs.
SODA 2008: 700-709 |
| 9 | | Nir Halman:
Discrete and Lexicographic Helly-Type Theorems.
Discrete & Computational Geometry 39(4): 690-719 (2008) |
| 8 | | Nir Halman:
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model.
SIAM J. Comput. 38(1): 1-45 (2008) |
| 2007 |
|---|
| 7 | | Nir Halman:
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games are all LP-Type Problems.
Equilibrium Computation 2007 |
| 6 | | Nir Halman:
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems.
Algorithmica 49(1): 37-50 (2007) |
| 5 | | Nir Halman,
Shmuel Onn,
Uriel G. Rothblum:
The convex dimension of a graph.
Discrete Applied Mathematics 155(11): 1373-1383 (2007) |
| 2005 |
|---|
| 4 | | Arie Tamir,
Nir Halman:
One-way and round-trip center location problems.
Discrete Optimization 2(2): 168-184 (2005) |
| 2004 |
|---|
| 3 | | Nir Halman:
On the Power of Discrete and of Lexicographic Helly-Type Theorems.
FOCS 2004: 463-472 |
| 2 | | Nir Halman,
Arie Tamir:
Continuous bottleneck tree partitioning problems.
Discrete Applied Mathematics 140(1-3): 185-206 (2004) |
| 2003 |
|---|
| 1 | | Nir Halman:
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane.
Inf. Process. Lett. 86(3): 121-128 (2003) |
