FlorentFoucaud

PhD Student, LaBRI

  • Home
  • Research
  • Teaching
  • Links

Publications

Published or accepted journal papers

  • Identifying codes in line graphs. With Sylvain Gravier, Reza Naserasr, Aline Parreau and Petru Valicov. Provisionally accepted in Journal of Graph Theory, 2012. [arXiv | Manuscript]
  • Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets. With Reza Naserasr and Aline Parreau. To appear in Graphs and Combinatorics, 2012. [DOI | arXiv | Manuscript]
  • Bounds on the size of identifying codes in triangle-free graphs. With Ralf Klasing, Adrian Kosowski and André Raspaud. Discrete Applied Mathematics 160(10-11):1532-1546, 2012. [DOI | arXiv | Manuscript]
  • Locally identifying colourings for graphs with given maximum degree. With Iiro Honkala, Tero Laihonen, Aline Parreau and Guillem Perarnau. Discrete Mathematics 312(10):1832-1837, 2012. [DOI | arXiv | Manuscript]
  • Bounds on identifying codes in terms of degree parameters. With Guillem Perarnau. The Electronic Journal of Combinatorics 19:P32, 2012. [www | arXiv | Manuscript]
  • Extremal graphs for the identifying code problem. With Eleonora Guerrini, Matjaž Kovše, Reza Naserasr, Aline Parreau and Petru Valicov. European Journal of Combinatorics 32(4):628-638, 2011. [DOI | arXiv | Manuscript | BIBTEX]

Published or accepted conference papers with refereed proceedings

  • On graph identification problems and the special case of identifying vertices using paths. With Matjaž Kovše. Accepted at the International Workshop on Combinatorial Algorithms, IWOCA 2012 (with upcoming LNCS post-conference proceedings).
  • Edge identifying codes (identifying codes in line graphs). With Sylvain Gravier, Reza Naserasr, Aline Parreau and Petru Valicov. Electronic Notes in Discrete Mathematics 38:343-348, 2011. Proceedings of the Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011. [DOI]

Submitted preprints

  • On the length of the longest path in partitionable balloons. With Olivier Baudon, Julien Bensmail and Monika Pilśniak, 2012+. Submitted. [HAL]
  • An improved lower bound for (1,<=2)-identifying codes in the king grid. With Tero Laihonen and Aline Parreau, 2011+. Submitted. [arXiv | Manuscript]

Master Thesis

  • Identifying codes in special graph classes. Les codes identifiants dans certaines classes de graphes. Master thesis, Université Bordeaux 1, June 2009. Under the supervision of Ralf Klasing and André Raspaud [DOWNLOAD]

Talks

Conferences and workshops

  • Identifying codes in graphs of given maximum degree.
    BWIC 2011 - Bordeaux Workshop on Identifying Codes (Bordeaux, France), November 2011 [Slides]
  • Les codes identifiants dans les graphes de degré maximum donné. Joint work with Guillem Perarnau.
    JGA'11 - Journées Graphes et Algorithmes 2011, Laboratoire GAMA (Lyon, France), November 2011 [Résumé | Slides]
  • Identifying codes in regular graphs. Joint work with Guillem Perarnau.
    CID 2011 - Colourings, Independence and Domination 2011 - 14th workshop on graph theory (Szklarska Poręba, Poland), September 2011 [Abstract | Slides]
  • Edge-identifying codes (identifying codes in line graphs). Joint work with Sylvain Gravier, Reza Naserasr, Aline Parreau and Petru Valicov.
    EUROCOMB'11 - European Conference on Combinatorics, Graph Theory and Applications 2011, (Budapest, Hungary), August-September 2011 [DOI | Abstract | Slides]
  • On identifying codes and Bondy's theorem on "induced subsets". Joint work with Reza Naserasr and Aline Parreau.
    8FCC - 8th French combinatorial conference, LRI (Orsay, France), June 2010 [Abstract | Slides]
  • Bornes pour la taille de codes identifiants dans les graphes de degré maximum Delta. Joint work with Ralf Klasing, Adrian Kosowski and André Raspaud.
    JGA'09 - Journées Graphes et Algorithmes 2009, LIRMM (Montpellier, France), November 2009 [Résumé | Slides]
  • Bounds on the size of identifying codes for graphs of maximum degree Delta. Joint work with Ralf Klasing, Adrian Kosowski and André Raspaud.
    CID 2009 - Colourings, Independence and Domination 2009 - 13th workshop on graph theory (Szklarska Poręba, Poland), September 2009 [Abstract | Slides]

Seminars

  • Identifying codes in graphs of given maximum degree. Seminar of the Algorithms and Complexity Theory team, TU Berlin (Berlin, Germany), March 2012 [Slides]
  • Bounding the identifying code number of a graph using its degree parameters, an illustration of the probabilistic method. Seminar Probabilities and Computer Science, LaBRI (Bordeaux, France), January 2012 [Slides part 1 | Slides Part 2]
  • Bounding the identifying code number of a graph using its degree parameters. Seminar of the Foundations of Computing and Discrete Mathematics team, Turun Yliopisto (Turku, Finland), August 2011 [Slides]
  • Edge-identifying codes. Seminar of the Combgraph team, UPC (Barcelona, Spain), May 2011 [Slides]
  • Bounding the identifying code number of a graph using its degree parameters. Seminar of the Graphs and Applications team, LaBRI (Bordeaux, France), April 2011 [Slides]
  • On some extremal problems on identifying codes in (di)graphs. Seminar of the Department of Discrete Mathematics, AGH Kraków (Kraków, Poland), November 2010 [Slides]
  • On some problems in graph theory: from colourings to vertex identification. Centre for Computer Science & Information Technology, Calicut University (Kozhikode, Kerala, India), September 2010 [Slides]
  • Extremal cardinalities of identifying codes. Seminar of the Graphs and Applications team, LaBRI (Bordeaux, France), April 2010 [Slides]
  • Identifying codes in graphs of maximum degree Delta. Seminar of the Department of Algorithms and System Modelling, Gdańsk University of Technology (Gdańsk, Poland), October 2009 [Slides]




© copyleft 2010 Florent Foucaud. Template by styleshout