Kalina H Petrova

4 Publications

Mark all

[4]
2025 | Published | Journal Article | IST-REx-ID: 19418 | OA
Draganić, N., & Petrova, K. H. (2025). Size‐Ramsey numbers of graphs with maximum degree three. Journal of the London Mathematical Society. Wiley. https://doi.org/10.1112/jlms.70116
[Published Version] View | Files available | DOI | arXiv
 
[3]
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 | OA
Lill, J., Petrova, K. H., & Weber, S. (2025). Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-025-01306-y
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[2]
2025 | Published | Journal Article | IST-REx-ID: 19503 | OA
Christoph, M., Petrova, K. H., & Steiner, R. (2025). A note on digraph splitting. Combinatorics Probability and Computing. Cambridge University Press. https://doi.org/10.1017/S0963548325000045
[Published Version] View | Files available | DOI | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
Lill, J., Petrova, K. H., & Weber, S. (2024). Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. In 19th International Symposium on Parameterized and Exact Computation (Vol. 321). Egham, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2024.2
[Published Version] View | Files available | DOI | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

Grants


4 Publications

Mark all

[4]
2025 | Published | Journal Article | IST-REx-ID: 19418 | OA
Draganić, N., & Petrova, K. H. (2025). Size‐Ramsey numbers of graphs with maximum degree three. Journal of the London Mathematical Society. Wiley. https://doi.org/10.1112/jlms.70116
[Published Version] View | Files available | DOI | arXiv
 
[3]
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 | OA
Lill, J., Petrova, K. H., & Weber, S. (2025). Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-025-01306-y
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[2]
2025 | Published | Journal Article | IST-REx-ID: 19503 | OA
Christoph, M., Petrova, K. H., & Steiner, R. (2025). A note on digraph splitting. Combinatorics Probability and Computing. Cambridge University Press. https://doi.org/10.1017/S0963548325000045
[Published Version] View | Files available | DOI | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
Lill, J., Petrova, K. H., & Weber, S. (2024). Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. In 19th International Symposium on Parameterized and Exact Computation (Vol. 321). Egham, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2024.2
[Published Version] View | Files available | DOI | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed