We stand with Ukraine  

Jean-François Culus

According to our database1, Jean-François Culus authored at least 11 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Deriving differential approximation results for k,CSPs from combinatorial designs.
[BibTeX]
[DOI]
Jean-François Culus
,
Sophie Toulouse
CoRR, 2024

Optimizing alphabet reduction pairs of arrays.
[BibTeX]
[DOI]
Jean-François Culus
,
Sophie Toulouse
CoRR, 2024

2018
How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be?
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Yerim Chung
,
Jean-François Culus
,
Marc Demange
Eur. J. Oper. Res., 2015

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

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

2009
Convex circuit-free coloration of an oriented graph.
[BibTeX]
[DOI]
Jean-François Culus
,
Bertrand Jouve
Eur. J. Comb., 2009

2008
Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs.
[BibTeX]
[DOI]
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).
[BibTeX]
[DOI]
Jean-François Culus
PhD thesis, 2006

Oriented Coloring: Complexity and Approximation.
[BibTeX]
[DOI]
Jean-François Culus
,
Marc Demange
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006


  Loading...