Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
5 Publications
2025 | Published | Journal Article | IST-REx-ID: 18753 | 
Carbonero, Alvaro, Hidde Koerts, Benjamin Moore, and Sophie Spirkl. “On Heroes in Digraphs with Forbidden Induced Forests.” European Journal of Combinatorics. Elsevier, 2025. https://doi.org/10.1016/j.ejc.2024.104104.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19018 |
Burova, Sofiya, and Lyuben Lichev. “The Semi-Random Tree Process.” European Journal of Combinatorics. Elsevier, 2025. https://doi.org/10.1016/j.ejc.2025.104120.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19879 |
Dvořák, Zdeněk, Benjamin Moore, Michaela Seifrtová, and Robert Šámal. “Precoloring Extension in Planar Near-Eulerian-Triangulations.” European Journal of Combinatorics. Elsevier, 2025. https://doi.org/10.1016/j.ejc.2025.104138.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20320 |
| 
|
Mies, Sebastian, Benjamin Moore, and Evelyne Smith-Roberge. “Beyond the Pseudoforest Strong Nine Dragon Tree Theorem.” European Journal of Combinatorics. Elsevier, 2025. https://doi.org/10.1016/j.ejc.2025.104214.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9589 |
Greenhill, Catherine, Mikhail Isaev, Matthew Alan Kwan, and Brendan D. McKay. “The Average Number of Spanning Trees in Sparse Graphs with given Degrees.” European Journal of Combinatorics. Elsevier, 2017. https://doi.org/10.1016/j.ejc.2017.02.003.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv