A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane. - Nir Halman (Inf. Process. Lett., 2003)

On the Power of Discrete and of Lexicographic Helly-Type Theorems. - Nir Halman (FOCS, 2004)

Continuous bottleneck tree partitioning problems. - Nir Halman; Arie Tamir (Discret. Appl. Math., 2004)

One-way and round-trip center location problems. - Arie Tamir; Nir Halman (Discret. Optim., 2005)

Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems. - Nir Halman (Algorithmica, 2007)

The convex dimension of a graph. - Nir Halman; Shmuel Onn; Uriel G. Rothblum (Discret. Appl. Math., 2007)

Discrete and Lexicographic Helly-Type Theorems. - Nir Halman (Discret. Comput. Geom., 2008)

On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model. - Nir Halman (SIAM J. Comput., 2008)

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand. - Nir Halman; Diego Klabjan; Mohamed Mostagir; James B. Orlin; David Simchi-Levi (Math. Oper. Res., 2009)

Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks. - Nir Halman; Chung-Lun Li; David Simchi-Levi (Oper. Res. Lett., 2009)

Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle. - Nir Halman; James B. Orlin; David Simchi-Levi (Oper. Res., 2012)

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs. - Nir Halman; Diego Klabjan; Chung-Lun Li; James B. Orlin; David Simchi-Levi (SIAM J. Discret. Math., 2014)

Approximating convex functions via non-convex oracles under the relative noise model. - Nir Halman (Discret. Optim., 2015)

A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs. - Nir Halman; Giacomo Nannicini; James B. Orlin (SIAM J. Optim., 2015)

A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy. - Nir Halman (Theor. Comput. Sci., 2016)

On the complexity of energy storage problems. - Nir Halman; Giacomo Nannicini; James B. Orlin (Discret. Optim., 2018)

Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints. - Nir Halman; Hans Kellerer; Vitaly A. Strusevich (Eur. J. Oper. Res., 2018)

An FPTAS for the knapsack problem with parametric weights. - Nir Halman; Michael Holzhauser; Sven O. Krumke (Oper. Res. Lett., 2018)

The TV advertisements scheduling problem. - Fabián Díaz-Núñez; Nir Halman; Óscar C. Vásquez 001 (Optim. Lett., 2019)

Bi-criteria path problem with minimum length and maximum survival probability. - Nir Halman; Mikhail Y. Kovalyov; Alain Quilliot; Dvir Shabtay; Moshe Zofi (OR Spectr., 2019)

Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States. - Nir Halman; Giacomo Nannicini (SIAM J. Optim., 2019)

Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs. - Nir Halman (INFORMS J. Comput., 2020)

A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times. - Nir Halman (J. Sched., 2020)

A faster FPTAS for counting two-rowed contingency tables. - Tzvi Alon; Nir Halman (Discret. Appl. Math., 2021)

Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions. - Nir Halman; Shmuel Wimer (Inf. Process. Lett., 2021)

Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier. - Tzvi Alon; Nir Halman (SIAM J. Discret. Math., 2021)

Strongly Polynomial FPTASes for Monotone Dynamic Programs. - Tzvi Alon; Nir Halman (Algorithmica, 2022)

Fully polynomial time (Σ , Π )-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs. - Nir Halman; Giacomo Nannicini (Math. Program., 2022)

An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences. - Nir Halman; Uriel Vinetz (Optim. Lett., 2022)

Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint. - Nir Halman; Mikhail Y. Kovalyov; Alain Quilliot (4OR, 2023)

Knapsack problems with position-dependent item weights or profits. - Stanislaw Gawiejnowicz; Nir Halman; Hans Kellerer (Ann. Oper. Res., 2023)

Packing squares independently. - Wei Wu 017; Hiroki Numaguchi; Nir Halman; Yannan Hu; Mutsunori Yagiura (Theor. Comput. Sci., 2025)