Obserwuj
Tamás Róbert Mezei
Tamás Róbert Mezei
Alfréd Rényi Institute of Mathematics
Zweryfikowany adres z renyi.hu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
952017
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
27*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
18*2018
Note on terminal-pairability in complete grid graphs
E Győri, TR Mezei, G Mészáros
Discrete Mathematics 340 (5), 988-990, 2017
122017
Terminal-pairability in complete graphs
E Győri, TR Mezei, G Mészáros
arXiv preprint arXiv:1605.05857, 2016
112016
Degree-preserving Network Growth
S Kharel, TR Mezei, S Chung, D Soltész, P Erdos, Z Toroczkai
Bulletin of the American Physical Society, 2020
72020
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
5*2021
Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard
I Hartarsky, TR Mezei
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1-13, 2020
5*2020
Terminal-pairability in complete bipartite graphs
L Colucci, PL Erdős, E Győri, TR Mezei
Discrete Applied Mathematics 236, 459-463, 2018
42018
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
32021
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
Mobile versus Point Guards
E Győri, TR Mezei
Discrete & Computational Geometry 61 (2), 421-451, 2019
22019
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
22016
Degree-preserving graph dynamics--a versatile process to construct random networks
PL Erdős, SR Kharel, TR Mezei, Z Toroczkai
arXiv preprint arXiv:2111.11994, 2021
12021
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
12021
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs
L Colucci, PL Erdős, E Győri, TR Mezei
Theoretical Computer Science 775, 16-25, 2019
12019
Extremal solutions to some art gallery and terminal-pairability problems
TR Mezei
arXiv preprint arXiv:1708.08691, 2017
12017
Seating couples and Tic-Tac-Toe
TR Mezei
Eötvös Loránd University, 2013
12013
The sequence of prime gaps is graphic
PL Erdős, G Harcos, SR Kharel, P Maga, TR Mezei, Z Toroczkai
Mathematische Annalen, 1-21, 2023
2023
A Novel Prognostication System for Spinal Metastasis Patients Based on Network Science and Correlation Analysis
T Mezei, A Horváth, Z Nagy, G Czigléczki, P Banczerowski, J Báskay, ...
Clinical Oncology 35 (1), e20-e29, 2023
2023
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20