| Publication | Date of Publication | Type |
|---|
| Self-similarity of communities of the ABCD model | 2025-01-08 | Paper |
| Linear colouring of binomial random graphs | 2024-12-02 | Paper |
| Hypergraph artificial benchmark for community detection (h-ABCD) | 2024-11-08 | Paper |
| Unsupervised framework for evaluating and explaining structural node embeddings of graphs | 2024-10-22 | Paper |
| Performance of community detection algorithms supported by node embeddings | 2024-10-22 | Paper |
| Classification supported by community-aware node features | 2024-10-18 | Paper |
| The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right | 2024-10-08 | Paper |
| Subgraph games in the semi-random graph process and its generalization to hypergraphs | 2024-10-07 | Paper |
| Cliques, chromatic number, and independent sets in the semi-random process | 2024-08-28 | Paper |
| A fully adaptive strategy for Hamiltonian cycles in the semi-random graph process | 2024-08-22 | Paper |
| Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\) | 2024-03-14 | Paper |
| Power of \(k\) choices in the semi-random graph process | 2024-02-19 | Paper |
| SimpleHypergraphs.jl -- novel software framework for modelling and analysis of hypergraphs | 2024-02-16 | Paper |
| Self-similarity of Communities of the ABCD Model | 2023-11-30 | Paper |
| Linear Colouring of Binomial Random Graphs | 2023-11-14 | Paper |
| Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds | 2023-11-09 | Paper |
| Predicting Properties of Nodes via Community-Aware Features | 2023-11-08 | Paper |
| A variant of the Erdős–Rényi random graph process | 2023-10-06 | Paper |
| Modularity based community detection in hypergraphs | 2023-10-04 | Paper |
| Asynchronous Majority Dynamics on Binomial Random Graphs | 2023-09-09 | Paper |
| Algorithms for \(p\)-Faulty Search on a half-line | 2023-08-17 | Paper |
| Edge and pair queries-random graphs and complexity | 2023-06-15 | Paper |
| Cliques, Chromatic Number, and Independent Sets in the Semi-random Process | 2023-03-23 | Paper |
| Modularity of the ABCD random graph model with community structure | 2023-03-10 | Paper |
| Clustering Properties of Spatial Preferential Attachment Model | 2023-03-09 | Paper |
| Label propagation on binomial random graphs | 2023-02-07 | Paper |
| Artificial Benchmark for Community Detection with Outliers (ABCD+o) | 2023-01-13 | Paper |
| Localization game for random geometric graphs | 2022-12-01 | Paper |
| Common Adversaries Form Alliances: Modelling Complex Networks via Anti-transitivity | 2022-11-04 | Paper |
| Endogenous Differentiation of Consumer Preferences Under Quality Uncertainty in a SPA Network | 2022-11-04 | Paper |
| Hypergraph Artificial Benchmark for Community Detection (h-ABCD) | 2022-10-26 | Paper |
| Almost all 9-regular graphs have a modulo-5 orientation | 2022-10-21 | Paper |
| A Scalable Unsupervised Framework for Comparing Graph Embeddings | 2022-10-14 | Paper |
| Probabilistically faulty searching on a half-line (extended abstract) | 2022-10-13 | Paper |
| The Erd\H{o}s-Gy\'arf\'as function $f(n, 4, 5) = \frac 56 n + o(n)$ -- so Gy\'arf\'as was right | 2022-07-06 | Paper |
| Perfect Matchings in the Semirandom Graph Process | 2022-06-03 | Paper |
| Broadcasting on paths and cycles | 2022-05-17 | Paper |
| A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process | 2022-05-04 | Paper |
| Properties and Performance of the ABCDe Random Graph Model with Community Structure | 2022-03-28 | Paper |
| Makespan trade-offs for visiting triangle edges (extended abstract) | 2022-03-22 | Paper |
| Modularity of the ABCD Random Graph Model with Community Structure | 2022-03-02 | Paper |
| Tight bounds on probabilistic zero forcing on hypercubes and grids | 2022-02-01 | Paper |
| An unsupervised framework for comparing graph embeddings | 2022-01-19 | Paper |
| Localization game for random graphs | 2022-01-13 | Paper |
| Mining Complex Networks | 2021-11-08 | Paper |
| Hamilton cycles in the semi-random graph process | 2021-10-28 | Paper |
| The unit acquisition number of binomial random graphs | 2021-08-09 | Paper |
| Local clustering coefficient of spatial preferential attachment model | 2021-06-04 | Paper |
| Some Typical Properties of the Spatial Preferred Attachment Model | 2021-04-23 | Paper |
| Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model | 2021-03-26 | Paper |
| On broadcasting time in the model of travelling agents | 2021-03-25 | Paper |
| Probabilistic zero forcing on random graphs | 2021-02-08 | Paper |
| On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness | 2021-02-08 | Paper |
| Zero-forcing in random regular graphs | 2021-02-08 | Paper |
| On the existence of Hamilton cycles with a periodic pattern in a random digraph | 2020-12-03 | Paper |
| Tight Bounds on the Probabilistic Zero Forcing on Hypercubes and Grids | 2020-11-30 | Paper |
| Broadcasting on Paths and Cycles | 2020-11-24 | Paper |
| Almost all 5‐regular graphs have a 3‐flow | 2020-05-21 | Paper |
| On Broadcasting Time in the Model of Travelling Agents | 2020-03-18 | Paper |
| Meyniel's conjecture holds for random d‐regular graphs | 2019-11-28 | Paper |
| How many zombies are needed to catch the survivor on toroidal grids? | 2019-10-16 | Paper |
| Sub-trees of a random tree | 2019-09-19 | Paper |
| Clique coloring of binomial random graphs | 2019-08-14 | Paper |
| Parallel execution of schedules with random dependency graph | 2019-08-13 | Paper |
| Perfect matchings and Hamiltonian cycles in the preferential attachment model | 2019-05-02 | Paper |
| Clique colourings of geometric graphs | 2019-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3120651 | 2019-03-05 | Paper |
| Clustering coefficient of a spatial preferential attachment model | 2018-11-01 | Paper |
| Modularity of complex networks models | 2018-10-26 | Paper |
| Clustering via Hypergraph Modularity | 2018-10-10 | Paper |
| Burning number of graph products | 2018-09-27 | Paper |
| Note on the multicolour size-Ramsey number for paths | 2018-09-07 | Paper |
| The robot crawler graph process | 2018-09-06 | Paper |
| Size-Ramsey numbers of cycles versus a path | 2018-05-24 | Paper |
| Randomly twisted hypercubes | 2018-04-25 | Paper |
| Modularity in several random graph models | 2018-01-18 | Paper |
| Rainbow perfect matchings and Hamilton cycles in the random geometric graph | 2017-12-13 | Paper |
| The total acquisition number of the randomly weighted path | 2017-10-13 | Paper |
| The game of overprescribed Cops and Robbers played on graphs | 2017-10-11 | Paper |
| An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths | 2017-10-04 | Paper |
| Lazy Cops and Robbers on Hypercubes | 2017-10-04 | Paper |
| Graph Searching Games and Probabilistic Methods | 2017-09-19 | Paper |
| On some Multicolor Ramsey Properties of Random Graphs | 2017-09-18 | 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 |
| Subhypergraphs in non-uniform random hypergraphs | 2017-03-22 | Paper |
| A probabilistic version of the game of zombies and survivors on graphs | 2016-11-29 | Paper |
| Lazy cops and robbers played on random graphs and graphs on surfaces | 2016-11-22 | Paper |
| Rainbow arborescence in random digraphs | 2016-11-16 | Paper |
| The set chromatic number of random graphs | 2016-10-07 | Paper |
| The total acquisition number of random graphs | 2016-07-06 | Paper |
| Brushing with additional cleaning restrictions | 2016-06-27 | Paper |
| Game brush number | 2016-06-01 | Paper |
| The bondage number of random graphs | 2016-05-11 | Paper |
| Acquaintance time of random graphs near connectivity threshold | 2016-04-07 | Paper |
| To catch a falling robber | 2016-04-01 | Paper |
| Meyniel's conjecture holds for random graphs | 2016-03-22 | Paper |
| The Robot Crawler Number of a Graph | 2016-01-08 | Paper |
| The Domination Number of On-line Social Networks and Random Geometric Graphs | 2015-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2941401 | 2015-08-28 | Paper |
| On-line list colouring of random graphs | 2015-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5265408 | 2015-07-24 | Paper |
| Containment game played on random graphs: another zig-zag theorem | 2015-06-02 | Paper |
| The acquaintance time of (percolated) random geometric graphs | 2015-06-02 | Paper |
| Power of \(k\) choices and rainbow spanning trees in random graphs | 2015-02-19 | Paper |
| Toppling numbers of complete and random graphs | 2015-02-09 | Paper |
| Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model | 2015-01-13 | Paper |
| Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) | 2014-11-07 | Paper |
| Firefighting on square, hexagonal, and triangular grids | 2014-10-31 | Paper |
| Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly | 2014-09-19 | Paper |
| Chasing robbers on random geometric graphs-an alternative approach | 2014-09-12 | 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 |
| Brushing without capacity restrictions | 2014-05-06 | Paper |
| Elimination schemes and lattices | 2014-05-06 | Paper |
| Cops and robbers playing on edges | 2014-04-30 | Paper |
| Sparse Graphs Are Not Flammable | 2014-04-10 | Paper |
| On the maximum density of graphs with unique-path labelings | 2014-01-21 | Paper |
| A note on off-diagonal small on-line Ramsey numbers for paths. | 2013-12-06 | Paper |
| Cops and invisible robbers: the cost of drunkenness | 2013-11-29 | Paper |
| Vertex-pursuit in random directed acyclic graphs | 2013-09-26 | Paper |
| The robber strikes back | 2013-08-13 | Paper |
| Chipping away at the edges: how long does it take? | 2013-07-12 | Paper |
| Discovery of Nodal Attributes through a Rank-Based Model of Network Structure | 2013-06-28 | Paper |
| The capture time of the hypercube | 2013-06-07 | Paper |
| Revolutionaries and Spies on Random Graphs | 2013-05-13 | Paper |
| Broadcasting in Conflict-Aware Multi-channel Networks | 2013-04-12 | Paper |
| Emergence of segregation in evolving social networks | 2013-02-02 | Paper |
| Geometric graph properties of the spatial preferred attachment model | 2013-01-18 | Paper |
| Some remarks on cops and drunk robbers | 2013-01-07 | Paper |
| \textsc{polish} -- Let us play the cleaning game | 2013-01-07 | Paper |
| On the Maximum Density of Graphs with Good Edge-Labellings | 2012-11-12 | Paper |
| Cops and robber with constraints | 2012-09-12 | Paper |
| The first player wins the one-colour triangle avoidance game on 16 vertices | 2012-09-05 | Paper |
| Geometric protean graphs | 2012-08-29 | Paper |
| Independence and chromatic densities of graphs | 2012-08-28 | Paper |
| Some Typical Properties of the Spatial Preferred Attachment Model | 2012-07-23 | Paper |
| Vertex-Pursuit in Hierarchical Social Networks | 2012-07-16 | Paper |
| Fighting constrained fires in graphs | 2012-06-25 | Paper |
| Almost all cop-win graphs contain a universal vertex | 2012-05-30 | Paper |
| On the threshold for \(k\)-regular subgraphs of random graphs | 2012-04-26 | Paper |
| Models of Online Social Networks | 2012-04-18 | Paper |
| Cleaning with brooms | 2012-01-24 | Paper |
| Cleaning random \(d\)-regular graphs with brooms | 2012-01-24 | Paper |
| An edge deletion model for complex networks | 2011-10-10 | Paper |
| Scale‐free graphs of increasing degree | 2011-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3012580 | 2011-07-06 | Paper |
| Rank-Based Models of Network Structure and the Discovery of Content | 2011-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3003877 | 2011-05-31 | Paper |
| Connectivity threshold and recovery time in rank-based models for complex networks | 2011-05-16 | Paper |
| Modular Orientations of Random and Quasi-Random Regular Graphs | 2011-05-11 | Paper |
| Rank-Based Attachment Leads to Power Law Graphs | 2011-04-15 | Paper |
| Geodesics and almost geodesic cycles in random regular graphs | 2011-03-07 | Paper |
| Pursuit-Evasion in Models of Complex Networks | 2011-02-28 | Paper |
| A Spatial Web Graph Model with Local Influence Regions | 2011-02-28 | Paper |
| The Geometric Protean Model for On-Line Social Networks | 2011-01-21 | Paper |
| Chasing robbers on random graphs: Zigzag theorem | 2010-12-14 | Paper |
| Cops and robbers from a distance | 2010-11-11 | Paper |
| Clean the graph before you draw it! | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575431 | 2010-07-27 | Paper |
| Graphs with then-e.c. adjacency property constructed from resolvable designs | 2010-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3565878 | 2010-06-07 | Paper |
| Parallel cleaning of a network with brushes | 2010-05-05 | Paper |
| Cleaning Regular Graphs with Brushes | 2010-03-17 | Paper |
| The good, the bad, and the great: homomorphisms and cores of random graphs | 2009-12-15 | Paper |
| Protean graphs with a variety of ranking schemes | 2009-11-25 | Paper |
| Growing Protean Graphs | 2009-04-28 | Paper |
| \(R(3,4)=17\) | 2009-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3614030 | 2009-03-16 | Paper |
| A Dynamic Model for On-Line Social Networks | 2009-02-10 | Paper |
| Protean Graphs with a Variety of Ranking Schemes | 2009-01-27 | Paper |
| The diameter of protean graphs | 2008-07-11 | Paper |
| Cleaning a network with brushes | 2008-06-24 | Paper |
| Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm | 2008-04-15 | Paper |
| Vertex Pursuit Games in Stochastic Network Models | 2008-04-15 | Paper |
| A Spatial Web Graph Model with Local Influence Regions | 2008-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5449142 | 2008-03-11 | Paper |
| Protean Graphs | 2007-04-19 | Paper |
| Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs | N/A | Paper |
| Matchings and loose cycles in the semirandom hypergraph model | N/A | Paper |
| Burning Random Trees | N/A | Paper |
