Kalina H Petrova
6 Publications
2025 | Published | Journal Article | IST-REx-ID: 19418 |
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
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19503 |
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
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 |
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.)
| WoS
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20422 |
|
|
Christoph, Micha, et al. “The Hamilton Space of Pseudorandom Graphs.” Journal of Combinatorial Theory Series B, vol. 176, Elsevier, 2025, pp. 254–67, doi:10.1016/j.jctb.2025.09.002.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20482 |
|
|
Boyadzhiyska, Simona, et al. “Odd-Ramsey Numbers of Complete Bipartite Graphs.” European Journal of Combinatorics, vol. 131, 104235, Elsevier, 2025, doi:10.1016/j.ejc.2025.104235.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18758 |
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
Grants
6 Publications
2025 | Published | Journal Article | IST-REx-ID: 19418 |
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
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19503 |
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
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19603 |
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.)
| WoS
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20422 |
|
|
Christoph, Micha, et al. “The Hamilton Space of Pseudorandom Graphs.” Journal of Combinatorial Theory Series B, vol. 176, Elsevier, 2025, pp. 254–67, doi:10.1016/j.jctb.2025.09.002.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20482 |
|
|
Boyadzhiyska, Simona, et al. “Odd-Ramsey Numbers of Complete Bipartite Graphs.” European Journal of Combinatorics, vol. 131, 104235, Elsevier, 2025, doi:10.1016/j.ejc.2025.104235.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18758 |
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