Benjamin Moore
5 Publications
2025 | Published | Journal Article | IST-REx-ID: 19002 |

Cortés, Pedro P., Pankaj Kumar, Benjamin Moore, Patrice Ossona de Mendez, and Daniel A. Quiroz. “Subchromatic Numbers of Powers of Graphs with Excluded Minors.” Discrete Mathematics. Elsevier, 2025. https://doi.org/10.1016/j.disc.2024.114377.
[Published Version]
View
| Files available
| DOI
| arXiv
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: 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
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20007 |

Anastos, Michael, Matthew Alan Kwan, and Benjamin Moore. “Smoothed Analysis for Graph Isomorphism.” In Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2098–2106. Association for Computing Machinery, 2025. https://doi.org/10.1145/3717823.3718173.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 15163 |

Campbell, Rutger, Florian Hörsch, and Benjamin Moore. “Decompositions into Two Linear Forests of Bounded Lengths.” Discrete Mathematics. Elsevier, 2024. https://doi.org/10.1016/j.disc.2024.113962.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
Search
Filter Publications
Display / Sort
Export / Embed
Grants
5 Publications
2025 | Published | Journal Article | IST-REx-ID: 19002 |

Cortés, Pedro P., Pankaj Kumar, Benjamin Moore, Patrice Ossona de Mendez, and Daniel A. Quiroz. “Subchromatic Numbers of Powers of Graphs with Excluded Minors.” Discrete Mathematics. Elsevier, 2025. https://doi.org/10.1016/j.disc.2024.114377.
[Published Version]
View
| Files available
| DOI
| arXiv
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: 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
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20007 |

Anastos, Michael, Matthew Alan Kwan, and Benjamin Moore. “Smoothed Analysis for Graph Isomorphism.” In Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2098–2106. Association for Computing Machinery, 2025. https://doi.org/10.1145/3717823.3718173.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 15163 |

Campbell, Rutger, Florian Hörsch, and Benjamin Moore. “Decompositions into Two Linear Forests of Bounded Lengths.” Discrete Mathematics. Elsevier, 2024. https://doi.org/10.1016/j.disc.2024.113962.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv