ד"ר ליאור ארונשטם

Aronshtam, L.; Sand, B.; Shrot, T.; Cohen, R.; Levin, C.; Daltrophe, H. Optimal Route Crowd-Shipping System for Sustainable Rapid Delivery: Algorithm, Simulation, and Feasibility Evaluation. Future Transp. 2024, 4, 1-14.

Aronshtam, L., Ilani, H. & Shufan, E. Perfect matching in bipartite hypergraphs subject to a demand graph. Ann Oper Res 321, 39–48 (2023).

H. Ilani ,E. Shufan, L. Hadad and L. Aronshtam, New directions in the house allocation problem, The 10th National Industrial Engineering and Management Research Conference, April 2022

Aronshtam, L. & Ilani, H. (2022). Bounds on the average and minimum attendance in preference-based activity scheduling. Discrete Applied Mathematics, 306, 114-119

Aronshtam, L., Shrot, T., & Shmallo, R. (2021). Can we do better? a classification of algorithm run-time-complexity improvement using the SOLO taxonomy. Education and Information Technologies, 1-22

Eidelstein, N., Aronshtam, L., Eidelstein, E., & Shrot, T. (2019). Controlling sub-tournaments: easy or hard problem?. Annals of Mathematics and Artificial Intelligence, 86(4), 257-268

L. Aronshtam, H. Ilani, E. Shufan, Satisfying Allocation of Plots to Tenants, MISTA Ningbo, China. December 12-15, 2019

Shmallo, R., Shrot, T., & Aronshtam, L. (2019). The effects of applying assessment for and as learning in theoretical engineering courses. The International journal of engineering education, 35(4), 1064-1073

T. Shrot , R. Shmallo, L. Aronshtam, The PO Approach: What Changes are Required?. Proceedings of the 13th International Conference on Education, Teaching & Learning. (ICE19Swiss Conference). Zurich, Switzerland. July 12-14, 2019

Aronshtam, L., Cohen, H., Sohacheski, D., & Mark, S. (2018). Grading scale model for knowledge based repositories. Journal of Computational Methods in Sciences and Engineering, 18(4), 931-938

Aronshtam, L., Cohen, H., & Shrot, T. (2017). Tennis manipulation: can we help serena williams win another tournament?. Annals of Mathematics and Artificial Intelligence, 80(2), 153-169

Aronshtam, L., & Linial, N. (2016). The threshold for d‐collapsibility in random complexes. Random Structures & Algorithms, 48(2), 260-269

H. Cohen, L. Aronshtam, A Mathematical Model For The Reuse of Testing Artifacts, SCE May 2016- AISTQ

Aronshtam, L., & Linial, N. (2015). When does the top homology of a random simplicial complex vanish?. Random Structures & Algorithms, 46(1), 26-35

Aronshtam, L., Linial, N., Łuczak, T., & Meshulam, R. (2013). Collapsibility and vanishing of top homology in random simplicial complexes. Discrete & Computational Geometry, 49(2), 317-334