Jean-François Culus

According to our database, Jean-François Culus authored at least 12 papers between 2006 and 2026.

Collaborative distances:

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

2026

From worst case to the average: Structural guarantees in k-CSP approximation via orthogonal arrays.

Jean-François Culus, Sophie Toulouse

Theor. Comput. Sci., 2026

2024

Deriving differential approximation results for k,CSPs from combinatorial designs.

Jean-François Culus, Sophie Toulouse

CoRR, 2024

Optimizing alphabet reduction pairs of arrays.

Jean-François Culus, Sophie Toulouse

CoRR, 2024

2018

How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be?

Jean-François Culus, Sophie Toulouse

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2 CSPs All Are Approximable Within a Constant Differential Factor.

Jean-François Culus, Sophie Toulouse

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2015

Inverse chromatic number problems in interval and permutation graphs.

Yerim Chung, Jean-François Culus, Marc Demange

Eur. J. Oper. Res., 2015

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

2010

On Inverse Chromatic Number problems (Extended abstract).

Yerim Chung, Jean-François Culus, Marc Demange

Electron. Notes Discret. Math., 2010

2009

Convex circuit-free coloration of an oriented graph.

Jean-François Culus, Bertrand Jouve

Eur. J. Comb., 2009

2008

Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs.

Yerim Chung, Jean-François Culus, Marc Demange

Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

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

PhD thesis, 2006

Oriented Coloring: Complexity and Approximation.

Jean-François Culus, Marc Demange

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006