D. Brosch, M. Laurent, A. Steenkamp, “Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling”, SIAM J. Optim., 31, no. 3, 2021, 2227
Rahil Baber, John Talbot, “A Solution to the 2/3 Conjecture”, SIAM J. Discrete Math., 28, no. 2, 2014, 756
Hamed Hatami, James Hirst, Serguei Norine, “The inducibility of blow-up graphs”, Journal of Combinatorial Theory, Series B, 109, 2014, 196
Ping Hu, Bernard Lidický, Taísa Martins, Sergey Norin, Jan Volec, 14, Extended Abstracts EuroComb 2021, 2021, 707
Alexander Razborov, “An Interview with Alexander Razborov”, Math Intelligencer, 44, no. 3, 2022, 193
Victor Falgas-Ravry, Klas Markström, Yi Zhao, “Triangle-degrees in graphs and tetrahedron coverings in 3-graphs”, Combinator. Probab. Comp., 30, no. 2, 2021, 175
József Balogh, Ping Hu, Bernard Lidický, Hong Liu, “Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube”, European Journal of Combinatorics, 35, 2014, 75
Noga Alon, Humberto Naves, Benny Sudakov, “On the Maximum Quartet Distance between Phylogenetic Trees”, SIAM J. Discrete Math., 30, no. 2, 2016, 718
Vladimir Remeslennikov, “Limit combinatorics as a method for investigating of mathematical models”, J. Phys.: Conf. Ser., 1050, 2018, 012068
Roman Glebov, Daniel Král’, Jan Volec, The Seventh European Conference on Combinatorics, Graph Theory and Applications, 2013, 3