Tamás Róbert Mezei

According to our database, Tamás Róbert Mezei authored at least 23 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Degree-preserving graph dynamics: a versatile process to construct random networks.

Péter L. Erdös, Shubha R. Kharel, Tamás Róbert Mezei, Zoltán Toroczkai

J. Complex Networks, September, 2023

Minimizing Interference-to-Signal Ratios in Multi-Cell Telecommunication Networks.

Péter L. Erdös, Tamás Róbert Mezei

Algorithms, July, 2023

Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence.

Andras Hubai, Tamás Róbert Mezei, Ferenc Béres, András Benczúr, István Miklós

CoRR, 2023

On the Small Quasi-kernel conjecture.

Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia, Mykhaylo Tyomkyn

CoRR, 2023

Covering simple orthogonal polygons with r-stars.

Tamás Róbert Mezei

CoRR, 2023

2022

The mixing time of switch Markov chains: A unified approach.

Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup

Eur. J. Comb., 2022

Minimizing interference-to-signal ratios in multi-cell networks.

Péter L. Erdös, Tamás Róbert Mezei

CoRR, 2022

Approximate Sampling of Graphs with Near-P-stable Degree Intervals.

Péter L. Erdös, Tamás Róbert Mezei, István Miklós

CoRR, 2022

2021

Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks.

Péter L. Erdös, Andrew R. Francis, Tamás Róbert Mezei

Discret. Appl. Math., 2021

Algorithms for Interference Minimization in Future Wireless Network Decomposition.

Péter L. Erdös, Tamás Róbert Mezei, Yiding Yu, Xiang Chen, Wei Han, Bo Bai

CoRR, 2021

Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain.

Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész

Electron. J. Comb., 2021

2020

Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness.

Ivailo Hartarsky, Tamás Róbert Mezei

SIAM J. Discret. Math., 2020

2019

Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs.

Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei

Theor. Comput. Sci., 2019

Mobile versus Point Guards.

Ervin Györi, Tamás Róbert Mezei

Discret. Comput. Geom., 2019

A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing.

Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész

CoRR, 2019

The mixing time of the swap (switch) Markov chains: a unified approach.

Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup

CoRR, 2019

2018

Terminal-pairability in complete bipartite graphs.

Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei

Discret. Appl. Math., 2018

Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard.

Ivailo Hartarsky, Tamás Róbert Mezei

CoRR, 2018

2017

Note on terminal-pairability in complete grid graphs.

Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros

Discret. Math., 2017

Extremal solutions to some art gallery and terminal-pairability problems.

Tamás Róbert Mezei

CoRR, 2017

Mobile vs. point guards.

Ervin Györi, Tamás Róbert Mezei

CoRR, 2017

2016

Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem.

Ervin Györi, Tamás Róbert Mezei

Comput. Geom., 2016

2015

Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem.

Ervin Györi, Tamás Róbert Mezei

CoRR, 2015