Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs von Erdős, Péter L, Mezei, Tamás Róbert, Miklós, István, Soltész, Dániel

Volltext

Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence von Hubai, András, Mezei, Tamás Róbert, Béres, Ferenc, Benczúr, András, Miklós, István

Volltext

Oral administration of pyrophosphate inhibits connective tissue calcification von Dedinszki, Dóra, Szeri, Flóra, Kozák, Eszter, Pomozi, Viola, Tőkési, Natália, Mezei, Tamás Róbert, Merczel, Kinga, Letavernier, Emmanuel, Tang, Ellie, Le Saux, Olivier, Arányi, Tamás, van de Wetering, Koen, Váradi, András

Volltext

Minimizing Interference-to-Signal Ratios in Multi-Cell Telecommunication Networks von Erdős, Péter L., Mezei, Tamás Róbert

Volltext

Mobile versus Point Guards von Győri, Ervin, Mezei, Tamás Róbert

Volltext

Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain von Erdős, Péter L., Győri, Ervin, Mezei, Tamás Róbert, Miklós, István, Soltész, Dániel

Volltext

New Results on Graph Matching from Degree-Preserving Growth von Erdős, Péter L., Kharel, Shubha R., Mezei, Tamás Róbert, Toroczkai, Zoltán

Volltext

Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks von Erdős, Péter L., Francis, Andrew, Mezei, Tamás Róbert

Volltext

Electrochemical Investigation of the Corrosion Inhibiting Effect of Organic Paints Doped with Benzotriazole Coated on Steel Substrates von Both, Júlia, Mezei, Róbert, Szabó, Gabriella, Mureşan, Liana Maria

Volltext

The mixing time of switch Markov chains: A unified approach von Erdős, Péter L., Greenhill, Catherine, Mezei, Tamás Róbert, Miklós, István, Soltész, Dániel, Soukup, Lajos

Volltext

The sequence of prime gaps is graphic von Erdős, Péter L., Harcos, Gergely, Kharel, Shubha R., Maga, Péter, Mezei, Tamás Róbert, Toroczkai, Zoltán

Volltext

Approximate Sampling of Graphs with Near-P-Stable Degree Intervals von Erdős, Péter L., Mezei, Tamás Róbert, Miklós, István

Volltext

Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem von Győri, Ervin, Mezei, Tamás Róbert

Volltext

Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness von Hartarsky, Ivailo, Mezei, Tamás Róbert

Volltext

New results on graph matching from degree preserving growth von Erdős, Péter L, Kharel, Shubha R, Tamás Róbert Mezei, Toroczkai, Zoltán

Volltext

Minimizing interference-to-signal ratios in multi-cell networks von Erdős, Péter L, Mezei, Tamás Róbert

Volltext

Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence von András Hubai, Tamás Róbert Mezei, Ferenc Béres, András Benczúr, István Miklós

Volltext

Note on terminal-pairability in complete grid graphs von Győri, Ervin, Mezei, Tamás Róbert, Mészáros, Gábor

Volltext

Complexity of 2D bootstrap percolation difficulty: Algorithm and NP-hardness von Hartarsky, Ivailo, Tamás Róbert Mezei

Volltext

Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite bipartite and directed graphs von Erdos, Péter L, Mezei, Tamás Róbert, Miklós, István, Soltész, Dániel

Volltext