| Publication | Date of Publication | Type |
|---|
Fully graphic degree sequences and P-stable degree sequences
Advances in Applied Mathematics | 2024-12-23 | Paper |
Mixing time of the swap Markov chain and \(P\)-stability
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Approximate sampling of graphs with near-\(P\)-stable degree intervals
Annals of Combinatorics | 2024-03-11 | Paper |
The sequence of prime gaps is graphic
Mathematische Annalen | 2024-02-09 | Paper |
| On the Small Quasi-kernel conjecture | 2023-07-09 | Paper |
| Minimizing interference-to-signal ratios in multi-cell networks | 2022-12-20 | Paper |
Defining phylogenetic networks using ancestral profiles
Mathematical Biosciences | 2021-11-08 | Paper |
| Algorithms for Interference Minimization in Future Wireless Network Decomposition | 2021-11-01 | Paper |
The mixing time of switch Markov chains: a unified approach
European Journal of Combinatorics | 2021-10-28 | Paper |
Half-graphs, other non-stable degree sequences, and the switch Markov chain
The Electronic Journal of Combinatorics | 2021-07-06 | Paper |
Navigating between packings of graphic sequences
Discrete Applied Mathematics | 2021-05-19 | Paper |
Navigating between packings of graphic sequences
Discrete Applied Mathematics | 2021-05-19 | Paper |
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks
Discrete Applied Mathematics | 2021-03-17 | Paper |
Exact sampling of graphs with prescribed degree correlations
New Journal of Physics | 2021-02-19 | Paper |
A class of phylogenetic networks reconstructable from ancestral profiles
Mathematical Biosciences | 2019-10-10 | Paper |
A high quartet distance construction
Annals of Combinatorics | 2019-06-14 | Paper |
Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
Theoretical Computer Science | 2019-05-29 | Paper |
| Two nearly equal distances in $R^d$ | 2019-01-04 | Paper |
Constructing big trees from short sequences
Automata, Languages and Programming | 2018-07-04 | Paper |
New classes of degree sequences with fast mixing swap Markov chain sampling
Combinatorics, Probability and Computing | 2018-05-24 | Paper |
Not all simple looking degree sequence problems are easy
Journal of Combinatorics | 2018-05-23 | Paper |
Regular families of forests, antichains and duality pairs of relational structures
Combinatorica | 2018-02-12 | Paper |
Regular families of forests, antichains and duality pairs of relational structures
Combinatorica | 2018-02-12 | Paper |
Terminal-pairability in complete bipartite graphs
Discrete Applied Mathematics | 2018-01-11 | Paper |
Terminal-pairability in complete bipartite graphs
Discrete Applied Mathematics | 2018-01-11 | Paper |
| Efficiently sampling the realizations of irregular, but linearly bounded bipartite and directed degree sequences | 2017-12-04 | Paper |
Graph realizations constrained by skeleton graphs
The Electronic Journal of Combinatorics | 2017-07-13 | Paper |
Graph realizations constrained by skeleton graphs
The Electronic Journal of Combinatorics | 2017-07-13 | Paper |
A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
On realizations of a joint degree matrix
Discrete Applied Mathematics | 2014-12-05 | Paper |
AZ-identities and strict 2-part Sperner properties of product posets
Order | 2014-06-12 | Paper |
AZ-identities and strict 2-part Sperner properties of product posets
Order | 2014-06-12 | Paper |
Modulated string searching
Theoretical Computer Science | 2014-03-13 | Paper |
Caterpillar dualities and regular languages
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
Caterpillar dualities and regular languages
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
On infinite-finite duality pairs of directed graphs
Order | 2013-11-22 | Paper |
| On two-part Sperner systems for regular posets (extended abstract) | 2013-11-01 | Paper |
Efficient algorithms for the periodic subgraphs mining problem
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Towards random uniform sampling of bipartite graphs with given degree sequence
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Towards random uniform sampling of bipartite graphs with given degree sequence
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
On the swap-distances of different realizations of a graphical degree sequence
Combinatorics, Probability and Computing | 2013-05-13 | Paper |
| Constructing, sampling and counting graphical realizations of restricted degree sequences | 2013-01-31 | Paper |
Generating functions for multi-labeled trees
Discrete Applied Mathematics | 2012-11-22 | Paper |
Parameterized searching with mismatches for run-length encoded strings
Theoretical Computer Science | 2012-10-11 | Paper |
A linear algorithm for string reconstruction in the reverse complement equivalence model
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Asymptotically normal distribution of some tree families relevant for phylogenectics, and of partitions without singletons
Moscow Journal of Combinatorics and Number Theory | 2012-09-05 | Paper |
Two-part set systems
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Two-part set systems
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
| A note on full transversals and mixed orthogonal arrays | 2011-05-31 | Paper |
Efficient Reconstruction of RC-Equivalent Strings
Lecture Notes in Computer Science | 2011-05-19 | Paper |
A tour of \(M\)-part \(L\)-Sperner families
Journal of Combinatorial Theory. Series A | 2011-01-14 | Paper |
Balanced vertices in trees and a simpler algorithm to compute the genomic distance
Applied Mathematics Letters | 2010-11-19 | Paper |
Balanced vertices in trees and a simpler algorithm to compute the genomic distance
Applied Mathematics Letters | 2010-11-19 | Paper |
No finite-infinite antichain duality in the homomorphism poset of directed graphs
Order | 2010-11-08 | Paper |
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
The Electronic Journal of Combinatorics | 2010-06-16 | Paper |
A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
The Electronic Journal of Combinatorics | 2010-06-16 | Paper |
Degree-based graph construction
Journal of Physics A: Mathematical and Theoretical | 2009-12-14 | Paper |
Quasi-kernels and quasi-sinks in infinite graphs
Discrete Mathematics | 2009-06-23 | Paper |
Parameterized matching with mismatches
Journal of Discrete Algorithms | 2008-05-16 | Paper |
All Maximum Size Two-Part Sperner Systems: In Short
Combinatorics, Probability and Computing | 2008-01-18 | Paper |
How to split antichains in infinite posets
Combinatorica | 2007-11-12 | Paper |
Subwords in reverse-complement order
Annals of Combinatorics | 2007-05-24 | Paper |
Two-Part and k-Sperner Families: New Proofs Using Permutations
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Non-trivial \(t\)-intersection in the function lattice
Annals of Combinatorics | 2005-12-13 | Paper |
Exordium for DNA codes
Journal of Combinatorial Optimization | 2005-03-15 | Paper |
Reconstructing words from subwords in linear time
Annals of Combinatorics | 2005-02-25 | Paper |
Note on the game chromatic index of trees
Theoretical Computer Science | 2004-10-27 | Paper |
\(X\)-trees and weighted quartet systems
Annals of Combinatorics | 2003-09-16 | Paper |
The combinatorics of evolutionary trees---a survey
Séminaire Lotharingien de Combinatoire | 2001-11-05 | Paper |
The combinatorics of evolutionary trees---a survey
Séminaire Lotharingien de Combinatoire | 2001-11-05 | Paper |
A finite word poset
The Electronic Journal of Combinatorics | 2001-10-16 | Paper |
A finite word poset
The Electronic Journal of Combinatorics | 2001-10-16 | Paper |
| scientific article; zbMATH DE number 1420985 (Why is no real title available?) | 2000-11-19 | Paper |
Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets
Combinatorica | 2000-11-13 | Paper |
| A few logs suffice to build (almost) all trees (I) | 2000-09-24 | Paper |
Some generalizations of property \(B\) and the splitting property
Annals of Combinatorics | 2000-02-23 | Paper |
A few logs suffice to build (almost) all trees. II
Theoretical Computer Science | 2000-01-12 | Paper |
Minimum multiway cuts in trees
Discrete Applied Mathematics | 1999-04-19 | Paper |
Pseudo-LYM inequalities and AZ identities
Advances in Applied Mathematics | 1998-07-13 | Paper |
Splitting property in infinite posets
Discrete Mathematics | 1997-10-06 | Paper |
Intersecting Systems
Combinatorics, Probability and Computing | 1997-09-28 | Paper |
| scientific article; zbMATH DE number 1047728 (Why is no real title available?) | 1997-08-11 | Paper |
| scientific article; zbMATH DE number 1026279 (Why is no real title available?) | 1997-06-24 | Paper |
| scientific article; zbMATH DE number 878311 (Why is no real title available?) | 1996-07-08 | Paper |
A splitting property of maximal antichains
Combinatorica | 1996-07-04 | Paper |
On the average rank of LYM-sets
Discrete Mathematics | 1996-03-19 | Paper |
On Intersecting Chains in Boolean Algebras
Combinatorics, Probability and Computing | 1995-02-16 | Paper |
| scientific article; zbMATH DE number 637307 (Why is no real title available?) | 1994-10-06 | Paper |
On weighted multiway cuts in trees
Mathematical Programming. Series A. Series B | 1994-09-26 | Paper |
A Group-Theoretic Setting for Some Intersecting Sperner Families
Combinatorics, Probability and Computing | 1994-08-10 | Paper |
Counting bichromatic evolutionary trees
Discrete Applied Mathematics | 1994-06-28 | Paper |
A new bijection on rooted forests
Discrete Mathematics | 1993-12-20 | Paper |
Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem
Advances in Applied Mathematics | 1993-10-18 | Paper |
Fourier calculus on evolutionary trees
Advances in Applied Mathematics | 1993-09-05 | Paper |
A Fourier inversion formula for evolutionary trees
Applied Mathematics Letters | 1993-08-11 | Paper |
Spectral analysis and a closest tree method for genetic sequences
Applied Mathematics Letters | 1993-04-01 | Paper |
Sharpening the LYM inequality
Combinatorica | 1993-01-17 | Paper |
Polytopes determined by complementfree Sperner families
Discrete Mathematics | 1990-01-01 | Paper |
Applications of antilexicographic order. I: An enumerative theory of trees
Advances in Applied Mathematics | 1989-01-01 | Paper |
Sperner families satisfying additional conditions and their convex hulls
Graphs and Combinatorics | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4170907 (Why is no real title available?) | 1987-01-01 | Paper |
All maximum 2-part Sperner families
Journal of Combinatorial Theory. Series A | 1986-01-01 | Paper |
Convex hulls of more-part Sperner families
Graphs and Combinatorics | 1986-01-01 | Paper |
Extremal hypergraph problems and convex hulls
Combinatorica | 1985-01-01 | Paper |
Any four independent edges of a 4-connected graph are contained in a circuit
Acta Mathematica Hungarica | 1985-01-01 | Paper |
Intersecting Sperner families and their convex hulls
Combinatorica | 1984-01-01 | Paper |
On automorphisms of line-graphs
European Journal of Combinatorics | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3661356 (Why is no real title available?) | 1979-01-01 | Paper |
Degree-preserving graph dynamics -- a versatile process to construct random networks
(available as arXiv preprint) | N/A | Paper |
On graphic degree sequences and matching numbers
(available as arXiv preprint) | N/A | Paper |
