default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTien-Nam Le
Person information
- affiliation: ENS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c4]Fedor V. Fomin
, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA 2023: 49:1-49:14- [i2]Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. CoRR abs/2308.05974 (2023)
2010 – 2019
- 2019
- [j17]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): 239-263 (2019) - [j16]Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Coloring Dense Digraphs. Comb. 39(5): 1021-1053 (2019) - [j15]Gregory Gauthier, Tien-Nam Le, Paul Wollan:
Forcing clique immersions through chromatic number. Eur. J. Comb. 81: 98-118 (2019) - [j14]Tien-Nam Le:
Locally self-avoiding Eulerian tours. J. Comb. Theory B 135: 279-294 (2019) - [j13]Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé, Hehui Wu:
Coloring tournaments: From local to global. J. Comb. Theory B 138: 166-171 (2019) - [j12]Tien-Nam Le, Amaury Habrard, Marc Sebban:
Deep multi-Wasserstein unsupervised domain adaptation. Pattern Recognit. Lett. 125: 249-255 (2019) - [j11]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): 13:1-13:44 (2019) - [c3]Nam Lê Tien, Amaury Habrard, Marc Sebban:
Differentially Private Optimal Transport: Application to Domain Adaptation. IJCAI 2019: 2852-2858 - 2018
- [b1]Tien-Nam Le:
Patterns in Large Graphs. (Motifs dans les grands graphes). University of Lyon, France, 2018 - [j10]Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Domination and Fractional Domination in Digraphs. Electron. J. Comb. 25(3): 3 (2018) - [j9]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): 534-542 (2018) - [c2]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: 331-342 - [i1]Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan:
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs. CoRR abs/1803.05414 (2018) - 2017
- [j8]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: 399-405 (2017) - [j7]Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Coloring dense digraphs. Electron. Notes Discret. Math. 61: 577-583 (2017) - [j6]Tien-Nam Le:
Locally self-avoiding Eulerian tours. Electron. Notes Discret. Math. 62: 27-32 (2017) - [j5]Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé:
A proof of the Barát-Thomassen conjecture. J. Comb. Theory B 124: 39-55 (2017) - 2016
- [j4]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): 2168-2177 (2016) - [j3]Tien-Nam Le, Paul Wollan:
Forcing clique immersions through chromatic number. Electron. Notes Discret. Math. 54: 121-126 (2016) - 2015
- [j2]Tien-Nam Le, Fiachra Knox, Moshe Rosenfeld:
Every 3-colorable graph has a faithful representation in the odd-distance graph. Discret. Math. 338(9): 1614-1620 (2015) - [c1]Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan:
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs. WADS 2015: 212-223 - 2014
- [j1]Moshe Rosenfeld, Nam Lê Tien:
Forbidden Subgraphs of the Odd-Distance Graph. J. Graph Theory 75(4): 323-330 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
