| Publication | Date of Publication | Type |
|---|
| On Seymour's and Sullivan's second neighbourhood conjectures | 2024-01-30 | Paper |
| Kings in multipartite hypertournaments | 2023-10-04 | Paper |
| Results on the small quasi-kernel conjecture | 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 | 2023-01-04 | Paper |
| Extended path partition conjecture for semicomplete and acyclic compositions | 2022-08-24 | Paper |
| Proper orientation number of triangle‐free bridgeless outerplanar graphs | 2022-03-31 | Paper |
| Proximity and remoteness in directed and undirected graphs | 2021-01-27 | Paper |
| Successive shortest paths in complete graphs with random edge weights | 2021-01-05 | Paper |
| The asymptotic number of prefix normal words | 2019-08-13 | Paper |
| Maximizing the Minimum Load for Random Processing Times | 2018-10-30 | Paper |
| Adversarial resilience of matchings in bipartite random graphs | 2017-01-10 | Paper |
| Controllability and matchings in random bipartite graphs | 2016-12-20 | Paper |
| Nonvertex‐Balanced Factors in Random Graphs | 2015-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921770 | 2014-10-13 | Paper |
| No dense subgraphs appear in the triangle-free graph process | 2011-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3012397 | 2011-07-06 | Paper |
| Pegging Graphs Yields a Small Diameter | 2011-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576710 | 2010-07-30 | Paper |
| Connectivity of the uniform random intersection graph | 2009-12-15 | Paper |
| Algorithms for generating convex sets in acyclic digraphs | 2009-12-10 | Paper |
| Sequences with Changing Dependencies | 2009-08-20 | Paper |
| Convex sets in acyclic digraphs | 2009-05-04 | Paper |
| The number of graphs not containing \(K_{3,3}\) as a minor | 2009-04-07 | Paper |
| Connectivity of addable graph classes | 2008-04-28 | Paper |
| The random planar graph process | 2008-03-28 | Paper |
| A probabilistic counting lemma for complete graphs | 2008-01-08 | Paper |
| The generalized Randić index of trees | 2008-01-04 | Paper |
| \(K_4\)-free subgraphs of random graphs revisited | 2007-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447281 | 2007-06-28 | Paper |
| Generalised acyclic edge colourings of graphs with large girth | 2007-05-11 | Paper |
| A characterization for sparse \(\varepsilon\)-regular pairs | 2007-03-12 | Paper |
| The generalized acyclic edge chromatic number of random regular graphs | 2007-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416250 | 2007-01-19 | Paper |
| Small subsets inherit sparse \(\varepsilon\)-regularity | 2007-01-11 | Paper |
| Graph Imperfection with a Co-Site Constraint | 2005-02-28 | Paper |
| On the Number of Edges in Random Planar Graphs | 2004-09-24 | Paper |
| K5‐free subgraphs of random graphs | 2004-03-29 | Paper |
| Graph imperfection. II | 2002-12-11 | Paper |
| Graph imperfection. I | 2002-12-10 | Paper |
| Channel assignment with large demands | 2002-06-09 | Paper |
| Colouring weighted bipartite graphs with a co-site constraint | 2001-04-18 | Paper |
