Kalina Petrova

Research Interests

I am a fourth year Computer Science PhD student in the group of Prof. Dr. Angelika Steger at ETH Zürich. I received my Master's degree in Theoretical Computer Science from ETH Zürich in 2019 and my Bachelor's degree in Computer Science from Princeton University in 2017. My research focus is on Extremal and Probabilistic Combinatorics, Graph Theory and Random Graphs.

Publications:

Preprints

Transference for loose Hamilton cycles in random 3-uniform hypergraphs
(joint with M. Trujić)
submitted May 2022

Size-Ramsey numbers of graphs with maximum degree three
(joint with N. Draganić)
submitted August 2022

Embedding loose spanning trees in 3-uniform hypergraphs
(joint with Y. Pehova)
submitted April 2023

On connectivity in random graph models with limited dependencies
(joint with J. Lengler, A. Martinsson, P. Schnider, R. Steiner, S. Weber, E. Welzl)
submitted May 2023

Randomly perturbed digraphs also have bounded-degree spanning trees
(joint with P. Morawski)
submitted June 2023

Size-Ramsey numbers of structurally sparse graphs
(joint with N. Draganić, M. Kaufmann, D. M. Correia, R. Steiner)
submitted September 2023

A note on digraph splitting
(joint with M. Christoph, R. Steiner)
submitted October 2023

Published

Optimal strategies for patrolling fences
(joint with B. Haeupler, F. Kuhn, A. Martinsson, and P. Pfister)
ICALP: International Colloquium on Automata, Languages and Programming, 2019

Theses:

Parallel Variational Autoencoders for Image Segmentation
Master thesis, ETH Zurich, 2019, under the supervision of Prof. Dr. Angelika Steger, Asier Mujika, and Frederik Benzing

A Dynamic Data Structure for Segment Intersection Queries
Bachelor independent work, Princeton University, 2016, under the supervision of Prof. Dr. Robert Tarjan