Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Tamás Róbert Mezei
Observed names:
Mezei, Tamás Róbert,
Tamás R Mezei,
Tamás R. Mezei
Institution:
HUN-REN Alfréd Rényi Institute of Mathematics
Observed institutions:
HUN-REN Alfréd Rényi Institute of Mathematics,
Central European University,
Huawei Technologies (China),
Hungarian Research Network,
Central European University - Budapest Campus,
Hungarian Academy of Sciences
show all 6
ORCID:
0000-0002-7608-3215
Observed ORCID:
0000-0002-7608-3215
OpenAlex ID:
A5012933161
Oral administration of pyrophosphate inhibits connective tissue calcification
2017
·
Dóra Dedinszki
, Flóra Szeri
, et al.
·
EMBO Molecular Medicine
·
129
PDF
The mixing time of switch Markov chains: A unified approach
2021
·
Péter L. Erdős
, Catherine Greenhill
, et al.
·
European Journal of Combinatorics
·
53
PDF
Degree-preserving network growth
2021
·
Shubha R. Kharel
, Tamás R. Mezei
, et al.
·
Nature Physics
·
50
Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs
2018
·
Péter L. Erdős
, Tamás Róbert Mezei
, et al.
·
PLoS ONE
·
21
PDF
Note on terminal-pairability in complete grid graphs
2017
·
Ervin Győri
, Tamás Róbert Mezei
, et al.
·
Discrete Mathematics
·
12
PDF
Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness
2020
·
Ivailo Hartarsky
, Tamás Róbert Mezei
·
SIAM Journal on Discrete Mathematics
·
10
PDF
On the Small Quasi-kernel Conjecture—A Survey
2025
·
Péter L. Erdős
, Ervin Győri
, et al.
·
Lecture notes in computer science
·
7
PDF
New Results on Graph Matching from Degree-Preserving Growth
2024
·
Péter L. Erdős
, Shubha R. Kharel
, et al.
·
Mathematics
·
7
PDF
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks
2021
·
Péter L. Erdős
, Andrew Francis
, et al.
·
Discrete Applied Mathematics
·
7
PDF
On the Small Quasi-kernel conjecture
2023
·
Erdős, Péter L.
, Győri, Ervin
, et al.
·
arXiv (Cornell University)
·
6
PDF
Degree-preserving graph dynamics: a versatile process to construct random networks
2023
·
Péter L Erdős
, Shubha R Kharel
, et al.
·
Journal of Complex Networks
·
5
PDF
The sequence of prime gaps is graphic
2023
·
Péter L. Erdős
, Gergely Harcos
, et al.
·
Mathematische Annalen
·
4
PDF
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence
2024
·
András Hubai
, Tamás Róbert Mezei
, et al.
·
PLoS ONE
·
3
PDF
Approximate Sampling of Graphs with Near-P-Stable Degree Intervals
2023
·
Péter L. Erdős
, Tamás Róbert Mezei
, et al.
·
Annals of Combinatorics
·
3
PDF
Terminal-pairability in complete bipartite graphs
2017
·
Lucas Colucci
, Péter L. Erdős
, et al.
·
Discrete Applied Mathematics
·
3
Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem
2016
·
Ervin Győri
, Tamás Róbert Mezei
·
Computational Geometry
·
3
Algorithms for Interference Minimization in Future Wireless Network Decomposition
2021
·
Erdős, Péter L.
, Mezei, Tamás Róbert
, et al.
·
arXiv (Cornell University)
·
2
PDF
Terminal-pairability in complete bipartite graphs with non-bipartite demands
2018
·
Lucas Colucci
, Péter L. Erdős
, et al.
·
Theoretical Computer Science
·
2
PDF
Minimizing Interference-to-Signal Ratios in Multi-Cell Telecommunication Networks
2023
·
Péter L. Erdős
, Tamás Róbert Mezei
·
Algorithms
·
1
PDF
Mixing time of the swap Markov chain and P-stability
2019
·
Péter L. Erdős
, Catherine Greenhill
, et al.
·
Acta Mathematica Universitatis Comenianae
·
1
PDF
Extremal solutions to some art gallery and terminal-pairability problems
2017
·
Mezei, Tamás Róbert
·
arXiv (Cornell University)
·
1
PDF
Approximate Sampling and Counting of Graphs with Near-P-stable Degree Intervals
2024
·
Erdős, Péter
, Mezei, Tamás Róbert
, et al.
·
Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)
PDF
Covering simple orthogonal polygons with $r$-stars
2023
·
Mezei, Tamás Róbert
·
arXiv (Cornell University)
PDF
Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard.
2018
·
Ivailo Hartarsky
, Tamás Róbert Mezei
·
Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)
PDF
Partitioning polyominoes into polyominoes of at most 8 vertices
2015
·
Ervin Győri
, Tamás Róbert Mezei
·
arXiv (Cornell University)
Show more works
View as search
Works count:
27
Citation count:
341
H-index:
7
I10-index:
7
Year
Topic
Type