Kalina H Petrova

4 Publications

Mark all

[4]
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, vol. 111, no. 3, e70116, Wiley, 2025, doi: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, Jonas, et al. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” Algorithmica, Springer Nature, 2025, doi: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, Micha, et al. “A Note on Digraph Splitting.” Combinatorics Probability and Computing, vol. 34, no. 4, Cambridge University Press, 2025, pp. 559–64, doi:10.1017/S0963548325000045.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
Lill, Jonas, et al. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” 19th International Symposium on Parameterized and Exact Computation, vol. 321, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.IPEC.2024.2.
[Published Version] View | Files available | DOI | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

Grants


4 Publications

Mark all

[4]
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, vol. 111, no. 3, e70116, Wiley, 2025, doi: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, Jonas, et al. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” Algorithmica, Springer Nature, 2025, doi: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, Micha, et al. “A Note on Digraph Splitting.” Combinatorics Probability and Computing, vol. 34, no. 4, Cambridge University Press, 2025, pp. 559–64, doi:10.1017/S0963548325000045.
[Published Version] View | Files available | DOI | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
Lill, Jonas, et al. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” 19th International Symposium on Parameterized and Exact Computation, vol. 321, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.IPEC.2024.2.
[Published Version] View | Files available | DOI | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed