Arnaud Mary

According to our database, Arnaud Mary authored at least 29 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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., March, 2024

Complexity and algorithms for Swap median and relation to other consensus problems.

Luís Cunha, Thiago Lopes, Arnaud Mary

CoRR, 2024

Enumeration of minimal transversals of hypergraphs of bounded VC-dimension.

Arnaud Mary

CoRR, 2024

2023

A General Framework for Enumerating Equivalence Classes of Solutions.

Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri

Algorithmica, October, 2023

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

Efficiently sparse listing of classes of optimal cophylogeny reconciliations.

Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri

Algorithms Mol. Biol., 2022

Polynomial Delay Algorithm for Minimal Chordal Completions.

Caroline Brosse, Vincent Limouzy, Arnaud Mary

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations.

Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri

Proceedings of the 21st International Workshop on Algorithms in Bioinformatics, 2021

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

Lazy listing of equivalence classes - A paper on dynamic programming and tropical circuits.

Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri

CoRR, 2020

Capybara: equivalence ClAss enumeration of coPhylogenY event-BAsed ReconciliAtions.

Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri

Bioinform., 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

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

2019

Efficient enumeration of solutions produced by closure operations.

Arnaud Mary, Yann Strozecki

Discret. Math. Theor. Comput. Sci., 2019

WEPA 2016 preface.

Arnaud Mary, Vincent Limouzy, Lhouari Nourine

Discret. Appl. Math., 2019

The Perfect Matching Reconfiguration Problem.

Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

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

Reconfiguration of Graphs with Connectivity Constraints.

Nicolas Bousquet, Arnaud Mary

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

2017

Algorithms for k-meet-semidistributive lattices.

Laurent Beaudou, Arnaud Mary, Lhouari Nourine

Theor. Comput. Sci., 2017

Token Jumping in Minor-Closed Classes.

Nicolas Bousquet, Arnaud Mary, Aline Parreau

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016

On Maximal Chain Subgraphs and Covers of Bipartite Graphs.

Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015

An average study of hypergraphs and their minimal transversals.

Julien David, Loïck Lhote, Arnaud Mary, François Rioult

Theor. Comput. Sci., 2015

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs.

Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs.

Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Incremental Complexity of a Bi-objective Hypergraph Transversal Problem.

Ricardo Andrade, Etienne Birmelé, Arnaud Mary, Thomas Picchetti, Marie-France Sagot

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014

On the Enumeration of Minimal Dominating Sets and Related Notions.

Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine

SIAM J. Discret. Math., 2014

2013

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

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

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

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011

Enumeration of Minimal Dominating Sets and Variants.

Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011