An approximate version of the Loebl-Komlós-Sós conjecture. - Diana Piguet; Maya Stein (Electron. Notes Discret. Math., 2007)

The Loebl-Komlós-Sós Conjecture for Trees of Diameter 5 and for Certain Caterpillars. - Diana Piguet; Maya Jakobine Stein (Electron. J. Comb., 2008)

The tripartite Ramsey number for trees. - Julia Böttcher; Jan Hladký; Diana Piguet (Electron. Notes Discret. Math., 2009)

Loebl-Komlós-Sós Conjecture: dense case. - Oliver Cooley; Jan Hladký; Diana Piguet (Electron. Notes Discret. Math., 2009)

A density Corrádi-Hajnal theorem. - Peter Allen 001; Julia Böttcher; Jan Hladký; Diana Piguet (Electron. Notes Discret. Math., 2011)

Embedding cycles of given length in oriented graphs. - Daniela Kühn; Deryk Osthus; Diana Piguet (Eur. J. Comb., 2013)

Turánnical hypergraphs. - Peter Allen 001; Julia Böttcher; Jan Hladký; Diana Piguet (Random Struct. Algorithms, 2013)

An Approximate Version of the Tree Packing Conjecture via Random Embeddings. - Julia Böttcher; Jan Hladký; Diana Piguet; Anusch Taraz (APPROX-RANDOM, 2014)

An Extension of Turán's Theorem, Uniqueness and Stability. - Peter Allen 001; Julia Böttcher; Jan Hladký; Diana Piguet (Electron. J. Comb., 2014)

Loebl-Komlós-Sós Conjecture: Dense case. - Jan Hladký; Diana Piguet (J. Comb. Theory B, 2016)

Packing degenerate graphs greedily. - Peter Allen 001; Julia Böttcher; Jan Hladký; Diana Piguet (Electron. Notes Discret. Math., 2017)

First steps in combinatorial optimization on graphons: Matchings. - Martin Dolezal; Jan Hladký; Ping Hu; Diana Piguet (Electron. Notes Discret. Math., 2017)

A skew version of the Loebl-Komlós-Sós conjecture. - Tereza Klimosová; Diana Piguet; Václav Rozhon (Electron. Notes Discret. Math., 2017)

A Median-Type Condition for Graph Tiling. - Diana Piguet; Maria Saumell (Electron. Notes Discret. Math., 2017)

The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. - Jan Hladký; János Komlós; Diana Piguet; Miklós Simonovits; Maya Stein; Endre Szemerédi (SIAM J. Discret. Math., 2017)

The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. - Jan Hladký; János Komlós; Diana Piguet; Miklós Simonovits; Maya Stein; Endre Szemerédi (SIAM J. Discret. Math., 2017)

The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. - Jan Hladký; János Komlós; Diana Piguet; Miklós Simonovits; Maya Stein; Endre Szemerédi (SIAM J. Discret. Math., 2017)

The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. - Jan Hladký; János Komlós; Diana Piguet; Miklós Simonovits; Maya Stein; Endre Szemerédi (SIAM J. Discret. Math., 2017)

Komlós's tiling theorem via graphon covers. - Jan Hladký; Ping Hu; Diana Piguet (J. Graph Theory, 2019)

A version of the Loebl-Komlós-Sós conjecture for skew trees. - Tereza Klimosová; Diana Piguet; Václav Rozhon (Eur. J. Comb., 2020)

Tilings in graphons. - Jan Hladký; Ping Hu; Diana Piguet (Eur. J. Comb., 2021)