( en | de | ru )

 

Disambiguation of "Mary, Arnaud"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes.

, , , , and . Discret. Appl. Math., (March 2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Georg Mary

Thomas Marycz

Melanie Marysko

Boris Maryasin

Johannes Maryska

 

Other publications of authors with the same name

WEPA 2016 preface., , and . Discret. Appl. Math., (2019)Efficiently sparse listing of classes of optimal cophylogeny reconciliations., , , and . Algorithms Mol. Biol., 17 (1): 2 (2022)A General Framework for Enumerating Equivalence Classes of Solutions., , , and . ESA, volume 204 of LIPIcs, page 80:1-80:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Efficient enumeration of solutions produced by closure operations., and . CoRR, (2015)On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets., , , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 289-298. Springer, (2012)On the Enumeration of Minimal Dominating Sets and Related Notions., , , and . SIAM J. Discret. Math., 28 (4): 1916-1929 (2014)Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs., , , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 446-457. Springer, (2015)Efficient enumeration of maximal split subgraphs and sub-cographs and related classes., , , , and . CoRR, (2020)A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs., , , , and . CoRR, (2014)Efficient enumeration of solutions produced by closure operations., and . Discret. Math. Theor. Comput. Sci., (2019)