| Publication | Date of Publication | Type |
|---|
| Approximate sampling of graphs with near-\(P\)-stable degree intervals | 2024-03-11 | Paper |
| The sequence of prime gaps is graphic | 2024-02-09 | Paper |
| Defining phylogenetic networks using ancestral profiles | 2021-11-08 | Paper |
| The mixing time of switch Markov chains: a unified approach | 2021-10-28 | Paper |
| Half-graphs, other non-stable degree sequences, and the switch Markov chain | 2021-07-06 | Paper |
| Navigating between packings of graphic sequences | 2021-05-19 | Paper |
| Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks | 2021-03-17 | Paper |
| Exact sampling of graphs with prescribed degree correlations | 2021-02-19 | Paper |
| A class of phylogenetic networks reconstructable from ancestral profiles | 2019-10-10 | Paper |
| A high quartet distance construction | 2019-06-14 | Paper |
| Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs | 2019-05-29 | Paper |
| Constructing big trees from short sequences | 2018-07-04 | Paper |
| New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling | 2018-05-24 | Paper |
| Not all simple looking degree sequence problems are easy | 2018-05-23 | Paper |
| Regular families of forests, antichains and duality pairs of relational structures | 2018-02-12 | Paper |
| Terminal-pairability in complete bipartite graphs | 2018-01-11 | Paper |
| Graph realizations constrained by skeleton graphs | 2017-07-13 | Paper |
| A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix | 2015-05-20 | Paper |
| On realizations of a joint degree matrix | 2014-12-05 | Paper |
| AZ-identities and strict 2-part Sperner properties of product posets | 2014-06-12 | Paper |
| Modulated string searching | 2014-03-13 | Paper |
| Caterpillar Dualities and Regular Languages | 2014-01-21 | Paper |
| On infinite-finite duality pairs of directed graphs | 2013-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857324 | 2013-11-01 | Paper |
| Efficient algorithms for the periodic subgraphs mining problem | 2013-06-24 | Paper |
| Towards random uniform sampling of bipartite graphs with given degree sequence | 2013-06-07 | Paper |
| On the Swap-Distances of Different Realizations of a Graphical Degree Sequence | 2013-05-13 | Paper |
| Generating functions for multi-labeled trees | 2012-11-22 | Paper |
| Parameterized searching with mismatches for run-length encoded strings | 2012-10-11 | Paper |
| A linear algorithm for string reconstruction in the reverse complement equivalence model | 2012-09-13 | Paper |
| Asymptotically normal distribution of some tree families relevant for phylogenectics, and of partitions without singletons | 2012-09-05 | Paper |
| Two-part set systems | 2012-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3001194 | 2011-05-31 | Paper |
| Efficient Reconstruction of RC-Equivalent Strings | 2011-05-19 | Paper |
| A tour of \(M\)-part \(L\)-Sperner families | 2011-01-14 | Paper |
| Balanced vertices in trees and a simpler algorithm to compute the genomic distance | 2010-11-19 | Paper |
| No finite-infinite antichain duality in the homomorphism poset of directed graphs | 2010-11-08 | Paper |
| A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs | 2010-06-16 | Paper |
| Degree-based graph construction | 2009-12-14 | Paper |
| Quasi-kernels and quasi-sinks in infinite graphs | 2009-06-23 | Paper |
| Parameterized matching with mismatches | 2008-05-16 | Paper |
| All Maximum Size Two-Part Sperner Systems: In Short | 2008-01-18 | Paper |
| How to split antichains in infinite posets | 2007-11-12 | Paper |
| Subwords in reverse-complement order | 2007-05-24 | Paper |
| Two-Part and k-Sperner Families: New Proofs Using Permutations | 2006-06-01 | Paper |
| Non-trivial \(t\)-intersection in the function lattice | 2005-12-13 | Paper |
| Exordium for DNA codes | 2005-03-15 | Paper |
| Reconstructing words from subwords in linear time | 2005-02-25 | Paper |
| Note on the game chromatic index of trees | 2004-10-27 | Paper |
| \(X\)-trees and weighted quartet systems | 2003-09-16 | Paper |
| The combinatorics of evolutionary trees---a survey | 2001-11-05 | Paper |
| A finite word poset | 2001-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945057 | 2000-11-19 | Paper |
| Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets | 2000-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4238440 | 2000-09-24 | Paper |
| Some generalizations of property \(B\) and the splitting property | 2000-02-23 | Paper |
| A few logs suffice to build (almost) all trees. II | 2000-01-12 | Paper |
| Minimum multiway cuts in trees | 1999-04-19 | Paper |
| Pseudo-LYM inequalities and AZ identities | 1998-07-13 | Paper |
| Splitting property in infinite posets | 1997-10-06 | Paper |
| Intersecting Systems | 1997-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347895 | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4342904 | 1997-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4877572 | 1996-07-08 | Paper |
| A splitting property of maximal antichains | 1996-07-04 | Paper |
| On the average rank of LYM-sets | 1996-03-19 | Paper |
| On Intersecting Chains in Boolean Algebras | 1995-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304358 | 1994-10-06 | Paper |
| On weighted multiway cuts in trees | 1994-09-26 | Paper |
| A Group-Theoretic Setting for Some Intersecting Sperner Families | 1994-08-10 | Paper |
| Counting bichromatic evolutionary trees | 1994-06-28 | Paper |
| A new bijection on rooted forests | 1993-12-20 | Paper |
| Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem | 1993-10-18 | Paper |
| Fourier calculus on evolutionary trees | 1993-09-05 | Paper |
| A Fourier inversion formula for evolutionary trees | 1993-08-11 | Paper |
| Spectral analysis and a closest tree method for genetic sequences | 1993-04-01 | Paper |
| Sharpening the LYM inequality | 1993-01-17 | Paper |
| Polytopes determined by complementfree Sperner families | 1990-01-01 | Paper |
| Applications of antilexicographic order. I: An enumerative theory of trees | 1989-01-01 | Paper |
| Sperner families satisfying additional conditions and their convex hulls | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3496336 | 1987-01-01 | Paper |
| All maximum 2-part Sperner families | 1986-01-01 | Paper |
| Convex hulls of more-part Sperner families | 1986-01-01 | Paper |
| Extremal hypergraph problems and convex hulls | 1985-01-01 | Paper |
| Any four independent edges of a 4-connected graph are contained in a circuit | 1985-01-01 | Paper |
| Intersecting Sperner families and their convex hulls | 1984-01-01 | Paper |
| On automorphisms of line-graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3859803 | 1979-01-01 | Paper |
