


default search action
Jean-François Culus
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i2]Jean-François Culus, Sophie Toulouse:
Optimizing alphabet reduction pairs of arrays. CoRR abs/2406.10930 (2024) - [i1]Jean-François Culus, Sophie Toulouse:
Deriving differential approximation results for k,CSPs from combinatorial designs. CoRR abs/2409.03903 (2024)
2010 – 2019
- 2018
- [c4]Jean-François Culus, Sophie Toulouse:
2 CSPs All Are Approximable Within a Constant Differential Factor. ISCO 2018: 389-401 - [c3]Jean-François Culus, Sophie Toulouse:
How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be? IWOCA 2018: 374-386 - 2015
- [j4]Jean-François Culus, Marc Demange, Ruxandra Marinescu-Ghemeci, Cerasela Tanasescu:
About some robustness and complexity properties of G-graphs networks. Discret. Appl. Math. 182: 34-45 (2015) - [j3]Yerim Chung, Jean-François Culus, Marc Demange:
Inverse chromatic number problems in interval and permutation graphs. Eur. J. Oper. Res. 243(3): 763-773 (2015) - 2010
- [j2]Yerim Chung, Jean-François Culus, Marc Demange:
On Inverse Chromatic Number problems (Extended abstract). Electron. Notes Discret. Math. 36: 1129-1136 (2010)
2000 – 2009
- 2009
- [j1]Jean-François Culus, Bertrand Jouve:
Convex circuit-free coloration of an oriented graph. Eur. J. Comb. 30(1): 43-52 (2009) - 2008
- [c2]Yerim Chung, Jean-François Culus, Marc Demange:
Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs. WALCOM 2008: 180-187 - 2006
- [b1]Jean-François Culus:
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). University of Toulouse II, France, 2006 - [c1]Jean-François Culus, Marc Demange:
Oriented Coloring: Complexity and Approximation. SOFSEM 2006: 226-236

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint