Kalina H Petrova

4 Publications

Mark all

[4]
2025 | Published | Journal Article | IST-REx-ID: 19418 | OA
Draganić N, Petrova KH. 2025. Size‐Ramsey numbers of graphs with maximum degree three. Journal of the London Mathematical Society. 111(3), e70116.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 | OA
Lill J, Petrova KH, Weber S. 2025. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[2]
2025 | Published | Journal Article | IST-REx-ID: 19503 | OA
Christoph M, Petrova KH, Steiner R. 2025. A note on digraph splitting. Combinatorics Probability and Computing. 34(4), 559–564.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
Lill J, Petrova KH, Weber S. 2024. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. 19th International Symposium on Parameterized and Exact Computation. IPEC: Symposium on Parameterized and Exact Computation, LIPIcs, vol. 321, 2.
[Published Version] View | Files available | DOI | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

Grants


4 Publications

Mark all

[4]
2025 | Published | Journal Article | IST-REx-ID: 19418 | OA
Draganić N, Petrova KH. 2025. Size‐Ramsey numbers of graphs with maximum degree three. Journal of the London Mathematical Society. 111(3), e70116.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 | OA
Lill J, Petrova KH, Weber S. 2025. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[2]
2025 | Published | Journal Article | IST-REx-ID: 19503 | OA
Christoph M, Petrova KH, Steiner R. 2025. A note on digraph splitting. Combinatorics Probability and Computing. 34(4), 559–564.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
Lill J, Petrova KH, Weber S. 2024. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. 19th International Symposium on Parameterized and Exact Computation. IPEC: Symposium on Parameterized and Exact Computation, LIPIcs, vol. 321, 2.
[Published Version] View | Files available | DOI | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed