| Publication | Date of Publication | Type |
|---|
| The frustum network model based on clique extension | 2024-11-28 | Paper |
| Improved pyrotechnics: closer to the burning number conjecture | 2024-02-16 | Paper |
| The localization number of designs | 2024-02-01 | Paper |
| The $k$-visibility Localization Game | 2023-11-02 | Paper |
| The one-visibility localization game | 2023-10-12 | Paper |
| The iterated local transitivity model for tournaments | 2023-10-04 | Paper |
| Algorithms for \(p\)-Faulty Search on a half-line | 2023-08-17 | Paper |
| An evolving network model from clique extension | 2023-08-10 | Paper |
| The localization game on oriented graphs | 2023-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6165487 | 2023-08-01 | Paper |
| The iterated local transitivity model for hypergraphs | 2023-06-15 | Paper |
| Pursuit-evasion games on Latin square graphs | 2023-04-19 | Paper |
| Dynamic Competition Networks: Detecting Alliances and Leaders | 2023-03-09 | Paper |
| Asymptotics of multicomponent linked polygons | 2023-02-07 | Paper |
| Asymptotics of linked polygons | 2023-01-23 | Paper |
| Common Adversaries Form Alliances: Modelling Complex Networks via Anti-transitivity | 2022-11-04 | Paper |
| The Iterated Local Directed Transitivity Model for Social Networks | 2022-10-14 | Paper |
| Iterated Global Models for Complex Networks | 2022-10-14 | Paper |
| The game of flipping coins | 2022-10-14 | Paper |
| Probabilistically faulty searching on a half-line (extended abstract) | 2022-10-13 | Paper |
| Distinguishing number of universal homogeneous Urysohn metric spaces | 2022-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5099428 | 2022-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5099429 | 2022-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5099430 | 2022-08-31 | Paper |
| An Invitation to Pursuit-Evasion Games and Graph Theory | 2022-07-18 | Paper |
| Bounds on the localization number | 2022-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3390711 | 2022-03-25 | Paper |
| The localization capture time of a graph | 2022-03-23 | Paper |
| Optimizing the trade-off between number of cops and capture time in cops and robbers | 2022-02-03 | Paper |
| On Meyniel extremal families of graphs | 2022-01-21 | Paper |
| Improved bounds for burning fence graphs | 2021-11-30 | Paper |
| An improved bound on the burning number of graphs | 2021-10-03 | Paper |
| Pursuit-evasion games on latin square graphs | 2021-09-29 | Paper |
| Geometric random graphs and Rado sets of continuous functions | 2021-09-20 | Paper |
| Spaces for All: The Rise of LGBTQ+ Mathematics Conferences | 2021-08-12 | Paper |
| The game of cops and eternal robbers | 2021-06-22 | Paper |
| The localization capture time of a graph | 2021-05-20 | Paper |
| A survey of graph burning | 2021-04-27 | Paper |
| How to Burn a Graph | 2021-03-26 | Paper |
| Progress on the localization number of a graph | 2021-03-18 | Paper |
| Burning the plane. Densities of the infinite Cartesian grid | 2021-02-16 | Paper |
| The iterated local model for social networks | 2020-07-07 | Paper |
| The Game of Cops and Eternal Robbers | 2020-03-08 | Paper |
| Topological directions in cops and robbers | 2019-11-18 | Paper |
| Bounds on the burning numbers of spiders and path-forests | 2019-10-16 | Paper |
| Approximation algorithms for graph burning | 2019-10-15 | Paper |
| Pursuit and evasion from a distance: algorithms and bounds | 2019-09-16 | Paper |
| Geometric random graphs and Rado sets in sequence spaces | 2019-06-18 | Paper |
| A Sublinear Bound on the Cop Throttling Number of a Graph | 2019-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4561588 | 2018-12-07 | Paper |
| Distinguishing number of Urysohn metric spaces | 2018-11-14 | Paper |
| Approximation Algorithms for Graph Burning | 2018-11-11 | Paper |
| The robot crawler graph process | 2018-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4583875 | 2018-09-03 | Paper |
| Characterizations and algorithms for generalized Cops and Robbers games | 2017-12-20 | Paper |
| Bounds on the burning number | 2017-12-06 | Paper |
| Burning a graph is hard | 2017-10-17 | Paper |
| The game of overprescribed Cops and Robbers played on graphs | 2017-10-11 | Paper |
| Lazy Cops and Robbers on Hypercubes | 2017-10-04 | Paper |
| Graph Searching Games and Probabilistic Methods | 2017-09-19 | Paper |
| Cops and robbers ordinals of cop-win trees | 2017-02-27 | Paper |
| Infinite random graphs and properties of metrics | 2017-01-25 | Paper |
| Conjectures on Cops and Robbers | 2016-12-16 | 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 |
| On 2-e.c. graphs, tournaments, and hypergraphs | 2016-07-01 | 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 |
| Burning a Graph as a Model of Social Contagion | 2015-09-09 | Paper |
| Distinguishing homomorphisms of infinite graphs | 2015-08-05 | Paper |
| On the minimum order of k-cop-win graphs | 2015-08-05 | Paper |
| A note on bounds for the cop number using tree decompositions | 2015-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5265408 | 2015-07-24 | Paper |
| Toppling numbers of complete and random graphs | 2015-02-09 | Paper |
| Independence densities of hypergraphs | 2014-08-28 | Paper |
| Infinite Random Geometric Graphs from the Hexagonal Metric | 2014-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5170048 | 2014-07-17 | Paper |
| WHAT IS...Cop Number? | 2014-04-15 | Paper |
| Cops and robbers on graphs based on designs | 2013-11-26 | Paper |
| Properties of metrics and infinite geometric graphs | 2013-10-17 | Paper |
| Vertex-pursuit in random directed acyclic graphs | 2013-09-26 | Paper |
| The robber strikes back | 2013-08-13 | Paper |
| The capture time of the hypercube | 2013-06-07 | Paper |
| Meyniel's conjecture on the cop number: a survey | 2013-02-28 | Paper |
| Geometric protean graphs | 2012-08-29 | Paper |
| Independence and chromatic densities of graphs | 2012-08-28 | 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 |
| Sketchy tweets: ten minute conjectures in graph theory | 2012-04-27 | Paper |
| Models of Online Social Networks | 2012-04-18 | Paper |
| Infinite random geometric graphs | 2012-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3090934 | 2011-09-07 | Paper |
| Infinite Limits and Adjacency Properties of a Generalized Copying Model | 2011-06-21 | Paper |
| Distinguishing number and adjacency properties | 2011-06-14 | 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 |
| Open Letter to the Internet Mathematics Community | 2011-02-28 | Paper |
| Infinite Limits and Adjacency Properties of a Generalized Copying Model | 2011-02-28 | Paper |
| The Geometric Protean Model for On-Line Social Networks | 2011-01-21 | Paper |
| Twins of rayless graphs | 2011-01-14 | Paper |
| Large classes of infinite k-cop-win graphs | 2010-12-14 | Paper |
| Cops and robbers from a distance | 2010-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576693 | 2010-07-30 | Paper |
| Graphs with then-e.c. adjacency property constructed from resolvable designs | 2010-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3558637 | 2010-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3558603 | 2010-05-05 | Paper |
| All countable monoids embed into the monoid of the infinite random graph | 2010-03-29 | Paper |
| The capture time of a graph | 2009-12-15 | Paper |
| The good, the bad, and the great: homomorphisms and cores of random graphs | 2009-12-15 | Paper |
| Then-ordered graphs: A new graph class | 2009-03-04 | Paper |
| A note on domination parameters in random graphs | 2009-02-26 | Paper |
| A Dynamic Model for On-Line Social Networks | 2009-02-10 | Paper |
| Vertex Pursuit Games in Stochastic Network Models | 2008-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457639 | 2008-04-14 | Paper |
| A Spatial Web Graph Model with Local Influence Regions | 2008-04-11 | Paper |
| A note on uniquely H-colorable graphs | 2008-02-22 | Paper |
| Graphs with the \(n\)-e.c. adjacency property constructed from affine planes | 2008-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3423993 | 2007-02-15 | Paper |
| Mutually embeddable graphs and the tree alternative conjecture | 2007-01-16 | Paper |
| On an adjacency property of almost all tournaments | 2006-10-30 | Paper |
| Spanning subgraphs of graphs partitioned into two isomorphic pieces | 2006-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461512 | 2005-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5460889 | 2005-07-20 | Paper |
| Infinite Limits of Copying Models of the Web Graph | 2005-04-11 | Paper |
| On a problem of Cameron's on inexhaustible graphs | 2004-10-19 | Paper |
| A note on orientations of the infinite random graph | 2004-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457740 | 2004-03-25 | Paper |
| Partitioning a graph into two isomorphic pieces | 2003-11-10 | Paper |
| Homomorphisms and amalgamation | 2003-09-04 | Paper |
| Large families of mutually embeddable vertex-transitive graphs | 2003-06-25 | Paper |
| Generalized pigeonhole properties of graphs and oriented graphs | 2003-01-05 | Paper |
| On retracts of the random graph and their natural order | 2002-06-10 | Paper |
| Metrically universal generic structures in free amalgamation classes | 2002-06-03 | Paper |
| A family of universal pseudo-homogeneous \(G\)-colourable graphs | 2002-05-28 | Paper |
| On an adjacency property of almost all graphs | 2001-11-28 | Paper |
| On 2-e. c. line-critical graphs | 2001-11-18 | Paper |
| Tournaments and Orders with the Pigeonhole Property | 2001-10-16 | Paper |
| The monoid of the random graph | 2001-03-21 | Paper |
| Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property | 2001-01-09 | Paper |
| Continuum many universal Horn classes of graphs of bounded chromatic number | 2000-02-27 | Paper |
| A Pigeonhole Property for Relational Structures | 1999-09-22 | Paper |
| The model companion of width-two orders | 1999-03-02 | Paper |
| How to cool a graph | N/A | Paper |
| Locally finite graphs and their localization numbers | N/A | Paper |
