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 | OA
Dvořák, Z., Moore, B., Seifrtová, M., & Šámal, R. (2025). Precoloring extension in planar near-Eulerian-triangulations. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104138
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20007 | OA
Anastos, M., Kwan, M. A., & Moore, B. (2025). Smoothed analysis for graph isomorphism. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing (pp. 2098–2106). Prague, Czechia: Association for Computing Machinery. https://doi.org/10.1145/3717823.3718173
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 20320 | OA | PlanS
Mies, S., Moore, B., & Smith-Roberge, E. (2025). Beyond the pseudoforest strong Nine Dragon Tree theorem. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104214
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 20504 | OA | PlanS
Jain, V., Kwan, M. A., Mubayi, D., & Tran, T. (2025). The edge-statistics conjecture for hypergraphs. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnaf273
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 18157 | OA
Brunck, F. R., & Kwan, M. A. (2025). Books, Hallways, and social butterflies: A note on sliding block puzzles. Mathematical Intelligencer. Springer Nature. https://doi.org/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 | OA | PlanS
Glasgow, M., Kwan, M. A., Sah, A., & Sawhney, M. (2025). The exact rank of sparse random graphs. Journal of the European Mathematical Society. EMS Press. https://doi.org/10.4171/jems/1692
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19508 | OA | PlanS
Attia, L., Lichev, L., Mitsche, D., Saona Urmeneta, R. J., & Ziliotto, B. (2025). Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. Springer Nature. https://doi.org/10.1007/s13235-025-00636-4
[Published Version] View | Files available | DOI | WoS
 
2024 | Published | Journal Article | IST-REx-ID: 15163 | OA
Campbell, R., Hörsch, F., & Moore, B. (2024). Decompositions into two linear forests of bounded lengths. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2024.113962
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 18559 | OA
Kwan, M. A., Sah, A., Sawhney, M., & Simkin, M. (2024). High-girth Steiner triple systems. Annals of Mathematics. Princeton University. https://doi.org/10.4007/annals.2024.200.3.4
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 18583 | OA
Anastos, M., Cooley, O., Kang, M., & Kwan, M. A. (2024). Partitioning problems via random processes. Journal of the London Mathematical Society. Wiley. https://doi.org/10.1112/jlms.70010
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 18655 | OA
Anastos, M., Diskin, S., Elboim, D., & Krivelevich, M. (2024). Climbing up a random subgraph of the hypercube. Electronic Communications in Probability. Duke University Press. https://doi.org/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 | OA
Lill, J., Petrova, K. H., & Weber, S. (2024). Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. In 19th International Symposium on Parameterized and Exact Computation (Vol. 321). Egham, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2024.2
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 17376 | OA
Kwan, M. A., & Wigderson, Y. (2024). The inertia bound is far from tight. Bulletin of the London Mathematical Society. London Mathematical Society. https://doi.org/10.1112/blms.13127
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 17475 | OA
Koval, I., & Kwan, M. A. (2024). Exponentially many graphs are determined by their spectrum. Quarterly Journal of Mathematics. Oxford University Press. https://doi.org/10.1093/qmath/haae030
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Epub ahead of print | Journal Article | IST-REx-ID: 18951 | OA
Hartarsky, I., Lichev, L., & Toninelli, F. L. (2024). Local dimer dynamics in higher dimensions. Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions. EMS Press. https://doi.org/10.4171/aihpd/200
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 18702 | OA
Anastos, M., Auerbach, B., Baig, M. A., Cueto Noval, M., Kwan, M. A., Pascual Perez, G., & Pietrzak, K. Z. (2024). 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, pp. 413–443). Milan, Italy: Springer Nature. https://doi.org/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 | OA
Liebenau, A., Mattos, L., Mendonca dos Santos, W., & Skokan, J. (2023). Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms. Wiley. https://doi.org/10.1002/rsa.21106
[Published Version] View | Files available | DOI | WoS
 
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
Anastos, M. (2023). A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/11471
[Published Version] View | Files available | DOI | WoS | arXiv
 
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
Anastos, M., Fabian, D., Müyesser, A., & Szabó, T. (2023). Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/11714
[Published Version] View | Files available | DOI | WoS | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 14344 | OA
Anastos, M. (2023). Fast algorithms for solving the Hamilton cycle problem with high probability. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2023, pp. 2286–2323). Florence, Italy: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch88
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed