Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
53 Publications
2025 |
Published |
Journal Article |
IST-REx-ID: 19879 |
Dvořák Z, Moore B, Seifrtová M, Šámal R. Precoloring extension in planar near-Eulerian-triangulations. European Journal of Combinatorics. 2025;127. doi:10.1016/j.ejc.2025.104138
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20007 |
Anastos M, Kwan MA, Moore B. Smoothed analysis for graph isomorphism. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2025:2098-2106. doi:10.1145/3717823.3718173
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 20320 |
| 
|
Mies S, Moore B, Smith-Roberge E. Beyond the pseudoforest strong Nine Dragon Tree theorem. European Journal of Combinatorics. 2025;130(12). doi:10.1016/j.ejc.2025.104214
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 20504 |
|
|
Jain V, Kwan MA, Mubayi D, Tran T. The edge-statistics conjecture for hypergraphs. International Mathematics Research Notices. 2025;2025(18). doi:10.1093/imrn/rnaf273
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 18157 |
Brunck FR, Kwan MA. Books, Hallways, and social butterflies: A note on sliding block puzzles. Mathematical Intelligencer. 2025;47:52-65. doi:10.1007/s00283-024-10358-x
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Epub ahead of print |
Journal Article |
IST-REx-ID: 21263 |
|
|
Glasgow M, Kwan MA, Sah A, Sawhney M. The exact rank of sparse random graphs. Journal of the European Mathematical Society. 2025. doi:10.4171/jems/1692
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19508 |
|
|
Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. 2025;15:1517-1535. doi:10.1007/s13235-025-00636-4
[Published Version]
View
| Files available
| DOI
| WoS
2024 |
Published |
Journal Article |
IST-REx-ID: 15163 |
Campbell R, Hörsch F, Moore B. Decompositions into two linear forests of bounded lengths. Discrete Mathematics. 2024;347(6). doi:10.1016/j.disc.2024.113962
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2024 |
Published |
Journal Article |
IST-REx-ID: 18559 |
Kwan MA, Sah A, Sawhney M, Simkin M. High-girth Steiner triple systems. Annals of Mathematics. 2024;200(3):1059-1156. doi:10.4007/annals.2024.200.3.4
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2024 |
Published |
Journal Article |
IST-REx-ID: 18583 |
Anastos M, Cooley O, Kang M, Kwan MA. Partitioning problems via random processes. Journal of the London Mathematical Society. 2024;110(6). doi:10.1112/jlms.70010
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Journal Article |
IST-REx-ID: 18655 |
Anastos M, Diskin S, Elboim D, Krivelevich M. Climbing up a random subgraph of the hypercube. Electronic Communications in Probability. 2024;29. doi:10.1214/24-ECP639
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
earlier version | 2024 |
Published |
Conference Paper |
IST-REx-ID: 18758 |
Lill J, Petrova KH, Weber S. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. In: 19th International Symposium on Parameterized and Exact Computation. Vol 321. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.IPEC.2024.2
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Journal Article |
IST-REx-ID: 17376 |
Kwan MA, Wigderson Y. The inertia bound is far from tight. Bulletin of the London Mathematical Society. 2024;56(10):3196-3208. doi:10.1112/blms.13127
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Journal Article |
IST-REx-ID: 17475 |
Koval I, Kwan MA. Exponentially many graphs are determined by their spectrum. Quarterly Journal of Mathematics. 2024;75(3):869-899. doi:10.1093/qmath/haae030
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Epub ahead of print |
Journal Article |
IST-REx-ID: 18951 |
Hartarsky I, Lichev L, Toninelli FL. Local dimer dynamics in higher dimensions. Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions. 2024. doi:10.4171/aihpd/200
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18702 |
Anastos M, Auerbach B, Baig MA, et al. The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging. In: 22nd International Conference on Theory of Cryptography. Vol 15364. Springer Nature; 2024:413-443. doi:10.1007/978-3-031-78011-0_14
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2023 |
Published |
Journal Article |
IST-REx-ID: 11706 |
Liebenau A, Mattos L, Mendonca dos Santos W, Skokan J. Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms. 2023;62(4):1035-1055. doi:10.1002/rsa.21106
[Published Version]
View
| Files available
| DOI
| WoS
2023 |
Published |
Journal Article |
IST-REx-ID: 13042 |
Anastos M. A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. 2023;30(2). doi:10.37236/11471
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 |
Published |
Journal Article |
IST-REx-ID: 14319 |
Anastos M, Fabian D, Müyesser A, Szabó T. Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. 2023;30(3). doi:10.37236/11714
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 |
Published |
Conference Paper |
IST-REx-ID: 14344 |
Anastos M. Fast algorithms for solving the Hamilton cycle problem with high probability. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2023. Society for Industrial and Applied Mathematics; 2023:2286-2323. doi:10.1137/1.9781611977554.ch88
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv