| Publication | Date of Publication | Type |
|---|
On \(k\)-anti-traceability of oriented graphs
Discrete Mathematics | 2025-01-08 | Paper |
Bounds on maximum weight directed cut
SIAM Journal on Discrete Mathematics | 2024-09-17 | Paper |
Public goods in networks with constraints on sharing
Journal of Economic Theory | 2024-06-28 | Paper |
On Seymour's and Sullivan's second neighbourhood conjectures
Journal of Graph Theory | 2024-01-30 | Paper |
Kings in multipartite hypertournaments
Journal of Graph Theory | 2023-10-04 | Paper |
Results on the small quasi-kernel conjecture
Discrete Mathematics | 2023-05-15 | Paper |
| Bounds on Maximum Weight Directed Cut | 2023-04-20 | Paper |
Proper orientation, proper biorientation and semi-proper orientation numbers of graphs
Journal of Combinatorial Optimization | 2023-01-04 | Paper |
Extended path partition conjecture for semicomplete and acyclic compositions
Discrete Mathematics | 2022-08-24 | Paper |
Proper orientation number of triangle-free bridgeless outerplanar graphs
Journal of Graph Theory | 2022-03-31 | Paper |
Proximity and remoteness in directed and undirected graphs
Discrete Mathematics | 2021-01-27 | Paper |
Successive shortest paths in complete graphs with random edge weights
Random Structures & Algorithms | 2021-01-05 | Paper |
The asymptotic number of prefix normal words
Theoretical Computer Science | 2019-08-13 | Paper |
Maximizing the minimum load for random processing times
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Adversarial resilience of matchings in bipartite random graphs
Journal of Combinatorics | 2017-01-10 | Paper |
Controllability and matchings in random bipartite graphs
Surveys in Combinatorics 2015 | 2016-12-20 | Paper |
Nonvertex-balanced factors in random graphs
Journal of Graph Theory | 2015-03-24 | Paper |
| Random planar graphs with \(n\) nodes and a fixed number of edges | 2014-10-13 | Paper |
No dense subgraphs appear in the triangle-free graph process
The Electronic Journal of Combinatorics | 2011-10-18 | Paper |
No dense subgraphs appear in the triangle-free graph process
The Electronic Journal of Combinatorics | 2011-10-18 | Paper |
| Connectivity of random addable graphs | 2011-07-06 | Paper |
Pegging graphs yields a small diameter
Combinatorics, Probability and Computing | 2011-03-07 | Paper |
| A probabilistic counting Lemma for complete graphs | 2010-07-30 | Paper |
Connectivity of the uniform random intersection graph
Discrete Mathematics | 2009-12-15 | Paper |
Algorithms for generating convex sets in acyclic digraphs
Journal of Discrete Algorithms | 2009-12-10 | Paper |
Sequences with Changing Dependencies
SIAM Journal on Discrete Mathematics | 2009-08-20 | Paper |
Convex sets in acyclic digraphs
Order | 2009-05-04 | Paper |
The number of graphs not containing \(K_{3,3}\) as a minor
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
The number of graphs not containing \(K_{3,3}\) as a minor
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
The number of graphs not containing \(K_{3,3}\) as a minor
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Connectivity of addable graph classes
Journal of Combinatorial Theory. Series B | 2008-04-28 | Paper |
The random planar graph process
Random Structures & Algorithms | 2008-03-28 | Paper |
A probabilistic counting lemma for complete graphs
Random Structures & Algorithms | 2008-01-08 | Paper |
The generalized Randić index of trees
Journal of Graph Theory | 2008-01-04 | Paper |
\(K_4\)-free subgraphs of random graphs revisited
Combinatorica | 2007-11-12 | Paper |
| Random planar graphs with given average degree | 2007-06-28 | Paper |
Generalised acyclic edge colourings of graphs with large girth
Discrete Mathematics | 2007-05-11 | Paper |
A characterization for sparse \(\varepsilon\)-regular pairs
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
A characterization for sparse \(\varepsilon\)-regular pairs
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
The generalized acyclic edge chromatic number of random regular graphs
Journal of Graph Theory | 2007-02-07 | Paper |
| The sparse regularity lemma and its applications | 2007-01-19 | Paper |
Small subsets inherit sparse \(\varepsilon\)-regularity
Journal of Combinatorial Theory. Series B | 2007-01-11 | 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 |
K5‐free subgraphs of random graphs
Random Structures & Algorithms | 2004-03-29 | 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 |
Channel assignment with large demands
Annals of Operations Research | 2002-06-09 | Paper |
Colouring weighted bipartite graphs with a co-site constraint
Discrete Mathematics | 2001-04-18 | Paper |
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
(available as arXiv preprint) | N/A | Paper |
On the $k$-anti-traceability Conjecture
(available as arXiv preprint) | N/A | Paper |
