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

Volltext

New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling von ERDŐS, PÉTER L., MIKLÓS, ISTVÁN, TOROCZKAI, ZOLTÁN

Volltext

A class of phylogenetic networks reconstructable from ancestral profiles von Erdős, Péter L., Semple, Charles, Steel, Mike

Volltext

A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix von Erdös, Péter L., Miklós, István, Toroczkai, Zoltán

Volltext

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

Approximate Counting of Graphical Realizations von Erdős, Péter L, Kiss, Sándor Z, Miklós, István, Soukup, Lajos

Volltext

Terminal-pairability in complete bipartite graphs von Colucci, Lucas, Erdős, Péter L., Győri, Ervin, Mezei, Tamás Róbert

Volltext

Exploring the Tiers of Rooted Phylogenetic Network Space Using Tail Moves von Janssen, Remie, Jones, Mark, Erdős, Péter L., van Iersel, Leo, Scornavacca, Celine

Volltext

Defining phylogenetic networks using ancestral profiles von Bai, Allan, Erdős, Péter L., Semple, Charles, Steel, Mike

Volltext

Degree-preserving network growth von Kharel, Shubha R., Mezei, Tamás R., Chung, Sukhwan, Erdős, Péter L., Toroczkai, Zoltan

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

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

Exact sampling of graphs with prescribed degree correlations von Bassler, Kevin E, Genio, Charo I Del, Erd s, Péter L, Miklós, István, Toroczkai, Zoltán

Volltext

Not all phylogenetic networks are leaf-reconstructible von Erdős, Péter L., van Iersel, Leo, Jones, Mark

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

Degree-preserving graph dynamics: a versatile process to construct random networks von Erdős, Péter L, Kharel, Shubha R, Mezei, Tamás R, Toroczkai, Zoltan

Volltext

Navigating between packings of graphic sequences von Erdős, Péter L., Ferrara, Michael, Hartke, Stephen G.

Volltext

On realizations of a joint degree matrix von Czabarka, Éva, Dutle, Aaron, Erdős, Péter L., Miklós, István

Volltext

Caterpillar Dualities and Regular Languages von Erdos, Peter L, Tardif, Claude, Tardos, Gabor

Volltext

Terminal-pairability in complete bipartite graphs with non-bipartite demands von Colucci, Lucas, Erdős, Péter L., Győri, Ervin, Mezei, Tamás Róbert

Volltext