Maximal Bootstrap Percolation Time on the Hypercube via Generalised Snake-in-the-Box. - Ivailo Hartarsky (Electron. J. Comb., 2018)

Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard. - Ivailo Hartarsky; Tamás Róbert Mezei (CoRR, 2018)

Strong Ramsey games in unbounded time. - Stefan David; Ivailo Hartarsky; Marius Tiba (Eur. J. Comb., 2020)

Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness. - Ivailo Hartarsky; Tamás Róbert Mezei (SIAM J. Discret. Math., 2020)

Refined universality for critical KCM: lower bounds. - Ivailo Hartarsky; Laure Marêché (Comb. Probab. Comput., 2022)

The Maximal Running Time of Hypergraph Bootstrap Percolation. - Ivailo Hartarsky; Lyuben Lichev (SIAM J. Discret. Math., 2024)