| Publication | Date of Publication | Type |
|---|
Finding and counting small tournaments in large tournaments
Theoretical Computer Science | 2024-12-12 | Paper |
Flip colouring of graphs
Graphs and Combinatorics | 2024-11-04 | Paper |
| Counting homomorphic cycles in degenerate graphs | 2024-07-19 | Paper |
Path-monochromatic bounded depth rooted trees in (random) tournaments
Discrete Mathematics | 2024-04-30 | Paper |
Highly connected graphs have highly connected spanning bipartite subgraphs
The Electronic Journal of Combinatorics | 2024-04-18 | Paper |
Perfect and nearly perfect separation dimension of complete and random graphs
Journal of Combinatorial Designs | 2024-02-05 | Paper |
Packing and Covering a Given Directed Graph in a Directed Graph
SIAM Journal on Discrete Mathematics | 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
ACM Transactions on Algorithms | 2023-10-23 | Paper |
The number of bounded‐degree spanning trees
Random Structures & Algorithms | 2023-10-19 | Paper |
On the quartet distance given partial information
Journal of Graph Theory | 2023-10-05 | Paper |
Sum-distinguishing number of sparse hypergraphs
European Journal of Combinatorics | 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
The Electronic Journal of Combinatorics | 2023-01-11 | Paper |
Ramsey number of 1-subdivisions of transitive tournaments
Journal of Combinatorial Theory. Series B | 2022-09-23 | Paper |
Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs
Journal of Combinatorial Theory. Series B | 2022-01-26 | Paper |
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs
(available as arXiv preprint) | 2022-01-01 | Paper |
On factors of independent transversals in \(k\)-partite graphs
The Electronic Journal of Combinatorics | 2021-11-22 | Paper |
Dominant tournament families
Journal of Combinatorics | 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)
SIAM Journal on Discrete Mathematics | 2021-06-28 | Paper |
Paths with many shortcuts in tournaments
Discrete Mathematics | 2021-01-21 | Paper |
Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs
The Electronic Journal of Combinatorics | 2020-10-20 | Paper |
A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families
Theoretical Computer Science | 2020-10-12 | Paper |
Incremental distance products via faulty shortest paths
Information Processing Letters | 2020-08-04 | Paper |
Induced subgraphs with many repeated degrees
Discrete Mathematics | 2020-03-20 | Paper |
Perfect sequence covering arrays
Designs, Codes and Cryptography | 2020-02-25 | Paper |
Vector clique decompositions
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Clumsy packings of graphs
The Electronic Journal of Combinatorics | 2019-07-11 | Paper |
Clumsy packings of graphs
The Electronic Journal of Combinatorics | 2019-07-11 | Paper |
On the compatibility of quartet trees
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
On the exact maximum induced density of almost all graphs and their inducibility
Journal of Combinatorial Theory. Series B | 2019-06-17 | Paper |
The removal lemma for tournaments
Journal of Combinatorial Theory. Series B | 2019-06-17 | Paper |
| Efficient algorithms on sets of permutations, dominance, and real-weighted APSP | 2019-05-06 | Paper |
Finding even cycles even faster
Automata, Languages and Programming | 2019-04-29 | Paper |
The effect of local majority on global majorityin connected graphs
Graphs and Combinatorics | 2019-01-11 | Paper |
Packing without some pieces
Journal of Combinatorics | 2018-12-10 | Paper |
Acyclic subgraphs with high chromatic number
European Journal of Combinatorics | 2018-11-15 | Paper |
Approximation algorithms and hardness results for cycle packing problems
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Approximating the Diameter of Planar Graphs in Near Linear Time
ACM Transactions on Algorithms | 2018-10-30 | Paper |
On the maximum number of spanning copies of an orientation in a tournament
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
On the longest path of a randomly weighted tournament
Discrete Applied Mathematics | 2017-08-22 | Paper |
A tournament approach to pattern avoiding matrices
Israel Journal of Mathematics | 2017-04-28 | Paper |
On minimum witnesses for Boolean matrix multiplication
Algorithmica | 2017-03-27 | Paper |
The effect of edge weights on clique weights
Linear Algebra and its Applications | 2016-12-29 | Paper |
Ramsey numbers for degree monotone paths
Discrete Mathematics | 2016-12-14 | Paper |
A Ramsey type result for oriented trees
European Journal of Combinatorics | 2016-11-07 | Paper |
On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
Graphs and Combinatorics | 2016-03-02 | Paper |
Unavoidable tournaments
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
Fast sparse matrix multiplication
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Hardness and algorithms for rainbow connection
Journal of Combinatorial Optimization | 2015-08-24 | Paper |
| Detecting short directed cycles using rectangular matrix multiplication and dynamic programming | 2015-08-03 | Paper |
On the compatibility of quartet trees
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
| Maximum matching in graphs with an excluded minor | 2014-12-18 | Paper |
| All-pairs bottleneck paths in vertex weighted graphs | 2014-12-18 | Paper |
Replacement paths and distance sensitivity oracles via fast matrix multiplication
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Packing edge-disjoint triangles in regular and almost regular tournaments
Discrete Mathematics | 2014-11-20 | Paper |
Finding heaviest \(H\)-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Approximation algorithms for cycle packing problems | 2014-10-13 | Paper |
Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review | 2014-10-07 | Paper |
The Turán number of sparse spanning graphs
Journal of Combinatorial Theory. Series B | 2014-10-06 | Paper |
Edge-Disjoint Cliques in Graphs with High Minimum Degree
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
Forcing \(k\)-repetitions in degree sequences
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Forcing \(k\)-repetitions in degree sequences
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
| scientific article; zbMATH DE number 6297767 (Why is no real title available?) | 2014-05-22 | Paper |
| Generating a \(d\)-dimensional linear subspace efficiently | 2014-05-22 | Paper |
Approximating the maximum consecutive subsums of a sequence
Theoretical Computer Science | 2014-03-13 | Paper |
Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs
Combinatorics, Probability and Computing | 2014-02-24 | Paper |
| Matrix sparsification and nested dissection over arbitrary fields | 2014-02-17 | Paper |
Packing triangles in regular tournaments
Journal of Graph Theory | 2013-10-09 | Paper |
Approximating the diameter of planar graphs in near linear time
Automata, Languages, and Programming | 2013-08-06 | Paper |
Edge-disjoint induced subgraphs with given minimum degree
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Maximum matching in regular and almost regular graphs
Algorithmica | 2013-05-16 | Paper |
A shortest cycle for each vertex of a graph
Information Processing Letters | 2013-04-04 | Paper |
Reconstructing approximate phylogenetic trees from quartet samples
SIAM Journal on Computing | 2013-03-19 | Paper |
\(H\)-packing of \(k\)-chromatic graphs
Moscow Journal of Combinatorics and Number Theory | 2013-02-28 | Paper |
Dense graphs with a large triangle cover have a large triangle packing
Combinatorics, Probability and Computing | 2012-10-31 | Paper |
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Approximate shortest paths in weighted graphs
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Almost exact matchings
Algorithmica | 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
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
The quasi-randomness of hypergraph cut properties
Random Structures & Algorithms | 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
Journal of Graph Theory | 2011-10-12 | Paper |
A linear time approximation scheme for maximum quartet consistency on sparse sampled inputs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Colorful monochromatic connectivity
Discrete Mathematics | 2011-08-08 | Paper |
Distance oracles for vertex-labeled graphs
Automata, Languages and Programming | 2011-07-07 | Paper |
On the size of dissociated bases
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
On the size of dissociated bases
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
On the size of dissociated bases
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Equitable hypergraph orientations
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Equitable hypergraph orientations
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
scientific article; zbMATH DE number 5899282 (Why is no real title available?)
Theory of Computing | 2011-05-24 | Paper |
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Combinatorica | 2011-04-26 | Paper |
Computing the girth of a planar graph in \(O(n \log n)\) time
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
All-pairs bottleneck paths in vertex weighted graphs
Algorithmica | 2011-03-30 | Paper |
The effect of induced subgraphs on quasi-randomness
Random Structures & Algorithms | 2010-11-10 | Paper |
On the density of a graph and its blowup
Journal of Combinatorial Theory. Series B | 2010-11-05 | Paper |
Single source shortest paths in \(H\)-minor free graphs
Theoretical Computer Science | 2010-08-11 | Paper |
| The effect of induced subgraphs on quasi-randomness | 2010-08-06 | Paper |
Large induced subgraphs with equated maximum degree
Discrete Mathematics | 2010-04-27 | Paper |
Disjoint color-avoiding triangles
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
Journal of Graph Theory | 2010-03-15 | Paper |
Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs
Information Processing Letters | 2010-01-29 | Paper |
A comment on Ryser's conjecture for intersecting hypergraphs
Graphs and Combinatorics | 2009-12-09 | Paper |
Computing the Girth of a Planar Graph in O(n logn) Time
Automata, Languages and Programming | 2009-07-14 | Paper |
Multigraphs (only) satisfy a weak triangle removal lemma
The Electronic Journal of Combinatorics | 2009-07-08 | Paper |
Multigraphs (only) satisfy a weak triangle removal lemma
The Electronic Journal of Combinatorics | 2009-07-08 | Paper |
Multigraphs (only) satisfy a weak triangle removal lemma
The Electronic Journal of Combinatorics | 2009-07-08 | Paper |
Approximation algorithms and hardness results for the clique packing problem
Discrete Applied Mathematics | 2009-06-30 | Paper |
Large disjoint subgraphs with the same order and size
European Journal of Combinatorics | 2009-06-17 | Paper |
Packing transitive triples in a tournament
Annals of Combinatorics | 2009-06-08 | Paper |
On rainbow connection
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
On rainbow connection
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems
Automata, Languages and Programming | 2009-03-12 | Paper |
Almost Exact Matchings
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
| scientific article; zbMATH DE number 5485494 (Why is no real title available?) | 2009-01-05 | Paper |
Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Approximation algorithms and hardness results for the clique packing problem
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time
Theoretical Computer Science | 2008-05-28 | Paper |
Almost given length cycles in digraphs
Graphs and Combinatorics | 2008-04-16 | Paper |
Packing Cliques in Graphs with Independence Number 2
Combinatorics, Probability and Computing | 2008-02-22 | Paper |
Rainbow decompositions
Proceedings of the American Mathematical Society | 2008-01-23 | Paper |
Fractional decompositions of dense hypergraphs
Bulletin of the London Mathematical Society | 2007-04-02 | Paper |
Packing directed cycles efficiently
Discrete Applied Mathematics | 2007-02-19 | Paper |
Mean Ramsey–Turán numbers
Journal of Graph Theory | 2007-02-07 | Paper |
The number of oriantations having no fixed tournament
Combinatorica | 2007-01-02 | Paper |
Connected odd dominating sets in graphs
Discussiones Mathematicae Graph Theory | 2006-10-16 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
Operations Research Letters | 2006-06-30 | Paper |
| Nowhere \(0\) mod \(p\) dominating sets in multigraphs. | 2006-06-26 | Paper |
On a hypergraph matching problem
Graphs and Combinatorics | 2006-06-16 | Paper |
Decomposing oriented graphs into transitive tournaments
Discrete Mathematics | 2006-03-20 | Paper |
Rainbow \(H\)-factors
The Electronic Journal of Combinatorics | 2006-02-16 | Paper |
Rainbow \(H\)-factors
The Electronic Journal of Combinatorics | 2006-02-16 | Paper |
Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
Journal of Combinatorial Theory. Series B | 2005-09-28 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 2191994 (Why is no real title available?) | 2005-08-04 | Paper |
Graphs with large variance.
Ars Combinatoria | 2005-07-20 | Paper |
Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs
Annals of Combinatorics | 2005-04-28 | Paper |
Integer and fractional packing of families of graphs
Random Structures & Algorithms | 2005-04-21 | Paper |
Families of Trees Decompose the Random Graph in an Arbitrary Way
Combinatorics, Probability and Computing | 2005-02-18 | Paper |
Dense graphs are antimagic
Journal of Graph Theory | 2005-02-16 | Paper |
The number of edge-disjoint transitive triples in a tournament
Discrete Mathematics | 2004-11-18 | Paper |
Edge coloring complete uniform hypergraphs with many components
Journal of Combinatorial Theory. Series B | 2004-08-06 | Paper |
Some remarks on domination
Journal of Graph Theory | 2004-08-04 | Paper |
Tiling transitive tournaments and their blow-ups
Order | 2004-03-15 | Paper |
A coding theory bound and zero-sum square matrices
Graphs and Combinatorics | 2004-03-04 | Paper |
Equitable Coloring ofk-Uniform Hypergraphs
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
The order of monochromatic subgraphs with a given minimum degree
The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
The order of monochromatic subgraphs with a given minimum degree
The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
The order of monochromatic subgraphs with a given minimum degree
The Electronic Journal of Combinatorics | 2003-09-24 | Paper |
2-connected graphs with small 2-connected dominating sets.
Discrete Mathematics | 2003-08-19 | Paper |
Second neighborhood via first neighborhood in digraphs
Annals of Combinatorics | 2003-08-14 | Paper |
The decomposition threshold for bipartite graphs with minimum degree one
Random Structures & Algorithms | 2003-04-02 | Paper |
Zero-sum square matrices
European Journal of Combinatorics | 2003-03-18 | Paper |
Covering non-uniform hypergraphs
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
A note on the number of edges guaranteeing a \(C_4\) in Eulerian bipartite digraphs
The Electronic Journal of Combinatorics | 2002-04-25 | Paper |
A note on the number of edges guaranteeing a \(C_4\) in Eulerian bipartite digraphs
The Electronic Journal of Combinatorics | 2002-04-25 | Paper |
Large monotone paths in graphs with bounded degree
Graphs and Combinatorics | 2002-01-09 | Paper |
List decomposition of graphs.
Discrete Mathematics | 2002-01-01 | Paper |
Graphs having the local decomposition property
Ars Combinatoria | 2001-12-17 | Paper |
| The domatic number of regular and almost regular graphs | 2001-11-24 | Paper |
Arithmetic progressions with constant weight
Discrete Mathematics | 2001-11-18 | Paper |
Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative
European Journal of Combinatorics | 2001-08-12 | Paper |
Monotone paths in edge-ordered sparse graphs
Discrete Mathematics | 2001-05-21 | Paper |
Dominating a family of graphs with small connected subgraphs
Combinatorics, Probability and Computing | 2001-03-27 | Paper |
Intersecting designs
Journal of Combinatorial Theory. Series A | 2001-02-05 | Paper |
Orthogonal \(H\)-decompositions.
Bulletin of the Institute of Combinatorics and its Applications | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1463396 (Why is no real title available?) | 2000-12-03 | Paper |
A Turán type problem concerning the powers of the degrees of a graph
The Electronic Journal of Combinatorics | 2000-11-30 | Paper |
A Turán type problem concerning the powers of the degrees of a graph
The Electronic Journal of Combinatorics | 2000-11-30 | Paper |
A Turán type problem concerning the powers of the degrees of a graph
The Electronic Journal of Combinatorics | 2000-11-30 | Paper |
Decomposing hypergraphs into simple hypertrees
Combinatorica | 2000-11-13 | Paper |
Linear coloring of graphs
Discrete Mathematics | 2000-11-02 | Paper |
Connected Domination and Spanning Trees with Many Leaves
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
Packing and decomposition of graphs with trees
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
Graph decomposition of slim graphs
Graphs and Combinatorics | 2000-06-04 | Paper |
The uniformity space of hypergraphs and its applications
Discrete Mathematics | 2000-03-13 | Paper |
| Decomposing large graphs with small graphs of high density | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1286510 (Why is no real title available?) | 2000-01-11 | Paper |
Orthogonal decomposition and packing of complete graphs
Journal of Combinatorial Theory. Series A | 1999-12-20 | Paper |
Optimal factorizations of families of trees
Discrete Mathematics | 1999-09-12 | Paper |
Recognizing global occurrence of local properties
Journal of Complexity | 1999-08-02 | Paper |
| scientific article; zbMATH DE number 1229732 (Why is no real title available?) | 1999-06-21 | Paper |
Covering graphs: The covering problem solved
Journal of Combinatorial Theory. Series A | 1999-06-08 | Paper |
| Tree decomposition of graphs | 1999-04-29 | Paper |
| scientific article; zbMATH DE number 1256685 (Why is no real title available?) | 1999-04-28 | Paper |
Orthogonal colorings of graphs
The Electronic Journal of Combinatorics | 1999-02-02 | Paper |
Orthogonal colorings of graphs
The Electronic Journal of Combinatorics | 1999-02-02 | Paper |
Covering the edges of a graph by a prescribed tree with minimum overlap
Journal of Combinatorial Theory. Series B | 1999-02-01 | Paper |
Independent transversals in \(r\)-partite graphs
Discrete Mathematics | 1998-07-06 | Paper |
Packing graphs: The packing problem solved
The Electronic Journal of Combinatorics | 1998-02-12 | Paper |
Packing graphs: The packing problem solved
The Electronic Journal of Combinatorics | 1998-02-12 | Paper |
Efficient covering designs of the complete graph
The Electronic Journal of Combinatorics | 1998-02-12 | Paper |
Efficient covering designs of the complete graph
The Electronic Journal of Combinatorics | 1998-02-12 | Paper |
Color-coding
Journal of the ACM | 1998-01-28 | Paper |
On packing trees into complete bipartite graphs
Discrete Mathematics | 1997-09-24 | Paper |
| scientific article; zbMATH DE number 1047710 (Why is no real title available?) | 1997-08-11 | Paper |
Finding Even Cycles Even Faster
SIAM Journal on Discrete Mathematics | 1997-05-26 | Paper |
Finding and counting given length cycles
Algorithmica | 1997-03-06 | Paper |
Independent Transversals and Independent Coverings in Sparse Partite Graphs
Combinatorics, Probability and Computing | 1997-03-06 | Paper |
\(H\)-factors in dense graphs
Journal of Combinatorial Theory. Series B | 1997-01-12 | Paper |
| scientific article; zbMATH DE number 881297 (Why is no real title available?) | 1996-05-22 | Paper |
The 123 theorem and its extensions
Journal of Combinatorial Theory. Series A | 1996-02-01 | Paper |
Threshold Functions for H-factors
Combinatorics, Probability and Computing | 1994-08-28 | Paper |
The Algorithmic Aspects of the Regularity Lemma
Journal of Algorithms | 1994-06-05 | Paper |
Almost \(H\)-factors in dense graphs
Graphs and Combinatorics | 1993-01-16 | Paper |
