Oriented Coloring: Complexity and Approximation. - Jean-François Culus; Marc Demange (SOFSEM, 2006)

Décompositions acircuituques de grands graphes orientés:des apsects algorithmiques aux aspects combinatoires. (Circuit-free decompositions of oriented graphs: from algorithmics aspects to combinatorials ones). - Jean-François Culus (2006)

Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs. - Yerim Chung; Jean-François Culus; Marc Demange (WALCOM, 2008)

Convex circuit-free coloration of an oriented graph. - Jean-François Culus; Bertrand Jouve (Eur. J. Comb., 2009)

On Inverse Chromatic Number problems (Extended abstract). - Yerim Chung; Jean-François Culus; Marc Demange (Electron. Notes Discret. Math., 2010)

About some robustness and complexity properties of G-graphs networks. - Jean-François Culus; Marc Demange; Ruxandra Marinescu-Ghemeci; Cerasela Tanasescu (Discret. Appl. Math., 2015)

Inverse chromatic number problems in interval and permutation graphs. - Yerim Chung; Jean-François Culus; Marc Demange (Eur. J. Oper. Res., 2015)

2 CSPs All Are Approximable Within a Constant Differential Factor. - Jean-François Culus; Sophie Toulouse (ISCO, 2018)

How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be? - Jean-François Culus; Sophie Toulouse (IWOCA, 2018)

Optimizing alphabet reduction pairs of arrays. - Jean-François Culus; Sophie Toulouse (CoRR, 2024)

Deriving differential approximation results for k,CSPs from combinatorial designs. - Jean-François Culus; Sophie Toulouse (CoRR, 2024)