×

zbMATH — the first resource for mathematics

Le, Tien-Nam

Compute Distance To:
Author ID: le.tien-nam Recent zbMATH articles by "Le, Tien-Nam"
Published as: Le, Tien-Nam
External Links: ORCID
Documents Indexed: 17 Publications since 2015

Publications by Year

Citations contained in zbMATH Open

10 Publications have been cited 22 times in 22 Documents Cited by Year
A proof of the Barát-Thomassen conjecture. Zbl 1398.05158
Bensmail, Julien; Harutyunyan, Ararat; Le, Tien-Nam; Merker, Martin; Thomassé, Stéphan
7
2017
Subquadratic kernels for implicit 3-hitting set and 3-set packing problems. Zbl 1403.68167
Le, Tien-Nam; Lokshtanov, Daniel; Saurabh, Saket; Thomassé, Stéphan; Zehavi, Meirav
4
2018
Forcing clique immersions through chromatic number. Zbl 1420.05057
Gauthier, Gregory; Le, Tien-Nam; Wollan, Paul
2
2019
Coloring tournaments: from local to global. Zbl 1415.05064
Harutyunyan, Ararat; Le, Tien-Nam; Thomassé, Stéphan; Wu, Hehui
2
2019
Additive bases and flows in graphs. Zbl 1380.05092
Esperet, Louis; de Joannis de Verclos, Rémi; Le, Tien-Nam; Thomassé, Stéphan
2
2018
Subquadratic kernels for implicit 3-Hitting Set and 3-Set Packing problems. Zbl 1454.68101
Fomin, Fedor V.; Le, Tien-Nam; Lokshtanov, Daniel; Saurabh, Saket; Thomassé, Stéphan; Zehavi, Meirav
1
2019
Domination and fractional domination in digraphs. Zbl 1395.05069
Harutyunyan, Ararat; Le, Tien-Nam; Newman, Alantha; Thomasse, Stéphan
1
2018
Coloring dense digraphs. Zbl 1379.05035
Harutyunyan, Ararat; Le, Tien-Nam; Newman, Alantha; Thomassé, Stéphan
1
2017
Forcing clique immersions through chromatic number. Zbl 1356.05052
Le, Tien-Nam; Wollan, Paul
1
2016
Linearity is strictly more powerful than contiguity for encoding graphs. Zbl 1444.05136
Crespelle, Christophe; Le, Tien-Nam; Perrot, Kevin; Phan, Thi Ha Duong
1
2015
Forcing clique immersions through chromatic number. Zbl 1420.05057
Gauthier, Gregory; Le, Tien-Nam; Wollan, Paul
2
2019
Coloring tournaments: from local to global. Zbl 1415.05064
Harutyunyan, Ararat; Le, Tien-Nam; Thomassé, Stéphan; Wu, Hehui
2
2019
Subquadratic kernels for implicit 3-Hitting Set and 3-Set Packing problems. Zbl 1454.68101
Fomin, Fedor V.; Le, Tien-Nam; Lokshtanov, Daniel; Saurabh, Saket; Thomassé, Stéphan; Zehavi, Meirav
1
2019
Subquadratic kernels for implicit 3-hitting set and 3-set packing problems. Zbl 1403.68167
Le, Tien-Nam; Lokshtanov, Daniel; Saurabh, Saket; Thomassé, Stéphan; Zehavi, Meirav
4
2018
Additive bases and flows in graphs. Zbl 1380.05092
Esperet, Louis; de Joannis de Verclos, Rémi; Le, Tien-Nam; Thomassé, Stéphan
2
2018
Domination and fractional domination in digraphs. Zbl 1395.05069
Harutyunyan, Ararat; Le, Tien-Nam; Newman, Alantha; Thomasse, Stéphan
1
2018
A proof of the Barát-Thomassen conjecture. Zbl 1398.05158
Bensmail, Julien; Harutyunyan, Ararat; Le, Tien-Nam; Merker, Martin; Thomassé, Stéphan
7
2017
Coloring dense digraphs. Zbl 1379.05035
Harutyunyan, Ararat; Le, Tien-Nam; Newman, Alantha; Thomassé, Stéphan
1
2017
Forcing clique immersions through chromatic number. Zbl 1356.05052
Le, Tien-Nam; Wollan, Paul
1
2016
Linearity is strictly more powerful than contiguity for encoding graphs. Zbl 1444.05136
Crespelle, Christophe; Le, Tien-Nam; Perrot, Kevin; Phan, Thi Ha Duong
1
2015

Citations by Year