Kalina Petrova

According to our database, Kalina Petrova authored at least 9 papers between 2019 and 2025.

Collaborative distances:

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

2025

A note on digraph splitting.

Micha Christoph, Kalina Petrova, Raphael Steiner

Comb. Probab. Comput., 2025

2024

Embedding Large Structures in Adversarially Modified Graphs and Hypergraphs.

Kalina Petrova

PhD thesis, 2024

Transference for loose Hamilton cycles in random 3-uniform hypergraphs.

Kalina Petrova, Milos Trujic

Random Struct. Algorithms, 2024

On connectivity in random graph models with limited dependencies.

Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl

Random Struct. Algorithms, 2024

Embedding loose spanning trees in 3-uniform hypergraphs.

Yanitsa Pehova, Kalina Petrova

J. Comb. Theory B, 2024

Improved bounds for polylogarithmic graph distances in scale-free percolation and related models.

Kostas Lakis, Johannes Lengler, Kalina Petrova, Leon Schiller

CoRR, 2024

Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound.

Jonas Lill, Kalina Petrova, Simon Weber

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Improved Bounds for Graph Distances in Scale Free Percolation and Related Models.

Kostas Lakis, Johannes Lengler, Kalina Petrova, Leon Schiller

Proceedings of the Approximation, 2024

2019

Optimal Strategies for Patrolling Fences.

Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019