# Conferences and workshops

*Locating-dominating sets in twin-free graphs.*

SCGT 2015 - 8th Slovenian Conference on Graph Theory (Kranjska Gora, Slovenia), June 2015 [Slides]*Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs.*

WG 2015 - 41st Worksop on graph-theoretic concepts in computer science (München, Germany), June 2015 [Slides]*Location-domination and metric dimension in interval and permutation graphs.*

IPM Conference on Combinatorics and Computing (Tehran, Iran), April 2015 [Slides]*Identification problems in graphs.*

South African Mathematical Society Annual Conference (Johannesburg, South Africa), October 2014 [Slides]*The complexity of homomorphisms of signed graphs.*

SIAM conference on Discrete Mathematcs (Minneapolis, USA), June 2014 [Slides]*The complexity of homomorphisms of signed graphs and signed constraint satisfaction.*

LATIN 2014 - 11th Latin American Theoretical INformatics Symposium (Montevideo, Uruguay), April 2014 [Slides]*The complexity of homomorphisms of signed graphs.*

JGA'13 - Journées Graphes et Algorithmes 2013, LRI (Orsay, France), November 2013 [Résumé | Slides]*Random subgraphs make identification affordable.*

CID 2013 - Colourings, Independence and Domination 2011 - 15th workshop on graph theory (Szklarska Poręba, Poland), September 2013 [Slides]*The complexity of the identifying code problem in restricted graph classes.*

IWOCA 2013 - 24th International Workshop on Combinatorial Algorithms (Rouen, france), July 2013 [Slides]*Bounding K4-minor-free graphs in the homomorphism order.*

BGW 2012 - 1st Bordeaux Graph Workshop (Bordeaux, France), November 2012 [Abstract | Slides]*Some complexity results for identifying codes in graphs.*

JGA'12 - Journées Graphes et Algorithmes 2012, LIMOS (Clermont-Ferrand, France), November 2012 [Résumé | Slides]*On graph identification problems and the special case of identifying vertices using paths.*

IWOCA 2012 - 23rd International Workshop on Combinatorial Algorithms (Krishnankoil, india), July 2012 [Slides]*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é.*

JGA'11 - Journées Graphes et Algorithmes 2011, Laboratoire GAMA (Lyon, France), November 2011 [Résumé | Slides]*Identifying codes in regular graphs.*

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).*

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".*

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.*

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.*

CID 2009 - Colourings, Independence and Domination 2009 - 13th workshop on graph theory (Szklarska Poręba, Poland), September 2009 [Abstract | Slides]

# Seminars

Seminar GOAL, LIRIS (Lyon, France), March 2015 and Seminar ACRO, LIF (Marseille, France), April 2015 and University of Tehran (Iran), April 2015, and Seminar Graphs and Optimisation, LaBRI (Bordeaux, France), September 2015, and Seminario Preguntón, Universidad Nacional Autónoma de México (Juriquilla, Querétaro, México), November 2015 [Slides].*Homomorphism bounds for K4-minor-free graphs.*Seminar of the LIMOS (Clermont-Ferrand, France), January 2015 [Slides] and Department of Mathematics, Tabriz University (Iran), April 2015 and IPM Tehran (Iran), May 2015 [Slides].*Identification problems in graphs.*Seminar Graphs and distributed algorithms, LIAFA (Paris, France), May 2014, and Seminar "Optimisation Combinatoire", LAMSADE, Paris Dauphine, June 2014 [Slides].*Identifying codes and metric dimension on selected graph classes.*Seminar Graphs and Applications, LaBRI (Bordeaux, France), March 2013, and Seminar "Graphes et structures discrètes", LIP, ENS Lyon, May 2013 and Seminar "Optimisation Combinatoire", LAMSADE, Paris Dauphine, June 2013.*The complexity of homomorphisms of signed graphs.*Seminar Combgraph, UPC (Barcelona, Spain), February 2013 [Slides]*Identifying codes in graphs: problems from the other side of the Pyrenees.*Seminar Algorithms and Complexity Theory, TU Berlin (Berlin, Germany), March 2012 [Slides] and Seminar GraphComb, LRI (Orsay, France), May 2012 [Slides]*Identifying codes in graphs of given maximum degree.*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, an illustration of the probabilistic method.*Seminar Foundations of Computing and Discrete Mathematics, Turun Yliopisto (Turku, Finland), August 2011 [Slides]*Bounding the identifying code number of a graph using its degree parameters.*Seminar Combgraph , UPC (Barcelona, Spain), May 2011 [Slides]*Edge-identifying codes.*Seminar Graphs and Applications, LaBRI (Bordeaux, France), April 2011 [Slides]*Bounding the identifying code number of a graph using its degree parameters.*Seminar of the Department of Discrete Mathematics, AGH Kraków (Kraków, Poland), November 2010 [Slides]*On some extremal problems on identifying codes in (di)graphs.*Centre for Computer Science & Information Technology, Calicut University (Kozhikode, Kerala, India), September 2010 [Slides]*On some problems in graph theory: from colourings to vertex identification.*Seminar Graphs and Applications, LaBRI (Bordeaux, France), April 2010 [Slides]*Extremal cardinalities of identifying codes.*Seminar of the Department of Algorithms and System Modelling, Gdańsk University of Technology (Gdańsk, Poland), October 2009 [Slides]*Identifying codes in graphs of maximum degree Delta.*