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: 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 | 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
 
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
 
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
 
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
 
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: 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 | Published | Conference Paper | IST-REx-ID: 18702 | OA
The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging
M. Anastos, B. Auerbach, M.A. Baig, M. Cueto Noval, M.A. Kwan, G. Pascual Perez, K.Z. Pietrzak, in:, 22nd International Conference on Theory of Cryptography, Springer Nature, 2024, pp. 413–443.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
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: 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: 17475 | OA
Exponentially many graphs are determined by their spectrum
I. Koval, M.A. Kwan, Quarterly Journal of Mathematics 75 (2024) 869–899.
[Published Version] View | Files available | DOI | 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
 
2023 | Published | Journal Article | IST-REx-ID: 11706 | OA
Asymmetric Ramsey properties of random graphs involving cliques and cycles
A. Liebenau, L. Mattos, W. Mendonca dos Santos, J. Skokan, Random Structures and Algorithms 62 (2023) 1035–1055.
[Published Version] View | Files available | DOI | WoS
 
2023 | Published | Journal Article | IST-REx-ID: 13042 | OA
A note on long cycles in sparse random graphs
M. Anastos, Electronic Journal of Combinatorics 30 (2023).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2023 | Published | Journal Article | IST-REx-ID: 14319 | OA
Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
M. Anastos, D. Fabian, A. Müyesser, T. Szabó, Electronic Journal of Combinatorics 30 (2023).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2023 | Published | Conference Paper | IST-REx-ID: 14344 | OA
Fast algorithms for solving the Hamilton cycle problem with high probability
M. Anastos, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 2286–2323.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

type<>research_data

Search

Filter Publications

Display / Sort

Export / Embed