| Publication | Date of Publication | Type |
|---|
| Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph | 2024-03-11 | Paper |
| Graphs, hypergraphs and hashing | 2024-01-05 | Paper |
| Semi‐labeled unrooted binary tree optimization subject to nonnegativity | 2023-12-12 | Paper |
| Asymptotic enumeration of digraphs and bipartite graphs by degree sequence | 2023-10-19 | Paper |
| Fast uniform generation of random graphs with given degree sequences | 2023-10-12 | Paper |
| Full rainbow matchings in graphs and hypergraphs | 2023-03-30 | Paper |
| Asymptotic Enumeration of Hypergraphs by Degree Sequence | 2023-01-18 | Paper |
| ASYMPTOTIC ENUMERATION OF GRAPHS WITH GIVEN DEGREE SEQUENCE | 2020-09-22 | Paper |
| The height of depth‐weighted random recursive trees | 2020-06-19 | Paper |
| Almost all 5‐regular graphs have a 3‐flow | 2020-05-21 | Paper |
| A limit theorem for the six-length of random functional graphs with a fixed degree sequence | 2019-12-09 | Paper |
| Meyniel's conjecture holds for random d‐regular graphs | 2019-11-28 | Paper |
| Local algorithms, regular graphs of large girth, and random regular graphs | 2019-02-01 | Paper |
| The Number of Satisfying Assignments of Random Regulark-SAT Formulas | 2018-07-24 | Paper |
| The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph | 2018-07-24 | Paper |
| Uniform generation of random graphs with power-law degree sequences | 2018-03-15 | Paper |
| Orientability Thresholds for Random Hypergraphs | 2017-10-04 | Paper |
| Uniform Generation of Random Regular Graphs | 2017-08-18 | Paper |
| Minimum Power Dominating Sets of Random Cubic Graphs | 2017-06-30 | Paper |
| On the Push&Pull Protocol for Rumor Spreading | 2017-05-24 | Paper |
| It's a Small World for Random Surfers | 2017-03-22 | Paper |
| Cycle Factors and Renewal Theory | 2017-02-01 | Paper |
| Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees | 2016-12-09 | Paper |
| It's a small world for random surfers | 2016-10-21 | Paper |
| Properties of regular graphs with large girth via local algorithms | 2016-10-12 | Paper |
| The threshold for combs in random graphs | 2016-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816121 | 2016-07-01 | Paper |
| On the Push&Pull Protocol for Rumour Spreading | 2016-03-23 | Paper |
| Meyniel's conjecture holds for random graphs | 2016-03-22 | Paper |
| Enumeration of graphs with a heavy-tailed degree sequence | 2015-12-03 | Paper |
| On longest paths and diameter in random apollonian networks | 2015-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934628 | 2014-12-18 | Paper |
| The mixing time of the giant component of a random graph | 2014-11-17 | Paper |
| Load balancing and orientability thresholds for random hypergraphs | 2014-08-13 | Paper |
| Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs | 2014-06-19 | Paper |
| Asymptotic enumeration of sparse 2-connected graphs | 2013-10-29 | Paper |
| Asymptotic enumeration of strongly connected digraphs by vertices and edges | 2013-08-27 | Paper |
| An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph | 2013-06-27 | Paper |
| On the stretch factor of randomly embedded random graphs | 2013-06-07 | Paper |
| The Diameter of Sparse Random Graphs | 2013-03-13 | Paper |
| Gradient-constrained minimum networks. III: Fixed topology | 2013-01-29 | Paper |
| Cores of random \(r\)-partite hypergraphs | 2012-07-20 | Paper |
| Induced subgraphs in sparse random graphs with given degree sequences | 2012-06-18 | Paper |
| On the threshold for \(k\)-regular subgraphs of random graphs | 2012-04-26 | Paper |
| Enumeration of unrooted odd-valent regular planar maps | 2012-01-24 | Paper |
| Disjoint Hamilton cycles in the random geometric graph | 2011-12-20 | Paper |
| Regular induced subgraphs of a random Graph | 2011-05-11 | Paper |
| Geodesics and almost geodesic cycles in random regular graphs | 2011-03-07 | Paper |
| Pegging Graphs Yields a Small Diameter | 2011-03-07 | Paper |
| Linear programming and the worst-case analysis of greedy algorithms on cubic graphs | 2010-12-16 | Paper |
| High degree graphs contain large-star factors | 2010-12-13 | Paper |
| Asymptotics of some convolutional recurrences | 2010-03-26 | Paper |
| Cleaning Regular Graphs with Brushes | 2010-03-17 | Paper |
| On the chromatic number of a random 5-regular graph | 2009-12-18 | Paper |
| On the chromatic number of random \(d\)-regular graphs | 2009-12-09 | Paper |
| Rate of convergence of the short cycle distribution in random regular graphs generated by pegging | 2009-07-08 | Paper |
| Walkers on the Cycle and the Grid | 2009-05-27 | Paper |
| On the hardness of sampling independent sets beyond the tree threshold | 2009-05-13 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Growing Protean Graphs | 2009-04-28 | Paper |
| Short cycle distribution in random regular graphs recursively generated by pegging | 2009-03-04 | Paper |
| Induced Forests in Regular Graphs with Large Girth | 2008-12-11 | Paper |
| Birth control for giants | 2008-10-21 | Paper |
| Corrigendum to ``Counting connected graphs inside-out [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)] | 2008-07-24 | Paper |
| Large forbidden trade volumes and edge packings of random graphs | 2008-05-29 | Paper |
| Expansion properties of a random regular graph after random vertex deletions | 2008-05-29 | Paper |
| Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm | 2008-04-15 | Paper |
| Network modelling of underground mine layout: two case studies | 2008-01-24 | Paper |
| Distribution of subgraphs of random regular graphs | 2008-01-18 | Paper |
| Hamiltonicity of random graphs produced by 2‐processes | 2008-01-08 | Paper |
| Approximations and lower bounds for the length of minimal Euclidean Steiner trees | 2007-10-23 | Paper |
| Large independent sets in regular graphs of large girth | 2007-10-10 | Paper |
| Bounds on the bisection width for random \(d\)-regular graphs | 2007-09-18 | Paper |
| Analysis of Algorithms on the Cores of Random Graphs | 2007-08-28 | Paper |
| On the Independent Domination Number of Random Regular Graphs | 2007-07-30 | Paper |
| Colouring Random 4-Regular Graphs | 2007-07-30 | Paper |
| Colouring Random Regular Graphs | 2007-05-15 | Paper |
| A PTAS for the sparsest 2-spanner of 4-connected planar triangulations | 2007-04-26 | Paper |
| Encores on cores | 2007-03-12 | Paper |
| Rainbow Hamilton cycles in random regular graphs | 2007-02-07 | Paper |
| The generalized acyclic edge chromatic number of random regular graphs | 2007-02-07 | Paper |
| 3-star factors in random \(d\)-regular graphs | 2006-11-15 | Paper |
| Random \(k\)-SAT: A tight threshold for moderately growing \(k\) | 2006-01-26 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Sharp concentration of the number of submaps in random planar triangulations | 2005-07-05 | Paper |
| The acyclic edge chromatic number of a random d‐regular graph is d + 1 | 2005-06-01 | Paper |
| Short cycles in random regular graphs | 2005-04-25 | Paper |
| Counting connected graphs inside-out | 2005-03-08 | Paper |
| Asymptotic normality determined by high moments, and submap counts of random maps | 2005-02-22 | Paper |
| Random hypergraph processes with degree restrictions | 2005-01-20 | Paper |
| Bounds on the max and min bisection of random cubic and random 4-regular graphs | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471152 | 2004-06-18 | Paper |
| To Adrian Bondy and U.S.R. Murty. | 2004-03-15 | Paper |
| Hamiltonian decompositions of random bipartite regular graphs. | 2004-03-14 | Paper |
| Enumeration of \(P_4\)-free chordal graphs | 2004-03-04 | Paper |
| Analysis of greedy algorithms on graphs with bounded degrees | 2004-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440432 | 2003-12-17 | Paper |
| Enumeration of rooted cubic planar maps | 2003-08-14 | Paper |
| The number of labeled 2-connected planar graphs | 2003-05-13 | Paper |
| Asymptotic enumeration of sparse graphs with a minimum degree constraint | 2003-04-28 | Paper |
| Minimum independent dominating sets of random cubic graphs | 2003-04-02 | Paper |
| Decycling numbers of random regular graphs | 2003-03-19 | Paper |
| On the probability of independent sets in random graphs | 2003-03-19 | Paper |
| Permutation Pseudographs and Contiguity | 2003-03-09 | Paper |
| Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs | 2002-12-10 | Paper |
| Regular graphs with no homomorphisms onto cycles | 2002-12-10 | Paper |
| Connectedness of graphs generated by a random d-process | 2002-11-17 | Paper |
| Random regular graphs of high degree | 2002-11-06 | Paper |
| Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree | 2002-10-14 | Paper |
| Maximum induced matchings of random cubic graphs | 2002-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766812 | 2002-07-14 | Paper |
| Counting 5-connected planar triangulations | 2002-04-16 | Paper |
| Linear arboricity and linear \(k\)-arboricity of regular graphs | 2002-03-29 | Paper |
| Random graph processes with maximum degree 2 | 2002-03-14 | Paper |
| Hamilton cycles containing randomly selected edges in random regular graphs | 2002-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344223 | 2001-11-26 | Paper |
| A polynomial algorithm for a constrained traveling salesman problem | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526640 | 2001-01-25 | Paper |
| Gradient-constrained minimum networks. I: Fundamentals. | 2001-01-01 | Paper |
| Factorisation of regular graphs into forests of short paths | 2000-11-02 | Paper |
| The distribution of the maximum vertex degree in random planar maps | 2000-09-24 | Paper |
| Random Star Processes | 2000-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938890 | 2000-08-28 | Paper |
| Branching and tree indexed random walks on fractals | 2000-05-18 | Paper |
| Generating Random Regular Graphs Quickly | 2000-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263664 | 2000-04-26 | Paper |
| The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees | 2000-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222072 | 2000-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395341 | 1999-07-05 | Paper |
| The Size of the Largest Components in Random Planar Maps | 1999-06-27 | Paper |
| A tree-based mergesort | 1999-04-26 | Paper |
| The asymptotic number of set partitions with unequal block sizes | 1999-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4358436 | 1998-03-08 | Paper |
| Minimal Steiner trees for rectangular arrays of lattice points | 1998-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4337357 | 1998-01-13 | Paper |
| Asymptotic enumeration of convex polygons | 1997-12-02 | Paper |
| Full minimal Steiner trees on lattice sets | 1997-11-09 | Paper |
| Steiner Trees for Terminals Constrained to Curves | 1997-08-20 | Paper |
| On the linear \(k\)-arboricity of cubic graphs | 1997-06-10 | Paper |
| Generating and Counting Hamilton Cycles in Random Regular Graphs | 1996-12-16 | Paper |
| Reconstruction of rooted trees from subtrees | 1996-11-25 | Paper |
| Sudden emergence of a giant \(k\)-core in a random graph | 1996-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4894612 | 1996-10-07 | Paper |
| Differential equations for random processes and random graphs | 1996-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4881085 | 1996-06-23 | Paper |
| Largest 4‐connected components of 3‐connected planar triangulations | 1996-06-05 | Paper |
| Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices | 1996-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873680 | 1996-04-17 | Paper |
| Almost all maps are asymmetric | 1995-07-02 | Paper |
| Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs | 1995-07-02 | Paper |
| Spanning Eulerian subgraphs of bounded degree in triangulations | 1994-09-26 | Paper |
| Almost all regular graphs are hamiltonian | 1994-09-11 | Paper |
| Random Graph Processes with Degree Restrictions | 1994-08-08 | Paper |
| Edge crossings in drawings of bipartite graphs | 1994-05-05 | Paper |
| Infinite highly arc transitive digraphs and universal covering digraphs | 1994-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3136994 | 1993-11-01 | Paper |
| Enumeration of Almost-Convex Polygons on the Square Lattice | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4014627 | 1992-10-18 | Paper |
| Almost all cubic graphs are Hamiltonian | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983255 | 1992-06-27 | Paper |
| Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\) | 1992-06-27 | Paper |
| The exponent set of symmetric primitive (0,1) matrices with zero trace | 1992-06-25 | Paper |
| Fixed edge-length graph drawing is NP-hard | 1992-06-25 | Paper |
| Asymptotic enumeration by degree sequence of graphs of high degree | 1992-06-25 | Paper |
| Longest cycles in 3-connected planar graphs | 1992-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3202775 | 1990-01-01 | Paper |
| Removable edges in 3-connected graphs | 1990-01-01 | Paper |
| Uniform generation of random regular graphs of moderate degree | 1990-01-01 | Paper |
| Cycles containing matchings and pairwise compatible euler tours | 1990-01-01 | Paper |
| Bounds on the measurable chromatic number of \({\mathbb{R}}\) | 1989-01-01 | Paper |
| Random Trees in Random Graphs | 1988-01-01 | Paper |
| The Number of Rooted Convex Polyhedra | 1988-01-01 | Paper |
| Isomorphic Factorization of Regular Graphs and 3-Regular Multigraphs | 1988-01-01 | Paper |
| The asymptotic number of rooted nonseparable maps on a surface | 1988-01-01 | Paper |
| Random triangulations of the plane | 1988-01-01 | Paper |
| Generating Random Unlabelled Graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795700 | 1987-01-01 | Paper |
| Optimal worst case trees | 1987-01-01 | Paper |
| Ménage numbers, bijections and P-recursiveness | 1987-01-01 | Paper |
| On the frequency of 3-connected subgraphs of planar graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792708 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818321 | 1986-01-01 | Paper |
| The asymptotic number of acyclic digraphs. I | 1986-01-01 | Paper |
| Extremal clique coverings of complementary graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3676163 | 1985-01-01 | Paper |
| Almost all Convex Polyhedra are Asymmetric | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686751 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3688415 | 1985-01-01 | Paper |
| Regular factors of regular graphs | 1985-01-01 | Paper |
| Enumeration of cyclically 4-connected cubic graphs | 1985-01-01 | Paper |
| Cataloguing the graphs on 10 vertices | 1985-01-01 | Paper |
| The number of loopless planar maps | 1985-01-01 | Paper |
| Counting labelled chordal graphs | 1985-01-01 | Paper |
| Isomorphic factorizations VII. Regular graphs and tournaments | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680864 | 1984-01-01 | Paper |
| Generating random regular graphs | 1984-01-01 | Paper |
| Automorphisms of random graphs with specified vertices | 1984-01-01 | Paper |
| Bridge and cycle degrees of vertices of graphs | 1984-01-01 | Paper |
| Numbers of cubic graphs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3669455 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3671196 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3950574 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4740591 | 1983-01-01 | Paper |
| The Asymptotic Number of Convex Polyhedra | 1982-01-01 | Paper |
| Counting the 10-point graphs by partition | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3956972 | 1981-01-01 | Paper |
| On the Tumber of Planar Maps | 1981-01-01 | Paper |
| The asymptotic distribution of short cycles in random regular graphs | 1981-01-01 | Paper |
| The asymptotic connectivity of labelled regular graphs | 1981-01-01 | Paper |
| Counting unrooted planar maps | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919738 | 1980-01-01 | Paper |
| Number of labeled 4-regular graphs | 1980-01-01 | Paper |
| Some problems in the enumeration of labelled graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048871 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3208683 | 1979-01-01 | Paper |
| Enumeration of Labelled Graphs I: 3-Connected Graphs | 1979-01-01 | Paper |
| Isomorphic factorisations V: Directed graphs | 1979-01-01 | Paper |
| Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity | 1979-01-01 | Paper |
| Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity | 1979-01-01 | Paper |
| The exponential generating function of labelled blocks | 1979-01-01 | Paper |
| On the Number of Automorphisms of a Regular Graph | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3852224 | 1978-01-01 | Paper |
| Achiral plane trees | 1978-01-01 | Paper |
| Isomorphic Factorisations. I: Complete Graphs | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4166776 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4145726 | 1977-01-01 | Paper |
| Counting labelled 3-connected graphs | 1977-01-01 | Paper |
| The divisibility theorem for isomorphic factorizations of complete graphs | 1977-01-01 | Paper |
| A remark on the construction of designs for two-way elimination of heterogeneity | 1976-01-01 | Paper |
| Nonexistence of certain supplementary difference sets | 1975-01-01 | Paper |
