Talks by members of the project, sorted by date (newest first)

2011

  • Tolerant identification using Euclidean balls
    A. Parreau - BWIC 2011 - Bordeaux Workshop on Identifying Codes (Bordeaux, France), November 2011
  • Identifying codes in line graphs
    P. Valicov - BWIC 2011 - Bordeaux Workshop on Identifying Codes (Bordeaux, France), November 2011
  • Identifying codes in graphs of given maximum degree
    F. Foucaud - BWIC 2011 - Bordeaux Workshop on Identifying Codes (Bordeaux, France), November 2011
  • Identification of vertices using paths
    M. Kovse - BWIC 2011 - Bordeaux Workshop on Identifying Codes (Bordeaux, France), November 2011
  • Extremal oriented graphs for identifying codes
    R. Naserasr - BWIC 2011 - Bordeaux Workshop on Identifying Codes (Bordeaux, France), November 2011
  • Locally identifying colourings of graphs
    A. Parreau - BWIC 2011 - Bordeaux Workshop on Identifying Codes (Bordeaux, France), November 2011
  • Codes identifiants tolérants utilisant des boules euclidiennes
    V. Junnila, A. Parreau, T. Laihonen - Journées Graphes et Algorithmes 2011 (Lyon, France), November 2011
  • Codes identifiants dans les graphes adjoints
    F. Foucaud, S. Gravier, R. Naserasr, A. Parreau, P. Valicov - Journées Graphes et Algorithmes 2011 (Lyon, France), November 2011
  • Les codes identifiants dans les graphes de degré maximum donné
    F. Foucaud, G. Perarnau - Journées Graphes et Algorithmes 2011 (Lyon, France), November 2011
  • Perfect codes in generalized Sierpinski graphs
    S. Gravier, M. Kovse, A. Parreau - Colourings, Independence and Domination 2011 - 14th workshop on graph theory (Szklarska Poręba, Poland), September 2011
  • Edge identifying codes
    F. Foucaud, S. Gravier, R. Naserasr, A. Parreau, P. Valicov - Colourings, Independence and Domination 2011 - 14th workshop on graph theory (Szklarska Poręba, Poland), September 2011
  • Identifying codes in regular graphs
    F. Foucaud, G. Perarnau - Colourings, Independence and Domination 2011 - 14th workshop on graph theory (Szklarska Poręba, Poland), September 2011
  • Edge identifying codes
    F. Foucaud, S. Gravier, R. Naserasr, A. Parreau, P. Valicov, EUROCOMB'11, August-September 2011, Budapest, Hungary.
  • Bounding the identifying code number of a graph using its degree parameters
    F. Foucaud, talk at the seminar of the Foundations of Computing and Discrete Mathematics team, Turun Yliopisto (Turku, Finland), August 2011
  • Network Verification via Routing Table Queries
    E. Bampas, D. Bilo, G. Drovandi, L. Gualà, R. Klasing and G. Proietti. 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2011), June 26-29, 2011, Gdansk, Poland.
  • Edge identifying codes
    F. Foucaud, talk at the seminar of CombGraph team, UPC (Barcelona, Spain), May 2011
  • Bounds on identifying codes in terms of degree parameters
    F. Foucaud, talk at the seminar of the Graphs and Applications team, LaBRI (Bordeaux, France), April 2011
  • Locally identifying coloring of graphs
    A. Parreau, talk at the University of Turku (Turku, Finland), March 2011

2010

  • Itération fractale de graphes
    S. Gravier, M. Kovse et A. Parreau, talk at JGA'10 - Journées Graphes et Algorithmes 2010, LIRMM (Marseille, France), November 2010
  • On some extremal problems on identifying codes in (di)graphs
    F. Foucaud, talk at the seminar of the Department of Discrete Mathematics, AGH Kraków (Kraków, Poland), November 2010
  • Computing identifying codes in chosen graph classes and dynamic scenarios
    F. Foucaud, R. Klasing, A. Kosowski, A. Raspaud, talk at session "Graphs & Applications", 24th European Conference on Operational Research (EURO XXIV), Lisbon, July 2010.
  • On the identification of vertices in graphs using paths
    F. Foucaud, M. Kovše, talk at 8FCC - 8th French combinatorial conference, LRI (Orsay, France), June 2010
  • Locally identifying coloring of graphs
    L. Esperet, S. Gravier, M. Montassier, P. Ochem and A. Parreau, talk at 8FCC - 8th French combinatorial conference, LRI (Orsay, France), June 2010
  • Classifying graphs with minimum identifying code of size n-1
    F. Foucaud, E. Guerrini, M. Kovše, R. Naserasr, A. Parreau and P. Valicov, talk at 8FCC - 8th French combinatorial conference, LRI (Orsay, France), June 2010
  • On identifying codes and Bondy's theorem on "induced subsets"
    F. Foucaud, E. Guerrini, M. Kovše, R. Naserasr, A. Parreau and P. Valicov, talk at 8FCC - 8th French combinatorial conference, LRI (Orsay, France), June 2010
  • Identifier les sommets d'un graphe avec des couleurs
    A. Parreau, talk at the seminar of the LIMD team of LAMA (Chambéry, France), May 2010
  • Extremal cardinalities of identifying codes
    F. Foucaud, talk at the seminar of the Graphs and Applications team, LaBRI (Bordeaux, France), April 2010
  • Polynomial ideals and codes
    E. Guerrini, talk at the seminar of the LIP6 (Paris, France), March 2010
  • Some variations of identifying codes
    O. Delmas, talk at the seminar of the Graphs and Applications team, LaBRI (Bordeaux, France), March 2010

2009

  • Deux variantes autour des codes identifiants
    O. Delmas, S. Gravier, M. Montassier and A. Parreau. talk at JGA'09 - Journées Graphes et Algorithmes 2009, LIRMM (Montpellier, France), November 2009
  • Bornes pour la taille de codes identifiants dans les graphes de degré maximum Delta
    F. Foucaud, R. Klasing, A. Kosowski and A. Raspaud. talk at JGA'09 - Journées Graphes et Algorithmes 2009, LIRMM (Montpellier, France), November 2009
  • Identifying codes in graphs of maximum degree Delta
    F. Foucaud, talk at the seminar of the Department of Algorithms and System Modelling, Gdańsk University of Technology (Gdańsk, Poland), October 2009
  • Bounds on the size of identifying codes for graphs of maximum degree Delta
    F. Foucaud, R. Klasing, A. Kosowski and A. Raspaud. talk at CID 2009 - Colourings, Independence and Domination 2009 - 13th workshop on graph theory (Szklarska Poręba, Poland), September 2009


The project?

Meetings

Notices

edit SideBar