Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets - Florent Foucaud; Reza Naserasr; Aline Parreau (CoRR, 2010)

On two variations of identifying codes. - Olivier Delmas; Sylvain Gravier; Mickaël Montassier; Aline Parreau (Discret. Math., 2011)

Extremal graphs for the identifying code problem. - Florent Foucaud; Eleonora Guerrini; Matjaz Kovse; Reza Naserasr; Aline Parreau; Petru Valicov (Eur. J. Comb., 2011)

Edge identifying codes. - Florent Foucaud; Sylvain Gravier; Reza Naserasr; Aline Parreau; Petru Valicov (Electron. Notes Discret. Math., 2011)

Codes for locating objects in sensor networks. - Ville Junnila; Tero Laihonen; Aline Parreau (ISIT, 2012)

Locally Identifying Coloring of Graphs. - Louis Esperet; Sylvain Gravier; Mickaël Montassier; Pascal Ochem; Aline Parreau (Electron. J. Comb., 2012)

Locally identifying colourings for graphs with given maximum degree. - Florent Foucaud; Iiro S. Honkala; Tero Laihonen; Aline Parreau; Guillem Perarnau (Discret. Math., 2012)

Locally identifying coloring in bounded expansion classes of graphs. - Daniel Gonçalves 001; Aline Parreau; Alexandre Pinlou (Discret. Appl. Math., 2013)

New results on variants of covering codes in Sierpiński graphs. - Sylvain Gravier; Matjaz Kovse; Michel Mollard; Julien Moncel; Aline Parreau (Des. Codes Cryptogr., 2013)

Acyclic edge-coloring using entropy compression. - Louis Esperet; Aline Parreau (Eur. J. Comb., 2013)

Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy's Theorem on Induced Subsets. - Florent Foucaud; Reza Naserasr; Aline Parreau (Graphs Comb., 2013)

Identifying Codes in Line Graphs. - Florent Foucaud; Sylvain Gravier; Reza Naserasr; Aline Parreau; Petru Valicov (J. Graph Theory, 2013)

Tolerant identification with Euclidean balls. - Ville Junnila; Tero Laihonen; Aline Parreau (Networks, 2013)

An improved lower bound for (1, ≤ 2)-identifying codes in the king grid. - Florent Foucaud; Tero Laihonen; Aline Parreau (Adv. Math. Commun., 2014)

Identification, location-domination and metric dimension on interval and permutation graphs. - Florent Foucaud; George B. Mertzios; Reza Naserasr; Aline Parreau; Petru Valicov (CoRR, 2014)

Identifying codes in vertex-transitive graphs. - Sylvain Gravier; Aline Parreau; Sara Rottey; Leo Storme; Élise Vandomme (CoRR, 2014)

Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. - Florent Foucaud; George B. Mertzios; Reza Naserasr; Aline Parreau; Petru Valicov (WG, 2015)

Identifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs. - Sylvain Gravier; Aline Parreau; Sara Rottey; Leo Storme; Élise Vandomme (Electron. J. Comb., 2015)

A New Approach to the 2-Regularity of the ℓ-Abelian Complexity of 2-Automatic Sequences. - Aline Parreau; Michel Rigo; Eric Rowland; Élise Vandomme (Electron. J. Comb., 2015)

Identifying Codes in Hereditary Classes of Graphs and VC-Dimension. - Nicolas Bousquet 001; Aurélie Lagoutte; Zhentao Li; Aline Parreau; Stéphan Thomassé (SIAM J. Discret. Math., 2015)

Token Jumping in Minor-Closed Classes. - Nicolas Bousquet 001; Arnaud Mary; Aline Parreau (FCT, 2017)

Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity. - Florent Foucaud; George B. Mertzios; Reza Naserasr; Aline Parreau; Petru Valicov (Algorithmica, 2017)

A Vizing-like theorem for union vertex-distinguishing edge coloring. - Nicolas Bousquet 001; Antoine Dailly; Éric Duchêne; Hamamache Kheddouci; Aline Parreau (Discret. Appl. Math., 2017)

Deciding game invariance. - Éric Duchêne; Aline Parreau; Michel Rigo (Inf. Comput., 2017)

Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. - Florent Foucaud; George B. Mertzios; Reza Naserasr; Aline Parreau; Petru Valicov (Theor. Comput. Sci., 2017)

On three domination numbers in block graphs. - Aline Parreau; Annegret Katrin Wagler (CoRR, 2018)

Ice sliding games. - Paul Dorbec; Éric Duchêne; André Fabbri; Julien Moncel; Aline Parreau; Éric Sopena (Int. J. Game Theory, 2018)

Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. - Laurent Beaudou; Peter Dankelmann; Florent Foucaud; Michael A. Henning; Arnaud Mary; Aline Parreau (SIAM J. Discret. Math., 2018)

Octal games on graphs: The game 0.33 on subdivided stars and bistars. - Laurent Beaudou; Pierre Coupechoux; Antoine Dailly; Sylvain Gravier; Julien Moncel; Aline Parreau; Éric Sopena (Theor. Comput. Sci., 2018)

The switch operators and push-the-button games: A sequential compound over rulesets. - Éric Duchêne; Marc Heinrich; Urban Larsson; Aline Parreau (Theor. Comput. Sci., 2018)

Identification of points using disks. - Valentin Gledel; Aline Parreau (Discret. Math., 2019)

Connected Subtraction Games on Subdivided Stars. - Antoine Dailly; Julien Moncel; Aline Parreau (Integers, 2019)

Domination and location in twin-free digraphs. - Florent Foucaud; Shahrzad Heydarshahi; Aline Parreau (Discret. Appl. Math., 2020)

Maker-Breaker domination game. - Éric Duchêne; Valentin Gledel; Aline Parreau; Gabriel Renault (Discret. Math., 2020)

Taking-and-merging games as rewrite games. - Éric Duchêne; Victor Marsault; Aline Parreau; Michel Rigo (Discret. Math. Theor. Comput. Sci., 2020)

Partizan Subtraction Games. - Éric Duchêne; Marc Heinrich; Richard J. Nowakowski; Aline Parreau (CoRR, 2021)

Metric dimension on sparse graphs and its applications to zero forcing sets. - Nicolas Bousquet 001; Quentin Deschamps; Aline Parreau; Ignacio M. Pelayo (CoRR, 2021)

influence: A partizan scoring game on graphs. - Éric Duchêne; Stéphane Gonzalez; Aline Parreau; Eric Rémila; Philippe Solal (Theor. Comput. Sci., 2021)

The neighbour sum distinguishing relaxed edge colouring. - Antoine Dailly; Éric Duchêne; Aline Parreau; Elzbieta Sidorowicz (Appl. Math. Comput., 2022)

Metric Dimension Parameterized by Treewidth in Chordal Graphs. - Nicolas Bousquet 001; Quentin Deschamps; Aline Parreau (WG, 2023)

Locating-dominating sets: From graphs to oriented graphs. - Nicolas Bousquet 001; Quentin Deschamps; Tuomo Lehtilä; Aline Parreau (Discret. Math., 2023)

Locating-dominating sets in local tournaments. - Thomas Bellitto; Caroline Brosse; Benjamin Lévêque; Aline Parreau (Discret. Appl. Math., 2023)

The Maker-Maker domination game in forests. - Éric Duchêne; Arthur Dumas; Nacim Oijid; Aline Parreau; Eric Rémila (Discret. Appl. Math., 2024)

On Three Domination-based Identification Problems in Block Graphs. - Dipayan Chakraborty; Florent Foucaud; Aline Parreau; Annegret Wagler (Fundam. Informaticae, 2024)

Smash and grab: The 0 ⋅ 6 scoring game on graphs. - Éric Duchêne; Valentin Gledel; Sylvain Gravier; Fionn Mc Inerney; Mehdi Mhalla; Aline Parreau (Theor. Comput. Sci., 2024)

Neighbourhood complexity of graphs of bounded twin-width. - Édouard Bonnet; Florent Foucaud; Tuomo Lehtilä; Aline Parreau (Eur. J. Comb., 2024)

Bipartite instances of INFLUENCE. - Éric Duchêne; Nacim Oijid; Aline Parreau (Theor. Comput. Sci., 2024)

Complexity of Maker-Breaker games on edge sets of graphs. - Éric Duchêne; Valentin Gledel; Fionn Mc Inerney; Nicolas Nisse; Nacim Oijid; Aline Parreau; Milos Stojakovic (Discret. Appl. Math., 2025)

Poset positional games. - Guillaume Bagan; Éric Duchêne; Florian Galliot; Valentin Gledel; Mirjana Mikalacki; Nacim Oijid; Aline Parreau; Milos Stojakovic (Discret. Math., 2025)

Partition Strategies for the Maker-Breaker Domination Game. - Guillaume Bagan; Éric Duchêne; Valentin Gledel; Tuomo Lehtilä; Aline Parreau (Algorithmica, 2025)

The Avoider-Enforcer game on hypergraphs of rank 3. - Florian Galliot; Valentin Gledel; Aline Parreau (CoRR, 2025)