Nir Halman

514 total citations
35 papers, 290 citations indexed

About

Nir Halman is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Nir Halman has authored 35 papers receiving a total of 290 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computer Networks and Communications, 14 papers in Industrial and Manufacturing Engineering and 11 papers in Computational Theory and Mathematics. Recurrent topics in Nir Halman's work include Optimization and Search Problems (14 papers), Scheduling and Optimization Algorithms (9 papers) and Complexity and Algorithms in Graphs (9 papers). Nir Halman is often cited by papers focused on Optimization and Search Problems (14 papers), Scheduling and Optimization Algorithms (9 papers) and Complexity and Algorithms in Graphs (9 papers). Nir Halman collaborates with scholars based in Israel, United States and Hong Kong. Nir Halman's co-authors include David Simchi‐Levi, James B. Orlin, Diego Klabjan, Mohamed Mostagir, Chung‐Lun Li, Arie Tamir, Giacomo Nannicini, Shmuel Onn, Hans Kellerer and Uriel G. Rothblum and has published in prestigious journals such as European Journal of Operational Research, Operations Research and Mathematical Programming.

In The Last Decade

Nir Halman

31 papers receiving 258 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Nir Halman Israel 9 129 98 80 77 53 35 290
Tjark Vredeveld Netherlands 10 136 1.1× 180 1.8× 146 1.8× 33 0.4× 24 0.5× 35 309
Dong X. Shaw United States 8 186 1.4× 101 1.0× 143 1.8× 151 2.0× 40 0.8× 15 426
Will Ma United States 9 55 0.4× 121 1.2× 114 1.4× 99 1.3× 29 0.5× 51 336
Vladimir Emelichev Belarus 9 187 1.4× 33 0.3× 61 0.8× 15 0.2× 94 1.8× 98 396
David Bergman United States 11 132 1.0× 105 1.1× 48 0.6× 21 0.3× 92 1.7× 34 303
Christian Raack Germany 12 92 0.7× 198 2.0× 74 0.9× 23 0.3× 43 0.8× 30 500
Zoya Svitkina United States 9 41 0.3× 103 1.1× 59 0.7× 10 0.1× 57 1.1× 17 218
Joachim Schauer Austria 11 185 1.4× 136 1.4× 65 0.8× 8 0.1× 119 2.2× 23 353
Chenchen Wu China 8 121 0.9× 97 1.0× 16 0.2× 25 0.3× 44 0.8× 53 230
Kavindra Malik United States 6 150 1.2× 121 1.2× 22 0.3× 42 0.5× 116 2.2× 11 372

Countries citing papers authored by Nir Halman

Since Specialization
Citations

This map shows the geographic impact of Nir Halman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Nir Halman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nir Halman more than expected).

Fields of papers citing papers by Nir Halman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Nir Halman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Nir Halman. The network helps show where Nir Halman may publish in the future.

Co-authorship network of co-authors of Nir Halman

This figure shows the co-authorship network connecting the top 25 collaborators of Nir Halman. A scholar is included among the top collaborators of Nir Halman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Nir Halman. Nir Halman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Gawiejnowicz, Stanisław, Nir Halman, & Hans Kellerer. (2023). Knapsack problems with position-dependent item weights or profits. Annals of Operations Research. 326(1). 137–156. 1 indexed citations
2.
Halman, Nir, et al.. (2022). Strongly Polynomial FPTASes for Monotone Dynamic Programs. Algorithmica. 84(10). 2785–2819. 4 indexed citations
3.
Halman, Nir & Shmuel Wimer. (2021). Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions. Information Processing Letters. 170. 106114–106114.
4.
Halman, Nir, et al.. (2021). An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences. Optimization Letters. 16(4). 1181–1196. 1 indexed citations
5.
Halman, Nir, et al.. (2020). A faster FPTAS for counting two-rowed contingency tables. Discrete Applied Mathematics. 303. 161–170. 1 indexed citations
6.
7.
Halman, Nir, et al.. (2018). The TV advertisements scheduling problem. Optimization Letters. 13(1). 81–94. 7 indexed citations
8.
Halman, Nir, et al.. (2018). An FPTAS for the knapsack problem with parametric weights. Operations Research Letters. 46(5). 487–491. 7 indexed citations
9.
Halman, Nir, Hans Kellerer, & Vitaly A. Strusevich. (2018). Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints. European Journal of Operational Research. 270(2). 435–447. 7 indexed citations
10.
Halman, Nir, Giacomo Nannicini, & James B. Orlin. (2017). On the complexity of energy storage problems. Discrete Optimization. 28. 31–53. 10 indexed citations
11.
Halman, Nir. (2016). A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy. Theoretical Computer Science. 645. 41–47. 8 indexed citations
12.
Halman, Nir. (2015). Approximating convex functions via non-convex oracles under the relative noise model. Discrete Optimization. 16. 1–16. 4 indexed citations
13.
Halman, Nir, James B. Orlin, & David Simchi‐Levi. (2012). Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle. Operations Research. 60(2). 429–446. 23 indexed citations
14.
Halman, Nir, Shmuel Onn, & Uriel G. Rothblum. (2007). The convex dimension of a graph. Discrete Applied Mathematics. 155(11). 1373–1383. 9 indexed citations
15.
Halman, Nir. (2007). Discrete and Lexicographic Helly-Type Theorems. Discrete & Computational Geometry. 39(4). 690–719. 1 indexed citations
16.
Halman, Nir. (2007). Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems. Algorithmica. 49(1). 37–50. 16 indexed citations
17.
Orlin, James B., Nir Halman, Diego Klabjan, Mohamed Mostagir, & David Simchi‐Levi. (2006). A Fully Polynomial Time Approximation Scheme for Single-Item Stochastic Lot-Sizing Problems with Discrete Demand. SSRN Electronic Journal. 8 indexed citations
18.
Tamir, Arie & Nir Halman. (2005). One-way and round-trip center location problems. Discrete Optimization. 2(2). 168–184. 21 indexed citations
19.
Halman, Nir & Arie Tamir. (2003). Continuous bottleneck tree partitioning problems. Discrete Applied Mathematics. 140(1-3). 185–206. 1 indexed citations
20.
Halman, Nir. (2003). A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane. Information Processing Letters. 86(3). 121–128. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Tjark Vredeveld Breakdown of academic impact, for papers by Dong X. Shaw Breakdown of academic impact, for papers by Will Ma Breakdown of academic impact, for papers by Vladimir Emelichev Breakdown of academic impact, for papers by David Bergman Breakdown of academic impact, for papers by Christian Raack Breakdown of academic impact, for papers by Zoya Svitkina Breakdown of academic impact, for papers by Joachim Schauer Breakdown of academic impact, for papers by Chenchen Wu Breakdown of academic impact, for papers by Kavindra Malik
Rankless by CCL
2026