We stand with Ukraine  

Diana Piguet

Orcid: 0000-0002-9467-9047

According to our database1, Diana Piguet authored at least 21 papers between 2007 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Tilings in graphons.
[BibTeX]
[DOI]
Jan Hladký
,
Ping Hu
,
Diana Piguet
Eur. J. Comb., 2021

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

2019
Komlós's tiling theorem via graphon covers.
[BibTeX]
[DOI]
Jan Hladký
,
Ping Hu
,
Diana Piguet
J. Graph Theory, 2019

2017
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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 I: The Sparse Decomposition.
[BibTeX]
[DOI]
Jan Hladký
,
János Komlós
,
Diana Piguet
,
Miklós Simonovits
,
Maya Stein
,
Endre Szemerédi
SIAM J. Discret. Math., 2017

A Median-Type Condition for Graph Tiling.
[BibTeX]
[DOI]
Diana Piguet
,
Maria Saumell
Electron. Notes Discret. Math., 2017

A skew version of the Loebl-Komlós-Sós conjecture.
[BibTeX]
[DOI]
Tereza Klimosová
,
Diana Piguet
,
Václav Rozhon
Electron. Notes Discret. Math., 2017

First steps in combinatorial optimization on graphons: Matchings.
[BibTeX]
[DOI]
Martin Dolezal
,
Jan Hladký
,
Ping Hu
,
Diana Piguet
Electron. Notes Discret. Math., 2017

Packing degenerate graphs greedily.
[BibTeX]
[DOI]
Peter Allen
,
Julia Böttcher
,
Jan Hladký
,
Diana Piguet
Electron. Notes Discret. Math., 2017

2016
Loebl-Komlós-Sós Conjecture: Dense case.
[BibTeX]
[DOI]
Jan Hladký
,
Diana Piguet
J. Comb. Theory, Ser. B, 2016

2014
An Extension of Turán's Theorem, Uniqueness and Stability.
[BibTeX]
[DOI]
Peter Allen
,
Julia Böttcher
,
Jan Hladký
,
Diana Piguet
Electron. J. Comb., 2014

An Approximate Version of the Tree Packing Conjecture via Random Embeddings.
[BibTeX]
[DOI]
Julia Böttcher
,
Jan Hladký
,
Diana Piguet
,
Anusch Taraz
Proceedings of the Approximation, 2014

2013
Turánnical hypergraphs.
[BibTeX]
[DOI]
Peter Allen
,
Julia Böttcher
,
Jan Hladký
,
Diana Piguet
Random Struct. Algorithms, 2013

Embedding cycles of given length in oriented graphs.
[BibTeX]
[DOI]
Daniela Kühn
,
Deryk Osthus
,
Diana Piguet
Eur. J. Comb., 2013

2011
A density Corrádi-Hajnal theorem.
[BibTeX]
[DOI]
Peter Allen
,
Julia Böttcher
,
Jan Hladký
,
Diana Piguet
Electron. Notes Discret. Math., 2011

2009
Loebl-Komlós-Sós Conjecture: dense case.
[BibTeX]
[DOI]
Oliver Cooley
,
Jan Hladký
,
Diana Piguet
Electron. Notes Discret. Math., 2009

The tripartite Ramsey number for trees.
[BibTeX]
[DOI]
Julia Böttcher
,
Jan Hladký
,
Diana Piguet
Electron. Notes Discret. Math., 2009

2008
The Loebl-Komlós-Sós Conjecture for Trees of Diameter 5 and for Certain Caterpillars.
[BibTeX]
[DOI]
Diana Piguet
,
Maya Jakobine Stein
Electron. J. Comb., 2008

2007
An approximate version of the Loebl-Komlós-Sós conjecture.
[BibTeX]
[DOI]
Diana Piguet
,
Maya Stein
Electron. Notes Discret. Math., 2007


  Loading...