| Publication | Date of Publication | Type |
|---|
| Fully graphic degree sequences and P-stable degree sequences | 2024-12-23 | Paper |
| Mixing time of the swap Markov chain and \(P\)-stability | 2024-10-18 | Paper |
| Approximate sampling of graphs with near-\(P\)-stable degree intervals | 2024-03-11 | Paper |
| Superpolynomial period lengths of the winning positions in the subtraction game | 2023-12-04 | Paper |
| Dense, irregular, yet always graphic $3$-uniform hypergraph degree sequences | 2023-12-01 | Paper |
| Constructing and sampling partite, $3$-uniform hypergraphs with given degree sequence | 2023-08-25 | Paper |
| A Markov chain on the solution space of edge colorings of bipartite graphs | 2023-04-17 | Paper |
| Constructing bounded degree graphs with prescribed degree and neighbor degree sequences | 2023-04-17 | Paper |
| The mixing time of switch Markov chains: a unified approach | 2021-10-28 | Paper |
| Constructing bounded degree graphs with prescribed degree and neighbor degree sequences | 2021-09-27 | Paper |
| Half-graphs, other non-stable degree sequences, and the switch Markov chain | 2021-07-06 | Paper |
| A Markov chain on the solution space of edge-colorings of bipartite graphs | 2021-03-22 | Paper |
| #P-hardness proofs of matrix immanants evaluated on restricted matrices | 2021-03-08 | Paper |
| Exact sampling of graphs with prescribed degree correlations | 2021-02-19 | Paper |
| Edge disjoint caterpillar realizations | 2020-12-29 | Paper |
| Packing tree degree sequences | 2020-04-30 | Paper |
| Counting Maximum Matchings in Planar Graphs Is Hard | 2020-01-06 | Paper |
| The computational complexity of calculating partition functions of optimal medians with Hamming distance | 2018-12-06 | Paper |
| Computational Complexity of Counting and Sampling | 2018-10-05 | 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 |
| Efficiently sampling the realizations of irregular, but linearly bounded bipartite and directed degree sequences | 2017-12-04 | Paper |
| Half-regular factorizations of the complete bipartite graph | 2017-08-22 | Paper |
| Graph realizations constrained by skeleton graphs | 2017-07-13 | Paper |
| Packing tree degree sequences | 2017-04-24 | Paper |
| Moments of the Boltzmann distribution for RNA secondary structures | 2016-04-05 | Paper |
| An improved algorithm for statistical alignment of sequences related by a star tree | 2016-03-08 | Paper |
| Proving the pressing game conjecture on linear graphs | 2016-01-05 | 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 |
| Counting and sampling SCJ small parsimony solutions | 2014-09-10 | Paper |
| Modulated string searching | 2014-03-13 | 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 |
| Constructing, sampling and counting graphical realizations of restricted degree sequences | 2013-01-31 | Paper |
| Approximating the number of double cut-and-join scenarios | 2012-08-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 |
| A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer | 2007-08-30 | Paper |
| Comparative Genomics | 2006-10-19 | Paper |
| Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution | 2003-04-28 | Paper |
| An Improved Model for Statistical Alignment | 2003-04-06 | Paper |
