Tami Tamir

1.7k total citations
56 papers, 798 citations indexed

About

Tami Tamir is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Management Science and Operations Research. According to data from OpenAlex, Tami Tamir has authored 56 papers receiving a total of 798 indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Computer Networks and Communications, 21 papers in Industrial and Manufacturing Engineering and 15 papers in Management Science and Operations Research. Recurrent topics in Tami Tamir's work include Optimization and Search Problems (35 papers), Game Theory and Applications (13 papers) and Scheduling and Optimization Algorithms (13 papers). Tami Tamir is often cited by papers focused on Optimization and Search Problems (35 papers), Game Theory and Applications (13 papers) and Scheduling and Optimization Algorithms (13 papers). Tami Tamir collaborates with scholars based in Israel, United States and Netherlands. Tami Tamir's co-authors include Hadas Shachnai, Ariel Kulik, Richard E. Ladner, David Kempe, Anna R. Karlin, Michal Feldman, Amotz Bar-Noy, László Lovász, Nicholas J. A. Harvey and Hagit Attiya and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Operations Research.

In The Last Decade

Tami Tamir

48 papers receiving 775 citations

Peers

Tami Tamir

CNC

IME

CTM

MSOR

Stavros G. Kolliopoulos Canada

Morteza Zadimoghaddam United States

Orli Waarts United States

Ari Freund Israel

MohammadHossein Bateni United States

Debmalya Panigrahi United States

Jeffrey M. Jaffe United States

Yishay Mansour Israel

Gianlorenzo D’Angelo Italy

Helmut Simonis Ireland

Stavros G. Kolliopoulos Canada

Tami Tamir

370 ×0.7

CNC

220 ×0.9

IME

156 ×0.9

CTM

102 ×0.7

MSOR

40 ×0.4

Citations per year, relative to Tami Tamir Tami Tamir (= 1×) peers Stavros G. Kolliopoulos

Countries citing papers authored by Tami Tamir

Since Specialization

Citations

This map shows the geographic impact of Tami Tamir'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 Tami Tamir with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tami Tamir more than expected).

Fields of papers citing papers by Tami Tamir

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tami Tamir. 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 Tami Tamir. The network helps show where Tami Tamir may publish in the future.

Co-authorship network of co-authors of Tami Tamir

This figure shows the co-authorship network connecting the top 25 collaborators of Tami Tamir. A scholar is included among the top collaborators of Tami Tamir 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 Tami Tamir. Tami Tamir is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Tamir, Tami, et al.. (2025). Cost-sharing games with rank-based utilities. Theoretical Computer Science. 1039. 115186–115186.

Dadush, Daniel, Martin Milanič, & Tami Tamir. (2024). Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. ACM Transactions on Algorithms. 20(3). 1–2.

Tamir, Tami, et al.. (2024). Minimizing total completion time with machine-dependent priority lists. European Journal of Operational Research. 315(3). 844–854.

Tamir, Tami, et al.. (2023). Scheduling games with rank-based utilities. Games and Economic Behavior. 140. 229–252. 1 indexed citations

Tamir, Tami, et al.. (2021). Scheduling games with machine-dependent priority lists. Research Publications (Maastricht University). 1 indexed citations

Tamir, Tami, et al.. (2016). Load rebalancing games in dynamic systems with migration costs. Theoretical Computer Science. 622. 16–33. 3 indexed citations

Tamir, Tami, et al.. (2016). Cost-sharing scheduling games on restricted unrelated machines. Theoretical Computer Science. 646. 26–39. 9 indexed citations

Kulik, Ariel, Hadas Shachnai, & Tami Tamir. (2013). Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints. Mathematics of Operations Research. 38(4). 729–739. 47 indexed citations

Tamir, Tami, et al.. (2012). Online algorithm for battery utilization in electric vehicles. Federated Conference on Computer Science and Information Systems. 349–356. 2 indexed citations

10.

Shachnai, Hadas, et al.. (2012). Minimal cost reconfiguration of data placement in a storage area network. Theoretical Computer Science. 460. 42–53. 8 indexed citations

11.

Kupferman, Orna & Tami Tamir. (2011). Coping with selfish on-going behaviors. Information and Computation. 210. 1–12. 2 indexed citations

12.

Flammini, Michele, Gianpiero Monaco, Luca Moscardelli, et al.. (2010). Minimizing total busy time in parallel scheduling with application to optical networks. Theoretical Computer Science. 411(40-42). 3553–3562. 28 indexed citations

13.

Kulik, Ariel, Hadas Shachnai, & Tami Tamir. (2009). Maximizing submodular set functions subject to multiple linear constraints. Symposium on Discrete Algorithms. 545–554. 78 indexed citations

14.

Sgall, Jiřı́, Hadas Shachnai, & Tami Tamir. (2009). Periodic scheduling with obligatory vacations. Theoretical Computer Science. 410(47-49). 5112–5121. 3 indexed citations

15.

Bar-Noy, Amotz, Richard E. Ladner, & Tami Tamir. (2008). Optimal delay for media-on-demand with pre-loading and pre-buffering. Theoretical Computer Science. 399(1-2). 3–11. 5 indexed citations

16.

Shachnai, Hadas, et al.. (2007). Approximation Schemes for Packing with Item Fragmentation. Theory of Computing Systems. 43(1). 81–98. 27 indexed citations

17.

Shachnai, Hadas, Tami Tamir, & Gerhard J. Woeginger. (2005). Minimizing Makespan and Preemption Costs on a System of Uniform Machines. Algorithmica. 42(3-4). 309–334. 12 indexed citations

18.

Bar-Noy, Amotz, Richard E. Ladner, & Tami Tamir. (2004). Windows scheduling as a restricted version of Bin Packing. Symposium on Discrete Algorithms. 224–233. 8 indexed citations

19.

Shachnai, Hadas & Tami Tamir. (2004). Tight bounds for online class-constrained packing. Theoretical Computer Science. 321(1). 103–123. 16 indexed citations

20.

Bar-Noy, Amotz, Richard E. Ladner, & Tami Tamir. (2003). Scheduling techniques for media-on-demand. Symposium on Discrete Algorithms. 791–800. 18 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