| Publication | Date of Publication | Type |
|---|
Regular decomposition of the edge set of a graph with applications
The Australasian Journal of Combinatorics | 2024-06-26 | Paper |
| Regular decomposition of the edge set of graphs with applications | 2021-09-25 | Paper |
| A new graph decomposition method for bipartite graphs | 2021-09-25 | Paper |
A discrepancy version of the Hajnal-Szemerédi theorem
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
On the discrepancies of graphs
The Electronic Journal of Combinatorics | 2020-05-20 | Paper |
On the relation of separability, bandwidth and embedding
Graphs and Combinatorics | 2020-01-21 | Paper |
| On embedding degree sequences | 2019-04-26 | Paper |
Embedding graphs having Ore-degree at most five
SIAM Journal on Discrete Mathematics | 2019-03-13 | Paper |
Proof of the 1-factorization and Hamilton Decomposition Conjectures
Memoirs of the American Mathematical Society | 2017-07-25 | Paper |
On the path separation number of graphs
Discrete Applied Mathematics | 2016-09-12 | Paper |
A weighted regularity lemma with applications
International Journal of Combinatorics | 2014-06-27 | Paper |
Proof of the 1-factorization and Hamilton decomposition conjectures
(available as arXiv preprint) | 2014-06-11 | Paper |
| Proof of the 1-factorization and Hamilton decomposition conjectures II: the bipartite case | 2014-01-16 | Paper |
| Proof of the 1-factorization and Hamilton decomposition conjectures III: approximate decompositions | 2014-01-16 | Paper |
Optimal random matchings, tours, and spanning trees in hierarchically separated trees
Theoretical Computer Science | 2013-12-19 | Paper |
| A note on the caro-tuza bound on the independence number of uniform hypergraphs | 2012-10-21 | Paper |
Approximate multipartite version of the Hajnal-Szemerédi theorem
Journal of Combinatorial Theory. Series B | 2012-05-04 | Paper |
Local resilience of almost spanning trees in random graphs
Random Structures & Algorithms | 2011-01-17 | Paper |
| Tight bounds for embedding bounded degree trees | 2010-12-13 | Paper |
Large bounded degree trees in expanding graphs
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Large bounded degree trees in expanding graphs
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
A randomized algorithm for the on-line weighted bipartite matching problem
Journal of Scheduling | 2009-08-28 | Paper |
Regular spanning subgraphs of bipartite graphs of high minimum degree
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Regular spanning subgraphs of bipartite graphs of high minimum degree
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Regular spanning subgraphs of bipartite graphs of high minimum degree
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Optimal Random Matchings on Trees and Applications
Lecture Notes in Computer Science | 2008-11-27 | Paper |
On embedding well-separable graphs
Discrete Mathematics | 2008-09-04 | Paper |
A randomized on–line algorithm for the k–server problem on a line
Random Structures & Algorithms | 2006-09-06 | Paper |
| scientific article; zbMATH DE number 2119646 (Why is no real title available?) | 2004-11-29 | Paper |
Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
Combinatorica | 2004-09-07 | Paper |
| scientific article; zbMATH DE number 1528669 (Why is no real title available?) | 2000-11-13 | Paper |
| scientific article; zbMATH DE number 1446755 (Why is no real title available?) | 2000-05-14 | Paper |
