default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Róbert Mezei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Péter L. Erdös
, Tamás Róbert Mezei:
Minimizing Interference-to-Signal Ratios in Multi-Cell Telecommunication Networks. Algorithms 16(7): 341 (2023)- [j10]Péter L. Erdös, Shubha R. Kharel, Tamás Róbert Mezei, Zoltán Toroczkai:
Degree-preserving graph dynamics: a versatile process to construct random networks. J. Complex Networks 11(5) (2023) - [i13]Tamás Róbert Mezei:
Covering simple orthogonal polygons with r-stars. CoRR abs/2304.13699 (2023) - [i12]Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia, Mykhaylo Tyomkyn:
On the Small Quasi-kernel conjecture. CoRR abs/2307.04112 (2023) - [i11]Andras Hubai, Tamás Róbert Mezei, Ferenc Béres, András Benczúr, István Miklós:
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence. CoRR abs/2308.13251 (2023) - 2022
- [j9]Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup:
The mixing time of switch Markov chains: A unified approach. Eur. J. Comb. 99: 103421 (2022) - [i10]Péter L. Erdös, Tamás Róbert Mezei, István Miklós:
Approximate Sampling of Graphs with Near-P-stable Degree Intervals. CoRR abs/2204.09493 (2022) - [i9]Péter L. Erdös, Tamás Róbert Mezei:
Minimizing interference-to-signal ratios in multi-cell networks. CoRR abs/2212.10129 (2022) - 2021
- [j8]Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész:
Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain. Electron. J. Comb. 28(3): 3 (2021) - [j7]Péter L. Erdös, Andrew R. Francis, Tamás Róbert Mezei:
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks. Discret. Appl. Math. 294: 205-213 (2021) - [i8]Péter L. Erdös, Tamás Róbert Mezei, Yiding Yu, Xiang Chen, Wei Han, Bo Bai:
Algorithms for Interference Minimization in Future Wireless Network Decomposition. CoRR abs/2111.00885 (2021) - [i7]Péter L. Erdös, Shubha R. Kharel, Tamás Róbert Mezei, Zoltán Toroczkai:
Degree-preserving graph dynamics - a versatile process to construct random networks. CoRR abs/2111.11994 (2021) - 2020
- [j6]Ivailo Hartarsky, Tamás Róbert Mezei:
Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness. SIAM J. Discret. Math. 34(2): 1444-1459 (2020)
2010 – 2019
- 2019
- [j5]Ervin Györi, Tamás Róbert Mezei:
Mobile versus Point Guards. Discret. Comput. Geom. 61(2): 421-451 (2019) - [j4]Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei:
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs. Theor. Comput. Sci. 775: 16-25 (2019) - [i6]Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup:
The mixing time of the swap (switch) Markov chains: a unified approach. CoRR abs/1903.06600 (2019) - [i5]Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész:
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing. CoRR abs/1909.02308 (2019) - 2018
- [j3]Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei:
Terminal-pairability in complete bipartite graphs. Discret. Appl. Math. 236: 459-463 (2018) - [i4]Ivailo Hartarsky, Tamás Róbert Mezei:
Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard. CoRR abs/1809.01525 (2018) - 2017
- [j2]Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros:
Note on terminal-pairability in complete grid graphs. Discret. Math. 340(5): 988-990 (2017) - [i3]Ervin Györi, Tamás Róbert Mezei:
Mobile vs. point guards. CoRR abs/1706.02619 (2017) - [i2]Tamás Róbert Mezei:
Extremal solutions to some art gallery and terminal-pairability problems. CoRR abs/1708.08691 (2017) - 2016
- [j1]Ervin Györi, Tamás Róbert Mezei:
Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem. Comput. Geom. 59: 13-25 (2016) - 2015
- [i1]Ervin Györi, Tamás Róbert Mezei:
Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem. CoRR abs/1509.05227 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
