A few logs suffice to build (almost) all trees (I) PL Erdos, MA Steel, LA Székely, TJ Warnow Random Structures and Algorithms 14 (2), 153-184, 1999 | 361* | 1999 |
Degree-based graph construction H Kim, Z Toroczkai, PL Erdős, I Miklós, LA Székely Journal of Physics A: Mathematical and Theoretical 42, 392001, 2009 | 117* | 2009 |
Fourier calculus on evolutionary trees MA Steel, LA Székely, PL Erdős Adv Appl Math 14, 200-216, 1993 | 98 | 1993 |
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs PL Erdős, I Miklós, Z Toroczkai arXiv preprint arXiv:0905.4913, 2009 | 82 | 2009 |
A complete family of phylogenetic invariants for any number of taxa under Kimura's 3ST model M Steel, L Székely, PL Erdös, P Waddell New Zealand journal of botany 31 (3), 289-296, 1993 | 76 | 1993 |
Towards random uniform sampling of bipartite graphs with given degree sequence PL Erdös, I Miklós, L Soukup Electronic Journal of Combinatorics 20 (1), #16, 2013 | 70 | 2013 |
Exordium for DNA codes AG D'yachkov, PL Erdös, AJ Macula, VV Rykov, DC Torney, CS Tung, ... Journal of Combinatorial Optimization 7, 369-379, 2003 | 60 | 2003 |
Constructing big trees from short sequences PL Erdös, MA Steel, LA Székely, TJ Warnow Automata, Languages and Programming: 24th International Colloquium, ICALP'97 …, 1997 | 60 | 1997 |
Exact sampling of graphs with prescribed degree correlations KE Bassler, CI Del Genio, PL Erdős, I Miklós, Z Toroczkai New Journal of Physics 17 (8), 083052, 2015 | 54 | 2015 |
Parameterized matching with mismatches A Apostolico, PL Erdős, M Lewenstein Journal of Discrete Algorithms 5 (1), 135-140, 2007 | 54 | 2007 |
On weighted multiway cuts in trees PL Erdős, LA Székely Mathematical programming 65 (1), 93-105, 1994 | 54 | 1994 |
Extremal hypergraph problems and convex hulls PL Erdős, GOH Katona, P Frankl Combinatorica 5, 11-26, 1985 | 50 | 1985 |
Intersecting Sperner families and their convex hulls PL Erdős, P Frankl, GOH Katona Combinatorica 4, 21-34, 1984 | 47 | 1984 |
Spectral analysis and a closest tree method for genetic sequences MA Steel, MD Hendy, LA Székely, PL Erdös Applied mathematics letters 5 (6), 63-67, 1992 | 44 | 1992 |
Note on the game chromatic index of trees PL Erdös, U Faigle, W Hochstättler, W Kern Theoretical Computer Science 313 (3), 371-376, 2004 | 42 | 2004 |
On realizations of a joint degree matrix É Czabarka, A Dutle, PL Erdős, I Miklós Discrete Applied Mathematics 181, 283-288, 2015 | 41 | 2015 |
The mixing time of switch Markov chains: a unified approach PL Erdős, C Greenhill, TR Mezei, I Miklós, D Soltész, L Soukup European Journal of Combinatorics 99, 103421, 2022 | 39* | 2022 |
Local quartet splits of a binary tree infer all quartet splits via one dyadic inference rule PL Erdos, MA Steel, LA Szekely, T Warnow Computers and Artificial Intelligence 16 (2), 217-227, 1997 | 38 | 1997 |
On the swap-distances of different realizations of a graphical degree sequence PL Erdős, Z Király, I Miklós Combinatorics, Probability and Computing 22 (3), 366-383, 2013 | 37* | 2013 |
A group-theoretic setting for some intersecting Sperner families PL Erdős, U Faigle, W Kern Combinatorics, Probability and Computing 1 (4), 323-334, 1992 | 37 | 1992 |