Kalina H Petrova

4 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

Grants


4 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed