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.

[BibT_eX]

[DOI]

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

2020

Efficient enumeration of maximal split subgraphs and sub-cographs and related classes.

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

Bioinform., 2020

MOOMIN - Mathematical explOration of 'Omics data on a MetabolIc Network.

[BibT_eX]

[DOI]

Taneli Pusa

Mariana Galvao Ferrarini

Ricardo Andrade

Alberto Marchetti-Spaccamela

Leen Stougie

Marie-France Sagot

Bioinform., 2020

Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2020

2019

Efficient enumeration of solutions produced by closure operations.

[BibT_eX]

[DOI]

Yann Strozecki

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

WEPA 2016 preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

The Perfect Matching Reconfiguration Problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Reconfiguration of Graphs with Connectivity Constraints.

[BibT_eX]

[DOI]

Nicolas Bousquet

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

2017

Algorithms for k-meet-semidistributive lattices.

[BibT_eX]

[DOI]

Laurent Beaudou

Theor. Comput. Sci., 2017

Token Jumping in Minor-Closed Classes.

[BibT_eX]

[DOI]

Nicolas Bousquet

Aline Parreau

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

2016

On Maximal Chain Subgraphs and Covers of Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

2015

An average study of hypergraphs and their minimal transversals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Incremental Complexity of a Bi-objective Hypergraph Transversal Problem.

[BibT_eX]

[DOI]

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

2014

On the Enumeration of Minimal Dominating Sets and Related Notions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

2013

On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

2011

Enumeration of Minimal Dominating Sets and Variants.

[BibT_eX]

[DOI]