Ivailo Hartarsky

According to our database, Ivailo Hartarsky authored at least 6 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

The Maximal Running Time of Hypergraph Bootstrap Percolation.

Ivailo Hartarsky, Lyuben Lichev

SIAM J. Discret. Math., 2024

2022

Refined universality for critical KCM: lower bounds.

Ivailo Hartarsky, Laure Marêché

Comb. Probab. Comput., 2022

2020

Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness.

Ivailo Hartarsky, Tamás Róbert Mezei

SIAM J. Discret. Math., 2020

Strong Ramsey games in unbounded time.

Stefan David, Ivailo Hartarsky, Marius Tiba

Eur. J. Comb., 2020

2018

Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard.

Ivailo Hartarsky, Tamás Róbert Mezei

CoRR, 2018

Maximal Bootstrap Percolation Time on the Hypercube via Generalised Snake-in-the-Box.

Ivailo Hartarsky

Electron. J. Comb., 2018