Auto-contrôle d'une cellule flexible d'usinage : étude et réalisation du système d'information
Jean-François Couturier
Theses
tel-01747793v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Application to the additive fabrication of Object Oriented Methodology
Jean-François Couturier
,
Alexandre Schneider
Conference papers
hal-02291825v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration
Jean-François Couturier
,
Pinar Heggernes
,
Pim Van’t Hof
,
Dieter Kratsch
Book sections
istex
hal-02332165v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Exact Algorithms for Weak Roman Domination
Mathieu Chapelle
,
Manfred Cochefert
,
Jean-François Couturier
,
Dieter Kratsch
,
Mathieu Liedloff
et al.
Conference papers
istex
hal-00848454v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds
Jean-François Couturier
,
Petr A. Golovach
,
Dieter Kratsch
,
Mathieu Liedloff
,
Artem V. Pyatkin
et al.
Journal articles
istex
hal-00942919v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Development of a Decision Support Tool for Additive Manufacturing
Alexandre Schneider
,
Jean-François Couturier
Conference papers
hal-02332312v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Parameterized Algorithms for Finding Square Roots
Manfred Cochefert
,
Jean-François Couturier
,
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
et al.
2019
Preprints, Working Papers, ...
hal-02332212v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Faster Algorithms to Enumerate Hypergraph Transversals
Manfred Cochefert
,
Jean-François Couturier
,
Serge Gaspers
,
Dieter Kratsch
Conference papers
hal-02332266v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On the parameterized complexity of coloring graphs in the absence of a linear forest
Jean-François Couturier
,
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
Journal articles
hal-02332177v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On the number of minimal dominating sets on some graph classes
Jean-François Couturier
,
Romain Letourneur
,
Mathieu Liedloff
Journal articles
hal-01105097v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Exact algorithms for weak Roman domination
Mathieu Chapelle
,
Manfred Cochefert
,
Jean-Fraņcois Couturier
,
Dieter Kratsch
,
Romain Letourneur
et al.
Journal articles
hal-01971124v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Bicolored independent sets and bicliques
Jean-François Couturier
,
Dieter Kratsch
Journal articles
hal-02332188v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
List Coloring in the Absence of a Linear Forest
Jean-François Couturier
,
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
Book sections
hal-02332136v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
List Coloring in the Absence of a Linear Forest
Jean-François Couturier
,
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
Journal articles
hal-02332260v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On the Number of Minimal Dominating Sets on Cobipartite and Interval Graphs
Jean-François Couturier
,
Romain Letourneur
,
Mathieu Liedloff
9th International colloquium on graph theory and combinatorics , Jun 2014, Grenoble, France
Conference papers
hal-01105090v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds
Petr A. Golovach
,
Dieter Kratsch
,
Jean-François Couturier
Book sections
istex
hal-02332120v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration
Jean-François Couturier
,
Pinar Heggernes
,
Pim van ’t Hof
,
Dieter Kratsch
Journal articles
hal-02332232v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Sparse Square Roots
Manfred Cochefert
,
Jean-François Couturier
,
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
et al.
Book sections
hal-02332225v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
Jean-François Couturier
,
Pinar Heggernes
,
Pim van ’t Hof
,
Yngve Villanger
Book sections
hal-02332172v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Cologne-Twente Workshop on Graphs and Combinatorial Optimization CTW 2011
Jean-François Couturier
,
Villa Mondragone
,
Ludovica Adacher
,
Marta Flamini
,
Gianmaria Leo
et al.
CTW 2011 Proceedings , pp.130 - 133, 2011
Book sections
hal-02332157v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Parameterized Algorithms for Finding Square Roots
Manfred Cochefert
,
Jean-François Couturier
,
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
et al.
Journal articles
hal-02332270v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Computing square roots of graphs with low maximum degree
Manfred Cochefert
,
Jean-François Couturier
,
Petr A. Golovach
,
Dieter Kratsch
,
Daniël Paulusma
et al.
Journal articles
hal-02332274v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Algorithmes exacts et exponentiels sur les graphes : énumération, comptage et optimisation
Jean-François Couturier
Theses
tel-01749404v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
An Advanced Security-Aware Cloud Architecture
Laurent Bobelin
,
Aline Bousquet
,
Jérémy Briffaut
,
Eddy Caron
,
Jean-François Couturier
et al.
HPCS 2014 - The 2014 International Conference on High Performance Computing & Simulation , Jul 2014, Bologne, Italy
Conference papers
hal-01063852v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
A tight bound on the number of minimal dominating sets in split graph
Jean-François Couturier
,
Mathieu Liedloff
CTW 2013 , 2013, Netherlands. pp. 67-70
Conference papers
hal-00943038v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More