Jean-François Couturier

Available identifiers

Publication	Date of Publication	Type
Computing square roots of graphs with low maximum degree	2018-09-17	Paper
Exact algorithms for weak Roman domination	2018-09-17	Paper
Faster Algorithms to Enumerate Hypergraph Transversals	2016-05-03	Paper
Parameterized algorithms for finding square roots	2016-03-29	Paper
List coloring in the absence of a linear forest	2015-03-02	Paper
On the number of minimal dominating sets on some graph classes	2014-12-02	Paper
Exact Algorithms for Weak Roman Domination	2014-01-17	Paper
Minimal dominating sets in graph classes: combinatorial bounds and enumeration	2013-12-11	Paper
Sparse Square Roots	2013-12-06	Paper
Colorings with few colors: counting, enumeration and combinatorial bounds	2013-08-01	Paper
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs	2012-09-25	Paper
On the parameterized complexity of coloring graphs in the absence of a linear forest	2012-09-13	Paper
Bicolored independent sets and bicliques	2012-07-20	Paper
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration	2012-06-15	Paper
List Coloring in the Absence of a Linear Forest	2011-12-16	Paper
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds	2010-11-16	Paper

This page was built for person: Jean-François Couturier