Forbidden Subgraphs of the Odd-Distance Graph. - Moshe Rosenfeld 001; Nam Lê Tien (J. Graph Theory, 2014)

Every 3-colorable graph has a faithful representation in the odd-distance graph. - Tien-Nam Le; Fiachra Knox; Moshe Rosenfeld 001 (Discret. Math., 2015)

Linearity is strictly more powerful than contiguity for encoding graphs. - Christophe Crespelle; Tien-Nam Le; Kévin Perrot; Thi Ha Duong Phan (Discret. Math., 2016)

Forcing clique immersions through chromatic number. - Tien-Nam Le; Paul Wollan (Electron. Notes Discret. Math., 2016)

Additive bases and flows in graphs. - Louis Esperet; Rémi de Joannis de Verclos; Tien-Nam Le; Stéphan Thomassé (Electron. Notes Discret. Math., 2017)

Coloring dense digraphs. - Ararat Harutyunyan; Tien-Nam Le; Alantha Newman; Stéphan Thomassé (Electron. Notes Discret. Math., 2017)

A proof of the Barát-Thomassen conjecture. - Julien Bensmail; Ararat Harutyunyan; Tien-Nam Le; Martin Merker; Stéphan Thomassé (J. Comb. Theory B, 2017)

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. - Tien-Nam Le; Daniel Lokshtanov; Saket Saurabh 001; Stéphan Thomassé; Meirav Zehavi (SODA, 2018)

Domination and Fractional Domination in Digraphs. - Ararat Harutyunyan; Tien-Nam Le; Alantha Newman; Stéphan Thomassé (Electron. J. Comb., 2018)

Patterns in Large Graphs. (Motifs dans les grands graphes). - Tien-Nam Le (2018)

Differentially Private Optimal Transport: Application to Domain Adaptation. - Nam Lê Tien; Amaury Habrard; Marc Sebban (IJCAI, 2019)

Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture. - Julien Bensmail; Ararat Harutyunyan; Tien-Nam Le; Stéphan Thomassé (Comb., 2019)

Forcing clique immersions through chromatic number. - Gregory Gauthier; Tien-Nam Le; Paul Wollan (Eur. J. Comb., 2019)

Coloring tournaments: From local to global. - Ararat Harutyunyan; Tien-Nam Le; Stéphan Thomassé; Hehui Wu (J. Comb. Theory B, 2019)

Locally self-avoiding Eulerian tours. - Tien-Nam Le (J. Comb. Theory B, 2019)

Deep multi-Wasserstein unsupervised domain adaptation. - Tien-Nam Le; Amaury Habrard; Marc Sebban (Pattern Recognit. Lett., 2019)

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. - Fedor V. Fomin; Tien-Nam Le; Daniel Lokshtanov; Saket Saurabh 001; Stéphan Thomassé; Meirav Zehavi (ACM Trans. Algorithms, 2019)

Lossy Kernelization for (Implicit) Hitting Set Problems. - Fedor V. Fomin; Tien-Nam Le; Daniel Lokshtanov; Saket Saurabh 001; Stéphan Thomassé; Meirav Zehavi (ESA, 2023)