| Publication | Date of Publication | Type |
|---|
| Path-monochromatic bounded depth rooted trees in (random) tournaments | 2024-04-30 | Paper |
| Highly connected graphs have highly connected spanning bipartite subgraphs | 2024-04-18 | Paper |
| Perfect and nearly perfect separation dimension of complete and random graphs | 2024-02-05 | Paper |
| Packing and Covering a Given Directed Graph in a Directed Graph | 2024-01-10 | Paper |
| Flip colouring of graphs | 2023-12-14 | Paper |
| On tournament inversion | 2023-12-04 | Paper |
| Finding and counting small tournaments in large tournaments | 2023-12-03 | Paper |
| Counting Homomorphic Cycles in Degenerate Graphs | 2023-10-23 | Paper |
| The number of bounded‐degree spanning trees | 2023-10-19 | Paper |
| On the quartet distance given partial information | 2023-10-05 | Paper |
| Sum-distinguishing number of sparse hypergraphs | 2023-07-18 | Paper |
| Almost $k$-union closed set systems | 2023-02-23 | Paper |
| The covering threshold of a directed acyclic graph by directed acyclic subgraphs | 2023-01-11 | Paper |
| Ramsey number of 1-subdivisions of transitive tournaments | 2022-09-23 | Paper |
| Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs | 2022-01-26 | Paper |
| Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs | 2022-01-01 | Paper |
| On factors of independent transversals in \(k\)-partite graphs | 2021-11-22 | Paper |
| Dominant tournament families | 2021-07-23 | Paper |
| All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight) | 2021-06-28 | Paper |
| Paths with many shortcuts in tournaments | 2021-01-21 | Paper |
| Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs | 2020-10-20 | Paper |
| A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families | 2020-10-12 | Paper |
| Incremental distance products via faulty shortest paths | 2020-08-04 | Paper |
| Induced subgraphs with many repeated degrees | 2020-03-20 | Paper |
| Perfect sequence covering arrays | 2020-02-25 | Paper |
| Vector clique decompositions | 2019-10-15 | Paper |
| Clumsy packings of graphs | 2019-07-11 | Paper |
| On the compatibility of quartet trees | 2019-06-20 | Paper |
| On the exact maximum induced density of almost all graphs and their inducibility | 2019-06-17 | Paper |
| The removal lemma for tournaments | 2019-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633908 | 2019-05-06 | Paper |
| Finding even cycles even faster | 2019-04-29 | Paper |
| The effect of local majority on global majorityin connected graphs | 2019-01-11 | Paper |
| Packing without some pieces | 2018-12-10 | Paper |
| Acyclic subgraphs with high chromatic number | 2018-11-15 | Paper |
| Approximation algorithms and hardness results for cycle packing problems | 2018-11-05 | Paper |
| Approximating the Diameter of Planar Graphs in Near Linear Time | 2018-10-30 | Paper |
| On the Maximum Number of Spanning Copies of an Orientation in a Tournament | 2017-10-10 | Paper |
| On the longest path of a randomly weighted tournament | 2017-08-22 | Paper |
| A tournament approach to pattern avoiding matrices | 2017-04-28 | Paper |
| On minimum witnesses for Boolean matrix multiplication | 2017-03-27 | Paper |
| The effect of edge weights on clique weights | 2016-12-29 | Paper |
| Ramsey numbers for degree monotone paths | 2016-12-14 | Paper |
| A Ramsey type result for oriented trees | 2016-11-07 | Paper |
| On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\) | 2016-03-02 | Paper |
| Unavoidable tournaments | 2015-12-11 | Paper |
| Fast sparse matrix multiplication | 2015-09-02 | Paper |
| Hardness and algorithms for rainbow connection | 2015-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501266 | 2015-08-03 | Paper |
| On the Compatibility of Quartet Trees | 2014-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934588 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934690 | 2014-12-18 | Paper |
| Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication | 2014-12-05 | Paper |
| Packing edge-disjoint triangles in regular and almost regular tournaments | 2014-11-20 | Paper |
| Finding heaviest \(H\)-subgraphs in real weighted graphs, with applications | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921712 | 2014-10-13 | Paper |
| Combinatorial and computational aspects of graph packing and graph decomposition | 2014-10-07 | Paper |
| The Turán number of sparse spanning graphs | 2014-10-06 | Paper |
| Edge-Disjoint Cliques in Graphs with High Minimum Degree | 2014-09-26 | Paper |
| Forcing \(k\)-repetitions in degree sequences | 2014-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417639 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417687 | 2014-05-22 | Paper |
| Approximating the maximum consecutive subsums of a sequence | 2014-03-13 | Paper |
| Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs | 2014-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5395722 | 2014-02-17 | Paper |
| Packing Triangles in Regular Tournaments | 2013-10-09 | Paper |
| Approximating the Diameter of Planar Graphs in Near Linear Time | 2013-08-06 | Paper |
| Edge-disjoint induced subgraphs with given minimum degree | 2013-06-07 | Paper |
| Maximum matching in regular and almost regular graphs | 2013-05-16 | Paper |
| A shortest cycle for each vertex of a graph | 2013-04-04 | Paper |
| Reconstructing Approximate Phylogenetic Trees from Quartet Samples | 2013-03-19 | Paper |
| \(H\)-packing of \(k\)-chromatic graphs | 2013-02-28 | Paper |
| Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing | 2012-10-31 | Paper |
| Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence | 2012-08-14 | Paper |
| Approximate shortest paths in weighted graphs | 2012-05-11 | Paper |
| Almost exact matchings | 2012-04-26 | Paper |
| Hardness and Algorithms for Rainbow Connectivity | 2012-04-24 | Paper |
| A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs | 2012-03-15 | Paper |
| The quasi-randomness of hypergraph cut properties | 2012-03-07 | Paper |
| Two-phase algorithms for the parametric shortest path problem | 2012-01-23 | Paper |
| On graphs and algebraic graphs that do not contain cycles of length 4 | 2011-10-12 | Paper |
| A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs | 2011-08-17 | Paper |
| Colorful monochromatic connectivity | 2011-08-08 | Paper |
| Distance Oracles for Vertex-Labeled Graphs | 2011-07-07 | Paper |
| On the size of dissociated bases | 2011-06-01 | Paper |
| Equitable hypergraph orientations | 2011-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002808 | 2011-05-24 | Paper |
| Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets | 2011-04-26 | Paper |
| Computing the Girth of a Planar Graph in $O(n \logn)$ Time | 2011-04-15 | Paper |
| All-pairs bottleneck paths in vertex weighted graphs | 2011-03-30 | Paper |
| The effect of induced subgraphs on quasi-randomness | 2010-11-10 | Paper |
| On the density of a graph and its blowup | 2010-11-05 | Paper |
| Single source shortest paths in \(H\)-minor free graphs | 2010-08-11 | Paper |
| The effect of induced subgraphs on quasi-randomness | 2010-08-06 | Paper |
| Large induced subgraphs with equated maximum degree | 2010-04-27 | Paper |
| Disjoint Color-Avoiding Triangles | 2010-03-17 | Paper |
| The rainbow connection of a graph is (at most) reciprocal to its minimum degree | 2010-03-15 | Paper |
| Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs | 2010-01-29 | Paper |
| A comment on Ryser's conjecture for intersecting hypergraphs | 2009-12-09 | Paper |
| Computing the Girth of a Planar Graph in O(n logn) Time | 2009-07-14 | Paper |
| Multigraphs (only) satisfy a weak triangle removal lemma | 2009-07-08 | Paper |
| Approximation algorithms and hardness results for the clique packing problem | 2009-06-30 | Paper |
| Large disjoint subgraphs with the same order and size | 2009-06-17 | Paper |
| Packing transitive triples in a tournament | 2009-06-08 | Paper |
| On rainbow connection | 2009-04-07 | Paper |
| Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems | 2009-03-12 | Paper |
| Almost Exact Matchings | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549658 | 2009-01-05 | Paper |
| Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets | 2008-11-27 | Paper |
| Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover | 2008-09-25 | Paper |
| Approximation algorithms and hardness results for the clique packing problem | 2008-06-05 | Paper |
| All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time | 2008-05-28 | Paper |
| Almost given length cycles in digraphs | 2008-04-16 | Paper |
| Packing Cliques in Graphs with Independence Number 2 | 2008-02-22 | Paper |
| Rainbow decompositions | 2008-01-23 | Paper |
| Fractional decompositions of dense hypergraphs | 2007-04-02 | Paper |
| Packing directed cycles efficiently | 2007-02-19 | Paper |
| Mean Ramsey–Turán numbers | 2007-02-07 | Paper |
| The number of oriantations having no fixed tournament | 2007-01-02 | Paper |
| Connected odd dominating sets in graphs | 2006-10-16 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| A \((1-1/e)\)-approximation algorithm for the generalized assignment problem | 2006-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5475540 | 2006-06-26 | Paper |
| On a hypergraph matching problem | 2006-06-16 | Paper |
| Decomposing oriented graphs into transitive tournaments | 2006-03-20 | Paper |
| Rainbow \(H\)-factors | 2006-02-16 | Paper |
| Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions | 2005-09-28 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463356 | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2715981 | 2005-07-20 | Paper |
| Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs | 2005-04-28 | Paper |
| Integer and fractional packing of families of graphs | 2005-04-21 | Paper |
| Families of Trees Decompose the Random Graph in an Arbitrary Way | 2005-02-18 | Paper |
| Dense graphs are antimagic | 2005-02-16 | Paper |
| The number of edge-disjoint transitive triples in a tournament | 2004-11-18 | Paper |
| Edge coloring complete uniform hypergraphs with many components | 2004-08-06 | Paper |
| Some remarks on domination | 2004-08-04 | Paper |
| Tiling transitive tournaments and their blow-ups | 2004-03-15 | Paper |
| A coding theory bound and zero-sum square matrices | 2004-03-04 | Paper |
| Equitable Coloring ofk-Uniform Hypergraphs | 2004-01-08 | Paper |
| The order of monochromatic subgraphs with a given minimum degree | 2003-09-24 | Paper |
| 2-connected graphs with small 2-connected dominating sets. | 2003-08-19 | Paper |
| Second neighborhood via first neighborhood in digraphs | 2003-08-14 | Paper |
| The decomposition threshold for bipartite graphs with minimum degree one | 2003-04-02 | Paper |
| Zero-sum square matrices | 2003-03-18 | Paper |
| Covering non-uniform hypergraphs | 2002-12-10 | Paper |
| A note on the number of edges guaranteeing a \(C_4\) in Eulerian bipartite digraphs | 2002-04-25 | Paper |
| Large monotone paths in graphs with bounded degree | 2002-01-09 | Paper |
| List decomposition of graphs. | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760991 | 2001-12-17 | Paper |
| The domatic number of regular and almost regular graphs | 2001-11-24 | Paper |
| Arithmetic progressions with constant weight | 2001-11-18 | Paper |
| Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative | 2001-08-12 | Paper |
| Monotone paths in edge-ordered sparse graphs | 2001-05-21 | Paper |
| Dominating a Family of Graphs with Small Connected Subgraphs | 2001-03-27 | Paper |
| Intersecting designs | 2001-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2765166 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4487455 | 2000-12-03 | Paper |
| A Turán type problem concerning the powers of the degrees of a graph | 2000-11-30 | Paper |
| Decomposing hypergraphs into simple hypertrees | 2000-11-13 | Paper |
| Linear coloring of graphs | 2000-11-02 | Paper |
| Connected Domination and Spanning Trees with Many Leaves | 2000-07-20 | Paper |
| Packing and decomposition of graphs with trees | 2000-06-25 | Paper |
| Graph decomposition of slim graphs | 2000-06-04 | Paper |
| The uniformity space of hypergraphs and its applications | 2000-03-13 | Paper |
| Decomposing large graphs with small graphs of high density | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242959 | 2000-01-11 | Paper |
| Orthogonal decomposition and packing of complete graphs | 1999-12-20 | Paper |
| Optimal factorizations of families of trees | 1999-09-12 | Paper |
| Recognizing global occurrence of local properties | 1999-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222171 | 1999-06-21 | Paper |
| Covering graphs: The covering problem solved | 1999-06-08 | Paper |
| Tree decomposition of graphs | 1999-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230372 | 1999-04-28 | Paper |
| Orthogonal colorings of graphs | 1999-02-02 | Paper |
| Covering the edges of a graph by a prescribed tree with minimum overlap | 1999-02-01 | Paper |
| Independent transversals in \(r\)-partite graphs | 1998-07-06 | Paper |
| Packing graphs: The packing problem solved | 1998-02-12 | Paper |
| Efficient covering designs of the complete graph | 1998-02-12 | Paper |
| Color-coding | 1998-01-28 | Paper |
| On packing trees into complete bipartite graphs | 1997-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347877 | 1997-08-11 | Paper |
| Finding Even Cycles Even Faster | 1997-05-26 | Paper |
| Independent Transversals and Independent Coverings in Sparse Partite Graphs | 1997-03-06 | Paper |
| Finding and counting given length cycles | 1997-03-06 | Paper |
| \(H\)-factors in dense graphs | 1997-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4879181 | 1996-05-22 | Paper |
| The 123 theorem and its extensions | 1996-02-01 | Paper |
| Threshold Functions for H-factors | 1994-08-28 | Paper |
| The Algorithmic Aspects of the Regularity Lemma | 1994-06-05 | Paper |
| Almost \(H\)-factors in dense graphs | 1993-01-16 | Paper |
