| Publication | Date of Publication | Type |
|---|
| Bounds on data limits for all-to-all comparison from combinatorial designs | 2024-10-14 | Paper |
| Zarankiewicz numbers near the triple system threshold | 2024-08-08 | Paper |
| New lower bounds for \(t\)-coverings | 2024-07-16 | Paper |
| Minimising the total number of subsets and supersets | 2024-03-26 | Paper |
| Exact values for some unbalanced Zarankiewicz numbers | 2024-03-25 | Paper |
| More constructions for Sperner partition systems | 2024-02-02 | Paper |
| On determining when small embeddings of partial Steiner triple systems exist | 2024-01-31 | Paper |
| Zarankiewicz numbers near the triple system threshold | 2023-10-19 | Paper |
| The cyclic matching sequenceability of regular graphs | 2023-10-04 | Paper |
| Induced path factors of regular graphs | 2023-09-29 | Paper |
| Bounds on data limits for all-to-all comparison from combinatorial designs | 2023-08-31 | Paper |
| Smaller embeddings of partial \(k\)-star decompositions | 2023-02-17 | Paper |
| Block avoiding point sequencings of partial Steiner systems | 2022-09-22 | Paper |
| An Evans-Style Result for Block Designs | 2022-01-07 | Paper |
| Smaller embeddings of partial $k$-star decompositions | 2021-09-28 | Paper |
| Generating Infinite Digraphs by Derangements | 2021-09-21 | Paper |
| Novák's conjecture on cyclic Steiner triple systems and its generalization | 2021-08-25 | Paper |
| Countable homogeneous Steiner triple systems avoiding specified subsystems | 2021-02-22 | Paper |
| New bounds on the maximum size of Sperner partition systems | 2021-02-08 | Paper |
| Decompositions of complete multigraphs into stars of varying sizes | 2020-09-24 | Paper |
| On the Minimum Degree Required for a Triangle Decomposition | 2020-03-04 | Paper |
| \(SUE(s^2)\)-optimal supersaturated designs | 2020-01-20 | Paper |
| Distributing hash families with few rows | 2019-11-13 | Paper |
| Switching techniques for edge decompositions of graphs | 2019-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5230040 | 2019-08-20 | Paper |
| MAX for \(k\)-independence in multigraphs | 2019-07-17 | Paper |
| Pseudo generalized Youden designs | 2018-11-23 | Paper |
| Generalising Fisher's inequality to coverings and packings | 2018-02-12 | Paper |
| Decompositions of complete multigraphs into cycles of varying lengths | 2018-02-09 | Paper |
| A hierarchical framework for recovery in compressive sensing | 2018-01-11 | Paper |
| Steiner Triple Systems with High Chromatic Index | 2017-11-24 | Paper |
| Compressed Sensing With Combinatorial Designs: Theory and Simulations | 2017-10-19 | Paper |
| New lower bounds for $t$-coverings | 2017-06-21 | Paper |
| Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths | 2017-05-22 | Paper |
| On factorisations of complete graphs into circulant graphs and the Oberwolfach problem | 2016-12-02 | Paper |
| Disjoint spread systems and fault location | 2016-10-28 | Paper |
| Doyen-Wilson results for odd length cycle systems | 2016-08-22 | Paper |
| More nonexistence results for symmetric pair coverings | 2015-11-10 | Paper |
| A second infinite family of Steiner triple systems without almost parallel classes | 2015-06-19 | Paper |
| Steiner Triple Systems without Parallel Classes | 2015-05-20 | Paper |
| Embedding Partial Steiner Triple Systems with Few Triples | 2014-12-22 | Paper |
| Small Embeddings of Partial Steiner Triple Systems | 2014-10-02 | Paper |
| Cycle decompositions V: Complete graphs into cycles of arbitrary lengths | 2014-06-19 | Paper |
| Sequence Covering Arrays | 2014-04-10 | Paper |
| Hierarchical Recovery in Compressive Sensing | 2014-03-04 | Paper |
| Resolvability of infinite designs | 2014-01-31 | Paper |
| On balanced incomplete block designs with specified weak chromatic number | 2014-01-31 | Paper |
| Strengthening hash families and compressive sensing | 2013-01-18 | Paper |
| Decomposing various graphs into short even-length cycles | 2013-01-03 | Paper |
| Trails of triples in partial triple systems | 2012-11-28 | Paper |
| On the non-existence of pair covering designs with at least as many points as blocks | 2012-04-26 | Paper |
| Maximum packings of the complete graph with uniform length cycles | 2011-10-12 | Paper |
| Existential closure of block intersection graphs of infinite designs having infinite block size | 2011-08-16 | Paper |
| Cycle decompositions of complete multigraphs | 2011-02-04 | Paper |
| An asymptotic solution to the cycle decomposition problem for complete graphs | 2010-09-27 | Paper |
| On cycle systems with specified weak chromatic number | 2010-09-27 | Paper |
| Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes | 2010-08-03 | Paper |
| Decompositions of complete graphs into long cycles | 2009-11-20 | Paper |
| A proof of Lindner's conjecture on embeddings of partial Steiner triple systems | 2009-03-09 | Paper |
| Packing cycles in complete graphs | 2008-10-07 | Paper |
| Steiner triple systems with two disjoint subsystems | 2006-03-24 | Paper |
| Decompositions into 2-regular subgraphs and equitable partial cycle decompositions | 2005-02-09 | Paper |
