default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnaud Mary
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy
, Arnaud Mary, Lucas Pastor:
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes. Discret. Appl. Math. 345: 34-51 (2024)- [i14]Arnaud Mary:
Enumeration of minimal transversals of hypergraphs of bounded VC-dimension. CoRR abs/2407.00694 (2024) - [i13]Luís Cunha, Thiago Lopes, Arnaud Mary:
Complexity and algorithms for Swap median and relation to other consensus problems. CoRR abs/2409.09734 (2024) - 2023
- [j11]Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
A General Framework for Enumerating Equivalence Classes of Solutions. Algorithmica 85(10): 3003-3023 (2023) - 2022
- [j10]Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
Efficiently sparse listing of classes of optimal cophylogeny reconciliations. Algorithms Mol. Biol. 17(1): 2 (2022) - [c15]Caroline Brosse, Vincent Limouzy, Arnaud Mary:
Polynomial Delay Algorithm for Minimal Chordal Completions. ICALP 2022: 33:1-33:16 - 2021
- [c14]Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
A General Framework for Enumerating Equivalence Classes of Solutions. ESA 2021: 80:1-80:14 - [c13]Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations. WABI 2021: 3:1-3:18 - [i12]Caroline Brosse, Vincent Limouzy, Arnaud Mary:
Polynomial delay algorithm for minimal chordal completions. CoRR abs/2107.05972 (2021) - 2020
- [j9]Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility. Algorithms Mol. Biol. 15(1): 14 (2020) - [j8]Taneli Pusa, Mariana Galvao Ferrarini, Ricardo Andrade, Arnaud Mary, Alberto Marchetti-Spaccamela, Leen Stougie, Marie-France Sagot:
MOOMIN - Mathematical explOration of 'Omics data on a MetabolIc Network. Bioinform. 36(2): 514-523 (2020) - [j7]Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
Capybara: equivalence ClAss enumeration of coPhylogenY event-BAsed ReconciliAtions. Bioinform. 36(14): 4197-4199 (2020) - [i11]Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
Lazy listing of equivalence classes - A paper on dynamic programming and tropical circuits. CoRR abs/2004.12143 (2020) - [i10]Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor:
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes. CoRR abs/2007.01031 (2020)
2010 – 2019
- 2019
- [j6]Arnaud Mary, Vincent Limouzy, Lhouari Nourine:
WEPA 2016 preface. Discret. Appl. Math. 268: 178 (2019) - [j5]Arnaud Mary, Yann Strozecki:
Efficient enumeration of solutions produced by closure operations. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [c12]Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa:
The Perfect Matching Reconfiguration Problem. MFCS 2019: 80:1-80:14 - [i9]Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa:
The Perfect Matching Reconfiguration Problem. CoRR abs/1904.06184 (2019) - 2018
- [j4]Laurent Beaudou, Peter Dankelmann, Florent Foucaud, Michael A. Henning, Arnaud Mary, Aline Parreau:
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. SIAM J. Discret. Math. 32(2): 902-918 (2018) - [c11]Nicolas Bousquet, Arnaud Mary:
Reconfiguration of Graphs with Connectivity Constraints. WAOA 2018: 295-309 - [i8]Nicolas Bousquet, Arnaud Mary:
Reconfiguration of graphs with connectivity constraints. CoRR abs/1809.05443 (2018) - 2017
- [j3]Laurent Beaudou, Arnaud Mary, Lhouari Nourine:
Algorithms for k-meet-semidistributive lattices. Theor. Comput. Sci. 658: 391-398 (2017) - [c10]Nicolas Bousquet, Arnaud Mary, Aline Parreau:
Token Jumping in Minor-Closed Classes. FCT 2017: 136-149 - [i7]Nicolas Bousquet, Arnaud Mary, Aline Parreau:
Token Jumping in minor-closed classes. CoRR abs/1706.09608 (2017) - [i6]Arnaud Mary, Yann Strozecki:
Efficient enumeration of solutions produced by closure operations. CoRR abs/1712.03714 (2017) - 2016
- [c9]Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
On Maximal Chain Subgraphs and Covers of Bipartite Graphs. ICTCS 2016: 286-291 - [c8]Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
On Maximal Chain Subgraphs and Covers of Bipartite Graphs. IWOCA 2016: 137-150 - [c7]Arnaud Mary, Yann Strozecki:
Efficient Enumeration of Solutions Produced by Closure Operations. STACS 2016: 52:1-52:13 - 2015
- [j2]Julien David, Loïck Lhote, Arnaud Mary, François Rioult:
An average study of hypergraphs and their minimal transversals. Theor. Comput. Sci. 596: 124-141 (2015) - [c6]Ricardo Andrade, Etienne Birmelé, Arnaud Mary, Thomas Picchetti, Marie-France Sagot:
Incremental Complexity of a Bi-objective Hypergraph Transversal Problem. FCT 2015: 202-213 - [c5]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. WADS 2015: 446-457 - [c4]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. WG 2015: 138-153 - [i5]Ricardo Andrade, Etienne Birmelé, Arnaud Mary, Thomas Picchetti, Marie-France Sagot:
Incremental complexity of a bi-objective hypergraph transversal problem. CoRR abs/1505.06025 (2015) - [i4]Arnaud Mary, Yann Strozecki:
Efficient enumeration of solutions produced by closure operations. CoRR abs/1509.05623 (2015) - 2014
- [j1]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine:
On the Enumeration of Minimal Dominating Sets and Related Notions. SIAM J. Discret. Math. 28(4): 1916-1929 (2014) - [i3]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs. CoRR abs/1404.3501 (2014) - [i2]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. CoRR abs/1407.2036 (2014) - [i1]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine:
On the Enumeration of Minimal Dominating Sets and Related Notions. CoRR abs/1407.2053 (2014) - 2013
- [c3]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. ISAAC 2013: 339-349 - 2012
- [c2]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine:
On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets. ISAAC 2012: 289-298 - 2011
- [c1]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine:
Enumeration of Minimal Dominating Sets and Variants. FCT 2011: 298-309
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 00:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
