Nombre de documents

7

CV de François Dross


Article dans une revue4 documents

  • François Dross, Mickaël Montassier, Alexandre Pinlou. Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. European Journal of Combinatorics, Elsevier, 2017, In press. <lirmm-01430784>
  • François Dross. Fractional Triangle Decompositions in Graphs with Large Minimum Degree. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2016, 30 (1), pp.36-42. <10.1137/15M1014310>. <lirmm-01336680>
  • François Dross, Mickaël Montassier, Alexandre Pinlou. A lower bound on the order of the largest induced forest in planar graphs with high girth. Discrete Applied Mathematics, Elsevier, 2016, To appear. <lirmm-01375448>
  • François Dross, Mickaël Montassier, Alexandre Pinlou. Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Electronic Notes in Discrete Mathematics, Elsevier, 2015, The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, 49, pp.269-275. <10.1016/j.endm.2015.06.037>. <lirmm-01233461>

Communication dans un congrès3 documents

  • Konrad K. Dabrowski, François Dross, Daniël Paulusma. Colouring Diamond-free Graphs. SWAT: Scandinavian Workshops on Algorithm Theory, 2016, Reykjavik, Iceland. 15th Scandinavian Symposium and Workshops on Algorithm Theory, 53, pp.16:1--16:14, 2016, <10.4230/LIPIcs.SWAT.2016.16>. <lirmm-01481433>
  • François Dross, Mickaël Montassier, Alexandre Pinlou. Partitioning sparse graphs into an independent set and a forest of bounded degree. BGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France. 4th International Workshop on graph theory, 2016, <http://bgw.labri.fr/2016/>. <lirmm-01430813>
  • Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma. Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. IWOCA: International Workshop on Combinatorial Algorithms, 2015, Verona, Italy. 26th International Workshop on Combinatorial Algorithms, LNCS (9538), pp.100-111, 2016, Combinatorial Algorithms. <10.1007/978-3-319-29516-9_9>. <lirmm-01481412>