Seguir
Tamás Róbert Mezei
Tamás Róbert Mezei
Sabbatical
E-mail confirmado em trm.hu - Página inicial
Título
Citado por
Citado por
Ano
Oral administration of pyrophosphate inhibits connective tissue calcification
D Dedinszki, F Szeri, E Kozák, V Pomozi, N Tőkési, TR Mezei, K Merczel, ...
EMBO molecular medicine 9 (11), 1463-1470, 2017
1192017
The mixing time of switch Markov chains: a unified approach
PL Erdős, C Greenhill, TR Mezei, I Miklós, D Soltész, L Soukup
European Journal of Combinatorics 99, 103421, 2022
44*2022
Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs
PL Erdős, TR Mezei, I Miklós, D Soltész
PLOS One 13 (8), e0201995, 2018
22*2018
Degree-preserving network growth
SR Kharel, TR Mezei, S Chung, PL Erdős, Z Toroczkai
Nature Physics 18 (1), 100-106, 2022
172022
Note on terminal-pairability in complete grid graphs
E Győri, TR Mezei, G Mészáros
Discrete Mathematics 340 (5), 988-990, 2017
112017
Terminal-Pairability in Complete Graphs
E Győri, TR Mezei, G Mészáros
Journal of Combinatorial Mathematics and Combinatorial Computing 107, 221-231, 2018
102018
Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard
I Hartarsky, TR Mezei
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1-13, 2020
9*2020
Half-graphs, other non-stable degree sequences, and the switch Markov chain
PL Erdős, E Győri, TR Mezei, I Miklós, D Soltész
The Electronic Journal of Combinatorics 28 (3), P3.7, 2021
8*2021
On the small quasi-kernel conjecture
PL Erdős, E Győri, TR Mezei, N Salia, M Tyomkyn
arXiv preprint arXiv:2307.04112, 2023
62023
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks
PL Erdős, A Francis, TR Mezei
Discrete Applied Mathematics 294, 205-213, 2021
52021
Mobile versus Point Guards
E Győri, TR Mezei
Discrete & Computational Geometry 61 (2), 421-451, 2019
5*2019
The sequence of prime gaps is graphic
PL Erdős, G Harcos, SR Kharel, P Maga, TR Mezei, Z Toroczkai
Mathematische Annalen 388 (2), 2195-2215, 2024
32024
Degree-preserving graph dynamics: a versatile process to construct random networks
PL Erdős, SR Kharel, TR Mezei, Z Toroczkai
Journal of Complex Networks 11 (6), cnad046, 2023
32023
Algorithms for interference minimization in future wireless network decomposition
PL Erdős, TR Mezei, Y Yu, X Chen, W Han, B Bai
arXiv preprint arXiv:2111.00885, 2021
32021
Terminal-pairability in complete bipartite graphs
L Colucci, PL Erdős, E Győri, TR Mezei
Discrete Applied Mathematics 236, 459-463, 2018
32018
Partitioning orthogonal polygons into ≤8-vertex pieces, with application to an art gallery theorem
E Győri, TR Mezei
Computational Geometry 59, 13-25, 2016
32016
Seating couples and Tic-Tac-Toe
TR Mezei
Eötvös Loránd University, 2013
32013
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence
A Hubai, TR Mezei, F Béres, A Benczúr, I Miklós
Plos one 19 (5), e0303155, 2024
22024
Approximate Sampling of Graphs with Near-P-Stable Degree Intervals
PL Erdős, TR Mezei, I Miklós
Annals of Combinatorics 28 (1), 223-256, 2024
22024
Mixing time of the swap Markov chain and P-stability
PL Erdős, CS Greenhill, TR Mezei, I Miklós, D Soltész, L Soukup
Acta Mathematica Universitatis Comenianae 88 (3), 659-665, 2019
22019
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20