Tamás Róbert Mezei

25 papers Journal 24Unranked 1
YearRankTypeTitle / Venue / Authors
2025 — conf
On the Small Quasi-kernel Conjecture - A Survey.
Information Theory and Related Fields
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia, Mykhaylo Tyomkyn
2023 J jnl
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence.
CoRR
Andras Hubai, Tamás Róbert Mezei, Ferenc Béres, András Benczúr, István Miklós
2023 J jnl
Covering simple orthogonal polygons with r-stars.
CoRR
Tamás Róbert Mezei
2023 J jnl
Degree-preserving graph dynamics: a versatile process to construct random networks.
J. Complex Networks
Péter L. Erdös, Shubha R. Kharel, Tamás Róbert Mezei, Zoltán Toroczkai
2023 J jnl
Minimizing Interference-to-Signal Ratios in Multi-Cell Telecommunication Networks.
Algorithms
Péter L. Erdös, Tamás Róbert Mezei
2023 J jnl
On the Small Quasi-kernel conjecture.
CoRR
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia, Mykhaylo Tyomkyn
2022 J jnl
Approximate Sampling of Graphs with Near-P-stable Degree Intervals.
CoRR
Péter L. Erdös, Tamás Róbert Mezei, István Miklós
2022 J jnl
Minimizing interference-to-signal ratios in multi-cell networks.
CoRR
Péter L. Erdös, Tamás Róbert Mezei
2022 J jnl
The mixing time of switch Markov chains: A unified approach.
Eur. J. Comb.
Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
2021 J jnl
Algorithms for Interference Minimization in Future Wireless Network Decomposition.
CoRR
Péter L. Erdös, Tamás Róbert Mezei, Yiding Yu, Xiang Chen, Wei Han, Bo Bai
2021 J jnl
Degree-preserving graph dynamics - a versatile process to construct random networks.
CoRR
Péter L. Erdös, Shubha R. Kharel, Tamás Róbert Mezei, Zoltán Toroczkai
2021 J jnl
Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain.
Electron. J. Comb.
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
2021 J jnl
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks.
Discret. Appl. Math.
Péter L. Erdös, Andrew R. Francis, Tamás Róbert Mezei
2020 J jnl
Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness.
SIAM J. Discret. Math.
Ivailo Hartarsky, Tamás Róbert Mezei
2019 J jnl
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing.
CoRR
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
2019 J jnl
Mobile versus Point Guards.
Discret. Comput. Geom.
Ervin Györi, Tamás Róbert Mezei
2019 J jnl
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs.
Theor. Comput. Sci.
Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei
2019 J jnl
The mixing time of the swap (switch) Markov chains: a unified approach.
CoRR
Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
2018 J jnl
Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard.
CoRR
Ivailo Hartarsky, Tamás Róbert Mezei
2018 J jnl
Terminal-pairability in complete bipartite graphs.
Discret. Appl. Math.
Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei
2017 J jnl
Extremal solutions to some art gallery and terminal-pairability problems.
CoRR
Tamás Róbert Mezei
2017 J jnl
Mobile vs. point guards.
CoRR
Ervin Györi, Tamás Róbert Mezei
2017 J jnl
Note on terminal-pairability in complete grid graphs.
Discret. Math.
Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros
2016 J jnl
Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem.
Comput. Geom.
Ervin Györi, Tamás Róbert Mezei
2015 J jnl
Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem.
CoRR
Ervin Györi, Tamás Róbert Mezei