Items where Author is "Mezei, Tamás Róbert"

Article

Erdős, Péter and Mezei, Tamás Róbert and Miklós, István (2024) Approximate Sampling and Counting of Graphs with Near-P-stable Degree Intervals. ANNALS OF COMBINATORICS. ISSN 0218-0006

Erdős, Péter and Harcos, Gergely and Kharel, Shubha R. and Maga, Péter and Mezei, Tamás Róbert (2023) The sequence of prime gaps is graphic. MATHEMATISCHE ANNALEN. ISSN 0025-5831

Erdős, Péter and Mezei, Tamás Róbert (2022) Minimizing interference-to-signal ratios in multi-cell telecommunication networks. ALGORITHMS, 16 (7). ISSN 1999-4893

Erdős, Péter and Greenhill, C. and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel and Soukup, Lajos (2022) The mixing time of switch Markov chains: A unified approach. EUROPEAN JOURNAL OF COMBINATORICS, 99. No.-103421. ISSN 0195-6698

Erdős, Péter and Kharel, S. and Mezei, Tamás Róbert and Toroczkai, Z. (2021) Degree preserving graph dynamics - a versatile process to construct random networks. JOURNAL OF COMPLEX NETWORKS, 11 (6). ISSN 2051-1310

Kharel, Shubha R. and Mezei, Tamás Róbert and Chung, Sukhwan and Erdős, Péter and Toroczkai, Zoltán (2021) Degree-preserving network growth. NATURE PHYSICS. ISSN 1745-2473 (In Press)

Erdős, Péter and Győri, Ervin and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel (2021) Half-graphs, other non-stable degree sequences, and the switch Markov chain. ELECTRONIC JOURNAL OF COMBINATORICS, 28 (3). ISSN 1097-1440

Erdős, Péter and Francis, A. and Mezei, Tamás Róbert (2021) Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks. DISCRETE APPLIED MATHEMATICS, 294. pp. 205-213. ISSN 0166-218X

Hartarsky, Ivailo and Mezei, Tamás Róbert (2020) Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness. SIAM JOURNAL ON DISCRETE MATHEMATICS, 34 (2). pp. 1444-1459. ISSN 0895-4801

Hartarsky, Ivailo and Mezei, Tamás Róbert (2020) Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard. SIAM JOURNAL ON DISCRETE MATHEMATICS, Submit. pp. 1-13. ISSN 0895-4801

Győri, Ervin and Mezei, Tamás Róbert (2019) Mobile vs. point guards. DISCRETE AND COMPUTATIONAL GEOMETRY. pp. 1-33. ISSN 0179-5376 (nyomtatott); 1432-0444 (online)

Erdős, Péter and Mezei, Tamás Róbert and Miklós, István and Soltész, Dániel (2018) Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs. PLOS ONE, 13 (8). ISSN 1932-6203

Colucci, Lucas and Erdős, Péter and Győri, Ervin and Mezei, Tamás Róbert (2018) Terminal-Pairability in Complete Bipartite Graph of Non-Bipartite Demands. THEORETICAL COMPUTER SCIENCE, 107. pp. 221-231. ISSN 0304-3975

Győri, Ervin and Mezei, Tamás Róbert and Mészáros, G. (2018) Terminal-pairability in complete graphs. JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING, 107. pp. 221-231. ISSN 0835-3026