Optimal Strategies for Patrolling Fences. - Bernhard Haeupler; Fabian Kuhn; Anders Martinsson; Kalina Petrova; Pascal Pfister (ICALP, 2019)

Improved Bounds for Graph Distances in Scale Free Percolation and Related Models. - Kostas Lakis; Johannes Lengler; Kalina Petrova; Leon Schiller (APPROX/RANDOM, 2024)

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound. - Jonas Lill; Kalina Petrova; Simon Weber 001 (IPEC, 2024)

Improved bounds for polylogarithmic graph distances in scale-free percolation and related models. - Kostas Lakis; Johannes Lengler; Kalina Petrova; Leon Schiller (CoRR, 2024)

Embedding loose spanning trees in 3-uniform hypergraphs. - Yanitsa Pehova; Kalina Petrova (J. Comb. Theory B, 2024)

On connectivity in random graph models with limited dependencies. - Johannes Lengler; Anders Martinsson; Kalina Petrova; Patrick Schnider; Raphael Steiner; Simon Weber 001; Emo Welzl (Random Struct. Algorithms, 2024)

Transference for loose Hamilton cycles in random 3-uniform hypergraphs. - Kalina Petrova; Milos Trujic (Random Struct. Algorithms, 2024)

Embedding Large Structures in Adversarially Modified Graphs and Hypergraphs. - Kalina Petrova (2024)

A note on digraph splitting. - Micha Christoph; Kalina Petrova; Raphael Steiner (Comb. Probab. Comput., 2025)