×

Mezei, Tamás Róbert

Author ID: mezei.tamas-robert Recent zbMATH articles by "Mezei, Tamás Róbert"
Published as: Mezei, Tamás Róbert
External Links: ORCID

Publications by Year

Citations contained in zbMATH Open

7 Publications have been cited 28 times in 21 Documents Cited by Year
Note on terminal-pairability in complete grid graphs. Zbl 1357.05068
Győri, Ervin; Mezei, Tamás Róbert; Mészáros, Gábor
10
2017
The mixing time of switch Markov chains: a unified approach. Zbl 1476.60116
Erdős, Péter L.; Greenhill, Catherine; Mezei, Tamás Róbert; Miklós, István; Soltész, Dániel; Soukup, Lajos
5
2022
Terminal-pairability in complete graphs. Zbl 1415.05092
Győri, Ervin; Mezei, Tamás Róbert; Mészáros, Gábor
5
2018
Terminal-pairability in complete bipartite graphs. Zbl 1377.05187
Colucci, Lucas; Erdos, Péter L.; Gyori, Ervin; Mezei, Tamás Róbert
3
2018
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks. Zbl 1460.92140
Erdös, Péter L.; Francis, Andrew; Mezei, Tamás Róbert
3
2021
Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem. Zbl 1354.65036
Gyori, Ervin; Mezei, Tamás Róbert
1
2016
Complexity of two-dimensional bootstrap percolation difficulty: algorithm and NP-hardness. Zbl 1462.68070
Hartarsky, Ivailo; Mezei, Tamás Róbert
1
2020
The mixing time of switch Markov chains: a unified approach. Zbl 1476.60116
Erdős, Péter L.; Greenhill, Catherine; Mezei, Tamás Róbert; Miklós, István; Soltész, Dániel; Soukup, Lajos
5
2022
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks. Zbl 1460.92140
Erdös, Péter L.; Francis, Andrew; Mezei, Tamás Róbert
3
2021
Complexity of two-dimensional bootstrap percolation difficulty: algorithm and NP-hardness. Zbl 1462.68070
Hartarsky, Ivailo; Mezei, Tamás Róbert
1
2020
Terminal-pairability in complete graphs. Zbl 1415.05092
Győri, Ervin; Mezei, Tamás Róbert; Mészáros, Gábor
5
2018
Terminal-pairability in complete bipartite graphs. Zbl 1377.05187
Colucci, Lucas; Erdos, Péter L.; Gyori, Ervin; Mezei, Tamás Róbert
3
2018
Note on terminal-pairability in complete grid graphs. Zbl 1357.05068
Győri, Ervin; Mezei, Tamás Róbert; Mészáros, Gábor
10
2017
Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem. Zbl 1354.65036
Gyori, Ervin; Mezei, Tamás Róbert
1
2016

Citations by Year