The traveling salesman problem for cubic graphs.
The Tribonacci substitution.
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions.
The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification
Analyzing genomic data for finding those gene variations which are responsible for hereditary diseases is one of the great challenges in modern bioinformatics. In many living beings (including the human), every gene is present in two copies, inherited from the two parents, the so-called haplotypes. In this paper, we propose a simple combinatorial model for classifying the set of haplotypes in a population according to their responsibility for a certain genetic disease. This model is based...
The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces.
Theorem proving through depth-first test
There are more than -letter ternary square-free words.
There are ternary circular square-free words of length for 18.
There exist binary circular power free words of every length.
Three complexity functions
For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.
Three complexity functions
For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.
Three complexity functions
For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.
Three generators for minimal writing-space computations
Three generators for minimal writing-space computations
We construct, for each integer n, three functions from {0,1}n to {0,1} such that any boolean mapping from {0,1}n to {0,1}n can be computed with a finite sequence of assignations only using the n input variables and those three functions.
Three new heuristics for the Steiner problem in graphs.
Three-dimensional 1-bend graph drawings.
Tilings associated with beta-numeration and substitutions.
TimGA: A genetic algorithm for drawing undirected graphs.
Torus knots extremizing the Möbius energy.
Totally greedy coin sets and greedy obstructions.