Péter L. Erdös

87 papers A* 1B 1C 2Journal 81Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Fully graphic degree sequences and P-stable degree sequences.
Adv. Appl. Math.
Péter L. Erdös, István Miklós, Lajos Soukup
2025 — conf
On the Small Quasi-kernel Conjecture - A Survey.
Information Theory and Related Fields
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia, Mykhaylo Tyomkyn
2024 J jnl
Fully graphic degree sequences and P-stable degree sequences.
CoRR
Péter L. Erdös, István Miklós, Lajos Soukup
2023 J jnl
Degree-preserving graph dynamics: a versatile process to construct random networks.
J. Complex Networks
Péter L. Erdös, Shubha R. Kharel, Tamás Róbert Mezei, Zoltán Toroczkai
2023 J jnl
Minimizing Interference-to-Signal Ratios in Multi-Cell Telecommunication Networks.
Algorithms
Péter L. Erdös, Tamás Róbert Mezei
2023 J jnl
On the Small Quasi-kernel conjecture.
CoRR
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia, Mykhaylo Tyomkyn
2022 J jnl
Approximate Sampling of Graphs with Near-P-stable Degree Intervals.
CoRR
Péter L. Erdös, Tamás Róbert Mezei, István Miklós
2022 J jnl
Minimizing interference-to-signal ratios in multi-cell networks.
CoRR
Péter L. Erdös, Tamás Róbert Mezei
2022 J jnl
The mixing time of switch Markov chains: A unified approach.
Eur. J. Comb.
Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
2021 J jnl
Algorithms for Interference Minimization in Future Wireless Network Decomposition.
CoRR
Péter L. Erdös, Tamás Róbert Mezei, Yiding Yu, Xiang Chen, Wei Han, Bo Bai
2021 J jnl
Degree-preserving graph dynamics - a versatile process to construct random networks.
CoRR
Péter L. Erdös, Shubha R. Kharel, Tamás Róbert Mezei, Zoltán Toroczkai
2021 J jnl
Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain.
Electron. J. Comb.
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
2021 J jnl
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks.
Discret. Appl. Math.
Péter L. Erdös, Andrew R. Francis, Tamás Róbert Mezei
2019 J jnl
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing.
CoRR
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
2019 J jnl
Navigating between packings of graphic sequences.
Discret. Appl. Math.
Péter L. Erdös, Michael Ferrara, Stephen G. Hartke
2019 J jnl
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs.
Theor. Comput. Sci.
Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei
2019 J jnl
The mixing time of the swap (switch) Markov chains: a unified approach.
CoRR
Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
2018 J jnl
New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling.
Comb. Probab. Comput.
Péter L. Erdös, István Miklós, Zoltán Toroczkai
2018 J jnl
Terminal-pairability in complete bipartite graphs.
Discret. Appl. Math.
Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei
2017 J jnl
Exploring the tiers of rooted phylogenetic network space using tail moves.
CoRR
Remie Janssen, Mark Jones, Péter L. Erdös, Leo van Iersel, Céline Scornavacca
2017 J jnl
Graph Realizations Constrained by Skeleton Graphs.
Electron. J. Comb.
Péter L. Erdös, Stephen G. Hartke, Leo van Iersel, István Miklós
2017 J jnl
Regular families of forests, antichains and duality pairs of relational structures.
Comb.
Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos
2016 J jnl
New classes of degree sequences with fast mixing swap Markov chain sampling.
CoRR
Péter L. Erdös, István Miklós, Zoltán Toroczkai
2016 J jnl
The second order degree sequence problem is NP-complete.
CoRR
Péter L. Erdös, István Miklós
2015 J jnl
A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix.
SIAM J. Discret. Math.
Péter L. Erdös, István Miklós, Zoltán Toroczkai
2015 J jnl
Exact sampling of graphs with prescribed degree correlations.
CoRR
Kevin E. Bassler, Charo I. Del Genio, Péter L. Erdös, István Miklós, Zoltán Toroczkai
2015 J jnl
On realizations of a joint degree matrix.
Discret. Appl. Math.
Éva Czabarka, Aaron Dutle, Péter L. Erdös, István Miklós
2014 J jnl
AZ-Identities and Strict 2-Part Sperner Properties of Product Posets.
Order
Harout K. Aydinian, Péter L. Erdös
2014 J jnl
Modulated string searching.
Theor. Comput. Sci.
Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons
2013 J jnl
A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix.
CoRR
Péter L. Erdös, István Miklós, Zoltán Toroczkai
2013 J jnl
Caterpillar Dualities and Regular Languages.
SIAM J. Discret. Math.
Péter L. Erdös, Claude Tardif, Gábor Tardos
2013 J jnl
Generating functions for multi-labeled trees.
Discret. Appl. Math.
Éva Czabarka, Péter L. Erdös, Virginia Johnson, Vincent Moulton
2013 J jnl
Modulated String Searching
CoRR
Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons
2013 J jnl
On Infinite-finite Duality Pairs of Directed Graphs.
Order
Péter L. Erdös, Claude Tardif, Gábor Tardos
2013 J jnl
On Realizations of a Joint Degree Matrix
CoRR
Éva Czabarka, Aaron Dutle, Péter L. Erdös, István Miklós
2013 J jnl
On the Swap-Distances of Different Realizations of a Graphical Degree Sequence.
Comb. Probab. Comput.
Péter L. Erdös, Zoltán Király, István Miklós
2013 J jnl
Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence.
Electron. J. Comb.
István Miklós, Péter L. Erdös, Lajos Soukup
2012 J jnl
A linear algorithm for string reconstruction in the reverse complement equivalence model.
J. Discrete Algorithms
Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták
2012 J jnl
Caterpillar dualities and regular languages
CoRR
Péter L. Erdös, Claude Tardif, Gábor Tardos
2012 J jnl
Efficient algorithms for the periodic subgraphs mining problem.
J. Discrete Algorithms
Alberto Apostolico, Péter L. Erdös, Ervin Györi, Zsuzsanna Lipták, Cinzia Pizzi
2012 J jnl
On infinite-finite duality pairs of directed graphs
CoRR
Péter L. Erdös, Claude Tardif, Gábor Tardos
2012 J jnl
On infinite-finite tree-duality pairs of relational structures
CoRR
Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos
2012 J jnl
On the swap-distances of different realizations of a graphical degree sequence
CoRR
Péter L. Erdös, Zoltán Király, István Miklós
2012 J jnl
Parameterized searching with mismatches for run-length encoded strings.
Theor. Comput. Sci.
Alberto Apostolico, Péter L. Erdös, Alpár Jüttner
2012 J jnl
Two-Part Set Systems.
Electron. J. Comb.
Péter L. Erdös, Dániel Gerbner, Nathan Lemons, Dhruv Mubayi, Cory Palmer, Balázs Patkós
2011 J jnl
A tour of M-part L-Sperner families.
J. Comb. Theory A
Harout K. Aydinian, Éva Czabarka, Péter L. Erdös, László A. Székely
2011 J jnl
Balanced vertices in trees and a simpler algorithm to compute the genomic distance.
Appl. Math. Lett.
Péter L. Erdös, Lajos Soukup, Jens Stoye
2011 J jnl
On two-part Sperner systems for regular posets (Extended Abstract).
Electron. Notes Discret. Math.
Harout K. Aydinian, Péter L. Erdös
2010 J jnl
A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs.
Electron. J. Comb.
Péter L. Erdös, István Miklós, Zoltán Toroczkai
2010 J jnl
A note on full transversals and mixed orthogonal arrays.
Australas. J Comb.
Harout K. Aydinian, Éva Czabarka, Konrad Engel, Péter L. Erdös, László A. Székely
2010 J jnl
Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance
CoRR
Péter L. Erdös, Lajos Soukup, Jens Stoye
2010 C conf
Efficient Reconstruction of RC-Equivalent Strings.
IWOCA
Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták
2010 J jnl
No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs.
Order
Péter L. Erdös, Lajos Soukup
2010 C conf
Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract).
SPIRE
Alberto Apostolico, Péter L. Erdös, Alpár Jüttner
2009 J jnl
Quasi-kernels and quasi-sinks in infinite graphs.
Discret. Math.
Péter L. Erdös, Lajos Soukup
2007 J jnl
All Maximum Size Two-Part Sperner Systems: In Short.
Comb. Probab. Comput.
Harout K. Aydinian, Péter L. Erdös
2007 J jnl
How To Split Antichains In Infinite Posets.
Comb.
Péter L. Erdös, Lajos Soukup
2007 J jnl
Parameterized matching with mismatches.
J. Discrete Algorithms
Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein
2006 — conf
Subwords in reverse-complement order.
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery
Péter L. Erdös, Péter Ligeti, Péter Sziklai, David C. Torney
2005 J jnl
Two-Part and
SIAM J. Discret. Math.
Péter L. Erdös, Zoltán Füredi, Gyula O. H. Katona
2004 J jnl
Note on the game chromatic index of trees.
Theor. Comput. Sci.
Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern
2003 J jnl
Exordium for DNA Codes.
J. Comb. Optim.
Arkadii G. D'yachkov, Péter L. Erdös, Anthony J. Macula, Vyacheslav V. Rykov, David C. Torney, Chang-Shung Tung, Pavel A. Vilenkin, P. Scott White
2001 J jnl
A Finite Word Poset.
Electron. J. Comb.
Péter L. Erdös, Péter Sziklai, David C. Torney
2000 J jnl
Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets.
Comb.
Péter L. Erdös, Ákos Seress, László A. Székely
1999 J jnl
A Few Logs Suffice to Build (almost) All Trees: Part II.
Theor. Comput. Sci.
Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy J. Warnow
1999 J jnl
A few logs suffice to build (almost) all trees (I).
Random Struct. Algorithms
Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy J. Warnow
1998 J jnl
Minimum Multiway Cuts in Trees.
Discret. Appl. Math.
Péter L. Erdös, András Frank, László A. Székely
1997 A* conf
Constructing Big Trees from Short Sequences.
ICALP
Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow
1997 J jnl
Intersecting Systems.
Comb. Probab. Comput.
Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely
1997 J jnl
Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule.
Comput. Artif. Intell.
Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow
1997 J jnl
Splitting property in infinite posets.
Discret. Math.
Péter L. Erdös
1995 J jnl
A Splitting Property of Maximal Antichains.
Comb.
Rudolf Ahlswede, Péter L. Erdös, Niall Graham
1995 J jnl
On the average rank of LYM-sets.
Discret. Math.
Péter L. Erdös, Ulrich Faigle, Walter Kern
1994 J jnl
On Intersecting Chains in Boolean Algebras.
Comb. Probab. Comput.
Péter L. Erdös, Ákos Seress, László A. Székely
1994 J jnl
On weighted multiway cuts in trees.
Math. Program.
Péter L. Erdös, László A. Székely
1993 J jnl
A new bijection on rooted forests.
Discret. Math.
Péter L. Erdös
1993 J jnl
Counting Bichromatic Evolutionary Trees.
Discret. Appl. Math.
Péter L. Erdös, László A. Székely
1992 J jnl
A Group-Theoretic Setting for Some Intersecting Sperner Families.
Comb. Probab. Comput.
Péter L. Erdös, Ulrich Faigle, Walter Kern
1992 B conf
Algorithms and Min-max Theorems for Certain Multiway Cuts.
IPCO
Péter L. Erdös, László A. Székely
1992 J jnl
Sharpening the LYM inequality.
Comb.
Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely
1990 J jnl
Polytopes determined by complementfree Sperner families.
Discret. Math.
Konrad Engel, Péter L. Erdös
1989 J jnl
Sperner families satisfying additional conditions and their convex hulls.
Graphs Comb.
Konrad Engel, Péter L. Erdös
1986 J jnl
All maximum 2-part Sperner families.
J. Comb. Theory A
Péter L. Erdös, Gyula O. H. Katona
1986 J jnl
Convex hulls of more-part Sperner families.
Graphs Comb.
Péter L. Erdös, Gyula O. H. Katona
1985 J jnl
Extremal hypergraph problems and convex hulls.
Comb.
Péter L. Erdös, Peter Frankl, Gyula O. H. Katona
1984 J jnl
Intersecting Sperner families and their convex hulls.
Comb.
Péter L. Erdös, Peter Frankl, Gyula O. H. Katona
1980 J jnl
On Automorphisms of Line-graphs.
Eur. J. Comb.
Péter L. Erdös, Zoltán Füredi