| Publication | Date of Publication | Type |
|---|
| On connectivity in random graph models with limited dependencies | 2025-01-14 | Paper |
| Mastermind with a linear number of queries | 2024-11-05 | Paper |
| On connectivity in random graph models with limited dependencies | 2024-09-02 | Paper |
| Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances | 2024-05-08 | Paper |
| Reconstructibility of the \(K_r\)-count from \(n - 1\) cards | 2024-04-30 | Paper |
| Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs | 2024-01-29 | Paper |
| Optimal schemes for combinatorial query problems with integer feedback | 2023-12-16 | Paper |
| Vertex-critical graphs far from edge-criticality | 2023-10-19 | Paper |
| On the approximability of the burning number | 2023-08-08 | Paper |
| Hat Guessing Numbers of Strongly Degenerate Graphs | 2023-06-27 | Paper |
| Synchronizing random automata through repeated 'a' inputs | 2023-06-15 | Paper |
| On Connectivity in Random Graph Models with Limited Dependencies | 2023-05-04 | Paper |
| Finding a good tree to burn | 2023-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092349 | 2022-07-21 | Paper |
| Solving static permutation mastermind using \(O(n \log n)\) queries | 2022-02-01 | Paper |
| A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method | 2021-11-11 | Paper |
| Note on long paths in Eulerian digraphs | 2021-06-21 | Paper |
| Long cycles, heavy cycles and cycle decompositions in digraphs | 2021-03-08 | Paper |
| Navigating an Infinite Space with Unreliable Movements | 2021-02-02 | Paper |
| Mastermind with a Linear Number of Queries | 2020-11-11 | Paper |
| The Chromatic Number of Dense Random Block Graphs | 2020-07-15 | Paper |
| A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles | 2020-03-11 | Paper |
| An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm | 2020-02-12 | Paper |
| The edge-statistics conjecture for \(\ell \ll k^{6/5} \) | 2019-12-17 | Paper |
| Long Cycles, Heavy Cycles and Cycle Decompositions in Digraphs | 2019-11-18 | Paper |
| When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument | 2019-09-18 | Paper |
| Most edge‐orderings of Kn have maximal altitude | 2019-06-07 | Paper |
| Segregating Markov chains | 2018-10-26 | Paper |
| Optimal strategies for patrolling fences | 2018-09-18 | Paper |
| Even flying cops should think ahead | 2018-08-17 | Paper |
| First-passage percolation on Cartesian power graphs | 2018-04-24 | Paper |
| The "No Justice in the Universe" phenomenon: why honesty of effort may not be rewarded in tournaments | 2018-03-02 | Paper |
| The Hegselmann-Krause dynamics on the circle converge | 2017-02-23 | Paper |
| Unoriented first-passage percolation on the \(n\)-cube | 2016-12-09 | Paper |
| An improved energy argument for the Hegselmann–Krause model | 2016-08-08 | Paper |
| Shotgun edge assembly of random jigsaw puzzles | 2016-05-23 | Paper |
| Permutations destroying arithmetic progressions in finite cyclic groups | 2016-01-25 | Paper |
| Accessibility percolation and first-passage site percolation on the unoriented binary hypercube | 2015-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2933958 | 2014-12-08 | Paper |
| On the existence of accessible paths in various models of fitness landscapes | 2014-08-06 | Paper |
| A variant of the multi-agent rendezvous problem | 2013-06-21 | Paper |
| Resolution of the Kohayakawa-Kreuter conjecture | N/A | Paper |
