Tien-Nam Le

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