Tien-Nam Le

ORCID

Publication Activity (10 Years)

Years Active: 2015-2023
Publications (10 Years): 21

Top Venues

Electron. Notes Discret. Math.

J. Comb. Theory, Ser. B

CoRR

Comb.

University of Lyon, France (PHD)

Education History

University of Lyon, France

PHD

Publications

Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA (2023)
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR (2023)
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Coloring Dense Digraphs. Comb. 39 (5) (2019)
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Trans. Algorithms 15 (1) (2019)
Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu
Coloring tournaments: From local to global. J. Comb. Theory, Ser. B 138 (2019)
Tien-Nam Le, Amaury Habrard, Marc Sebban
Deep multi-Wasserstein unsupervised domain adaptation. Pattern Recognit. Lett. 125 (2019)
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé
Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture. Comb. 39 (2) (2019)
Gregory Gauthier, Tien-Nam Le, Paul Wollan
Forcing clique immersions through chromatic number. Eur. J. Comb. 81 (2019)
Tien-Nam Le
Locally self-avoiding Eulerian tours. J. Comb. Theory, Ser. B 135 (2019)
Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. SODA (2018)
Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs. CoRR (2018)
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Domination and Fractional Domination in Digraphs. Electron. J. Comb. 25 (3) (2018)
Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé
Additive Bases and Flows in Graphs. SIAM J. Discret. Math. 32 (1) (2018)
Tien-Nam Le
Locally self-avoiding Eulerian tours. Electron. Notes Discret. Math. 62 (2017)
Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé
Additive bases and flows in graphs. Electron. Notes Discret. Math. 61 (2017)
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé
A proof of the Barát-Thomassen conjecture. J. Comb. Theory, Ser. B 124 (2017)
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Coloring dense digraphs. Electron. Notes Discret. Math. 61 (2017)
Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan
Linearity is strictly more powerful than contiguity for encoding graphs. Discret. Math. 339 (8) (2016)
Tien-Nam Le, Paul Wollan
Forcing clique immersions through chromatic number. Electron. Notes Discret. Math. 54 (2016)
Tien-Nam Le, Fiachra Knox, Moshe Rosenfeld
Every 3-colorable graph has a faithful representation in the odd-distance graph. Discret. Math. 338 (9) (2015)
Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs. WADS (2015)

Tien-Nam Le.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tien-Nam Le