Projective Plane

Talks at Conferences and Seminars



  • Mathematics, Statistics and Computer Science Seminar (mini-symposium), St Francis Xavier University, Antigonish (Nova Scotia), Canada, May 29, 2017, talk "Bounds and heuristics for limited packings in graphs"


  • Discrete Mathematics and Data Science Seminar, School of Mathematics, Cardiff University, Cardiff, UK, 17 March, 2017, talk "The bondage number of graphs on topological surfaces and Teschner's conjecture"


  • Data and Knowledge Engineering Seminar, School of Computer Science and Informatics, Cardiff University, Cardiff, UK, 21 November, 2016, talk "Fixed-parameter tractable algorithms for the workflow satisfiability problem with user independent constraints"


  • 9th International Frontiers in Algorithmics Workshop FAW 2015, Guilin, China, July 3-5, 2015, talk "Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints"


  • 9th International Colloquium on Graph Theory and Combinatorics ICGT 2014, Grenoble, France, June 30 - July 4, 2014, talk "Bounds and algorithms for limited packings in graphs"


  • Canadian Mathematical Society Summer Meeting 2014, Winnipeg (Manitoba), Canada, June 6-9, 2014, session Graphs and Hypergraphs, talk "The bondage number of graphs on topological surfaces and Teschner's conjecture" (invited)


  • Pure Mathematics Seminar, Royal Holloway, University of London, Egham, UK, 26 November, 2013, talk "The bondage number of graphs on topological surfaces and Teschner's conjecture"


  • 24th British Combinatorial Conference BCC24, Egham, England, 30 June - 5 July, 2013, talk "Embedding graphs containing K5-subdivisions on the torus"


  • Graphs and Games Seminar, Dalhousie University, Halifax (Nova Scotia), Canada, December 7, 2011, talk "Randomized algorithms and upper bounds for multiple domination in graphs and networks"


  • Department of Mathematics and Statistics Seminar, Acadia University, Wolfville (Nova Scotia), Canada, November 18, 2011, talk "Randomized algorithms and upper bounds for multiple domination in graphs and networks"


  • 7th East Coast Combinatorics Conference ECCC 2011, Acadia University, Wolfville (Nova Scotia), Canada, May 4-6, 2011, talk "Upper bounds for the bondage number of graphs on topological surfaces"


  • 4th East Coast Combinatorics Conference ECCC 2008, St Francis Xavier University, Antigonish (Nova Scotia), Canada, May 1-2, 2008, talk "Upper bounds for the alpha-domination number"


  • Computer Science Seminar, Acadia University, Wolfville (Nova Scotia), Canada, February 2, 2007, talk "Toroidal and projective-planar graphs avoiding K3,3's: detection algorithms and structure"


  • Séminaire départemental, Département d'Informatique, UQAM, Montréal (Québec), Canada, 8 mars 2006, l'exposé "Méthodes de correction des erreurs systématiques et d'amélioration du choix des éléments actifs pour la recherche de médicaments"


  • 7th International Colloquium on Graph Theory ICGT'05, Hyères, France, 12 - 16 September, 2005, talk "Forbidden minors and subdivisions for toroidal graphs with no K3,3's"


  • 20th British Combinatorial Conference BCC20, Durham, England, 11 - 15 July, 2005, talk "Structure and enumeration of toroidal and projective-planar graphs with no K3,3's"


  • 12èmes Rencontres de la Société Francophone de Classification SFC'05, Montréal (Québec), Canada, 30 mai - 1er juin 2005, l'exposé "Une classification des graphes sans K3,3 plongeables sur le plan projectif ou sur le tore"


  • Séminaire de Combinatoire et d'Informatique Mathématique, LaCIM, UQAM, Montréal (Québec), Canada, 25 février 2005, l'exposé "Structure et dénombrement des graphes toroïdaux sans K3,3"


  • Séminaire de Combinatoire et d'Informatique Mathématique, LaCIM, UQAM, Montréal (Québec), Canada, 22 octobre 2004, l'exposé "Dénombrement des graphes projectifs-planaires étiquetés sans subdivision de K3,3"


  • Combinatorial Algorithms Group Seminar, CAG, University of Victoria, Victoria (British Columbia), Canada, June 23, 2004, talk "Projective-planar and toroidal graphs avoiding K3,3-subdivisions: detection, forbidden minors and enumeration"


  • 19th British Combinatorial Conference BCC19, Bangor, Wales, 29 June - 4 July, 2003, talk "How to detect a projective planar or toroidal graph"


  • Combinatorics and Theoretical Computer Science Seminar, LaCIM, UQAM, Montreal (Quebec), Canada, May 2, 2003, talk "Embedding graphs containing K5-subdivisions"