| Publication | Date of Publication | Type |
|---|
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 |
| Constructing and sampling partite, $3$-uniform hypergraphs with given degree sequence | 2023-08-25 | Paper |
| On the Small Quasi-kernel conjecture | 2023-07-09 | Paper |
| Covering simple orthogonal polygons with $r$-stars | 2023-04-26 | Paper |
| Minimizing interference-to-signal ratios in multi-cell networks | 2022-12-20 | 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 |
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks
Discrete Applied Mathematics | 2021-03-17 | Paper |
Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness
SIAM Journal on Discrete Mathematics | 2021-03-12 | 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 |
Terminal-pairability in complete graphs
(available as arXiv preprint) | 2019-03-11 | Paper |
Mobile versus point guards
Discrete & Computational Geometry | 2019-01-29 | 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 |
| Extremal solutions to some art gallery and terminal-pairability problems | 2017-08-29 | Paper |
Note on terminal-pairability in complete grid graphs
Discrete Mathematics | 2017-02-27 | Paper |
Note on terminal-pairability in complete grid graphs
Discrete Mathematics | 2017-02-27 | Paper |
Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem
Computational Geometry | 2016-11-14 | 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 |
