| Publication | Date of Publication | Type |
|---|
| Attainable bounds for algebraic connectivity and maximally connected regular graphs | 2024-11-24 | Paper |
| Strongly \(n\)-e.c. graphs and independent distinguishing labellings | 2024-02-16 | Paper |
| Graph sequences sampled from Robinson graphons | 2024-02-05 | Paper |
| Attainable bounds for algebraic connectivity and maximally-connected regular graphs | 2023-07-14 | Paper |
| Signal processing on large networks with group symmetries | 2023-03-29 | Paper |
| Orthogonal Colourings of Random Geometric Graphs | 2023-03-14 | Paper |
| High Degree Vertices and Spread of Infections in Spatially Modelled Social Networks | 2022-11-04 | Paper |
| A noncommutative approach to the graphon Fourier transform | 2022-08-26 | Paper |
| Uniform embeddings for Robinson similarity matrices | 2022-03-25 | Paper |
| The spread of cooperative strategies on grids with random asynchronous updating | 2022-03-23 | Paper |
| Geometric random graphs and Rado sets of continuous functions | 2021-09-20 | Paper |
| Uniform Embeddings for Robinson Similarity Matrices | 2021-05-19 | Paper |
| Finding Safe Strategies for Competitive Diffusion on Trees | 2021-04-26 | Paper |
| How to Burn a Graph | 2021-03-26 | Paper |
| Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model | 2021-03-26 | Paper |
| Orthogonal colourings of Cayley graphs | 2020-09-10 | Paper |
| Total Colourings of Direct Product Graphs | 2020-08-12 | Paper |
| Geometric random graphs and Rado sets in sequence spaces | 2019-06-18 | Paper |
| An Optimization Parameter for Seriation of Noisy Data | 2019-05-13 | Paper |
| The spread of cooperative strategies on grids with random asynchronous updating | 2018-10-26 | Paper |
| Recovering the structure of random linear graphs | 2018-10-02 | Paper |
| Bounds on the burning number | 2017-12-06 | Paper |
| Rumors Spread Slowly in a Small-World Spatial Network | 2017-11-02 | Paper |
| Burning a graph is hard | 2017-10-17 | Paper |
| Infinite random graphs and properties of metrics | 2017-01-25 | Paper |
| Uniform linear embeddings of graphons | 2016-12-27 | Paper |
| Bratteli diagrams where random orders are imperfect | 2016-12-14 | Paper |
| Conditions on square geometric graphs | 2016-10-24 | Paper |
| Uniform linear embeddings of spatial random graphs | 2016-10-14 | Paper |
| Rumours Spread Slowly in a Small World Spatial Network | 2016-01-08 | Paper |
| Partial list colouring of certain graphs | 2015-11-02 | Paper |
| Burning a Graph as a Model of Social Contagion | 2015-09-09 | Paper |
| Linear embeddings of graphs and graph limits | 2015-06-10 | Paper |
| Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model | 2015-01-13 | Paper |
| On the continuity of graph parameters | 2014-12-05 | Paper |
| Infinite Random Geometric Graphs from the Hexagonal Metric | 2014-08-19 | Paper |
| Properties of metrics and infinite geometric graphs | 2013-10-17 | Paper |
| Geometric graph properties of the spatial preferred attachment model | 2013-01-18 | Paper |
| Geometric protean graphs | 2012-08-29 | Paper |
| Infinite random geometric graphs | 2012-01-24 | Paper |
| Infinite Limits and Adjacency Properties of a Generalized Copying Model | 2011-06-21 | Paper |
| Rank-Based Attachment Leads to Power Law Graphs | 2011-04-15 | Paper |
| A Spatial Web Graph Model with Local Influence Regions | 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 |
| https://portal.mardi4nfdi.de/entity/Q3576693 | 2010-07-30 | Paper |
| Spatial Models for Virtual Networks | 2010-07-29 | Paper |
| Protean graphs with a variety of ranking schemes | 2009-11-25 | Paper |
| Then-ordered graphs: A new graph class | 2009-03-04 | Paper |
| Workshop on Algorithms and Models for the Web Graph | 2008-08-19 | Paper |
| Modelling and Mining of Networked Information Spaces | 2008-08-19 | Paper |
| A Spatial Web Graph Model with Local Influence Regions | 2008-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5487922 | 2006-09-13 | Paper |
| Lower Bounds from Tile Covers for the Channel Assignment Problem | 2005-09-16 | Paper |
| Infinite Limits of Copying Models of the Web Graph | 2005-04-11 | Paper |
| Distributive online channel assignment for hexagonal cellular networks with constraints | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3045824 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3045822 | 2004-08-12 | Paper |
| Graph covers using \(t\)-colourable vertex sets. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430843 | 2003-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329136 | 2002-07-14 | Paper |
| Approximation algorithms for channel assignment with constraints | 2002-03-03 | Paper |
| There is no (46, 6, 1) block design | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511237 | 2001-03-06 | Paper |
| Distributed Online Frequency Assignment in Cellular Networks | 2000-11-22 | Paper |
| Adaptive multicolouring | 2000-11-13 | Paper |
| Bounded Stable Sets: Polytopes and Colorings | 1999-06-27 | Paper |
| New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs | 1998-01-19 | Paper |
| All-even Latin squares | 1997-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4844909 | 1996-01-07 | Paper |
| On even and odd latin squares | 1995-08-27 | Paper |
| The Dinitz problem solved for rectangles | 1994-01-31 | Paper |
| Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/ | 1990-01-01 | Paper |
| An approximation algorithm for zero forcing | N/A | Paper |
