Enumeration of Minimal Dominating Sets and Variants. - Mamadou Moustapha Kanté; Vincent Limouzy; Arnaud Mary; Lhouari Nourine (FCT, 2011)

On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets. - Mamadou Moustapha Kanté; Vincent Limouzy; Arnaud Mary; Lhouari Nourine (ISAAC, 2012)

On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. - Mamadou Moustapha Kanté; Vincent Limouzy; Arnaud Mary; Lhouari Nourine; Takeaki Uno (ISAAC, 2013)

On the Enumeration of Minimal Dominating Sets and Related Notions. - Mamadou Moustapha Kanté; Vincent Limouzy; Arnaud Mary; Lhouari Nourine (SIAM J. Discret. Math., 2014)

Incremental Complexity of a Bi-objective Hypergraph Transversal Problem. - Ricardo Andrade; Etienne Birmelé; Arnaud Mary; Thomas Picchetti; Marie-France Sagot (FCT, 2015)

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. - Mamadou Moustapha Kanté; Vincent Limouzy; Arnaud Mary; Lhouari Nourine; Takeaki Uno (WADS, 2015)

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. - Mamadou Moustapha Kanté; Vincent Limouzy; Arnaud Mary; Lhouari Nourine; Takeaki Uno (WG, 2015)

An average study of hypergraphs and their minimal transversals. - Julien David; Loïck Lhote; Arnaud Mary; François Rioult (Theor. Comput. Sci., 2015)

On Maximal Chain Subgraphs and Covers of Bipartite Graphs. - Tiziana Calamoneri; Mattia Gastaldello; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (IWOCA, 2016)

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

Algorithms for k-meet-semidistributive lattices. - Laurent Beaudou; Arnaud Mary; Lhouari Nourine (Theor. Comput. Sci., 2017)

Reconfiguration of Graphs with Connectivity Constraints. - Nicolas Bousquet 001; Arnaud Mary (WAOA, 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)

The Perfect Matching Reconfiguration Problem. - Marthe Bonamy; Nicolas Bousquet 001; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Arnaud Mary; Moritz Mühlenthaler; Kunihiro Wasa (MFCS, 2019)

WEPA 2016 preface. - Arnaud Mary; Vincent Limouzy; Lhouari Nourine (Discret. Appl. Math., 2019)

Efficient enumeration of solutions produced by closure operations. - Arnaud Mary; Yann Strozecki (Discret. Math. Theor. Comput. Sci., 2019)

Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility. - Tiziana Calamoneri; Mattia Gastaldello; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (Algorithms Mol. Biol., 2020)

MOOMIN - Mathematical explOration of 'Omics data on a MetabolIc Network. - Taneli Pusa; Mariana Galvao Ferrarini; Ricardo Andrade; Arnaud Mary; Alberto Marchetti-Spaccamela; Leen Stougie; Marie-France Sagot (Bioinform., 2020)

Capybara: equivalence ClAss enumeration of coPhylogenY event-BAsed ReconciliAtions. - Yishu Wang 002; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (Bioinform., 2020)

Lazy listing of equivalence classes - A paper on dynamic programming and tropical circuits. - Yishu Wang 002; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (CoRR, 2020)

Efficient enumeration of maximal split subgraphs and sub-cographs and related classes. - Caroline Brosse; Aurélie Lagoutte; Vincent Limouzy; Arnaud Mary; Lucas Pastor (CoRR, 2020)

Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations. - Yishu Wang 002; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (WABI, 2021)

Polynomial Delay Algorithm for Minimal Chordal Completions. - Caroline Brosse; Vincent Limouzy; Arnaud Mary (ICALP, 2022)

Efficiently sparse listing of classes of optimal cophylogeny reconciliations. - Yishu Wang 002; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (Algorithms Mol. Biol., 2022)

CALDERA: finding all significant de Bruijn subgraphs for bacterial GWAS. - Hector Roux de Bézieux; Leandro Lima; Fanny Perraudeau; Arnaud Mary; Sandrine Dudoit; Laurent Jacob (Bioinform., 2022)

A General Framework for Enumerating Equivalence Classes of Solutions. - Yishu Wang 002; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri (Algorithmica, 2023)

Enumeration of minimal transversals of hypergraphs of bounded VC-dimension. - Arnaud Mary (CoRR, 2024)

Complexity and algorithms for Swap median and relation to other consensus problems. - Luís Cunha 001; Thiago Lopes; Arnaud Mary (CoRR, 2024)

Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes. - Caroline Brosse; Aurélie Lagoutte; Vincent Limouzy; Arnaud Mary; Lucas Pastor (Discret. Appl. Math., 2024)

The Tape Reconfiguration Problem and Its Consequences for Dominating Set Reconfiguration. - Nicolas Bousquet 001; Quentin Deschamps; Arnaud Mary; Amer E. Mouawad; Théo Pierron (ESA, 2025)