Search - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly

Filter your results

13 Results
Author: personID (integer) : 973747

Linearity is Strictly More Powerful than Contiguity for Encoding Graphs

Christophe Crespelle , Tien-Nam Le , Kévin Perrot , Thi Ha Duong Phan
Discrete Mathematics, 2016, 339 (8), pp.2168-2177. ⟨10.1016/j.disc.2016.03.006⟩
Journal articles hal-01424428v1
Image document

A Proof of the Barát–Thomassen Conjecture

Julien Bensmail , Ararat Harutyunyan , Tien-Nam Le , Martin Merker , Stéphan Thomassé et al.
Journal of Combinatorial Theory, Series B, 2017, 124, pp.39 - 55. ⟨10.1016/j.jctb.2016.12.006⟩
Journal articles hal-01629943v1

Linearity is Strictly More Powerful than Contiguity for Encoding Graphs

Christophe Crespelle , Tien-Nam Le , Kévin Perrot , Thi Ha Duong Phan
14th International Symposium on Algorithms and Data Structures – WADS 2015, 2015, Victoria, Canada. pp.212-223
Conference papers hal-01242024v1

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems

Fedor V. Fomin , Tien-Nam Le , Daniel Lokshtanov , Saket Saurabh , Stéphan Thomassé et al.
ACM Transactions on Algorithms, 2019, 15 (1), pp.1-44
Journal articles hal-02055844v1

Coloring dense digraphs

Ararat Harutyunyan , Tien-Nam Le , Alantha Newman , Stéphan Thomassé
The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), Aug 2017, Vienna, Austria. pp.577-583
Conference papers hal-01990330v1

Deep Multi-Wasserstein Unsupervised Domain Adaptation

Tien-Nam Le , Amaury Habrard , Marc Sebban
Pattern Recognition Letters, In press
Journal articles hal-02114975v1

Additive bases and flows in graphs

Louis Esperet , Rémi de Joannis de Verclos , Tien-Nam Le , Stéphan Thomassé
SIAM Journal on Discrete Mathematics, 2018, 32 (1), pp.534-542. ⟨10.1137/17M1113758⟩
Journal articles hal-01709239v1
Image document

Coloring tournaments: From local to global

Ararat Harutyunyan , Tien-Nam Le , Stéphan Thomassé , Hehui Wu
Journal of Combinatorial Theory, Series B, 2019, 138, pp.166-171. ⟨10.1016/j.jctb.2019.01.005⟩
Journal articles hal-02181518v1

Additive bases and flows in graphs

Louis Esperet , Rémi de Joannis de Verclos , Tien-Nam Le , Stéphan Thomassé
The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), 2017, Vienne, Austria. pp.399-405, ⟨10.1016/j.endm.2017.06.066⟩
Conference papers hal-01433822v1
Image document

Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture

Julien Bensmail , Ararat Harutyunyan , Tien-Nam Le , Stéphan Thomassé
Combinatorica, 2019, 39 (2), pp.239-263. ⟨10.1007/s00493-017-3661-5⟩
Journal articles hal-01744515v1

Domination and fractional domination in digraphs

Ararat Harutyunyan , Tien-Nam Le , Alantha Newman , Stéphan Thomassé
The Electronic Journal of Combinatorics, 2018, 25 (3), pp.P3.32
Journal articles hal-01990176v1

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems

Tien-Nam Le , Daniel Lokshtanov , Saket Saurabh , Stéphan Thomassé , Meirav Zehavi et al.
SODA 2018, Jan 2018, New Orleans, France. pp.331-342
Conference papers hal-01993402v1

Differentially Private Optimal Transport: Application to Domain Adaptation

Tien-Nam Le , Amaury Habrard , Marc Sebban
IJCAI 2019, Aug 2019, Macao, China
Conference papers hal-02124877v1