| Publication | Date of Publication | Type |
|---|
| Percolation on dense random graphs with given degrees | 2024-05-10 | Paper |
| The jump of the clique chromatic number of random graphs | 2023-10-23 | Paper |
| On the modularity of 3‐regular random graphs and random graphs with given degree sequences | 2023-10-17 | Paper |
| On the first and second largest components in the percolated random geometric graph | 2023-09-15 | Paper |
| On the minimum bisection of random 3-regular graphs | 2023-06-27 | Paper |
| Sharp threshold for embedding balanced spanning trees in random geometric graphs | 2023-03-24 | Paper |
| Cluster-size decay in supercritical kernel-based spatial random graphs | 2023-03-01 | Paper |
| Label propagation on binomial random graphs | 2023-02-07 | Paper |
| Localization game for random geometric graphs | 2022-12-01 | Paper |
| On the Power of Choice for Boolean Functions | 2022-08-31 | Paper |
| Tail bounds for detection times in mobile hyperbolic graphs | 2022-02-28 | Paper |
| Limit theory of combinatorial optimization for random geometric graphs | 2022-02-14 | Paper |
| On the largest component of subcritical random hyperbolic graphs | 2022-01-06 | Paper |
| A survey of the modified Moran process and evolutionary graph theory | 2021-12-20 | Paper |
| New results for the random nearest neighbor tree | 2021-08-30 | Paper |
| The contact process on random hyperbolic graphs: metastability and critical exponents | 2021-07-02 | Paper |
| A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees | 2021-02-01 | Paper |
| Learning random points from geometric graphs or orderings | 2020-11-30 | Paper |
| The height of depth‐weighted random recursive trees | 2020-06-19 | Paper |
| On the Decycling Number of $4$-regular Random Graphs | 2020-03-01 | Paper |
| On the Second Largest Component of Random Hyperbolic Graphs | 2019-11-20 | Paper |
| A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees | 2019-09-27 | Paper |
| A Bound for the Diameter of Random Hyperbolic Graphs | 2019-09-17 | Paper |
| Clique coloring of binomial random graphs | 2019-08-14 | Paper |
| Clique colourings of geometric graphs | 2019-03-05 | Paper |
| Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity | 2019-02-15 | Paper |
| Hamilton cycles and perfect matchings in the KPKVB model | 2019-01-26 | Paper |
| Burning number of graph products | 2018-09-27 | Paper |
| The diameter of inhomogeneous random graphs | 2018-09-25 | Paper |
| Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity | 2018-08-27 | Paper |
| Spectral gap of random hyperbolic graphs and related parameters | 2018-06-29 | Paper |
| On rigidity, orientability, and cores of random graphs with sliders | 2018-05-25 | Paper |
| Corrigendum to: ``On the limiting distribution of the metric dimension for random forests | 2017-10-10 | Paper |
| The total acquisition number of random geometric graphs | 2017-09-08 | Paper |
| Strong-majority bootstrap percolation on regular graphs with low dissemination threshold | 2017-09-07 | Paper |
| Burning graphs: a probabilistic perspective | 2017-08-10 | Paper |
| On Treewidth and Related Parameters of Random Geometric Graphs | 2017-06-23 | Paper |
| A probabilistic version of the game of zombies and survivors on graphs | 2016-11-29 | Paper |
| On the relation between graph distance and Euclidean distance in random geometric graphs | 2016-11-01 | Paper |
| The set chromatic number of random graphs | 2016-10-07 | Paper |
| The number of empty four-gons in random point sets | 2016-05-13 | Paper |
| The bondage number of random graphs | 2016-05-11 | Paper |
| Maximum degree in minor-closed classes of graphs | 2016-04-14 | Paper |
| The Domination Number of On-line Social Networks and Random Geometric Graphs | 2015-09-30 | Paper |
| On-line list colouring of random graphs | 2015-08-26 | Paper |
| On the limiting distribution of the metric dimension for random forests | 2015-06-18 | Paper |
| Empty non-convex and convex four-gons in random point sets | 2015-05-07 | Paper |
| The cook-book approach to the differential equation method | 2014-10-24 | Paper |
| Book review of: J. Kogan, Introduction to clustering large and high-dimensional data | 2014-10-07 | Paper |
| On the hyperbolicity of random graphs | 2014-09-04 | Paper |
| Independence densities of hypergraphs | 2014-08-28 | Paper |
| A note on the acquaintance time of random graphs | 2014-08-14 | Paper |
| Metric dimension for random graphs | 2014-08-14 | Paper |
| On the Fiedler value of large planar graphs | 2014-02-19 | Paper |
| On the Maximum Density of Graphs with Unique-Path Labelings | 2014-01-21 | Paper |
| Cops and invisible robbers: the cost of drunkenness | 2013-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857328 | 2013-11-01 | Paper |
| The Power of Mediation in an Extended El Farol Game | 2013-10-23 | Paper |
| Vertex-Pursuit in Random Directed Acyclic Graphs | 2013-09-26 | Paper |
| The robber strikes back | 2013-08-13 | Paper |
| Revolutionaries and Spies on Random Graphs | 2013-05-13 | Paper |
| Continuous monitoring in the dynamic sensor field model | 2013-01-07 | Paper |
| On the Maximum Density of Graphs with Good Edge-Labellings | 2012-11-12 | Paper |
| A new upper bound for 3-SAT | 2012-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2904780 | 2012-08-23 | Paper |
| Vertex-Pursuit in Hierarchical Social Networks | 2012-07-16 | Paper |
| Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks | 2011-09-16 | Paper |
| On the number of higher order Delaunay triangulations | 2011-07-14 | Paper |
| Theoretical Aspects of Graph Models for MANETs | 2011-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579492 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576713 | 2010-07-30 | Paper |
| On the Number of Higher Order Delaunay Triangulations | 2010-05-28 | Paper |
| Colorings at minimum cost | 2010-03-29 | Paper |
| On the satisfiability threshold of formulas with three literals per clause | 2009-08-07 | Paper |
| On the probability of the existence of fixed-size components in random geometric graphs | 2009-07-22 | Paper |
| Sharp Threshold for Hamiltonicity of Random Geometric Graphs | 2008-03-28 | Paper |
| Collaborative Ranking: An Aggregation Algorithm for Individuals’ Preference Estimation | 2008-01-04 | Paper |
| Online balanced graph avoidance games | 2007-11-21 | Paper |
| Between Colorings and Layouts - Minimum Morphism Cost Problems | 2007-05-29 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| New results for the random nearest neighbor tree | 0001-01-03 | Paper |
| Cluster-size decay in supercritical long-range percolation | 0001-01-03 | Paper |
