6 citations · 10 across the 10 of their papers we have counts for
12 papers
Lossy Kernelization for (Implicit) Hitting Set Problems
Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov +3
We re-visit the complexity of kernelization for the -Hitting Set problem. This is a classic problem in Parameterized Complexity, which encompasses several other of the most well…
Integer solutions of
Tien Nam Le, Tung Tho Nguyen
In this article we will show different proofs for the fact that there exist relatively prime positive integers such that: .
Diagonal Orbits in a Type A Double Flag Variety of Complexity One
Mahir Bilen Can, Tien Le
We continue our study of the inclusion posets of diagonal -orbit closures in a product of two partial flag varieties. We prove that, if the diagonal action is of complexity…
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs
Christophe Crespelle, Tien-Nam Le, Kevin Perrot +1
Linearity and contiguity are two parameters devoted to graph encoding. Linearity is a generalisation of contiguity in the sense that every encoding achieving contiguity induces…
Domination and fractional domination in digraphs
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman +1
In this paper, we investigate the relation between the (fractional) domination number of a digraph and the independence number of its underlying graph, denoted by . More…
Coloring dense digraphs
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman +1
The chromatic number of a digraph is the minimum number of acyclic subgraphs covering the vertex set of . A tournament is a hero if every -free tournament has chr…
Forcing clique immersions through chromatic number
Gregory Gauthier, Tien-Nam Le, Paul Wollan
Building on recent work of Dvořák and Yepremyan, we show that every simple graph of minimum degree contains as an immersion and that every graph with chromatic number…
Coloring tournaments: from local to global
Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé +1
The \emph{chromatic number} of a directed graph is the minimum number of colors needed to color the vertices of such that each color class of induces an acyclic subdigr…
Additive bases and flows in graphs
Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le +1
It was conjectured by Jaeger, Linial, Payan, and Tarsi in 1992 that for any prime number , there is a constant such that for any , the union (with repetition) of the vect…
Locally self-avoiding eulerian tours
Tien-Nam Le
It was independently conjectured by Häggkvist in 1989 and Kriesell in 2011 that given a positive integer , every simple eulerian graph with high minimum degree (depending on…
A Proof of the Barát-Thomassen Conjecture
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le +2
The Barát-Thomassen conjecture asserts that for every tree on edges, there exists a constant such that every -edge-connected graph with size divisible by can…
Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le +1
The Barát-Thomassen conjecture asserts that there is a function such that for every fixed tree with edges, every graph which is -edge-connected with its number of…