Articles with public access mandates - Péter L. ErdősLearn more
Available somewhere: 44
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
Mandates: Hungarian Scientific Research Fund
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
Mandates: Australian Research Council, National Office for Research, Development and …
On realizations of a joint degree matrix
É Czabarka, A Dutle, PL Erdős, I Miklós
Discrete Applied Mathematics 181, 283-288, 2015
Mandates: Hungarian Scientific Research Fund
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
Mandates: Hungarian Scientific Research Fund
A class of phylogenetic networks reconstructable from ancestral profiles
PL Erdős, C Semple, M Steel
Mathematical biosciences 313, 33-40, 2019
Mandates: National Office for Research, Development and Innovation, Hungary
A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix
PL Erdos, I Miklós, Z Toroczkai
SIAM Journal on Discrete Mathematics 29 (1), 481-499, 2015
Mandates: Hungarian Scientific Research Fund
Approximate counting of graphical realizations
PL Erdős, SZ Kiss, I Miklós, L Soukup
PLoS One 10 (7), e0131300, 2015
Mandates: Hungarian Scientific Research Fund
New classes of degree sequences with fast mixing swap Markov chain sampling
PL Erdős, I Miklós, Z Toroczkai
Combinatorics, Probability and Computing 27 (2), 186-207, 2018
Mandates: US Department of Defense, National Office for Research, Development and …
Exploring the tiers of rooted phylogenetic network space using tail moves
R Janssen, M Jones, PL Erdős, L Van Iersel, C Scornavacca
Bulletin of mathematical biology 80, 2177-2208, 2018
Mandates: Netherlands Organisation for Scientific Research, National Office for …
Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs
PL Erdős, TR Mezei, I Miklós, D Soltész
Plos one 13 (8), e0201995, 2018
Mandates: Hungarian Scientific Research Fund, National Office for Research …
Degree-preserving network growth
SR Kharel, TR Mezei, S Chung, PL Erdős, Z Toroczkai
Nature Physics 18 (1), 100-106, 2022
Mandates: US National Science Foundation, National Office for Research, Development …
Parameterized searching with mismatches for run-length encoded strings
A Apostolico, PL Erdős, A Jüttner
Theoretical Computer Science 454, 23-29, 2012
Mandates: Hungarian Scientific Research Fund
Defining phylogenetic networks using ancestral profiles
A Bai, PL Erdős, C Semple, M Steel
Mathematical Biosciences 332, 108537, 2021
Mandates: National Office for Research, Development and Innovation, Hungary
Generating functions for multi-labeled trees
É Czabarka, PL Erdős, V Johnson, V Moulton
Discrete Applied Mathematics 161 (1-2), 107-117, 2013
Mandates: US National Institutes of Health, Hungarian Scientific Research Fund
Regular families of forests, antichains and duality pairs of relational structures
PL Erdős, D Pálvölgyi, C Tardif, G Tardos
Combinatorica 37, 651-672, 2017
Mandates: Hungarian Academy of Sciences, Hungarian Scientific Research Fund
A linear algorithm for string reconstruction in the reverse complement equivalence model
F Cicalese, PL Erdős, Z Lipták
Journal of Discrete Algorithms 14, 37-54, 2012
Mandates: Hungarian Scientific Research Fund
A tour of M-part L-Sperner families
H Aydinian, É Czabarka, PL Erdős, LA Székely
Journal of Combinatorial Theory, Series A 118 (2), 702-725, 2011
Mandates: German Research Foundation, Hungarian Scientific Research Fund
Caterpillar dualities and regular languages
PL Erdos, C Tardif, G Tardos
SIAM Journal on Discrete Mathematics 27 (3), 1287-1294, 2013
Mandates: Hungarian Scientific Research Fund
Balanced vertices in trees and a simpler algorithm to compute the genomic distance
PL Erdős, L Soukup, J Stoye
Applied mathematics letters 24 (1), 82-86, 2011
Mandates: Hungarian Scientific Research Fund
Not all simple looking degree sequence problems are easy
PL Erdős, I Miklós
arXiv preprint arXiv:1606.00730, 2016
Mandates: Hungarian Scientific Research Fund, National Office for Research …
Publication and funding information is determined automatically by a computer program