The following pages link to Lior Aronshtam (Q1943660):
Displaying 7 items.
- Collapsibility and vanishing of top homology in random simplicial complexes (Q1943661) (← links)
- Bounds on the average and minimum attendance in preference-based activity scheduling (Q2243142) (← links)
- Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis (Q2330543) (← links)
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? (Q2363601) (← links)
- The threshold for d-collapsibility in random complexes* (Q2795743) (← links)
- When does the top homology of a random simplicial complex vanish? (Q5175229) (← links)
- Perfect matching in bipartite hypergraphs subject to a demand graph (Q6099389) (← links)