Presentation
I'm a computer science PhD student at LIRIS (Lyon). I started my PhD in September 2020 under the supervision of Nicolas Bousquet, Hamamache Kheddoucci and Aline Parreau on the subject Combinatorial and Algorithmic aspect of metric dimension in the GOAL team. I am interested in various aspects of graph theory such that combinatorics, parametrized complexity or algoritmiths.
You can contact me by e-mail at the adress quentin.deschamps[at]univ-lyon.fr
Teaching
I give courses about cryptologie and introduction for programmation in python. Here is some content about the cryptologie courses : Cryptologie Material
Talks
Comparison between metric dimension and zero-forcing number
Comparison between metric dimension and zero-forcing number
Oriented Locating-dominating sets: from graphs to oriented graphs
Publications
Pre-publications
Metric dimension on sparse graphs and its applications to zero forcing sets
Nicolas Bousquet, Quentin Deschamps, Aline Parreau, Ignacio M. Pelayo
Arxiv link
Locating-dominating sets: from graphs to oriented graphs
Nicolas Bousquet, Quentin Deschamps, Tuomo Lehtilä, Aline Parreau
Arxiv link
Improved square coloring of planar graphs
Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron
Arxiv link
Strengthening a theorem of Meyniel
Quentin Deschamps, Carl Feghali, František Kardoš, Clément Legrand-Duchesne, Théo Pierron
Arxiv link
Square coloring planar graphs with automatic discharging
Nicolas Bousquet, Lucas de Meyer, Quentin Deschamps, Théo Pierron
Arxiv link
Partitioning into degenerate graphs in linear time
Timothée Corsini, Quentin Deschamps, Carl Feghali, Daniel Gonçalves, Hélène Langlois, Alexandre Talon
Arxiv link
