| Publication | Date of Publication | Type |
|---|
Simultaneous separation in bounded degree trees
Discrete Applied Mathematics | 2026-04-30 | Paper |
Inducibility in H-free graphs and inducibility of Turán graphs
Journal of Combinatorial Theory. Series B | 2026-03-16 | Paper |
Acyclic subgraphs of digraphs with high chromatic number
European Journal of Combinatorics | 2026-01-20 | Paper |
On tournament inversion
Journal of Graph Theory | 2025-08-07 | Paper |
On the minimum density of monotone subwords
The Electronic Journal of Combinatorics | 2025-05-06 | Paper |
| Replacement paths via fast matrix multiplication | 2025-04-29 | Paper |
| Solving linear systems through nested dissection | 2025-04-29 | Paper |
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 |
| Generating a \(d\)-dimensional linear subspace efficiently | 2014-05-22 | Paper |
| scientific article; zbMATH DE number 6297767 (Why is no real title available?) | 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 n) time
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
All-pairs bottleneck paths in vertex weighted graphs
Algorithmica | 2011-03-30 | Paper |
