arnaud mary
arnaud mary
maitre de conférences, LBBE, Université de Lyon
No verified email - Homepage
Title
Cited by
Cited by
Year
On the enumeration of minimal dominating sets and related notions
MM Kanté, V Limouzy, A Mary, L Nourine
SIAM Journal on Discrete Mathematics 28 (4), 1916-1929, 2014
742014
Enumeration of minimal dominating sets and variants
MM Kanté, V Limouzy, A Mary, L Nourine
International Symposium on Fundamentals of Computation Theory, 298-309, 2011
502011
On the neighbourhood helly of some graph classes and applications to the enumeration of minimal dominating sets
MM Kanté, V Limouzy, A Mary, L Nourine
International Symposium on Algorithms and Computation, 289-298, 2012
292012
On the enumeration and counting of minimal dominating sets in interval and permutation graphs
MM Kanté, V Limouzy, A Mary, L Nourine, T Uno
International Symposium on Algorithms and Computation, 339-349, 2013
282013
Polynomial delay algorithm for listing minimal edge dominating sets in graphs
MM Kanté, V Limouzy, A Mary, L Nourine, T Uno
Workshop on Algorithms and Data Structures, 446-457, 2015
242015
A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs
MM Kanté, V Limouzy, A Mary, L Nourine, T Uno
International Workshop on Graph-Theoretic Concepts in Computer Science, 138-153, 2015
222015
Efficient enumeration of solutions produced by closure operations
A Mary, Y Strozecki
arXiv preprint arXiv:1712.03714, 2017
202017
Énumération des Dominants Minimaux d’un graphe
A Mary
PhD thesis, Université Blaise Pascal, 2013
202013
BacHBerry: BACterial Hosts for production of Bioactive phenolics from bERRY fruits
A Dudnik, AF Almeida, R Andrade, B Avila, P Bañados, D Barbay, ...
Phytochemistry reviews 17 (2), 291-326, 2018
192018
A combinatorial algorithm for microbial consortia synthetic design
A Julien-Laferrière, L Bulteau, D Parrot, A Marchetti-Spaccamela, ...
Scientific reports 6 (1), 1-12, 2016
192016
Token jumping in minor-closed classes
N Bousquet, A Mary, A Parreau
International Symposium on Fundamentals of Computation Theory, 136-149, 2017
132017
Bounding the order of a graph using its diameter and metric dimension: A study through tree decompositions and VC dimension
L Beaudou, P Dankelmann, F Foucaud, MA Henning, A Mary, A Parreau
SIAM Journal on Discrete Mathematics 32 (2), 902-918, 2018
72018
Algorithms for k-meet-semidistributive lattices
L Beaudou, A Mary, L Nourine
Theoretical Computer Science 658, 391-398, 2017
72017
MOOMIN–Mathematical explOration of’Omics data on a MetabolIc Network
T Pusa, MG Ferrarini, R Andrade, A Mary, A Marchetti-Spaccamela, ...
Bioinformatics 36 (2), 514-523, 2020
52020
The perfect matching reconfiguration problem
M Bonamy, N Bousquet, M Heinrich, T Ito, Y Kobayashi, A Mary, ...
arXiv preprint arXiv:1904.06184, 2019
52019
Reconfiguration of graphs with connectivity constraints
N Bousquet, A Mary
International Workshop on Approximation and Online Algorithms, 295-309, 2018
42018
An average study of hypergraphs and their minimal transversals
J David, L Lhote, A Mary, F Rioult
Theoretical Computer Science 596, 124-141, 2015
42015
On Maximal Chain Subgraphs and Covers of Bipartite Graphs
T Calamoneri, M Gastaldello, A Mary, MF Sagot, B Sinaimeri
International Workshop on Combinatorial Algorithms, 137-150, 2016
22016
Capybara: equivalence ClAss enumeration of coPhylogenY event-BAsed ReconciliAtions
Y Wang, A Mary, MF Sagot, B Sinaimeri
Bioinformatics 36 (14), 4197-4199, 2020
12020
Lazy listing of equivalence classes--A paper on dynamic programming and tropical circuits
Y Wang, A Mary, MF Sagot, B Sinaimeri
arXiv preprint arXiv:2004.12143, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20