4 citations · 4 across the 3 of their papers we have counts for
5 papers
A unified algorithm for colouring graphs of bounded clique-width
Bruno Courcelle, Irène Durand, Michael Raskin
Clique-width is one of the graph complexity measures leading to polynomial special-case algorithms for generally NP-complete problems, e.g. graph colourability. The best two curren…
Fly-automata, model-checking and recognizability
Bruno Courcelle, Irène A. Durand
The Recognizability Theorem states that if a set of finite graphs is definable by a monadic second-order (MSO) sentence, then it is recognizable with respect to the graph algebra u…
Computations by fly-automata beyond monadic second-order logic
Bruno Courcelle, Irène Durand
We present logically based methods for constructing XP and FPT graph algorithms, parametrized by tree-width or clique-width. We will use fly-automata introduced in a previous artic…
Bottom-up rewriting for words and terms
Irene Durand, Geraud Senizergues
For the whole class of linear term rewriting systems, we define \emph{bottom-up rewriting} which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting…
On the Complexity of Deciding Call-by-Need
Irène Durand, Aart Middeldorp
In a recent paper we introduced a new framework for the study of call by need computations to normal form and root-stable form in term rewriting. Using elementary tree automata tec…