Lior Aronshtam

According to our database, Lior Aronshtam authored at least 10 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Perfect matching in bipartite hypergraphs subject to a demand graph.

Lior Aronshtam, Hagai Ilani, Elad Shufan

Ann. Oper. Res., February, 2023

2022

Bounds on the average and minimum attendance in preference-based activity scheduling.

Lior Aronshtam, Hagai Ilani

Discret. Appl. Math., 2022

2021

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

2019

Controlling sub-tournaments: easy or hard problem? - Theoretical vs. practical analysis.

Noa Eidelstein, Lior Aronshtam, Eitan Eidelstein, Tammar Shrot

Ann. Math. Artif. Intell., 2019

2018

Grading scale model for knowledge based repositories.

Lior Aronshtam, Havatzelet Cohen, Dov Sohacheski, Shlomo Mark

J. Comput. Methods Sci. Eng., 2018

2017

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

2016

The threshold for d-collapsibility in random complexes.

Lior Aronshtam, Nathan Linial

Random Struct. Algorithms, 2016

2015

When does the top homology of a random simplicial complex vanish?

Lior Aronshtam, Nathan Linial

Random Struct. Algorithms, 2015

2013

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

Lior Aronshtam

PhD thesis, 2013

Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes.

Lior Aronshtam, Nathan Linial, Tomasz Luczak, Roy Meshulam

Discret. Comput. Geom., 2013