Остановите войну!
for scientists:
default search action
Anne Berry
- > Home > Persons > Anne Berry
Publications
- 2022
- [j32]Geneviève Simonet, Anne Berry:
Properties and Recognition of Atom Graphs. Algorithms 15(8): 294 (2022) - 2021
- [j31]Anne Berry, Geneviève Simonet:
Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph. Algorithms 14(12): 347 (2021) - 2017
- [j29]Anne Berry, Geneviève Simonet:
Computing a Clique Tree with the Algorithm Maximal Label Search. Algorithms 10(1): 20 (2017) - 2016
- [i3]Anne Berry, Geneviève Simonet:
Computing the atom graph of a graph and the union join graph of a hypergraph. CoRR abs/1607.02911 (2016) - [i2]Anne Berry, Geneviève Simonet:
Computing a clique tree with algorithm MLS (Maximal Label Search). CoRR abs/1610.09623 (2016) - 2014
- [j25]Anne Berry, Romain Pogorelcnik, Geneviève Simonet:
Organizing the atoms of the clique separator decomposition into an atom tree. Discret. Appl. Math. 177: 1-13 (2014) - 2011
- [j23]Richard Krueger, Geneviève Simonet, Anne Berry:
A General Label Search to investigate classical graph search algorithms. Discret. Appl. Math. 159(2-3): 128-142 (2011) - 2010
- [j21]Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Geneviève Simonet:
Graph Extremities Defined by Search Algorithms. Algorithms 3(2): 100-124 (2010) - [j20]Anne Berry, Romain Pogorelcnik, Geneviève Simonet:
An Introduction to Clique Minimal Separator Decomposition. Algorithms 3(2): 197-215 (2010) - 2009
- [j19]Anne Berry, Richard Krueger, Geneviève Simonet:
Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings. SIAM J. Discret. Math. 23(1): 428-446 (2009) - 2008
- [j18]Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet:
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree. Theor. Comput. Sci. 409(3): 601-616 (2008) - 2006
- [j12]Anne Berry, Jean R. S. Blair, Geneviève Simonet:
Preface. Discret. Math. 306(3): 293 (2006) - [j10]Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger:
A wide-range algorithm for minimal triangulation from an arbitrary ordering. J. Algorithms 58(1): 33-66 (2006) - 2005
- [j8]Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Richard Krueger, Geneviève Simonet:
Extremities and orderings defined by generalized graph search algorithms. Electron. Notes Discret. Math. 22: 413-420 (2005) - [c10]Anne Berry, Richard Krueger, Geneviève Simonet:
Ultimate Generalizations of LexBFS and LEX M. WG 2005: 199-213 - 2003
- [c6]Anne Berry, Pinar Heggernes, Geneviève Simonet:
The Minimum Degree Heuristic and the Minimal Triangulation Process. WG 2003: 58-70
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-02-07 03:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint