Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Frédéric Havet

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Nathann Cohen

> Home > Persons > Frédéric Havet

Publications

2019
[j90]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorics/AboulkerCHLMT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/AboulkerCHLMT19
Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, Stéphan Thomassé:
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. Electron. J. Comb. 26(3): 3 (2019)
[j89]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dmtcs/BensmailBCHR19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmtcs/BensmailBCHR19
Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, Leonardo S. Rocha:
Backbone colouring and algorithms for TDMA scheduling. Discret. Math. Theor. Comput. Sci. 21(3) (2019)
2018
[j85]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorics/CohenH18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/CohenH18
Nathann Cohen, Frédéric Havet:
On the Minimum Size of an Identifying Code Over All Orientations of a Graph. Electron. J. Comb. 25(1): 1 (2018)
[j84]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorics/CohenHLL18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/CohenHLL18
Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes:
Bispindles in Strongly Connected Digraphs with Large Chromatic Number. Electron. J. Comb. 25(2): 2 (2018)
[j81]
- view
  authority control:
- export record
  dblp key:
  - journals/jda/CohenHMSW18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/CohenHMSW18
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms 52-53: 133-142 (2018)
[j78]
- view
  authority control:
- export record
  dblp key:
  - journals/jgt/CohenHLN18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/CohenHLN18
Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse:
Subdivisions of oriented cycles in digraphs with large chromatic number. J. Graph Theory 89(4): 439-456 (2018)
2017
[j74]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/CohenHLL17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/CohenHLL17
Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes:
Bispindle in strongly connected digraphs with large chromatic number. Electron. Notes Discret. Math. 62: 69-74 (2017)
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/iwoca/CohenHMSW17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/CohenHMSW17
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum ℱ -Overlay Problem. IWOCA 2017: 116-127
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/CohenHMSW17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/CohenHMSW17
Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum F-Overlay Problem. CoRR abs/1703.05156 (2017)
2016
[j68]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Bang-JensenCH16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Bang-JensenCH16
Jørgen Bang-Jensen, Nathann Cohen, Frédéric Havet:
Finding good 2-partitions of digraphs II. Enumerable properties. Theor. Comput. Sci. 640: 1-19 (2016)
2015
[j63]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/AraujoCRHM15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AraujoCRHM15
Júlio Araújo, Nathann Cohen, Susanna F. de Rezende, Frédéric Havet, Phablo F. S. Moura:
On the proper orientation number of bipartite graphs. Theor. Comput. Sci. 566: 59-75 (2015)
2012
[j52]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/AraujoCGH12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AraujoCGH12
Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet:
Good edge-labelling of graphs. Discret. Appl. Math. 160(18): 2502-2513 (2012)
2011
[j44]
- view
  authority control:
- export record
  dblp key:
  - journals/gc/CohenH11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/CohenH11
Nathann Cohen, Frédéric Havet:
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. Graphs Comb. 27(6): 831-849 (2011)
[j41]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/BasavarajuCCHM11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/BasavarajuCCHM11
Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller:
Acyclic Edge-Coloring of Planar Graphs. SIAM J. Discret. Math. 25(2): 463-478 (2011)
2010
[j36]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/CohenH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/CohenH10
Nathann Cohen, Frédéric Havet:
Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof. Discret. Math. 310(21): 3049-3051 (2010)
2009
[j29]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/CohenHM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/CohenHM09
Nathann Cohen, Frédéric Havet, Tobias Müller:
Acyclic edge-colouring of planar graphs. Extended abstract. Electron. Notes Discret. Math. 34: 417-421 (2009)
[j28]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/AraujoCGH09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/AraujoCGH09
Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet:
Good edge-labelling of graphs. Electron. Notes Discret. Math. 35: 275-280 (2009)

a service of

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.