Péter L. Erdös

Adv. Appl. Math., 2025

2023

Degree-preserving graph dynamics: a versatile process to construct random networks.

[BibT_eX]

[DOI]

J. Complex Networks, September, 2023

Minimizing Interference-to-Signal Ratios in Multi-Cell Telecommunication Networks.

[BibT_eX]

[DOI]

Algorithms, July, 2023

On the Small Quasi-kernel conjecture.

[BibT_eX]

[DOI]

CoRR, 2023

2022

The mixing time of switch Markov chains: A unified approach.

[BibT_eX]

[DOI]

Catherine S. Greenhill

Eur. J. Comb., 2022

Minimizing interference-to-signal ratios in multi-cell networks.

[BibT_eX]

[DOI]

CoRR, 2022

Approximate Sampling of Graphs with Near-P-stable Degree Intervals.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks.

[BibT_eX]

[DOI]

Andrew R. Francis

Discret. Appl. Math., 2021

Algorithms for Interference Minimization in Future Wireless Network Decomposition.

[BibT_eX]

[DOI]

CoRR, 2021

Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2019

Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Navigating between packings of graphic sequences.

[BibT_eX]

[DOI]

Michael Ferrara

Stephen G. Hartke

Discret. Appl. Math., 2019

A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing.

[BibT_eX]

[DOI]

CoRR, 2019

The mixing time of the swap (switch) Markov chains: a unified approach.

[BibT_eX]

[DOI]

Catherine S. Greenhill

CoRR, 2019

2018

Terminal-pairability in complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling.

[BibT_eX]

[DOI]

Zoltán Toroczkai

Comb. Probab. Comput., 2018

2017

Exploring the tiers of rooted phylogenetic network space using tail moves.

[BibT_eX]

[DOI]

CoRR, 2017

Graph Realizations Constrained by Skeleton Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

Regular families of forests, antichains and duality pairs of relational structures.

[BibT_eX]

[DOI]

Comb., 2017

2016

The second order degree sequence problem is NP-complete.

[BibT_eX]

[DOI]

CoRR, 2016

2015

A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix.

[BibT_eX]

[DOI]

Zoltán Toroczkai

SIAM J. Discret. Math., 2015

On realizations of a joint degree matrix.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Exact sampling of graphs with prescribed degree correlations.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Modulated string searching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

AZ-Identities and Strict 2-Part Sperner Properties of Product Posets.

[BibT_eX]

[DOI]

Harout K. Aydinian

Order, 2014

2013

Caterpillar Dualities and Regular Languages.

[BibT_eX]

[DOI]

Claude Tardif

Gábor Tardos

SIAM J. Discret. Math., 2013

On Infinite-finite Duality Pairs of Directed Graphs.

[BibT_eX]

[DOI]

Claude Tardif

Gábor Tardos

Order, 2013

Generating functions for multi-labeled trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

On the Swap-Distances of Different Realizations of a Graphical Degree Sequence.

[BibT_eX]

[DOI]

Zoltán Király

Comb. Probab. Comput., 2013

Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

Parameterized searching with mismatches for run-length encoded strings.

[BibT_eX]

[DOI]

Alberto Apostolico

Alpár Jüttner

Theor. Comput. Sci., 2012

A linear algorithm for string reconstruction in the reverse complement equivalence model.

[BibT_eX]

[DOI]

Ferdinando Cicalese

Zsuzsanna Lipták

J. Discrete Algorithms, 2012

Efficient algorithms for the periodic subgraphs mining problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

On infinite-finite tree-duality pairs of relational structures

[BibT_eX]

[DOI]

CoRR, 2012

Two-Part Set Systems.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2011

A tour of M-part L-Sperner families.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

On two-part Sperner systems for regular posets (Extended Abstract).

[BibT_eX]

[DOI]

Harout K. Aydinian

Electron. Notes Discret. Math., 2011

Balanced vertices in trees and a simpler algorithm to compute the genomic distance.

[BibT_eX]

[DOI]

Jens Stoye

Appl. Math. Lett., 2011

2010

No Finite-Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs.

[BibT_eX]

[DOI]

Order, 2010

A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs.

[BibT_eX]

[DOI]

Zoltán Toroczkai

Electron. J. Comb., 2010

A note on full transversals and mixed orthogonal arrays.

[BibT_eX]

[DOI]

Australas. J Comb., 2010

Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract).

[BibT_eX]

[DOI]

Alberto Apostolico

Alpár Jüttner

Proceedings of the String Processing and Information Retrieval, 2010

Efficient Reconstruction of RC-Equivalent Strings.

[BibT_eX]

[DOI]

Ferdinando Cicalese

Zsuzsanna Lipták

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

Quasi-kernels and quasi-sinks in infinite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

2007

Parameterized matching with mismatches.

[BibT_eX]

[DOI]

Alberto Apostolico

Moshe Lewenstein

J. Discrete Algorithms, 2007

All Maximum Size Two-Part Sperner Systems: In Short.

[BibT_eX]

[DOI]

Harout K. Aydinian

Comb. Probab. Comput., 2007

How To Split Antichains In Infinite Posets.

[BibT_eX]

[DOI]

Comb., 2007

2006

Subwords in reverse-complement order.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05., 2006

2005

Two-Part and <i>k</i>-Sperner Families: New Proofs Using Permutations.

[BibT_eX]

[DOI]

Zoltán Füredi

SIAM J. Discret. Math., 2005

2004

Note on the game chromatic index of trees.

[BibT_eX]

[DOI]

Ulrich Faigle

Winfried Hochstättler

Walter Kern

Theor. Comput. Sci., 2004

2003

Exordium for DNA Codes.

[BibT_eX]

[DOI]

J. Comb. Optim., 2003

2001

A Finite Word Poset.

[BibT_eX]

[DOI]

Péter Sziklai

David C. Torney

Electron. J. Comb., 2001

2000

Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets.

[BibT_eX]

[DOI]

Ákos Seress

Comb., 2000

1999

A Few Logs Suffice to Build (almost) All Trees: Part II.

[BibT_eX]

[DOI]

Michael Anthony Steel

Tandy J. Warnow

Theor. Comput. Sci., 1999

A few logs suffice to build (almost) all trees (I).

[BibT_eX]

[DOI]

Michael Anthony Steel

Tandy J. Warnow

Random Struct. Algorithms, 1999

1998

Minimum Multiway Cuts in Trees.

[BibT_eX]

[DOI]

András Frank

Discret. Appl. Math., 1998

1997

Splitting property in infinite posets.

[BibT_eX]

[DOI]

Discret. Math., 1997

Intersecting Systems.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1997

Constructing Big Trees from Short Sequences.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1995

On the average rank of LYM-sets.

[BibT_eX]

[DOI]

Ulrich Faigle

Walter Kern

Discret. Math., 1995

A Splitting Property of Maximal Antichains.

[BibT_eX]

[DOI]

Rudolf Ahlswede

Niall Graham

Comb., 1995

1994

On weighted multiway cuts in trees.

[BibT_eX]

[DOI]

Math. Program., 1994

On Intersecting Chains in Boolean Algebras.

[BibT_eX]

[DOI]

Ákos Seress

Comb. Probab. Comput., 1994

1993

A new bijection on rooted forests.

[BibT_eX]

[DOI]

Discret. Math., 1993

Counting Bichromatic Evolutionary Trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

1992

A Group-Theoretic Setting for Some Intersecting Sperner Families.

[BibT_eX]

[DOI]

Ulrich Faigle

Walter Kern

Comb. Probab. Comput., 1992

Sharpening the LYM inequality.

[BibT_eX]

[DOI]

Comb., 1992

Algorithms and Min-max Theorems for Certain Multiway Cuts.

[BibT_eX]

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1990

Polytopes determined by complementfree Sperner families.

[BibT_eX]

[DOI]

Konrad Engel

Discret. Math., 1990

1989

Sperner families satisfying additional conditions and their convex hulls.

[BibT_eX]

[DOI]

Konrad Engel

Graphs Comb., 1989

1986

All maximum 2-part Sperner families.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

Convex hulls of more-part Sperner families.

[BibT_eX]

[DOI]

Graphs Comb., 1986

1985

Extremal hypergraph problems and convex hulls.

[BibT_eX]

[DOI]

Peter Frankl

Comb., 1985

1984

Intersecting Sperner families and their convex hulls.

[BibT_eX]

[DOI]

Peter Frankl

Comb., 1984

1980

On Automorphisms of Line-graphs.

[BibT_eX]

[DOI]