Equi-partitioning of higher-dimensional hyper-rectangular grid graphs.
Errata : «Les hiérarchies de parties et leur demi-treillis»
Establishing Order in Planar Subdivisions.
Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées
Evaluating a weighted graph polynomial for graphs of bounded tree-width.
Even kernels.
Exact bounds on the complexity of sequential string matching algorithms. (Des bornes exactes de la complexité des algorithmes séquentiels de recherche d'un motif.)
Existence of an infinite ternary 64-abelian square-free word
We consider a recently defined notion of k-abelian equivalence of words by concentrating on avoidance problems. The equivalence class of a word depends on the numbers of occurrences of different factors of length k for a fixed natural number k and the prefix of the word. We have shown earlier that over a ternary alphabet k-abelian squares cannot be avoided in pure morphic words for any natural number k. Nevertheless, computational experiments support the conjecture that even 3-abelian squares can...
Existence of feasible potentials on infinite networks.
Experiments with the fixed-parameter approach for two-layer planarization.
Explicit constructions of extractors and expanders
Exploiting the structure of conflict graphs in high level synthesis
In this paper we analyze the computational complexity of a processor optimization problem. Given operations with interval times in a branching flow graph, the problem is to find an assignment of the operations to a minimum number of processors. We analyze the complexity of this assignment problem for flow graphs with a constant number of program traces and a constant number of processors.
Extended Ramsey theory for words representing rationals
Ramsey theory for words over a finite alphabet was unified in the work of Carlson, who also presented a method to extend the theory to words over an infinite alphabet, but subject to a fixed dominating principle. In the present work we establish an extension of Carlson's approach to countable ordinals and Schreier-type families developing an extended Ramsey theory for dominated words over a doubly infinite alphabet (in fact for ω-ℤ*-located words), and we apply this theory, exploiting the Budak-Işik-Pym...
Extensions of -subsets to -subsets - existence versus constructability
Extremal infinite overlap-free binary words.
Extreme distances in multicolored point sets.
Factor complexity of infinite words associated with non-simple Parry numbers.
Factor frequencies in generalized Thue-Morse words
We describe factor frequencies of the generalized Thue-Morse word defined for , as the fixed point starting in of the morphism where and where the letters are expressed modulo . We...
Factors of generalized Rudin-Shapiro sequences. (Facteurs des suites de Rudin-Shapiro généralisées.)
Fast approximation of centrality.