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.

34 Publications


2025 | Published | Journal Article | IST-REx-ID: 19440 | OA
Alon, Yahav, and Michael Anastos. “The Completion Numbers of Hamiltonicity and Pancyclicity in Random Graphs.” Random Structures and Algorithms. Wiley, 2025. https://doi.org/10.1002/rsa.21286.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Journal Article | IST-REx-ID: 18583 | OA
Anastos, Michael, Oliver Cooley, Mihyun Kang, and Matthew Alan Kwan. “Partitioning Problems via Random Processes.” Journal of the London Mathematical Society. Wiley, 2024. https://doi.org/10.1112/jlms.70010.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Journal Article | IST-REx-ID: 18655 | OA
Anastos, Michael, Sahar Diskin, Dor Elboim, and Michael Krivelevich. “Climbing up a Random Subgraph of the Hypercube.” Electronic Communications in Probability. Duke University Press, 2024. https://doi.org/10.1214/24-ECP639.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18702 | OA
Anastos, Michael, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Alan Kwan, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging.” In 22nd International Conference on Theory of Cryptography, 15364:413–43. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-78011-0_14.
[Preprint] View | DOI | Download Preprint (ext.)
 

2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
Lill, Jonas, Kalina H Petrova, and Simon Weber. “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. https://doi.org/10.4230/LIPIcs.IPEC.2024.2.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Epub ahead of print | Journal Article | IST-REx-ID: 18753 | OA
Carbonero, Alvaro, Hidde Koerts, Benjamin Moore, and Sophie Spirkl. “On Heroes in Digraphs with Forbidden Induced Forests.” European Journal of Combinatorics. Elsevier, 2024. https://doi.org/10.1016/j.ejc.2024.104104.
View | DOI | Download None (ext.) | arXiv
 

2024 | Published | Journal Article | IST-REx-ID: 17376 | OA
Kwan, Matthew Alan, and Yuval Wigderson. “The Inertia Bound Is Far from Tight.” Bulletin of the London Mathematical Society. London Mathematical Society, 2024. https://doi.org/10.1112/blms.13127.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Epub ahead of print | Journal Article | IST-REx-ID: 18951 | OA
Hartarsky, Ivailo, Lyuben Lichev, and Fabio Lucio Toninelli. “Local Dimer Dynamics in Higher Dimensions.” Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions. EMS Press, 2024. https://doi.org/10.4171/aihpd/200.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2024 | Published | Journal Article | IST-REx-ID: 17475 | OA
Koval, Illya, and Matthew Alan Kwan. “Exponentially Many Graphs Are Determined by Their Spectrum.” Quarterly Journal of Mathematics. Oxford University Press, 2024. https://doi.org/10.1093/qmath/haae030.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Published | Journal Article | IST-REx-ID: 15163 | OA
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
 

2024 | Epub ahead of print | Journal Article | IST-REx-ID: 18157 | OA
Brunck, Florestan R, and Matthew Alan Kwan. “Books, Hallways, and Social Butterflies: A Note on Sliding Block Puzzles.” Mathematical Intelligencer. Springer Nature, 2024. https://doi.org/10.1007/s00283-024-10358-x.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2024 | Published | Journal Article | IST-REx-ID: 18559 | OA
Kwan, Matthew Alan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin. “High-Girth Steiner Triple Systems.” Annals of Mathematics. Princeton University, 2024. https://doi.org/10.4007/annals.2024.200.3.4.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
Anastos, Michael, David Fabian, Alp Müyesser, and Tibor Szabó. “Splitting Matchings and the Ryser-Brualdi-Stein Conjecture for Multisets.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2023. https://doi.org/10.37236/11714.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 14344 | OA
Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2023:2286–2323. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/1.9781611977554.ch88.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2023 | Published | Journal Article | IST-REx-ID: 14444 | OA
Kwan, Matthew Alan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin. “Substructures in Latin Squares.” Israel Journal of Mathematics. Springer Nature, 2023. https://doi.org/10.1007/s11856-023-2513-9.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2023 | Published | Journal Article | IST-REx-ID: 14499 | OA
Kwan, Matthew Alan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney. “Anticoncentration in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” Forum of Mathematics, Pi. Cambridge University Press, 2023. https://doi.org/10.1017/fmp.2023.17.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Published | Journal Article | IST-REx-ID: 11706 | OA
Liebenau, Anita, Letícia Mattos, Walner Mendonca dos Santos, and Jozef Skokan. “Asymmetric Ramsey Properties of Random Graphs Involving Cliques and Cycles.” Random Structures and Algorithms. Wiley, 2023. https://doi.org/10.1002/rsa.21106.
[Published Version] View | Files available | DOI | WoS
 

2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2023. https://doi.org/10.37236/11471.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 14867 | OA
Anastos, Michael. “Constructing Hamilton Cycles and Perfect Matchings Efficiently.” In Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 36–41. Masaryk University Press, 2023. https://doi.org/10.5817/cz.muni.eurocomb23-005.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Published | Journal Article | IST-REx-ID: 15173 | OA
Kwan, Matthew Alan, Ashwin Sah, and Mehtaab Sawhney. “Enumerating Matroids and Linear Spaces.” Comptes Rendus Mathematique. Academie des Sciences, 2023. https://doi.org/10.5802/crmath.423.
[Published Version] View | Files available | DOI | arXiv
 

Filters and Search Terms

department=MaKw

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed