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.

Matthew Kwan

Aleksandr Grebennikov

Zhihan Jin

Lenka Kopfova

Kalina Petrova

Farhood Rostamkhani

Yiting Wang

Michael Anastos

Florestan Brunck

Oliver Cooley

Lyuben Lichev

Walner Mendonça

Benjamin Moore



59 Publications

2025 | Published | Journal Article | IST-REx-ID: 19503 | OA
A note on digraph splitting
M. Christoph, K.H. Petrova, R. Steiner, Combinatorics Probability and Computing 34 (2025) 559–564.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19554 | OA
A central limit theorem for the matching number of a sparse random graph
M. Glasgow, M.A. Kwan, A. Sah, M. Sawhney, Journal of the London Mathematical Society 111 (2025).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19798 | OA
A note on finding large transversals efficiently
M. Anastos, P. Morris, Journal of Combinatorial Designs 33 (2025) 338–342.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19859 | OA
Color-avoiding percolation on the Erdős–Rényi random graph
L. Lichev, B. Schapira, Annales Henri Lebesgue 8 (2025) 35–65.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19879 | OA
Precoloring extension in planar near-Eulerian-triangulations
Z. Dvořák, B. Moore, M. Seifrtová, R. Šámal, European Journal of Combinatorics 127 (2025).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20007 | OA
Smoothed analysis for graph isomorphism
M. Anastos, M.A. Kwan, B. Moore, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 2098–2106.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 20320 | OA | PlanS
Beyond the pseudoforest strong Nine Dragon Tree theorem
S. Mies, B. Moore, E. Smith-Roberge, European Journal of Combinatorics 130 (2025).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 20504 | OA | PlanS
The edge-statistics conjecture for hypergraphs
V. Jain, M.A. Kwan, D. Mubayi, T. Tran, International Mathematics Research Notices 2025 (2025).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 21263 | OA | PlanS
The exact rank of sparse random graphs
M. Glasgow, M.A. Kwan, A. Sah, M. Sawhney, Journal of the European Mathematical Society (2025).
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19508 | OA | PlanS
Random zero-sum dynamic games on infinite directed graphs
L. Attia, L. Lichev, D. Mitsche, R.J. Saona Urmeneta, B. Ziliotto, Dynamic Games and Applications 15 (2025) 1517–1535.
[Published Version] View | Files available | DOI | WoS
 
2025 | Published | Journal Article | IST-REx-ID: 18753 | OA
On heroes in digraphs with forbidden induced forests
A. Carbonero, H. Koerts, B. Moore, S. Spirkl, European Journal of Combinatorics 125 (2025).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19603 | OA
Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound
J. Lill, K.H. Petrova, S. Weber, Algorithmica 87 (2025) 983–1007.
[Published Version] View | Files available | DOI | WoS
 
2025 | Published | Journal Article | IST-REx-ID: 18157 | OA
Books, Hallways, and social butterflies: A note on sliding block puzzles
F.R. Brunck, M.A. Kwan, Mathematical Intelligencer 47 (2025) 52–65.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 15163 | OA
Decompositions into two linear forests of bounded lengths
R. Campbell, F. Hörsch, B. Moore, Discrete Mathematics 347 (2024).
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
earlier version | 2024 | Published | Conference Paper | IST-REx-ID: 18758 | OA
Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound
J. Lill, K.H. Petrova, S. Weber, in:, 19th International Symposium on Parameterized and Exact Computation, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 18583 | OA
Partitioning problems via random processes
M. Anastos, O. Cooley, M. Kang, M.A. Kwan, Journal of the London Mathematical Society 110 (2024).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 17376 | OA
The inertia bound is far from tight
M.A. Kwan, Y. Wigderson, Bulletin of the London Mathematical Society 56 (2024) 3196–3208.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 18655 | OA
Climbing up a random subgraph of the hypercube
M. Anastos, S. Diskin, D. Elboim, M. Krivelevich, Electronic Communications in Probability 29 (2024).
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
2024 | Epub ahead of print | Journal Article | IST-REx-ID: 18951 | OA
Local dimer dynamics in higher dimensions
I. Hartarsky, L. Lichev, F.L. Toninelli, Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions (2024).
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2024 | Published | Journal Article | IST-REx-ID: 18559 | OA
High-girth Steiner triple systems
M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Annals of Mathematics 200 (2024) 1059–1156.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed