Nombre de documents

124

CV de Frederic Havet


Rapport61 documents

  • Jørgen Bang-Jensen, Nathann Cohen, Frédéric Havet. Finding good 2-partitions of digraphs II. Enumerable properties. [Research Report] RR-8868, INRIA Sophia Antipolis - I3S. 2016. <hal-01279338>
  • Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse. Subdivisions of oriented cycles in digraphs with large chromatic number. [Research Report] RR-8865, LRI - CNRS, University Paris-Sud; LIP - ENS Lyon; INRIA Sophia Antipolis - I3S. 2016, pp.25. <hal-01277578>
  • Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo Moura, et al.. Subdivisions in digraphs of large out-degree or large dichromatic number *. [Research Report] INRIA Sophia Antipolis - I3S. 2016. <hal-01403921>
  • Marwane Bouznif, Frédéric Havet, Myriam Preissmann. Minimum-density identifying codes in square grids. [Research Report] RR-8845, INRIA Sophia Antipolis - I3S. 2016. <hal-01259550>
  • Jørgen Bang-Jensen, Frédéric Havet. Finding good 2-partitions of digraphs I. Hereditary properties. [Research Report] RR-8867, INRIA Sophia Antipolis - I3S. 2016. <hal-01279332>
  • Rennan Dantas, Frédéric Havet, Rudini Sampaio. Identifying codes for infinite triangular grids with a finite number of rows. [Research Report] RR-8951, INRIA Sophia Antipolis - I3S. 2016. <hal-01358064>
  • Frédéric Havet, A. Karolinna Maia de Oliveira, Bojan Mohar. Finding a subdivision of a prescribed digraph of order 4. [Research Report] RR-8773, INRIA. 2015. <hal-01202650>
  • Julio Araujo, Frédéric Havet, Claudia Linhares Sales, Ana Silva. Proper orientation of cacti. [Research Report] RR-8833, INRIA Sophia Antipolis - Méditerranée. 2015, pp.17. <hal-01247014>
  • Frédéric Havet, Bernard Lidicky. Splitting a tournament into two subtournaments with given minimum outdegree. [Research Report] RR-8469, INRIA. 2014. <hal-00943152>
  • Joergen Bang-Jensen, Frédéric Havet, Anders Yeo. The complexity of finding arc-disjoint branching flows. [Research Report] RR-8640, INRIA Sophia Antipolis; INRIA. 2014. <hal-01088664>
  • Frédéric Giroire, Frédéric Havet, Joanna Moulierac. Compressing Two-dimensional Routing Tables with Order. [Research Report] RR-8658, INRIA Sophia Antipolis; INRIA. 2014. <hal-01097910>
  • Julio Araujo, Frédéric Havet, Mathieu Schmitt. Steinberg-like theorems for backbone colouring. [Research Report] RR-8641, INRIA Sophia Antipolis; INRIA. 2014. <hal-01088698>
  • Julio Araujo, Nathann Cohen, Susanna F. De Rezende, Frédéric Havet, Phablo Moura. On the proper orientation number of bipartite graphs. [Research Report] RR-8492, INRIA. 2014, pp.23. <hal-00957453>
  • Frédéric Havet, Ana Karolinna Maia. On disjoint directed cycles with prescribed minimum lengths. [Research Report] RR-8286, INRIA. 2013. <hal-00816135v2>
  • Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant. Complexity Dichotomies for the Minimum F-Overlay Problem. [Research Report] RR-9045, Inria Sophia Antipolis. 2013, pp.16. <hal-01490535>
  • Frédéric Havet, Nagarajan Paramaguru, Rathinaswamy Sampathkumar. Detection number of bipartite graphs and cubic graphs. [Research Report] RR-8115, INRIA. 2012, pp.17. <hal-00744365>
  • Frédéric Havet, Ana Karolinna Maia, Min-Li Yu. Complexity of greedy edge-colouring. [Research Report] RR-8171, INRIA. 2012, pp.13. <hal-00762534>
  • Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia. Finding a subdivision of a digraph. [Research Report] RR-8024, INRIA. 2012. <hal-00720500v2>
  • Frédéric Havet, Andrew King, Mathieu Liedloff, Ioan Todinca. (Circular) backbone colouring: tree backbones in planar graphs. [Research Report] RR-8152, INRIA. 2012. <hal-00759044>
  • Frédéric Havet, Andrew King. List circular backbone colouring. [Research Report] RR-8159, INRIA. 2012. <hal-00759527>
  • Victor Campos, Frédéric Havet, Rudini Sampaio, Ana Silva. Backbone colouring: tree backbones with small diameter in planar graphs. [Research Report] RR-8151, INRIA. 2012. <hal-00758548>
  • Gerard Chang, Frédéric Havet, Mickael Montassier, André Raspaud. Steinberg's Conjecture and near-colorings. [Research Report] RR-7669, INRIA. 2011. <inria-00605810>
  • Victor Campos, Frédéric Havet. 5-choosability of graphs with 2 crossings. [Research Report] RR-7618, INRIA. 2011, pp.22. <inria-00593426>
  • Frédéric Havet, Xuding Zhu. The game Grundy number of graphs. [Research Report] RR-7646, INRIA. 2011. <inria-00600738>
  • Pierre Aboulker, Frédéric Havet, Nicolas Trotignon. On wheel-free graphs. [Research Report] RR-7651, INRIA. 2011. <inria-00602079>
  • Stéphane Bessy, Frédéric Havet. Enumerating the edge-colourings and total colourings of a regular graph. [Research Report] RR-7652, INRIA. 2011. <inria-00602188>
  • Julio Araujo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, et al.. Weighted Improper Colouring. [Research Report] RR-7590, INRIA. 2011, pp.57. <inria-00583036v4>
  • Louigi Addario-Berry, Frédéric Havet, Claudia Linhares Sales, Bruce Reed, Stéphan Thomassé. Oriented trees in digraphs.. [Research Report] RR-7502, INRIA. 2011. <inria-00551133>
  • Nathann Cohen, Frédéric Havet. Linear and 2-frugal choosability of graphs of small maximum average degree. [Research Report] RR-7213, INRIA. 2010. <inria-00459692>
  • Jean-Claude Bermond, Frédéric Havet, Florian Huc, Claudia Linhares Sales. Improper colouring of weighted grid and hexagonal graphs. [Research Report] RR-7250, INRIA. 2010, pp.19. <inria-00472819>
  • Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon. Finding an induced subdivision of a digraph. [Research Report] RR-7430, INRIA. 2010. <inria-00527518>
  • Victor Campos, Andras Gyarfas, Frédéric Havet, Claudia Linhares Sales, Frédéric Maffray. New bounds on the Grundy number of products of graphs. [Research Report] RR-7243, INRIA. 2010. <inria-00470158>
  • Frédéric Havet, Claudia Linhares Sales, Leonardo Sampaio. b-coloring of tight graphs. [Research Report] RR-7241, INRIA. 2010. <inria-00468734v2>
  • Nathann Cohen, Frédéric Havet, Tobias Mueller. Acyclic edge-colouring of planar graphs. [Research Report] RR-6876, INRIA. 2009. <inria-00367394>
  • Frédéric Havet, Stanislav Jendrol', Roman Sotak, Erika Skrabulakova. Facial non-repetitive edge-colouring of plane graphs. [Research Report] RR-6873, INRIA. 2009. <inria-00366589>
  • Julio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet. Good edge-labelling of graphs. [Research Report] RR-6934, INRIA. 2009, pp.16. <inria-00383343v4>
  • Rok Erman, Frédéric Havet, Bernard Lidicky, Ondrej Pangrac. 5-colouring graphs with 4 crossings. [Research Report] RR-7110, INRIA. 2009. <inria-00437726>
  • Nicole Eggemann, Frédéric Havet, Steven Noble. $k$-$L(2,1)$-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. [Research Report] RR-6840, INRIA. 2009. <inria-00360505>
  • Nathann Cohen, Frédéric Havet. Planar graphs with maximum degree Delta\geq 9 are (\Delta+1)-edge-choosable -- short proof. [Research Report] RR-7098, INRIA. 2009. <inria-00432389>
  • Frédéric Havet, Jan Van den Heuvel, Colin Mcdiarmid, Bruce Reed. List colouring squares of planar graphs. [Research Report] RR-6586, INRIA. 2008. <inria-00303303>
  • Frédéric Havet, Martin Klazar, Jan Kratochvil, Dieter Kratsch, Matthieu Liedloff. Exact algorithms for $L(2,1)$-labeling of graphs. [Research Report] RR-6587, INRIA. 2008. <inria-00303330>
  • Marie Aste, Frédéric Havet, Claudia Linhares-Sales. Grundy number and products of graphs. [Research Report] RR-6672, INRIA. 2008. <inria-00328589>
  • Frédéric Havet, Ross Kang, Tobias Müller, Jean-Sébastien Sereni. Circular Choosability. [Research Report] RR-5957, INRIA. 2007, pp.33. <inria-00086981v2>
  • Frédéric Havet, Ross Kang, Jean-Sébastien Sereni. Improper colouring of unit disk graphs. [Research Report] RR-6206, INRIA. 2007, pp.35. <inria-00150464v2>
  • Frédéric Havet, Stéphan Thomassé. Complexity of $(p,1)$-total labelling. [Research Report] RR-6305, INRIA. 2007, pp.22. <inria-00173438v3>
  • Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé. WDM and Directed Star Arboricity. [Research Report] RR-6179, INRIA. 2007, pp.20. <inria-00132396v3>
  • Frédéric Havet, Stéphan Thomassé, Anders Yeo. Hoàng-Reed conjecture holds for tournaments. [Research Report] RR-5976, INRIA. 2006, pp.7. <inria-00091366v2>
  • Frédéric Havet. Choosability of the square of planar subcubic graphs with large girth. [Research Report] RR-5800, INRIA. 2006, pp.17. <inria-00070223>
  • Olivier Delmas, Mickael Montassier, Frédéric Havet, Stéphane Pérennes. Design of fault-tolerant on-board network. [Research Report] RR-5866, INRIA. 2006, pp.20. <inria-00070160>
  • Louigi Addario-Berry, Stéphan Thomassé, Frédéric Havet. Paths with two blocks in $n$-chromatic digraphs. [Research Report] RR-5688, INRIA. 2005, pp.8. <inria-00070325>
  • Frédéric Havet. Repartitors, selectors and superselectors. [Research Report] RR-5686, INRIA. 2005, pp.28. <inria-00070327>
  • Frédéric Havet, Jean-Sébastien Sereni. Improper choosability of graphs and maximum average degree. RR-5164, INRIA. 2004. <inria-00071425>
  • Stéphane Bessy, Etienne Birmelé, Frédéric Havet. Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree. [Research Report] RR-5364, INRIA. 2004, pp.20. <inria-00070639>
  • Jean-Claude Bermond, Frédéric Havet, Csaba Tóth. Fault tolerant on-board networks with priorities. [Research Report] RR-5363, INRIA. 2004, pp.52. <inria-00070640>
  • Frédéric Havet. Upper bound for the span of (s,1)-total labelling of graphs. RR-4816, INRIA. 2003. <inria-00071770>
  • Frédéric Havet. Stable set meeting every longest paths. RR-5009, INRIA. 2003. <inria-00071575>
  • Frédéric Havet, Min-Li Yu. (d,1)-total labelling of graphs. RR-4650, INRIA. 2002. <inria-00071935>
  • Frédéric Havet. Pancyclic arcs and connectivity in tournaments. RR-4378, INRIA. 2002. <inria-00072210>
  • Frédéric Havet. Robustness of a routing tree for the Push Tree Problem. RR-4464, INRIA. 2002. <inria-00072124>
  • Frédéric Havet. Design of fault tolerant on board networks with priorities via selectors. RR-4463, INRIA. 2002. <inria-00072125>
  • Stéphane Bessy, Frédéric Havet, Jérôme Palaysi. Choosability of bipartite graphs with maximum degree $Delta$. RR-4522, INRIA. 2002. <inria-00072066>

Communication dans un congrès16 documents

  • Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse. Subdivisions of oriented cycles in digraphs with large chromatic number. Bordeaux Graph Wokshop 2016, Nov 2016, Bordeaux, France. Proceedings of BGW 216 (Bordeaux Graph Wokshop 2016), pp.85-88, <http://bgw.labri.fr/2016/>. <hal-01411115>
  • Marwane Bouznif, Frédéric Havet, Myriam Preissmann. Minimum-Density Identifying Codes in Square Grids. 11th International Conference, AAIM 2016, Jul 2016, Bergamo, Italy. Springer, 9778, pp.77-88, 2016, Lecture Notes in Computer Science. <10.1007/978-3-319-41168-2_7>. <hal-01346750>
  • Rennan Dantas, Frédéric Havet, Rudini Sampaio. Identifying codes for infinite triangular grids with a finite number of rows. Bordeaux Graph Workshop 2016, Nov 2016, Bordeaux, France. Proceedings of BGW 2016 (Bordeaux Graph Workshop 2016). <hal-01411109>
  • Frédéric Giroire, Frédéric Havet, Joanna Moulierac. Compressing two-dimensional routing tables with order. INOC (International Network Optimization Conference), May 2015, Varsovie, Poland. Elsevier, 52, pp.351-358, 2016, Electronic Notes In Discrete Mathematics. <http://www.inoc2015.pl/>. <hal-01162724>
  • Frédéric Havet, Nicolas Huin, Joanna Moulierac, Khoa Phan. Routage vert et compression de règles SDN. ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France. <hal-01148471>
  • Julio Araujo, Nathann Cohen, Susanna De Rezende, Frédéric Havet, Phablo Moura. On the proper orientation number of bipartite graphs. 9th International colloquium on graph theory and combinatorics, Jun 2014, Grenoble, France. <hal-01076904>
  • Stéphane Bessy, Frédéric Havet. Enumerating the edge-colourings and total colourings of a regular graph. 2012 Workshop on Graph Theory and Combinatorics, Aug 2012, National Sun Yat-sen University, Kaohsiung, Taiwan. 2012, <http://www.math.nsysu.edu.tw/~comb/2012/>. <lirmm-00811571>
  • Frédéric Havet, Jørgen Bang-Jensen, Nicolas Trotignon. Finding an induced subdivision of a digraph. Electronic Notes on Discrete Mathematics. VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011), Apr 2011, Bariloche, Argentina. 37, pp.09--14, 2011. <inria-00638464>
  • Julio Araujo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, et al.. Weighted Improper Colouring. 22th International Workshop, IWOCA 2011, Jul 2011, Victoria, Canada. 2011. <inria-00635882>
  • Frédéric Havet, Leonardo Sampaio. On the Grundy number of a graph. Fifth International Symposium on Parameterized and Exact Computation (IPEC 2010), Dec 2010, Chennai, India. Springer, 6478, pp.170--179, 2010, Parameterized and Exact Computation. <10.1007/978-3-642-17493-3>. <inria-00532906>
  • Frédéric Havet, Claudia Linhares Sales. Combinatória e Problemas em Redes de Telecomunicações. Colloque dÍnformatique: Brésil / INRIA, Coopérations, Avancées et Défis, 2009, Bento Gonçãlves, Brazil. 4p, 2009. <hal-00795280>
  • Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. Spanning galaxies in digraphs. Jaroslav Nešetřil and André Raspaud. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. Elsevier, 34, pp.139-143, 2009, Electronic Notes in Discrete Mathematics. <http://eurocomb09.labri.fr/>. <10.1016/j.endm.2009.07.023>. <lirmm-00433050>
  • Julio Araujo, Nathann Cohen, Frédéric Giroire, Frédéric Havet. Good edge-labelling of graphs. LAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium, Nov 2009, Gramado, Brazil. Elsevier, Volume 35 (1), pp.275-280, 2009, Eletronic Notes in Discrete Mathematics. <10.1016/j.endm.2009.11.045>. <hal-00749194>
  • Frédéric Havet, Bruce Reed, Jean-Sébastien Sereni. L(2,1)-labelling of graphs. ACM-SIAM symposium on Discrete algorithms (SODA 2008), Jan 2008, San Francisco, California, United States. pp.621-630, 2008, <http://portal.acm.org/citation.cfm?id=1347082.1347151>. <inria-00486183>
  • Jean-Claude Bermond, Frédéric Havet, Florian Huc, Claudia Linhares-Sales. Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés. 9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.53-56, 2007. <inria-00176955>
  • Jean-Claude Bermond, Olivier Delmas, Frédéric Havet, Mickael Montassier, Stéphane Pérennes. Réseaux de télécommunication minimaux embarqués tolérants aux pannes. 5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2003), May 2003, France. pp.27--32, 2003. <hal-00307610>

Article dans une revue46 documents

  • J Bang-Jensen, Frédéric Havet, Anders Yeo. The complexity of finding arc-disjoint branching flows. Discrete Applied Mathematics, Elsevier, 2016, 209, pp.16-26. <10.1016/j.dam.2015.10.012>. <hal-01360910>
  • J Bang-Jensen, Frédéric Havet. Finding good 2-partitions of digraphs I. Hereditary properties. Journal of Theoretical Computer Science (TCS), Elsevier, 2016, 636, pp.85-94. <10.1016/j.tcs.2016.05.029>. <hal-01327015>
  • Joergen Bang-Jensen, Nathann Cohen, Frédéric Havet. Finding good 2-partitions of digraphs II. Enumerable properties. Journal of Theoretical Computer Science (TCS), Elsevier, 2016, 640, pp.1-19. <http://www.sciencedirect.com/science/article/pii/S0304397516301815>. <10.1016/j.tcs.2016.05.034>. <hal-01346079>
  • Julio Araujo, Frédéric Havet, Claudia Linhares Sales, Ana Silva. Proper orientation of cacti. Journal of Theoretical Computer Science (TCS), Elsevier, 2016, 639, pp.14-25. <10.1016/j.tcs.2016.05.016>. <hal-01338646>
  • Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia de Oliveira. Finding a subdivision of a digraph. Theoretical Computer Science, Elsevier, 2015, 562, pp.20. <hal-01111374>
  • Olivier Delmas, Frédéric Havet, Mickaël Montassier. Design of fault-tolerant on-board networks with variable switch sizes. Theoretical Computer Science, Elsevier, 2015, 562, pp.15. <hal-01111370>
  • Julio Araujo, Frédéric Havet, Mathieu Schmitt. Steinberg-like theorems for backbone colouring. Electronic Notes in Discrete Mathematics, Elsevier, 2015, LAGOS'15 – VIII Latin-American Algorithms, Graphs and Optimization Symposium, 50, pp.223-229. <hal-01246205>
  • Julio Araujo, Nathann Cohen, Susanna F. De Rezende, Frédéric Havet, Phablo Moura. On the proper orientation number of bipartite graphs. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 566, pp.59-75. <10.1016/j.tcs.2014.11.037>. <hal-01101578>
  • Frédéric Havet, A Karolinna Maia, Min-Li Yu. Complexity of greedy edge-colouring. Journal of the Brazilian Computer Society, Springer Verlag, 2015, 21 (18), <10.1186/s13173-015-0036-x>. <hal-01233312>
  • Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca. (Circular) backbone colouring: forest backbones in planar graphs. Discrete Applied Mathematics, Elsevier, 2014, 169, pp.119-134. <10.1016/j.dam.2014.01.011>. <hal-00957243>
  • Frédéric Havet, Andrew King. List circular backbone colouring. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, 16 (1), pp.89--104. <hal-01179209>
  • Frédéric Havet, Nagarajan Paramaguru, Rathinaswamy Sampathkumar. Detection number of bipartite graphs and cubic graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, 16 (3), pp.333-342. <hal-01110978>
  • Louigi Addario-Berry, Frédéric Havet, Claudia Linhares Sales, Bruce Reed, Stéphan Thomassé. Oriented trees in digraphs. Discrete Mathematics, Elsevier, 2013, 313 (8), pp.967-974. <http://www.sciencedirect.com/science/article/pii/S0012365X13000289>. <10.1016/j.disc.2013.01.011>. <hal-00821609>
  • Frédéric Havet, Leonardo Sampaio. On the Grundy and b-chromatic numbers of a graph. Algorithmica, Springer Verlag, 2013, 65 (4), pp.885-899. <hal-00905927>
  • Sylvain Guillemot, Frédéric Havet, Christophe Paul, Anthony Perez. On the (non-)existence of polynomial kernels for $P_l$-free edge modification problems. Algorithmica, Springer Verlag, 2013, 65 (4), pp.900-926. <hal-00821612>
  • Stéphane Bessy, Frédéric Havet. Enumerating the edge-colourings and total colourings of a regular graph. Journal of Combinatorial Optimization, Springer Verlag, 2013, 25 (4), pp.523-535. <10.1007/s10878-011-9448-5>. <hal-00821598>
  • Frédéric Havet, Xuding Zhu. The game Grundy number of graphs. Journal of Combinatorial Optimization, Springer Verlag, 2013, 25 (4), pp.752-765. <10.1007/s10878-012-9513-8>. <hal-00821597>
  • Victor Campos, Frédéric Havet, Rudini Sampaio, Ana Silva. Backbone colouring: Tree backbones with small diameter in planar graphs. Theoretical Computer Science, Elsevier, 2013, 487, pp.50-64. <http://www.sciencedirect.com/science/article/pii/S0304397513001941>. <10.1016/j.tcs.2013.03.003>. <hal-00821608>
  • Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. The spanning galaxy problem. Discrete Applied Mathematics, Elsevier, 2012, 160 (6), pp.744-754. <hal-00749191>
  • Frédéric Havet, Claudia Linhares Sales, Leonardo Sampaio. b-coloring of tight graphs. Discrete Applied Mathematics, Elsevier, 2012, 160 (18), pp.2709--2715. <hal-00749192>
  • Julio Araujo, Nathann Cohen, Frédéric Giroire, Frédéric Havet. Good edge-labelling of graphs.. Discrete Applied Mathematics, Elsevier, 2012, V Latin American Algorithms, Graphs, and Optimization Symposium -- Gramado, Brazil, 2009, 160 (18), pp.2502-2513. <10.1016/j.dam.2011.07.021>. <inria-00639005>
  • Victor Campos, Andras Gyarfas, Frédéric Havet, Claudia Linhares Sales, Frédéric Maffray. New bounds on the Grundy number of products of graphs. Journal of Graph Theory, Wiley, 2012, 71 (1), pp.78--88. <hal-00749190>
  • Julio Araujo, Jean-Claude Bermond, Frédéric Giroire, Frédéric Havet, Dorian Mazauric, et al.. Weighted improper colouring. Journal of Discrete Algorithms, Elsevier, 2012, 16, pp.53-66. <10.1016/j.jda.2012.07.001>. <hal-00747755>
  • Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon. Finding an induced subdivision of a digraph.. Theoretical Computer Science, Elsevier, 2012, 443, pp.10--24. <hal-00749187>
  • Frédéric Havet, Bruce Reed, Jean-Sébastien Sereni. Griggs and Yeh's Conjecture and L(p,1)-labelings. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2012, 26 (1), pp.145--168. <10.1137/090763998>. <inria-00327909v2>
  • Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller. Acyclic edge-colouring of planar graphs. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2011, 25 (2), pp.436--478. <inria-00638448>
  • Frédéric Havet, Martin Klazar, Jan Kratochvil, Dieter Kratsch, Mathieu Liedloff. Exact Algorithms for L(2,1)-Labeling of Graphs. Algorithmica, Springer Verlag, 2011, 59 (2), pp.169-194. <10.1007/s00453-009-9302-7>. <hal-00460873>
  • Frédéric Havet, Stanislav Jendrol', Roman Sotak, Erika Skrabulakova. Facial non-repetitive edge-colouring of plane graphs. Journal of Graph Theory, Wiley, 2011, 66 (1), pp.38--48. <10.1002/jgt.20488>. <inria-00638439>
  • Nathann Cohen, Frédéric Havet. Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. Graphs and Combinatorics, Springer Verlag, 2011, 27 (6), pp.831--849. <inria-00638460>
  • Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrac. 5-colouring graphs with 4 crossings. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2011, 25 (1), pp.401-422. <10.1137/100784059>. <inria-00638434>
  • Marie Aste, Frédéric Havet, Claudia Linhares Sales. Grundy number and products of graphs. Discrete Mathematics, Elsevier, 2010, 310 (9), pp.1482--1490. <inria-00496038>
  • Nicole Eggemann, Frédéric Havet, Steven Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$.. Discrete Applied Mathematics, Elsevier, 2010, 158 (16), pp.1777-1788. <inria-00534520>
  • Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski. Facial colorings using Hall's Theorem. European Journal of Combinatorics, Elsevier, 2010, 31 (3), pp.1001--1019. <10.1016/j.ejc.2009.10.003>. <hal-00487100>
  • Nathann Cohen, Frédéric Havet. Planar graphs with maximum degree Δ≥9 are (Δ+1)-edge-choosable—A short proof. Contributions to Discrete Mathematics, University of Calgary, 2010, 310 (21), <10.1016/j.disc.2010.07.004>. <hal-01338378>
  • Jean-Claude Bermond, Frédéric Havet, Florian Huc, Claudia Linhares Sales. Improper colouring of weighted grid and hexagonal graphs. Discrete Mathematics, Algorithms and Applications, World Scientific Publishing, 2010, 2 (3), pp.395-411. <10.1142/S1793830910000747>. <inria-00526530>
  • Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé. WDM and Directed Star Arboricity. Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2010, 19, pp.161-182. <lirmm-00512776>
  • Frédéric Havet. Choosability of the square of planar subcubic graphs with large girth. Discrete Mathematics, Elsevier, 2009, 309, pp.3553--3563. <inria-00496423>
  • Frédéric Havet, Stéphan Thomassé. Complexity of $(p,1)$-Total Labelling. Discrete Applied Mathematics, Elsevier, 2009, 157, pp.2859-2870. <lirmm-00432700>
  • Frédéric Havet, Ross Kang, Jean-Sébastien Sereni. Improper Colouring of Unit Disk Graphs. Networks, Wiley, 2009, 54 (3), pp.150--164. <inria-00496436>
  • Frédéric Havet, Ross Kang, Tobias Müller, Jean-Sébastien Sereni. Circular choosability. Journal of Graph Theory, Wiley, 2009, 61 (4), pp.241--270. <10.1002/jgt.20375>. <inria-00496432>
  • Ricardo Correa, Frédéric Havet, Jean-Sébastien Sereni. About a Brooks-type theorem for improper colouring. The Australasian Journal of Combinatorics, 2009, 43, pp.219--230. <inria-00223009v4>
  • Frédéric Havet, Stéphan Thomassé, Anders Yeo. The Hoàng-Reed Conjecture holds for tournaments. Discrete Mathematics, Elsevier, 2008, 308, pp.3412-3415. <10.1016/j.disc.2007.06.033>. <lirmm-00292710>
  • Frédéric Havet, Jean-Sébastien Sereni, Riste Skrekovski. 3-facial colouring of plane graphs. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2008, 22 (1), pp.231--247. <10.1137/060664124>. <inria-00083533v4>
  • Stéphan Thomassé, Frédéric Havet, Louigi Addario-Berry. Paths with two blocks in n-chromatic digraphs. Journal of Combinatorial Theory, Series B, Elsevier, 2007, 97, pp.620-626. <10.1016/j.jctb.2006.10.001>. <lirmm-00197151>
  • Jean-Claude Bermond, Frédéric Havet, C.D. Toth. Fault tolerant on board networks with priorities. Networks, Wiley, 2006, 47 (1), pp.9-25. <inria-00430156>
  • Stéphane Bessy, Etienne Birmele, Frédéric Havet. Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree.. Journal of Graph Theory, Wiley, 2006, 53 (4), pp.315-332. <lirmm-00153978>

Pré-publication, Document de travail1 document

  • Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, et al.. χ-bounded families of oriented graphs. 2016. <hal-01412667>