Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes. - Lior Aronshtam; Nathan Linial; Tomasz Luczak 001; Roy Meshulam (Discret. Comput. Geom., 2013)

Random simplicial complexes (שער נוסף בעברית: קומפלקסים סימפליציאליים מקריים.). - Lior Aronshtam (2013)

When does the top homology of a random simplicial complex vanish? - Lior Aronshtam; Nathan Linial (Random Struct. Algorithms, 2015)

The threshold for d-collapsibility in random complexes. - Lior Aronshtam; Nathan Linial (Random Struct. Algorithms, 2016)

Tennis manipulation: can we help serena williams win another tournament? - Or can we control a knockout tournament with reasonable complexity? - Lior Aronshtam; Havatzelet Cohen; Tammar Shrot (Ann. Math. Artif. Intell., 2017)

Grading scale model for knowledge based repositories. - Lior Aronshtam; Havatzelet Cohen; Dov Sohacheski; Shlomo Mark (J. Comput. Methods Sci. Eng., 2018)

Controlling sub-tournaments: easy or hard problem? - Theoretical vs. practical analysis. - Noa Eidelstein; Lior Aronshtam; Eitan Eidelstein; Tammar Shrot (Ann. Math. Artif. Intell., 2019)

Can we do better? a classification of algorithm run-time-complexity improvement using the SOLO taxonomy. - Lior Aronshtam; Tammar Shrot; Ronit Shmallo (Educ. Inf. Technol., 2021)

Bounds on the average and minimum attendance in preference-based activity scheduling. - Lior Aronshtam; Hagai Ilani (Discret. Appl. Math., 2022)

Perfect matching in bipartite hypergraphs subject to a demand graph. - Lior Aronshtam; Hagai Ilani; Elad Shufan (Ann. Oper. Res., 2023)