Kalina H Petrova

7 Publications

Mark all

[7]
2026 | Published | Journal Article | IST-REx-ID: 20422 | OA | PlanS
Christoph, Micha, Rajko Nenadov, and Kalina H Petrova. “The Hamilton Space of Pseudorandom Graphs.” Journal of Combinatorial Theory Series B. Elsevier, 2026. https://doi.org/10.1016/j.jctb.2025.09.002.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[6]
2026 | Published | Journal Article | IST-REx-ID: 20482 | OA | PlanS
Boyadzhiyska, Simona, Shagnik Das, Thomas Lesgourgues, and Kalina H Petrova. “Odd-Ramsey Numbers of Complete Bipartite Graphs.” European Journal of Combinatorics. Elsevier, 2026. https://doi.org/10.1016/j.ejc.2025.104235.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[5]
2025 | Published | Journal Article | IST-REx-ID: 19418 | OA
Draganić, Nemanja, and Kalina H Petrova. “Size‐Ramsey Numbers of Graphs with Maximum Degree Three.” Journal of the London Mathematical Society. Wiley, 2025. https://doi.org/10.1112/jlms.70116.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2025 | Published | Journal Article | IST-REx-ID: 19503 | OA
Christoph, Micha, Kalina H Petrova, and Raphael Steiner. “A Note on Digraph Splitting.” Combinatorics Probability and Computing. Cambridge University Press, 2025. https://doi.org/10.1017/S0963548325000045.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[3]
2025 | Published | Journal Article | IST-REx-ID: 19603 | OA
Lill, Jonas, Kalina H Petrova, and Simon Weber. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” Algorithmica. Springer Nature, 2025. https://doi.org/10.1007/s00453-025-01306-y.
[Published Version] View | Files available | DOI | WoS
 
[2]
2025 | Submitted | Preprint | IST-REx-ID: 21211 | OA
Montgomery, Richard, Kalina H Petrova, Arjun Ranganathan, and Jane Tan. “Packing Subdivisions into Regular Graphs.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2508.00480.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
Lill, Jonas, Kalina H Petrova, and Simon Weber. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” In 19th International Symposium on Parameterized and Exact Computation, Vol. 321. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.IPEC.2024.2.
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

Grants


7 Publications

Mark all

[7]
2026 | Published | Journal Article | IST-REx-ID: 20422 | OA | PlanS
Christoph, Micha, Rajko Nenadov, and Kalina H Petrova. “The Hamilton Space of Pseudorandom Graphs.” Journal of Combinatorial Theory Series B. Elsevier, 2026. https://doi.org/10.1016/j.jctb.2025.09.002.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[6]
2026 | Published | Journal Article | IST-REx-ID: 20482 | OA | PlanS
Boyadzhiyska, Simona, Shagnik Das, Thomas Lesgourgues, and Kalina H Petrova. “Odd-Ramsey Numbers of Complete Bipartite Graphs.” European Journal of Combinatorics. Elsevier, 2026. https://doi.org/10.1016/j.ejc.2025.104235.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[5]
2025 | Published | Journal Article | IST-REx-ID: 19418 | OA
Draganić, Nemanja, and Kalina H Petrova. “Size‐Ramsey Numbers of Graphs with Maximum Degree Three.” Journal of the London Mathematical Society. Wiley, 2025. https://doi.org/10.1112/jlms.70116.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[4]
2025 | Published | Journal Article | IST-REx-ID: 19503 | OA
Christoph, Micha, Kalina H Petrova, and Raphael Steiner. “A Note on Digraph Splitting.” Combinatorics Probability and Computing. Cambridge University Press, 2025. https://doi.org/10.1017/S0963548325000045.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[3]
2025 | Published | Journal Article | IST-REx-ID: 19603 | OA
Lill, Jonas, Kalina H Petrova, and Simon Weber. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” Algorithmica. Springer Nature, 2025. https://doi.org/10.1007/s00453-025-01306-y.
[Published Version] View | Files available | DOI | WoS
 
[2]
2025 | Submitted | Preprint | IST-REx-ID: 21211 | OA
Montgomery, Richard, Kalina H Petrova, Arjun Ranganathan, and Jane Tan. “Packing Subdivisions into Regular Graphs.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2508.00480.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
Lill, Jonas, Kalina H Petrova, and Simon Weber. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” In 19th International Symposium on Parameterized and Exact Computation, Vol. 321. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.IPEC.2024.2.
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed