| Publication | Date of Publication | Type |
|---|
Pendant appearances and components in random graphs from structured classes
European Journal of Combinatorics | 2024-07-08 | Paper |
Modularity and Graph Expansion
| 2023-12-12 | Paper |
Modularity of nearly complete graphs and bipartite graphs
| 2023-11-12 | Paper |
The component structure of dense random subgraphs of the hypercube
Random Structures & Algorithms | 2023-10-12 | Paper |
Classes of graphs embeddable in order-dependent surfaces
Combinatorial Theory | 2023-03-31 | Paper |
Random graphs from structured classes
| 2022-09-21 | Paper |
Random graphs embeddable in order-dependent surfaces
| 2021-08-17 | Paper |
Pendant appearances and components in random graphs from structured classes
| 2021-08-16 | Paper |
Modularity of Erdős-Rényi random graphs
| 2021-06-15 | Paper |
Modularity of regular and treelike graphs
Journal of Complex Networks | 2021-05-07 | Paper |
Learning random points from geometric graphs or orderings
Random Structures & Algorithms | 2020-11-30 | Paper |
Modularity of Erdős-Rényi random graphs
Random Structures & Algorithms | 2020-09-16 | Paper |
Connectivity for an unlabelled bridge-addable graph class
| 2020-01-15 | Paper |
Clique coloring of binomial random graphs
Random Structures & Algorithms | 2019-08-14 | Paper |
Extremal distances for subtree transfer operations in binary trees
Annals of Combinatorics | 2019-06-14 | Paper |
Recognition of unipolar and generalised split graphs
Algorithms | 2019-03-26 | Paper |
Clique colourings of geometric graphs
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
Random perfect graphs
Random Structures & Algorithms | 2019-02-20 | Paper |
On the purity of minor-closed classes of graphs
Journal of Combinatorial Theory. Series B | 2019-02-08 | Paper |
On the critical densities of minor-closed classes
European Journal of Combinatorics | 2018-11-15 | Paper |
Linear extensions and comparable pairs in partial orders
Order | 2018-10-09 | Paper |
Edge-maximal graphs on surfaces
Canadian Journal of Mathematics | 2018-08-30 | Paper |
Hamilton cycles, minimum degree, and bipartite holes
Journal of Graph Theory | 2017-12-01 | Paper |
Bridge-addability, edge-expansion and connectivity
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
On random graphs from a minor-closed class
| 2017-07-24 | Paper |
Uniform multicommodity flows in the hypercube with random edge‐capacities
Random Structures & Algorithms | 2017-06-02 | Paper |
Colouring random graphs
| 2016-09-30 | Paper |
Random graphs from a block-stable class
European Journal of Combinatorics | 2016-08-16 | Paper |
Colour degree matrices of graphs with at most one cycle
Discrete Applied Mathematics | 2016-06-21 | Paper |
Connectivity for bridge-alterable graph classes
European Journal of Combinatorics | 2016-05-11 | Paper |
Balanced routing of random calls
The Annals of Applied Probability | 2015-05-29 | Paper |
Counting phylogenetic networks
Annals of Combinatorics | 2015-05-05 | Paper |
For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set
Random Structures & Algorithms | 2014-11-17 | Paper |
Random planar graphs with \(n\) nodes and a fixed number of edges
| 2014-10-13 | Paper |
Random graphs from a weighted minor-closed class
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
On the spread of random graphs
Combinatorics, Probability and Computing | 2014-08-06 | Paper |
Largest sparse subgraphs of random graphs
European Journal of Combinatorics | 2014-07-29 | Paper |
The number of disk graphs
European Journal of Combinatorics | 2014-07-29 | Paper |
Random graphs containing few disjoint excluded minors
Random Structures & Algorithms | 2014-04-15 | Paper |
Relatively Bridge-Addable Classes of Graphs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
On independent sets in graphs with given minimum degree
Combinatorics, Probability and Computing | 2014-02-24 | Paper |
Largest sparse subgraphs of random graphs
| 2013-11-01 | Paper |
Counting disk graphs
| 2013-11-01 | Paper |
Connectivity for random graphs from a weighted bridge-addable class
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Integer realizations of disk and segment graphs
Journal of Combinatorial Theory. Series B | 2013-01-18 | Paper |
Connectivity for Bridge-addable monotone graph classes
Combinatorics, Probability and Computing | 2012-10-31 | Paper |
On the chromatic number of random geometric graphs
Combinatorica | 2012-02-13 | Paper |
Random graphs with few disjoint cycles
Combinatorics, Probability and Computing | 2011-12-08 | Paper |
On graphs with few disjoint \(t\)-star minors
European Journal of Combinatorics | 2011-11-29 | Paper |
Random unlabelled graphs containing few disjoint cycles
Random Structures & Algorithms | 2011-01-17 | Paper |
The number of bits needed to represent a unit disk graph
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Colouring random geometric graphs
| 2010-07-30 | Paper |
The \(t\)-stability number of a random graph
The Electronic Journal of Combinatorics | 2010-06-16 | Paper |
The \(t\)-improper chromatic number of random graphs
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Random graphs from a minor-closed class
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
Acyclic improper colourings of graphs with bounded maximum degree
Discrete Mathematics | 2010-03-29 | Paper |
Uniform multicommodity flow through the complete graph with random edge-capacities
Operations Research Letters | 2009-11-17 | Paper |
On the Maximum Degree of a Random Planar Graph
Combinatorics, Probability and Computing | 2008-09-29 | Paper |
Random graphs on surfaces
Journal of Combinatorial Theory. Series B | 2008-07-24 | Paper |
List Colouring Squares of Planar Graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
The t-improper chromatic number of random graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Vertex-colouring edge-weightings
Combinatorica | 2008-01-14 | Paper |
Asymptotic distributions and chaos for the supermarket model
Electronic Journal of Probability | 2007-11-23 | Paper |
On the span of a random channel assignment problem
Combinatorica | 2007-11-12 | Paper |
Random planar graphs with given average degree
| 2007-06-28 | Paper |
Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
scientific article; zbMATH DE number 5130821 (Why is no real title available?)
| 2007-03-05 | Paper |
Random cubic planar graphs
Random Structures & Algorithms | 2007-02-07 | Paper |
Concentration for self-bounding functions and an inequality of Talagrand
Random Structures & Algorithms | 2007-02-07 | Paper |
On the maximum queue length in the supermarket model
The Annals of Probability | 2006-07-26 | Paper |
On the power of two choices: balls and bins in continuous time
The Annals of Applied Probability | 2005-11-08 | Paper |
Random planar graphs
Journal of Combinatorial Theory. Series B | 2005-03-08 | Paper |
Graph Imperfection with a Co-Site Constraint
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
On the Number of Edges in Random Planar Graphs
Combinatorics, Probability and Computing | 2004-09-24 | Paper |
Channel assignment on graphs of bounded treewidth
Discrete Mathematics | 2004-01-05 | Paper |
scientific article; zbMATH DE number 1984542 (Why is no real title available?)
| 2003-09-22 | Paper |
Frequency-distance constraints with large distances
Discrete Mathematics | 2003-07-29 | Paper |
On-line routing of random calls in networks
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2003-07-08 | Paper |
On the span in channel assignment problems: Bounds, computing and counting
Discrete Mathematics | 2003-06-09 | Paper |
scientific article; zbMATH DE number 1919507 (Why is no real title available?)
| 2003-05-27 | Paper |
Concentration for locally acting permutations
Discrete Mathematics | 2003-05-25 | Paper |
Random channel assignment in the plane
Random Structures & Algorithms | 2003-04-03 | Paper |
scientific article; zbMATH DE number 1944137 (Why is no real title available?)
| 2003-01-01 | Paper |
Concentration for Independent Permutations
Combinatorics, Probability and Computing | 2002-12-15 | Paper |
Graph imperfection. II
Journal of Combinatorial Theory. Series B | 2002-12-11 | Paper |
Graph imperfection. I
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
On the divisibility of graphs
Discrete Mathematics | 2002-06-24 | Paper |
Channel assignment with large demands
Annals of Operations Research | 2002-06-09 | Paper |
Graph imperfection and channel assignment
| 2002-03-25 | Paper |
scientific article; zbMATH DE number 1439504 (Why is no real title available?)
| 2001-05-08 | Paper |
Bisecting sparse random graphs
| 2001-02-11 | Paper |
Channel assignment and weighted coloring
| 2000-12-03 | Paper |
Pattern minimisation in cutting stock problems
Discrete Applied Mathematics | 2000-01-17 | Paper |
scientific article; zbMATH DE number 1246230 (Why is no real title available?)
| 1999-12-13 | Paper |
Colouring proximity graphs in the plane
Discrete Mathematics | 1999-11-03 | Paper |
Random minimum length spanning trees in regular graphs
Combinatorica | 1999-05-18 | Paper |
A doubly cyclic channel assignment problem
Discrete Applied Mathematics | 1998-09-07 | Paper |
On finding a minimum spanning tree in a network with random weights
| 1997-10-01 | Paper |
scientific article; zbMATH DE number 986986 (Why is no real title available?)
| 1997-08-19 | Paper |
Hypergraph colouring and the Lovász local lemma
Discrete Mathematics | 1997-08-17 | Paper |
scientific article; zbMATH DE number 1047743 (Why is no real title available?)
| 1997-08-11 | Paper |
Centering Sequences with Bounded Differences
Combinatorics, Probability and Computing | 1997-07-08 | Paper |
scientific article; zbMATH DE number 1028237 (Why is no real title available?)
| 1997-07-01 | Paper |
Tidier examples for lower bounds on diagonal Ramsey numbers
Journal of Combinatorial Theory. Series A | 1996-07-09 | Paper |
scientific article; zbMATH DE number 858004 (Why is no real title available?)
| 1996-03-20 | Paper |
Almost Every Graph can be Covered by Linear Forests
Combinatorics, Probability and Computing | 1996-02-12 | Paper |
On the bandwidth of triangulated triangles
Discrete Mathematics | 1995-10-23 | Paper |
Minimal positions in a branching random walk
The Annals of Applied Probability | 1995-08-10 | Paper |
The complexity of harmonious colouring for trees
Discrete Applied Mathematics | 1995-04-10 | Paper |
New upper bounds on harmonious colorings
Journal of Graph Theory | 1994-09-15 | Paper |
Total colouring regular bipartite graphs is NP-hard
Discrete Mathematics | 1994-06-28 | Paper |
Sharing jugs of wine
Discrete Mathematics | 1994-05-05 | Paper |
The Strongly Connected Components of 1-in, 1-out
Combinatorics, Probability and Computing | 1994-05-05 | Paper |
On a Correlation Inequality of Farr
Combinatorics, Probability and Computing | 1994-05-05 | Paper |
A Random Recolouring Method for Graphs and Hypergraphs
Combinatorics, Probability and Computing | 1994-04-28 | Paper |
An upper bound for total colouring of graphs
Discrete Mathematics | 1994-04-25 | Paper |
Star arboricity
Combinatorica | 1993-03-10 | Paper |
Probability Modelling and Optimal Location of a Travelling Salesman
The Journal of the Operational Research Society | 1993-01-16 | Paper |
On total colourings of graphs
Journal of Combinatorial Theory. Series B | 1993-01-01 | Paper |
scientific article; zbMATH DE number 68367 (Why is no real title available?)
| 1992-10-06 | Paper |
scientific article; zbMATH DE number 67459 (Why is no real title available?)
| 1992-09-27 | Paper |
Volumes Spanned by Random Points in the Hypercube
Random Structures & Algorithms | 1992-06-28 | Paper |
Upper bounds for harmonious colorings
Journal of Graph Theory | 1992-06-27 | Paper |
Expected numbers at hitting times
Journal of Graph Theory | 1992-06-27 | Paper |
scientific article; zbMATH DE number 16685 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 15993 (Why is no real title available?)
| 1992-06-25 | Paper |
Acyclic coloring of graphs
Random Structures & Algorithms | 1992-06-25 | Paper |
On the chromatic number of random graphs
Random Structures & Algorithms | 1992-06-25 | Paper |
Linear arboricity of random regular graphs
Random Structures & Algorithms | 1992-06-25 | Paper |
Lattice bandwidth of random graphs
Discrete Applied Mathematics | 1991-01-01 | Paper |
On the improvement per iteration in Karmarkar's algorithm for linear programming
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4134071 (Why is no real title available?)
| 1990-01-01 | Paper |
Greedy Matching on the Line
SIAM Journal on Computing | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4170917 (Why is no real title available?)
| 1989-01-01 | Paper |
On random minimum length spanning trees
Combinatorica | 1989-01-01 | Paper |
Building heaps fast
Journal of Algorithms | 1989-01-01 | Paper |
Edge-colouring random graphs
Journal of Combinatorial Theory. Series B | 1988-01-01 | Paper |
Average-Case Lower Bounds for Searching
SIAM Journal on Computing | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4070918 (Why is no real title available?)
| 1987-01-01 | Paper |
On linear programs with random costs
Mathematical Programming | 1986-01-01 | Paper |
On the greedy algorithm with random costs
Mathematical Programming | 1986-01-01 | Paper |
The complexity of counting homeomorphs
Theoretical Computer Science | 1985-01-01 | Paper |
On some conditioning results in the probabilistic analysis of algorithms
Discrete Applied Mathematics | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3945879 (Why is no real title available?)
| 1985-01-01 | Paper |
Partitioning heuristics for two geometric maximization problems
Operations Research Letters | 1984-01-01 | Paper |
scientific article; zbMATH DE number 4101221 (Why is no real title available?)
| 1984-01-01 | Paper |
On the chromatic forcing number of a random graph
Discrete Applied Mathematics | 1983-01-01 | Paper |
General first-passage percolation
Advances in Applied Probability | 1983-01-01 | Paper |
Integral decomposition in polyhedra
Mathematical Programming | 1983-01-01 | Paper |
Achromatic numbers of random graphs
Mathematical Proceedings of the Cambridge Philosophical Society | 1982-01-01 | Paper |
General percolation and random graphs
Advances in Applied Probability | 1981-01-01 | Paper |
Percolation on subsets of the square lattice
Journal of Applied Probability | 1980-01-01 | Paper |
Clutter percolation and random graphs
Mathematical Programming Studies | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3689411 (Why is no real title available?)
| 1979-01-01 | Paper |
Determining the Chromatic Number of a Graph
SIAM Journal on Computing | 1979-01-01 | Paper |
Blocking, antiblocking, and pairs of matroids and polymatroids
Journal of Combinatorial Theory. Series B | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3510341 (Why is no real title available?)
| 1976-01-01 | Paper |
On the number of systems of distinct representatives in an independence structure
Journal of Mathematical Analysis and Applications | 1976-01-01 | Paper |
Disjoint Common Transversals and Exchange Structures
Journal of the London Mathematical Society | 1976-01-01 | Paper |
Bi-submodular functions, distributive valuations, and distance functions in lattices
Algebra Universalis | 1975-01-01 | Paper |
On colouring random graphs
Mathematical Proceedings of the Cambridge Philosophical Society | 1975-01-01 | Paper |
Rado's theorem for polymatroids
Mathematical Proceedings of the Cambridge Philosophical Society | 1975-01-01 | Paper |
An Exchange Theorem for Independence Structures
| 1975-01-01 | Paper |
EXTENSIONS OF MENGER'S THEOREM
The Quarterly Journal of Mathematics | 1975-01-01 | Paper |
Path-Partition Structures of Graphs and Digraphs
Proceedings of the London Mathematical Society | 1974-01-01 | Paper |
Independence Structures and Submodular Functions
Bulletin of the London Mathematical Society | 1973-01-01 | Paper |
An application of a reduction method of R. Rado to the study of common transversals
Mathematika | 1973-01-01 | Paper |
A Note on a Theorem of R. Rado on Independent Transversals
Bulletin of the London Mathematical Society | 1973-01-01 | Paper |
The Solution of a Timetabling Problem
IMA Journal of Applied Mathematics | 1972-01-01 | Paper |
Strict Gammoids and Rank Functions
Bulletin of the London Mathematical Society | 1972-01-01 | Paper |
Modularity and partially observed graphs
| N/A | Paper |
