Jean-François Couturier

24 papers B 5C 3Misc 1Journal 12Unranked 2
YearRankTypeTitle / Venue / Authors
2022 — conf
Nearly Quantum Computing by Simulation.
CARLA
Gilberto J. Díaz T, Carlos Jaime Barrios Hernández, Luiz Angelo Steffenel, Jean-François Couturier
2018 J jnl
Computing square roots of graphs with low maximum degree.
Discret. Appl. Math.
Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2018 J jnl
Exact algorithms for weak Roman domination.
Discret. Appl. Math.
Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff, Anthony Perez
2016 B conf
Faster Algorithms to Enumerate Hypergraph Transversals.
LATIN
Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch
2016 J jnl
Parameterized Algorithms for Finding Square Roots.
Algorithmica
Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2016 J jnl
Squares of Low Maximum Degree.
CoRR
Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
2015 J jnl
Faster algorithms to enumerate hypergraph transversals.
CoRR
Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch
2015 J jnl
List Coloring in the Absence of a Linear Forest.
Algorithmica
Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2015 J jnl
On the number of minimal dominating sets on some graph classes.
Theor. Comput. Sci.
Jean-François Couturier, Romain Letourneur, Mathieu Liedloff
2014 — conf
An advanced security-aware Cloud architecture.
HPCS
Laurent Bobelin, Aline Bousquet, Jérémy Briffaut, Jean-François Couturier, Christian Toinard, Eddy Caron, Arnaud Lefray, Jonathan Rouzaud-Cornabas
2013 C conf
A tight bound on the number of minimal dominating sets in split graph.
CTW
Jean-François Couturier, Mathieu Liedloff
2013 J jnl
Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds.
Theory Comput. Syst.
Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin
2013 C conf
Exact Algorithms for Weak Roman Domination.
IWOCA
Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez
2013 J jnl
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration.
Theor. Comput. Sci.
Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch
2013 J jnl
Parameterized Algorithms for Finding Square Roots.
CoRR
Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2013 B conf
Sparse Square Roots.
WG
Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
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
2012 J jnl
Bicolored independent sets and bicliques.
Inf. Process. Lett.
Jean-François Couturier, Dieter Kratsch
2012 Misc conf
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs.
COCOON
Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger
2012 B conf
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration.
SOFSEM
Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch
2012 J jnl
On the parameterized complexity of coloring graphs in the absence of a linear forest.
J. Discrete Algorithms
Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2011 C conf
Bicolored independent sets and bicliques.
CTW
Jean-François Couturier, Dieter Kratsch
2011 B conf
List Coloring in the Absence of a Linear Forest.
WG
Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
2010 B conf
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds.
WG
Petr A. Golovach, Dieter Kratsch, Jean-François Couturier