Obserwuj
Tien-Nam Le
Tien-Nam Le
Laboratoire Hubert Curien
Zweryfikowany adres z ens-lyon.fr - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
A proof of the Barát–Thomassen conjecture
J Bensmail, A Harutyunyan, TN Le, M Merker, S Thomassé
Journal of Combinatorial Theory, Series B 124, 39-55, 2017
202017
Forcing clique immersions through chromatic number
G Gauthier, TN Le, P Wollan
European Journal of Combinatorics 81, 98-118, 2019
142019
Coloring tournaments: From local to global
A Harutyunyan, TN Le, S Thomassé, H Wu
Journal of Combinatorial Theory, Series B 138, 166-171, 2019
142019
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems
TN Le, D Lokshtanov, S Saurabh, S Thomassé, M Zehavi
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
142018
Differentially Private Optimal Transport: Application to Domain Adaptation.
N Lê Tien, A Habrard, M Sebban
IJCAI, 2852-2858, 2019
122019
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture
J Bensmail, A Harutyunyan, TN Le, S Thomassé
Combinatorica 39 (2), 239-263, 2019
112019
Edge-partitioning a graph into paths: beyond the Bar\'at-Thomassen conjecture
J Bensmail, A Harutyunyan, TN Le, S Thomassé
arXiv preprint arXiv:1507.08208, 2015
112015
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems
FV Fomin, TN Le, D Lokshtanov, S Saurabh, S Thomassé, M Zehavi
ACM Transactions on Algorithms (TALG) 15 (1), 1-44, 2019
92019
Coloring dense digraphs
A Harutyunyan, TN Le, A Newman, S Thomassé
Combinatorica 39, 1021-1053, 2019
82019
Deep multi-Wasserstein unsupervised domain adaptation
TN Le, A Habrard, M Sebban
Pattern Recognition Letters 125, 249-255, 2019
82019
Additive bases and flows in graphs
L Esperet, R De Joannis De Verclos, TN Le, S Thomassé
SIAM Journal on Discrete Mathematics 32 (1), 534-542, 2018
72018
Forbidden Subgraphs of the Odd‐Distance Graph
M Rosenfeld, NL Tiến
Journal of Graph Theory 75 (4), 323-330, 2014
62014
Domination and fractional domination in digraphs
A Harutyunyan, TN Le, A Newman, S Thomassé
arXiv preprint arXiv:1708.00423, 2017
52017
Forcing clique immersions through chromatic number
TN Le, P Wollan
Electronic Notes in Discrete Mathematics 54, 121-126, 2016
32016
Locally self-avoiding Eulerian tours
TN Le
Journal of Combinatorial Theory, Series B 135, 279-294, 2019
22019
Coloring dense digraphs
A Harutyunyan, TN Le, A Newman, S Thomassé
Electronic Notes in Discrete Mathematics 61, 577-583, 2017
22017
Linearity is strictly more powerful than contiguity for encoding graphs
C Crespelle, TN Le, K Perrot, THD Phan
Discrete Mathematics 339 (8), 2168-2177, 2016
12016
Every 3-colorable graph has a faithful representation in the odd-distance graph
TN Le, F Knox, M Rosenfeld
Discrete Mathematics 338 (9), 1614-1620, 2015
12015
House allocation with randomly generated preference lists
H Abgaryan, Y Chevaleyre, A Harutyunyan, TN Le
Autonomous Agents and Multi-Agent Systems, 2022
2022
Diagonal Orbits in a Type A Double Flag Variety of Complexity One
M Bilen Can, T Le
arXiv e-prints, arXiv: 1810.06513, 2018
2018
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20