| Publication | Date of Publication | Type |
|---|
| The structure and number of Erdős covering systems | 2024-03-11 | Paper |
| Subcritical monotone cellular automata | 2024-01-05 | Paper |
| Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions | 2023-10-19 | Paper |
| Random Translates in Minkowski Sums | 2023-08-31 | Paper |
| Counting graphic sequences via integrated random walks | 2023-01-17 | Paper |
| Erd\H{o}s covering systems | 2022-11-02 | Paper |
| Improved bounds for 1-independent percolation on $\mathbb{Z}^n$ | 2022-06-24 | Paper |
| Universality for monotone cellular automata | 2022-03-25 | Paper |
| The critical length for growing a droplet | 2022-03-25 | Paper |
| On the Erdős covering problem: the density of the uncovered set | 2022-03-22 | Paper |
| A Note on Infinite Antichain Density | 2022-03-15 | Paper |
| The Erdős-Selfridge problem with square-free moduli | 2021-05-27 | Paper |
| Erdős covering systems | 2021-01-25 | Paper |
| Flat Littlewood polynomials exist | 2020-12-14 | Paper |
| Covering intervals with arithmetic progressions | 2020-10-02 | Paper |
| Bounds on Rudin-Shapiro polynomials of arbitrary degree | 2019-09-18 | Paper |
| The asymptotic number of prefix normal words | 2019-08-13 | Paper |
| River landscapes and optimal channel networks | 2019-07-03 | Paper |
| Dense subgraphs in random graphs | 2019-05-03 | Paper |
| A note on Linnik's theorem on quadratic non-residues | 2019-03-27 | Paper |
| The Erd\H{o}s-Selfridge problem with square-free moduli | 2019-01-31 | Paper |
| Coalescence on the real line | 2019-01-09 | Paper |
| On the edge spectrum of saturated graphs for paths and stars | 2019-01-03 | Paper |
| On the Erd\H{o}s Covering Problem: the density of the uncovered set | 2018-11-08 | Paper |
| Line percolation | 2018-09-05 | Paper |
| Random geometric graphs and isometries of normed spaces | 2018-08-15 | Paper |
| The sharp threshold for making squares | 2018-06-19 | Paper |
| Decompositions of graphs into cycles with chords | 2017-11-28 | Paper |
| Catching a fast robber on the grid | 2017-09-05 | Paper |
| Reconstructing random jigsaws | 2017-07-15 | Paper |
| Adversarial resilience of matchings in bipartite random graphs | 2017-01-10 | Paper |
| Controllability and matchings in random bipartite graphs | 2016-12-20 | Paper |
| Barrier Coverage | 2016-11-09 | Paper |
| The time of bootstrap percolation in two dimensions | 2016-10-21 | Paper |
| Subtended angles | 2016-09-15 | Paper |
| Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs | 2016-06-20 | Paper |
| Random Hypergraph Irregularity | 2016-04-04 | Paper |
| Subcritical $\mathcal {U}$-bootstrap percolation models have non-trivial phase transitions | 2016-03-23 | Paper |
| Consistent random vertex-orderings of graphs | 2015-06-10 | Paper |
| Limited packings of closed neighbourhoods in graphs | 2015-01-08 | Paper |
| Minimal Symmetric Differences of Lines in Projective Planes | 2014-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2874912 | 2014-08-12 | Paper |
| Interference percolation | 2014-08-07 | Paper |
| Essential enhancements revisited | 2014-02-04 | Paper |
| Repeated Degrees in Random Uniform Hypergraphs | 2013-06-27 | Paper |
| A concentration function estimate and intersective sets from matrices | 2012-11-13 | Paper |
| Projections, entropy and sumsets | 2012-09-17 | Paper |
| Critical Probabilities of 1-Independent Percolation Models | 2012-05-14 | Paper |
| Random partial orders defined by angular domains | 2011-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3012397 | 2011-07-06 | Paper |
| Coloring vertices and edges of a graph by nonempty subsets of a set | 2011-04-08 | Paper |
| Bond percolation with attenuation in high dimensional VoronoiÌ tilings | 2010-11-10 | Paper |
| Random majority percolation | 2010-11-10 | Paper |
| Sentry Selection in Wireless Networks | 2010-06-07 | Paper |
| The Linus Sequence | 2010-04-23 | Paper |
| Algorithms for generating convex sets in acyclic digraphs | 2009-12-10 | Paper |
| The Erdős–Heilbronn problem for finite groups | 2009-12-08 | Paper |
| Sequences with Changing Dependencies | 2009-08-20 | Paper |
| Random transceiver networks | 2009-07-22 | Paper |
| A critical constant for the k nearest-neighbour model | 2009-05-06 | Paper |
| Convex sets in acyclic digraphs | 2009-05-04 | Paper |
| Highly connected random geometric graphs | 2009-03-04 | Paper |
| Connected graphs without long paths | 2008-09-04 | Paper |
| Connectivity of addable graph classes | 2008-04-28 | Paper |
| Adjacent Vertex Distinguishing Edge‐Colorings | 2008-03-28 | Paper |
| The generalized Randić index of trees | 2008-01-04 | Paper |
| Counting regions with bounded surface area | 2007-10-10 | Paper |
| Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions | 2007-06-13 | Paper |
| Large deviations for mean field models of probabilistic cellular automata | 2007-02-07 | Paper |
| Ramsey unsaturated and saturated graphs | 2006-03-24 | Paper |
| Pair dominating graphs | 2006-03-22 | Paper |
| Mono-multi bipartite Ramsey numbers, designs, and matrices | 2006-03-16 | Paper |
| Continuum percolation with steps in the square or the disc | 2005-08-29 | Paper |
| Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics | 2005-08-17 | Paper |
| Percolation in Voronoi tilings | 2005-06-01 | Paper |
| Connectivity of random k-nearest-neighbour graphs | 2005-05-03 | Paper |
| Continuum percolation with steps in an annulus | 2005-03-21 | Paper |
| Longest Paths in Circular Arc Graphs | 2004-09-24 | Paper |
| Balanced edge colorings. | 2004-03-15 | Paper |
| Entropy along convex shapes, random tilings and shifts of finite type | 2003-11-25 | Paper |
| Packing closed trails into dense graphs. | 2003-08-25 | Paper |
| Graphs with large maximum degree containing no odd cycles of a given length | 2003-08-25 | Paper |
| Packing Digraphs with Directed Closed Trails | 2003-07-15 | Paper |
| Zero-sum square matrices | 2003-03-18 | Paper |
| The interlace polynomial of graphs at \(-1\) | 2003-03-18 | Paper |
| Vertex-distinguishing edge colorings of graphs | 2003-03-10 | Paper |
| Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) | 2002-08-29 | Paper |
| A note on Ramsey size-linear graphs | 2002-08-25 | Paper |
| Vertex‐distinguishing edge colorings of random graphs | 2002-06-05 | Paper |
| Packing Circuits into KN | 2002-03-13 | Paper |
| On the Alspach Conjecture | 2002-02-21 | Paper |
| Dependent percolation in two dimensions | 2001-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705353 | 1999-12-19 | Paper |
| Note on Nakayama's lemma for compact \(\Lambda\)-modules | 1998-06-21 | Paper |
| Improved upper bounds for the critical probability of oriented percolation in two dimensions | 1995-02-22 | Paper |
| Upper bounds for the critical probability of oriented percolation in two dimensions | 1994-03-14 | Paper |
