Jean-François Couturier

According to our database, Jean-François Couturier authored at least 19 papers between 2010 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

Nearly Quantum Computing by Simulation.

Gilberto J. Díaz T, Carlos Jaime Barrios Hernández, Luiz Angelo Steffenel, Jean-François Couturier

Proceedings of the High Performance Computing - 9th Latin American Conference, 2022

2018

Computing square roots of graphs with low maximum degree.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

Discret. Appl. Math., 2018

Exact algorithms for weak Roman domination.

Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff, Anthony Perez

Discret. Appl. Math., 2018

2016

Squares of Low Maximum Degree.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

CoRR, 2016

Parameterized Algorithms for Finding Square Roots.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma

Algorithmica, 2016

Faster Algorithms to Enumerate Hypergraph Transversals.

Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

On the number of minimal dominating sets on some graph classes.

Jean-François Couturier, Romain Letourneur, Mathieu Liedloff

Theor. Comput. Sci., 2015

List Coloring in the Absence of a Linear Forest.

Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma

Algorithmica, 2015

2014

An advanced security-aware Cloud architecture.

Laurent Bobelin, Aline Bousquet, Jérémy Briffaut, Jean-François Couturier, Christian Toinard, Eddy Caron, Arnaud Lefray, Jonathan Rouzaud-Cornabas

Proceedings of the International Conference on High Performance Computing & Simulation, 2014

2013

Minimal dominating sets in graph classes: Combinatorial bounds and enumeration.

Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch

Theor. Comput. Sci., 2013

Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds.

Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin

Theory Comput. Syst., 2013

Sparse Square Roots.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Exact Algorithms for Weak Roman Domination.

Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

A tight bound on the number of minimal dominating sets in split graph.

Jean-François Couturier, Mathieu Liedloff

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Algorithmes exacts et exponentiels sur les graphes : énumération, comptage et optimisation. (Exponential and exact algorithms on graphs : enumeration, counting and optimization).

Jean-François Couturier

PhD thesis, 2012

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

J. Discrete Algorithms, 2012

Bicolored independent sets and bicliques.

Jean-François Couturier, Dieter Kratsch

Inf. Process. Lett., 2012

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

Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2010

Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds.

Petr A. Golovach, Dieter Kratsch, Jean-François Couturier

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010