Publications

Published papers in international journals

• Smash and Grab: the 0.6 Scoring Game on Graphs With Eric Duchene , Valentin Gledel, Sylvain Gravier , Fionn Mc Inerney and Mehdi Mhalla.
  Theoretical Computer Science, Vol. 990, 2024. [HAL| DOI]
• Locating Dominating Sets in local tournaments. With Thomas Bellitto, Caroline Brosse and Benjamin Lévêque.
  Discrete Applied Mathematics, Vol. 337, 2023. [arXiv|web]
• Locating-dominating sets: from graphs to oriented graphs. With Nicolas Bousquet , Quentin Deschamps and Tuomo Lehtilä.
  Discrete Mathematics, 346(1), 2023. [HAL|web]
• The neighbour-sum-distinguishing relaxed edge colouring. With Antoine Dailly, Eric Duchêne et Elzbieta Sidorowicz.
  Applied Mathematics and Computation, 419, 2022. [ HAL | web ]
• Influence, a partizan scoring game on graphs. With Eric Duchene , Stéphane Gonzalez , Eric Remila and Philippe Solal.
  Theoritical Computer Science, 2021, 878–879. [Arxiv|web]
• Taking and merging games as rewrite games With Eric Duchêne, Victor Marsault and Michel Rigo.
  Discrete Mathematics and Theoretical Computer Science, DMTCS, 2020, 22 (4).[ Arxiv]
• Maker-Breaker domination game. With Eric Duchêne, Valentin Gledel and Gabriel Renault .
  Discrete Mathematics, 343(19), 2020. [ Arxiv|web].
• Domination and location in twin-free digraphs. With Florent Foucaud and Shahrzad Heydarshahi.
  Discrete Applied Mathermatics , 284, 2020. [Arxiv|web]
• Connected Subtraction Games on Subdivided Stars. With Antoine Dailly and Julien Moncel.
  Integers : Electronic Journal of Combinatorial Number Theory, 19, 2019.[Arxiv|Web]
• Identification of points using disks. With Valentin Gledel .
  Discrete Mathematics, 342(1), 256-269, 2019. [Arxiv| web]
• Octal Games on Graphs: The game 0.33 on subdivided stars and bistars. With Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel and Eric Sopena.
  Theoritical Computer Science, 746, 19--35, 2018. [Arxiv| web ]
• Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension. With Laurent Beaudou, Florent Foucaud, Peter Dankelmann, Michael A. Henning and Arnaud Mary.
  SIAM Journal of Discrete Mathematics, 32(2), 902--918, 2018. [Arxiv|web]
• Ice Sliding Games. With Paul Dorbec, Eric Duchêne, André Fabbri, Julien Moncel and Eric Sopena.
  Internationational Journal of Game Theory, 47(2), 487--508, 2018. [ Arxiv | web ]
• The switch operators and push-the-button games: a sequential compound over rulesets. With Eric Duchene, Marc Heinrich and Urban Larsson.
  Theoritical Computer Science, 715, 71--85, 2018. [Arxiv|web]
• A Vizing-like theorem for union vertex-distinguishing edge coloring. With Nicolas Bousquet, Antoine Dailly, Eric Duchêne and Hamamache Kheddouci.
  Discrete Applied Mathematics , 232, 88--98, 2017. [ Arxiv|web]
• Deciding game invariance. With Eric Duchêne and Michel Rigo.
  Information and Computation , 253(1),127--142, 2017. [ Arxiv | BIBTEX |DOI]
• Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. With Florent Foucaud, George Mertzios , Reza Naserasr and Petru Valicov.
  Theoretical Computer Science , 668, 43--58, 2017. [Arxiv|DOI]
• Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity. With Florent Foucaud, George Mertzios , Reza Naserasr and Petru Valicov.
  Algorithmica , 78(3), 914--944, 2017. [Arxiv|DOI]
• Identifying codes in hereditary classes of graphs and VC-dimension. With Nicolas Bousquet, Aurélie Lagoutte , Zhentao Li and Stéphan Thomassé.
  SIAM Journal of Discrete Mathematics, 29(4), 2015. [ Arxiv | BIBTEX | DOI ]
• Identifying codes in vertex-transitive graphs and strongly regular graphs. With Sylvain Gravier, Sara Rottey, Leo Storme and Elise Vandomme.
  Electronic Journal of Combinatorics, 22(4), 2015. [PDF | BIBTEX]
• A new approach to the 2-regularity of the l-abelian complexity of 2-automatic sequences. With Michel Rigo, Eric Rowland and Elise Vandomme.
  Electronic Journal of Combinatorics, 22(1), 2015. [PDF|BIBTEX]
• An improved lower bound for (1,<=2)-identifying codes in the king grid. With Florent Foucaud and Tero Laihonen .
  Advances in Mathematics of Communications, 8(1), 35--52, 2014. [Arxiv |DOI| BIBTEX]
• Locally identifying coloring in bounded expansion classes of graphs. With Daniel Gonçalves and Alexandre Pinlou.
  Discrete Applied Mathematics,161(18), 2013. [Arxiv |DOI | BIBTEX]
• Acyclic edge-coloring using entropy compression. With Louis Esperet.
  European Journal of Combinatorics , 34(6), 2013. [Arxiv | DOI | BIBTEX]
• Identifying codes in line graphs. With Florent Foucaud, Sylvain Gravier, Reza Naserasr, and Petru Valicov.
  Journal of Graph Theory, 73(4), 2013. [Arxiv | DOI| BIBTEX]
• New results on variants of covering codes in Sierpinski graphs. With Sylvain Gravier, Matjaz Kovse, Michel Mollard and Julien Moncel.
  Designs, Codes and Cryptography, 69(2), 2013. [ArXiv | DOI| BIBTEX]
• Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy s Theorem on Induced Subsets. With Florent Foucaud and Reza Naserasr.
  Graphs and Combinatorics, 29(3), 463-473, 2013. [Arxiv | DOI |BIBTEX]
• Tolerant identification with Euclidean balls. With Ville Junnila and Tero Laihonen .
  Networks , 1097-0037, 2012. [Arxiv |DOI |BIBTEX]
• Locally identifying coloring of graphs. With Louis Esperet, Sylvain Gravier, Mickaël Montassier and Pascal Ochem .
  Electronic Journal of Combinatorics, 19(2), 2012. [PDF| BIBTEX]
• Locally identifying colouring of graphs with given maximum degree. With Florent Foucaud, Iiro Honkala , Tero Laihonen and Guillem Perarnau
  Discrete Mathematics , 312(10), 2012. [Arxiv |DOI| BIBTEX]
• On two variations of identifying code. With Olivier Delmas, Sylvain Gravier and Mickaël Montassier.
  Discrete Mathematics, 311 (17) 2011. [Arxiv | DOI | BIBTEX]
• Extremal graphs for the identifying code problem. With Florent Foucaud, Eleonora Guerrini, Matjaž Kovše, Reza Naserasr and Petru Valicov.
  European Journal of Combinatorics, 32(4), 2011. [Arxiv | DOI | BIBTEX]

Published papers in proceedings of conferences

• On the cycle rank conjecture about metric dimension and zero forcing number in graphs, Avec Nicolas Bousquet, Ignacio Pelayo et Quentin Deschamps.
  In: Nešetřil J., Perarnau G., Rué J., Serra O. (eds) Extended Abstracts EuroComb 2021. Trends in Mathematics, vol 14. Birkhäuser, Cham. 2021.
• Token Jumping in minor-closed classes. With Nicolas Bousquet and Arnaud Mary.
  To appear in FCT'17. [ Arxiv]
• Algorithms and Complexity for Metric Dimension and Location-Domination on Interval and Permutation Graphs. With Florent Foucaud, George Mertzios , Reza Naserasr and Petru Valicov.
  Proceedings of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Lecture Notes in Computer Science 9224:456-471, 2016.
• Codes for Locating Objects in Sensor Networks. With Ville Junnila and Tero Laihonen.
  Proceedings of the 2012 IEEE International Symposium on Information Theory (ISIT 2012)
• Edges identifying codes. With Florent Foucaud, Sylvain Gravier, Reza Naserasr, and Petru Valicov. Electronic Notes in Discrete Mathematics, 38(1), 2011. Proceedings of the Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011.

Submitted Papers

Research reports

• On powers of interval graphs and their orders. With Florent Foucaud, Reza Naserasr and Petru Valicov. [ArXiv]
• Problèmes d'identification dans les graphes.
  Ph.D. thesis, doctoral school EDMSTII, Université de Grenoble, July 2012. Under the supervision of Sylvain Gravier [PDF]
• Arbres couvrants dans les grilles.
  Master thesis, Master ROCO, Université Joseph Fourier, Grenoble, June 2009. Under the supervision of Sylvain Gravier [PDF]
• Hamiltonicité dans une grille, un jeu d'enfant ?
  Licence thesis, ENS Lyon, July 2007. Under the supervision of Sylvain Gravier.