| Publication | Date of Publication | Type |
|---|
3-coloring C₄ or C₃-free diameter two graphs
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Polynomial-time Algorithm for Maximum Weight Independent Set on <i>P</i> <sub>6</sub> -free Graphs
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Edge‐decomposing graphs into coprime forests
Journal of Graph Theory | 2023-09-29 | Paper |
Antipaths in oriented graphs
Discrete Mathematics | 2023-06-12 | Paper |
Sandwiching biregular random graphs
Combinatorics, Probability and Computing | 2023-04-03 | Paper |
On Vizing's edge colouring question
Journal of Combinatorial Theory. Series B | 2023-01-04 | Paper |
| Colouring (P_r+P_s)-Free Graphs | 2022-07-21 | Paper |
Edge-partitioning 3-edge-connected graphs into paths
Journal of Combinatorial Theory. Series B | 2022-06-10 | Paper |
On 3-coloring of \((2P_4,C_5)\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
On 3-coloring of \((2P_4,C_5)\)-free graphs
Algorithmica | 2022-06-01 | Paper |
Counterexamples to Thomassen's conjecture on decomposition of cubic graphs
Graphs and Combinatorics | 2021-11-30 | Paper |
Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs
The Electronic Journal of Combinatorics | 2021-02-16 | Paper |
A version of the Loebl-Komlós-Sós conjecture for skew trees
European Journal of Combinatorics | 2020-06-16 | Paper |
Colouring \((P_r + P_s)\)-free graphs
Algorithmica | 2020-05-21 | Paper |
Polynomial-time algorithm for maximum weight independent set on \(P_6\)-free graphs
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Hereditary properties of permutations are strongly testable
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Infinite-dimensional finitely forcible graphon
Proceedings of the London Mathematical Society | 2019-05-15 | Paper |
Infinite-dimensional finitely forcible graphon
Proceedings of the London Mathematical Society | 2019-05-15 | Paper |
| A skew version of the Loebl-Komlós-Sós conjecture | 2018-01-18 | Paper |
| Decomposing graphs into paths and trees | 2018-01-18 | Paper |
Densities in large permutations and parameter testing
European Journal of Combinatorics | 2016-11-07 | Paper |
Immersion in four-edge-connected graphs
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
Finitely forcible graphons and permutons
Journal of Combinatorial Theory. Series B | 2014-11-21 | Paper |
Strong immersions and maximum degree
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Hypertree-depth and minors in hypergraphs
Theoretical Computer Science | 2013-01-07 | Paper |
