| Size-Ramsey numbers of graphs with maximum degree three N Draganić, K Petrova arXiv preprint arXiv:2207.05048, 2022 | 7 | 2022 |
| Minimum vertex degree conditions for loose spanning trees in 3-graphs Y Pehova, K Petrova European Conference on Combinatorics, Graph Theory and Applications, 754-759, 2023 | 3 | 2023 |
| Transference for loose Hamilton cycles in random 3‐uniform hypergraphs K Petrova, M Trujić Random Structures & Algorithms, 2022 | 3 | 2022 |
| Optimal strategies for patrolling fences B Haeupler, F Kuhn, A Martinsson, K Petrova, P Pfister arXiv preprint arXiv:1809.06727, 2018 | 3 | 2018 |
| Size-Ramsey numbers of structurally sparse graphs N Draganić, M Kaufmann, DM Correia, K Petrova, R Steiner arXiv preprint arXiv:2307.12028, 2023 | 2 | 2023 |
| Randomly perturbed digraphs also have bounded-degree spanning trees P Morawski, K Petrova arXiv preprint arXiv:2306.14648, 2023 | 2 | 2023 |
| Self-avoiding walks in the plane R Dangovski, K Petrova Union of Bulgarian Mathematicians, 2012 | 2 | 2012 |
| The Hamilton space of pseudorandom graphs M Christoph, R Nenadov, K Petrova arXiv preprint arXiv:2402.01447, 2024 | 1 | 2024 |
| A note on digraph splitting M Christoph, K Petrova, R Steiner arXiv preprint arXiv:2310.08449, 2023 | 1 | 2023 |
| A Dynamic Data Structure for Segment In-tersection Queries K Petrova, R Tarjan | 1 | |
| Embedding Large Structures in Adversarially Modified Graphs and Hypergraphs K Petrova ETH Zurich, 2024 | | 2024 |
| On connectivity in random graph models with limited dependencies J Lengler, A Martinsson, K Petrova, P Schnider, R Steiner, S Weber, ... Random Structures & Algorithms, 2023 | | 2023 |
| Embedding loose spanning trees in 3-uniform hypergraphs Y Pehova, K Petrova arXiv preprint arXiv:2301.09630, 2023 | | 2023 |
| Automating the neuron integration in connectome construction K Petrova, S Seung RESEARCH SCIENCE INSTITUTE 2012, 28, 2012 | | 2012 |
Nemanja DraganićUniversity of OxfordПодтвержден адрес электронной почты в домене maths.ox.ac.uk
