default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-François Couturier 0001
Person information
- affiliation: Université de Reims Champagne-Ardenne, France
Other persons with the same name
- Jean-François Couturier 0002 — Nancy University, France
- Jean-François Couturier 0003 — Bell Canada, Montreal, Canada
- Jean-François Couturier 0004 — Onscope Inc., Montréal, QC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2012
[b1]Jean-François Couturier:
Algorithmes exacts et exponentiels sur les graphes : énumération, comptage et optimisation. (Exponential and exact algorithms on graphs : enumeration, counting and optimization). University of Lorraine, Nancy, France, 2012
Journal Articles
- 2018
- [j9]Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Romain Letourneur
, Mathieu Liedloff, Anthony Perez:
Exact algorithms for weak Roman domination. Discret. Appl. Math. 248: 79-92 (2018) - [j8]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Computing square roots of graphs with low maximum degree. Discret. Appl. Math. 248: 93-101 (2018) - 2016
- [j7]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Parameterized Algorithms for Finding Square Roots. Algorithmica 74(2): 602-629 (2016) - 2015
- [j6]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
List Coloring in the Absence of a Linear Forest. Algorithmica 71(1): 21-35 (2015) - [j5]Jean-François Couturier, Romain Letourneur, Mathieu Liedloff:
On the number of minimal dominating sets on some graph classes. Theor. Comput. Sci. 562: 634-642 (2015) - 2013
- [j4]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Artem V. Pyatkin:
Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds. Theory Comput. Syst. 52(4): 645-667 (2013) - [j3]Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch:
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. Theor. Comput. Sci. 487: 82-94 (2013) - 2012
- [j2]Jean-François Couturier, Dieter Kratsch:
Bicolored independent sets and bicliques. Inf. Process. Lett. 112(8-9): 329-334 (2012) - [j1]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
On the parameterized complexity of coloring graphs in the absence of a linear forest. J. Discrete Algorithms 15: 56-62 (2012)
Conference and Workshop Papers
- 2022
- [c10]Gilberto J. Díaz T, Carlos Jaime Barrios Hernández, Luiz Angelo Steffenel, Jean-François Couturier:
Nearly Quantum Computing by Simulation. CARLA 2022: 205-219 - 2016
- [c9]Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch:
Faster Algorithms to Enumerate Hypergraph Transversals. LATIN 2016: 306-318 - 2014
- [c8]Laurent Bobelin, Aline Bousquet, Jérémy Briffaut, Jean-François Couturier, Christian Toinard, Eddy Caron, Arnaud Lefray, Jonathan Rouzaud-Cornabas:
An advanced security-aware Cloud architecture. HPCS 2014: 572-579 - 2013
- [c7]Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez:
Exact Algorithms for Weak Roman Domination. IWOCA 2013: 81-93 - [c6]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Sparse Square Roots. WG 2013: 177-188 - 2012
- [c5]Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger:
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. COCOON 2012: 133-144 - [c4]Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch:
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM 2012: 202-213 - 2011
- [c3]Jean-François Couturier, Dieter Kratsch:
Bicolored independent sets and bicliques. CTW 2011: 130-133 - [c2]Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
List Coloring in the Absence of a Linear Forest. WG 2011: 119-130 - 2010
- [c1]Petr A. Golovach, Dieter Kratsch, Jean-François Couturier:
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. WG 2010: 39-50
Informal and Other Publications
- 2016
- [i4]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Squares of Low Maximum Degree. CoRR abs/1608.06142 (2016) - 2015
- [i3]Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch:
Faster algorithms to enumerate hypergraph transversals. CoRR abs/1510.05093 (2015) - 2013
- [i2]Jean-François Couturier, Mathieu Liedloff:
A tight bound on the number of minimal dominating sets in split graph. CTW 2013: 67-70 - [i1]Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
Parameterized Algorithms for Finding Square Roots. CoRR abs/1310.5469 (2013)
Coauthor Index
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 2025-01-09 13:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
