Search - Archive ouverte HAL Access content directly

Filter your results

25 Results

Auto-contrôle d'une cellule flexible d'usinage : étude et réalisation du système d'information

Jean-François Couturier
Autre. Université Henri Poincaré - Nancy 1, 1991. Français. ⟨NNT : 1991NAN10138⟩
Theses tel-01747793v1

Application to the additive fabrication of Object Oriented Methodology

Jean-François Couturier , Alexandre Schneider
International Conference on Numerical Methods in Industrial Forming Processes (NUMIFORM), 2016, Troyes, France. pp.08002, ⟨10.1051/matecconf/20168008002⟩
Conference papers hal-02291825v1

Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration

Jean-François Couturier , Pinar Heggernes , Pim Van’t Hof , Dieter Kratsch
SOFSEM 2012: Theory and Practice of Computer Science, pp.202-213, 2012, ⟨10.1007/978-3-642-27660-6_17⟩
Book sections istex hal-02332165v1

Exact Algorithms for Weak Roman Domination

Mathieu Chapelle , Manfred Cochefert , Jean-François Couturier , Dieter Kratsch , Mathieu Liedloff et al.
IWOCA 2013, Jul 2013, Rouen, France. pp.81-93, ⟨10.1007/978-3-642-45278-9_8⟩
Conference papers istex hal-00848454v1

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.
Theory of Computing Systems, 2013, 52 (4), pp.645-667. ⟨10.1007/s00224-012-9410-7⟩
Journal articles istex hal-00942919v1

Development of a Decision Support Tool for Additive Manufacturing

Alexandre Schneider , Jean-François Couturier
International CAD Conference (CAD), 2016, Vancouvers, Canada. pp.137-141, ⟨10.14733/cadconfP.2016.137-141⟩
Conference papers hal-02332312v1
Image document

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

Faster Algorithms to Enumerate Hypergraph Transversals

Manfred Cochefert , Jean-François Couturier , Serge Gaspers , Dieter Kratsch
Latin American Symposium on Theoretical Informatics (LATIN), 2016, Ensenada, Mexico. pp.306-318, ⟨10.1007/978-3-662-49529-2_23⟩
Conference papers hal-02332266v1

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 of Discrete Algorithms, 2012, 15, pp.56-62. ⟨10.1016/j.jda.2012.04.008⟩
Journal articles hal-02332177v1

On the number of minimal dominating sets on some graph classes

Jean-François Couturier , Romain Letourneur , Mathieu Liedloff
Theoretical Computer Science, 2015, 562, pp.634-642. ⟨10.1016/j.tcs.2014.11.006⟩
Journal articles hal-01105097v1

Exact algorithms for weak Roman domination

Mathieu Chapelle , Manfred Cochefert , Jean-Fraņcois Couturier , Dieter Kratsch , Romain Letourneur et al.
Discrete Applied Mathematics, 2018, 248, pp.79-92. ⟨10.1016/j.dam.2017.09.015⟩
Journal articles hal-01971124v1

Bicolored independent sets and bicliques

Jean-François Couturier , Dieter Kratsch
Information Processing Letters, 2012, 112 (8-9), pp.329-334. ⟨10.1016/j.ipl.2012.01.010⟩
Journal articles hal-02332188v1

List Coloring in the Absence of a Linear Forest

Jean-François Couturier , Petr A. Golovach , Dieter Kratsch , Daniël Paulusma
Graph-Theoretic Concepts in Computer Science, pp.119-130, 2011, ⟨10.1007/978-3-642-25870-1_12⟩
Book sections hal-02332136v1

List Coloring in the Absence of a Linear Forest

Jean-François Couturier , Petr A. Golovach , Dieter Kratsch , Daniël Paulusma
Algorithmica, 2015, 71 (1), pp.21-35. ⟨10.1007/s00453-013-9777-0⟩
Journal articles hal-02332260v1

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

Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds

Petr A. Golovach , Dieter Kratsch , Jean-François Couturier
Graph Theoretic Concepts in Computer Science, pp.39-50, 2010, 978-3-642-16925-0. ⟨10.1007/978-3-642-16926-7_6⟩
Book sections istex hal-02332120v1

Minimal dominating sets in graph classes: Combinatorial bounds and enumeration

Jean-François Couturier , Pinar Heggernes , Pim van ’t Hof , Dieter Kratsch
Theoretical Computer Science, 2013, 487, pp.82-94. ⟨10.1016/j.tcs.2013.03.026⟩
Journal articles hal-02332232v1

Sparse Square Roots

Manfred Cochefert , Jean-François Couturier , Petr A. Golovach , Dieter Kratsch , Daniël Paulusma et al.
Graph-Theoretic Concepts in Computer Science, pp.177-188, 2013, ⟨10.1007/978-3-642-45043-3_16⟩
Book sections hal-02332225v1

Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs

Jean-François Couturier , Pinar Heggernes , Pim van ’t Hof , Yngve Villanger
Computing and Combinatorics, pp.133-144, 2012, ⟨10.1007/978-3-642-32241-9_12⟩
Book sections hal-02332172v1

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

Parameterized Algorithms for Finding Square Roots

Manfred Cochefert , Jean-François Couturier , Petr A. Golovach , Dieter Kratsch , Daniël Paulusma et al.
Algorithmica, 2016, 74 (2), pp.602-629. ⟨10.1007/s00453-014-9967-4⟩
Journal articles hal-02332270v1

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.
Discrete Applied Mathematics, 2018, 248, pp.93-101. ⟨10.1016/j.dam.2017.04.041⟩
Journal articles hal-02332274v1
Image document

Algorithmes exacts et exponentiels sur les graphes : énumération, comptage et optimisation

Jean-François Couturier
Autre [cs.OH]. Université de Lorraine, 2012. Français. ⟨NNT : 2012LORR0325⟩
Theses tel-01749404v1

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

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