Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Anne Berry
@article{DBLP:journals/algorithms/SimonetB22,
author = {Genevi{\`{e}}ve Simonet and
Anne Berry},
title = {Properties and Recognition of Atom Graphs},
journal = {Algorithms},
volume = {15},
number = {8},
pages = {294},
year = {2022},
url = {https://doi.org/10.3390/a15080294},
doi = {10.3390/A15080294},
timestamp = {Fri, 30 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/SimonetB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/BerryS21,
author = {Anne Berry and
Genevi{\`{e}}ve Simonet},
title = {Computing the Atom Graph of a Graph and the Union Join Graph of a
Hypergraph},
journal = {Algorithms},
volume = {14},
number = {12},
pages = {347},
year = {2021},
url = {https://doi.org/10.3390/a14120347},
doi = {10.3390/A14120347},
timestamp = {Thu, 20 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/BerryS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BerryW18,
author = {Anne Berry and
Annegret Wagler},
title = {The Normal Graph Conjecture for Two Classes of Sparse Graphs},
journal = {Graphs Comb.},
volume = {34},
number = {1},
pages = {139--157},
year = {2018},
url = {https://doi.org/10.1007/s00373-017-1868-2},
doi = {10.1007/S00373-017-1868-2},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BerryW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/BerryS17,
author = {Anne Berry and
Genevi{\`{e}}ve Simonet},
title = {Computing a Clique Tree with the Algorithm Maximal Label Search},
journal = {Algorithms},
volume = {10},
number = {1},
pages = {20},
year = {2017},
url = {https://doi.org/10.3390/a10010020},
doi = {10.3390/A10010020},
timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/BerryS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerryS16,
author = {Anne Berry and
Genevi{\`{e}}ve Simonet},
title = {Computing the atom graph of a graph and the union join graph of a
hypergraph},
journal = {CoRR},
volume = {abs/1607.02911},
year = {2016},
url = {http://arxiv.org/abs/1607.02911},
eprinttype = {arXiv},
eprint = {1607.02911},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BerryS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerryS16a,
author = {Anne Berry and
Genevi{\`{e}}ve Simonet},
title = {Computing a clique tree with algorithm {MLS} (Maximal Label Search)},
journal = {CoRR},
volume = {abs/1610.09623},
year = {2016},
url = {http://arxiv.org/abs/1610.09623},
eprinttype = {arXiv},
eprint = {1610.09623},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BerryS16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BerryBGM15,
author = {Anne Berry and
Andreas Brandst{\"{a}}dt and
Vassilis Giakoumakis and
Fr{\'{e}}d{\'{e}}ric Maffray},
title = {Efficiently decomposing, recognizing and triangulating hole-free graphs
without diamonds},
journal = {Discret. Appl. Math.},
volume = {184},
pages = {50--61},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2014.11.018},
doi = {10.1016/J.DAM.2014.11.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BerryBGM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BerryBE15,
author = {Anne Berry and
Andreas Brandst{\"{a}}dt and
Konrad Engel},
title = {The Dilworth Number of Auto-Chordal Bipartite Graphs},
journal = {Graphs Comb.},
volume = {31},
number = {5},
pages = {1463--1471},
year = {2015},
url = {https://doi.org/10.1007/s00373-014-1471-8},
doi = {10.1007/S00373-014-1471-8},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BerryBE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/BerryGHNS14,
author = {Anne Berry and
Alain Gutierrez and
Marianne Huchard and
Amedeo Napoli and
Alain Sigayret},
title = {Hermes: a simple and efficient algorithm for building the AOC-poset
of a binary relation},
journal = {Ann. Math. Artif. Intell.},
volume = {72},
number = {1-2},
pages = {45--71},
year = {2014},
url = {https://doi.org/10.1007/s10472-014-9418-6},
doi = {10.1007/S10472-014-9418-6},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/BerryGHNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BerryPS14,
author = {Anne Berry and
Romain Pogorelcnik and
Genevi{\`{e}}ve Simonet},
title = {Organizing the atoms of the clique separator decomposition into an
atom tree},
journal = {Discret. Appl. Math.},
volume = {177},
pages = {1--13},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.05.030},
doi = {10.1016/J.DAM.2014.05.030},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BerryPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/JachietPBLB13,
author = {Pierre{-}Alain Jachiet and
Romain Pogorelcnik and
Anne Berry and
Philippe Lopez and
Eric Bapteste},
title = {MosaicFinder: identification of fused gene families in sequence similarity
networks},
journal = {Bioinform.},
volume = {29},
number = {7},
pages = {837--844},
year = {2013},
url = {https://doi.org/10.1093/bioinformatics/btt049},
doi = {10.1093/BIOINFORMATICS/BTT049},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/JachietPBLB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfca/BerryS13,
author = {Anne Berry and
Alain Sigayret},
editor = {Peggy Cellier and
Felix Distel and
Bernhard Ganter},
title = {Dismantlable Lattices in the Mirror},
booktitle = {Formal Concept Analysis, 11th International Conference, {ICFCA} 2013,
Dresden, Germany, May 21-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7880},
pages = {44--59},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38317-5\_3},
doi = {10.1007/978-3-642-38317-5\_3},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/icfca/BerryS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BerryW13,
author = {Anne Berry and
Annegret Wagler},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {The Normal Graph Conjecture for Classes of Sparse Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
pages = {64--75},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_7},
doi = {10.1007/978-3-642-45043-3\_7},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BerryW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerryBE13,
author = {Anne Berry and
Andreas Brandst{\"{a}}dt and
Konrad Engel},
title = {The Dilworth Number of Auto-Chordal-Bipartite Graphs},
journal = {CoRR},
volume = {abs/1309.5787},
year = {2013},
url = {http://arxiv.org/abs/1309.5787},
eprinttype = {arXiv},
eprint = {1309.5787},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BerryBE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cla/BerryHNS12,
author = {Anne Berry and
Marianne Huchard and
Amedeo Napoli and
Alain Sigayret},
editor = {Laszlo Szathmary and
Uta Priss},
title = {Hermes: an Efficient Algorithm for Building Galois Sub-hierarchies},
booktitle = {Proceedings of The Ninth International Conference on Concept Lattices
and Their Applications, Fuengirola (M{\'{a}}laga), Spain, October
11-14, 2012},
series = {{CEUR} Workshop Proceedings},
volume = {972},
pages = {21--32},
publisher = {CEUR-WS.org},
year = {2012},
url = {https://ceur-ws.org/Vol-972/paper2.pdf},
timestamp = {Fri, 10 Mar 2023 16:22:10 +0100},
biburl = {https://dblp.org/rec/conf/cla/BerryHNS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfca/BerryS12,
author = {Anne Berry and
Alain Sigayret},
editor = {Florent Domenach and
Dmitry I. Ignatov and
Jonas Poelmans},
title = {A Peep through the Looking Glass: Articulation Points in Lattices},
booktitle = {Formal Concept Analysis - 10th International Conference, {ICFCA} 2012,
Leuven, Belgium, May 7-10, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7278},
pages = {45--60},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29892-9\_10},
doi = {10.1007/978-3-642-29892-9\_10},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/icfca/BerryS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BerryW12,
author = {Anne Berry and
Annegret Wagler},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {Triangulation and Clique Separator Decomposition of Claw-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {7--21},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_5},
doi = {10.1007/978-3-642-34611-8\_5},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BerryW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KruegerSB11,
author = {Richard Krueger and
Genevi{\`{e}}ve Simonet and
Anne Berry},
title = {A General Label Search to investigate classical graph search algorithms},
journal = {Discret. Appl. Math.},
volume = {159},
number = {2-3},
pages = {128--142},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.02.011},
doi = {10.1016/J.DAM.2010.02.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KruegerSB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BerryP11,
author = {Anne Berry and
Romain Pogorelcnik},
title = {A simple algorithm to generate the minimal separators and the maximal
cliques of a chordal graph},
journal = {Inf. Process. Lett.},
volume = {111},
number = {11},
pages = {508--511},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.013},
doi = {10.1016/J.IPL.2011.02.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BerryP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cla/BerryPS11,
author = {Anne Berry and
Romain Pogorelcnik and
Alain Sigayret},
editor = {Amedeo Napoli and
Vil{\'{e}}m Vychodil},
title = {Vertical Decomposition of a Lattice Using Clique Separators},
booktitle = {Proceedings of The Eighth International Conference on Concept Lattices
and Their Applications, Nancy, France, October 17-20, 2011},
series = {{CEUR} Workshop Proceedings},
volume = {959},
pages = {15--29},
publisher = {CEUR-WS.org},
year = {2011},
url = {https://ceur-ws.org/Vol-959/paper1.pdf},
timestamp = {Fri, 10 Mar 2023 16:22:10 +0100},
biburl = {https://dblp.org/rec/conf/cla/BerryPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/BerryBBS10,
author = {Anne Berry and
Jean R. S. Blair and
Jean Paul Bordat and
Genevi{\`{e}}ve Simonet},
title = {Graph Extremities Defined by Search Algorithms},
journal = {Algorithms},
volume = {3},
number = {2},
pages = {100--124},
year = {2010},
url = {https://doi.org/10.3390/a3020100},
doi = {10.3390/A3020100},
timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/BerryBBS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/BerryPS10,
author = {Anne Berry and
Romain Pogorelcnik and
Genevi{\`{e}}ve Simonet},
title = {An Introduction to Clique Minimal Separator Decomposition},
journal = {Algorithms},
volume = {3},
number = {2},
pages = {197--215},
year = {2010},
url = {https://doi.org/10.3390/a3020197},
doi = {10.3390/A3020197},
timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/BerryPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BerryKS09,
author = {Anne Berry and
Richard Krueger and
Genevi{\`{e}}ve Simonet},
title = {Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination
Orderings},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {1},
pages = {428--446},
year = {2009},
url = {https://doi.org/10.1137/070684355},
doi = {10.1137/070684355},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BerryKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BerryDHS08,
author = {Anne Berry and
Elias Dahlhaus and
Pinar Heggernes and
Genevi{\`{e}}ve Simonet},
title = {Sequential and parallel triangulating algorithms for Elimination Game
and new insights on Minimum Degree},
journal = {Theor. Comput. Sci.},
volume = {409},
number = {3},
pages = {601--616},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.09.059},
doi = {10.1016/J.TCS.2008.09.059},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BerryDHS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/BerrySPG07,
author = {Anne Berry and
Eric SanJuan and
Maurice Pouzet and
Martin Charles Golumbic},
title = {Introduction to the special volume on knowledge discovery and discrete
mathematics and a tribute to the memory of Peter L. Hammer},
journal = {Ann. Math. Artif. Intell.},
volume = {49},
number = {1-4},
pages = {1--4},
year = {2007},
url = {https://doi.org/10.1007/s10472-007-9066-1},
doi = {10.1007/S10472-007-9066-1},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amai/BerrySPG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/BerryBS07,
author = {Anne Berry and
Jean Paul Bordat and
Alain Sigayret},
title = {A local approach to concept generation},
journal = {Ann. Math. Artif. Intell.},
volume = {49},
number = {1-4},
pages = {117--136},
year = {2007},
url = {https://doi.org/10.1007/s10472-007-9063-4},
doi = {10.1007/S10472-007-9063-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/BerryBS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isb/KabaPLSB07,
author = {Bangaly Kaba and
Nicolas Pinet and
Ga{\"{e}}lle Lelandais and
Alain Sigayret and
Anne Berry},
title = {Clustering Gene Expression Data Using Graph Separators},
journal = {Silico Biol.},
volume = {7},
number = {4-5},
pages = {433--452},
year = {2007},
url = {http://content.iospress.com/articles/in-silico-biology/isb00319},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/isb/KabaPLSB07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BerryGL07,
author = {Anne Berry and
Martin Charles Golumbic and
Marina Lipshteyn},
title = {Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {21},
number = {3},
pages = {573--591},
year = {2007},
url = {https://doi.org/10.1137/050637091},
doi = {10.1137/050637091},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BerryGL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfca/ArevaloBHPS07,
author = {Gabriela Ar{\'{e}}valo and
Anne Berry and
Marianne Huchard and
Guillaume Perrot and
Alain Sigayret},
editor = {Sergei O. Kuznetsov and
Stefan Schmidt},
title = {Performances of Galois Sub-hierarchy-building Algorithms},
booktitle = {Formal Concept Analysis, 5th International Conference, {ICFCA} 2007,
Clermont-Ferrand, France, February 12-16, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4390},
pages = {166--180},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-70901-5\_11},
doi = {10.1007/978-3-540-70901-5\_11},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icfca/ArevaloBHPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BerrySS06,
author = {Anne Berry and
Eric SanJuan and
Alain Sigayret},
title = {Generalized domination in closure systems},
journal = {Discret. Appl. Math.},
volume = {154},
number = {7},
pages = {1064--1084},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.04.009},
doi = {10.1016/J.DAM.2005.04.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BerrySS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BerryBS06,
author = {Anne Berry and
Jean R. S. Blair and
Genevi{\`{e}}ve Simonet},
title = {Preface},
journal = {Discret. Math.},
volume = {306},
number = {3},
pages = {293},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2005.12.004},
doi = {10.1016/J.DISC.2005.12.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BerryBS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BerryHV06,
author = {Anne Berry and
Pinar Heggernes and
Yngve Villanger},
title = {A vertex incremental approach for maintaining chordality},
journal = {Discret. Math.},
volume = {306},
number = {3},
pages = {318--336},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2005.12.002},
doi = {10.1016/J.DISC.2005.12.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BerryHV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BerryBHSV06,
author = {Anne Berry and
Jean Paul Bordat and
Pinar Heggernes and
Genevi{\`{e}}ve Simonet and
Yngve Villanger},
title = {A wide-range algorithm for minimal triangulation from an arbitrary
ordering},
journal = {J. Algorithms},
volume = {58},
number = {1},
pages = {33--66},
year = {2006},
url = {https://doi.org/10.1016/j.jalgor.2004.07.001},
doi = {10.1016/J.JALGOR.2004.07.001},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BerryBHSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/soco/BerrySS06,
author = {Anne Berry and
Alain Sigayret and
Christine Sinoquet},
title = {Maximal sub-triangulation in pre-processing phylogenetic data},
journal = {Soft Comput.},
volume = {10},
number = {5},
pages = {461--468},
year = {2006},
url = {https://doi.org/10.1007/s00500-005-0507-7},
doi = {10.1007/S00500-005-0507-7},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/soco/BerrySS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfca/BerryMSS06,
author = {Anne Berry and
Ross M. McConnell and
Alain Sigayret and
Jeremy P. Spinrad},
editor = {Rokia Missaoui and
J{\"{u}}rg Schmid},
title = {Very Fast Instances for Concept Generation},
booktitle = {Formal Concept Analysis, 4th International Conference, {ICFCA} 2006,
Dresden, Germany, February 13-17, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3874},
pages = {119--129},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11671404\_8},
doi = {10.1007/11671404\_8},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/icfca/BerryMSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BerryBBKS05,
author = {Anne Berry and
Jean R. S. Blair and
Jean Paul Bordat and
Richard Krueger and
Genevi{\`{e}}ve Simonet},
title = {Extremities and orderings defined by generalized graph search algorithms},
journal = {Electron. Notes Discret. Math.},
volume = {22},
pages = {413--420},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.06.066},
doi = {10.1016/J.ENDM.2005.06.066},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BerryBBKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfca/BerryHMSS05,
author = {Anne Berry and
Marianne Huchard and
Ross M. McConnell and
Alain Sigayret and
Jeremy P. Spinrad},
editor = {Bernhard Ganter and
Robert Godin},
title = {Efficiently Computing a Linear Extension of the Sub-hierarchy of a
Concept Lattice},
booktitle = {Formal Concept Analysis, Third International Conference, {ICFCA} 2005,
Lens, France, February 14-18, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3403},
pages = {208--222},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-32262-7\_14},
doi = {10.1007/978-3-540-32262-7\_14},
timestamp = {Sun, 02 Jun 2019 21:20:58 +0200},
biburl = {https://dblp.org/rec/conf/icfca/BerryHMSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BerryKS05,
author = {Anne Berry and
Richard Krueger and
Genevi{\`{e}}ve Simonet},
editor = {Dieter Kratsch},
title = {Ultimate Generalizations of LexBFS and {LEX} {M}},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {199--213},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_18},
doi = {10.1007/11604686\_18},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BerryKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BerrySS05,
author = {Anne Berry and
Alain Sigayret and
Jeremy P. Spinrad},
editor = {Dieter Kratsch},
title = {Faster Dynamic Algorithms for Chordal Graphs, and an Application to
Phylogeny},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {445--455},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_39},
doi = {10.1007/11604686\_39},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BerrySS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BerryBHP04,
author = {Anne Berry and
Jean R. S. Blair and
Pinar Heggernes and
Barry W. Peyton},
title = {Maximum Cardinality Search for Computing Minimal Triangulations of
Graphs},
journal = {Algorithmica},
volume = {39},
number = {4},
pages = {287--298},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1084-3},
doi = {10.1007/S00453-004-1084-3},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BerryBHP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BerryS04,
author = {Anne Berry and
Alain Sigayret},
title = {Representing a concept lattice by a graph},
journal = {Discret. Appl. Math.},
volume = {144},
number = {1-2},
pages = {27--42},
year = {2004},
url = {https://doi.org/10.1016/j.dam.2004.02.016},
doi = {10.1016/J.DAM.2004.02.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BerryS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BerryGL04,
author = {Anne Berry and
Martin Charles Golumbic and
Marina Lipshteyn},
editor = {J. Ian Munro},
title = {Two tricks to triangulate chordal probe graphs in polynomial time},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {962--969},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982936},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BerryGL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BerryHV03,
author = {Anne Berry and
Pinar Heggernes and
Yngve Villanger},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {A Vertex Incremental Approach for Dynamically Maintaining Chordal
Graphs},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {47--57},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_7},
doi = {10.1007/978-3-540-24587-2\_7},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BerryHV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BerryHS03,
author = {Anne Berry and
Pinar Heggernes and
Genevi{\`{e}}ve Simonet},
editor = {Hans L. Bodlaender},
title = {The Minimum Degree Heuristic and the Minimal Triangulation Process},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {58--70},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_6},
doi = {10.1007/978-3-540-39890-5\_6},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BerryHS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/oois/BerryS02,
author = {Anne Berry and
Alain Sigayret},
editor = {Jean{-}Michel Bruel and
Zohra Bellahsene},
title = {Maintaining Class Membership Information},
booktitle = {Advances in Object-Oriented Information Systems, {OOIS} 2002 Workshops,
Montpellier, France, September 2, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2426},
pages = {13--23},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-46105-1\_3},
doi = {10.1007/3-540-46105-1\_3},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/oois/BerryS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BerryBH02,
author = {Anne Berry and
Jean R. S. Blair and
Pinar Heggernes},
editor = {Ludek Kucera},
title = {Maximum Cardinality Search for Computing Minimal Triangulations},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {1--12},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_1},
doi = {10.1007/3-540-36379-3\_1},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BerryBH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BerryB01,
author = {Anne Berry and
Jean Paul Bordat},
title = {Asteroidal triples of moplexes},
journal = {Discret. Appl. Math.},
volume = {111},
number = {3},
pages = {219--229},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00278-X},
doi = {10.1016/S0166-218X(00)00278-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BerryB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BerryB01,
author = {Anne Berry and
Jean Paul Bordat},
title = {Moplex elimination orderings},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {6--9},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80065-4},
doi = {10.1016/S1571-0653(05)80065-4},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BerryB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BerryBC00,
author = {Anne Berry and
Jean Paul Bordat and
Olivier Cogis},
title = {Generating All the Minimal Separators of a Graph},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {397--403},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000211},
doi = {10.1142/S0129054100000211},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BerryBC00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BerryBH00,
author = {Anne Berry and
Jean Paul Bordat and
Pinar Heggernes},
title = {Recognizing Weakly Triangulated Graphs by Edge Separability},
journal = {Nord. J. Comput.},
volume = {7},
number = {3},
pages = {164--177},
year = {2000},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/BerryBH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BerryBH00,
author = {Anne Berry and
Jean Paul Bordat and
Pinar Heggernes},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Recognizing Weakly Triangulated Graphs by Edge Separability},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {139--149},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_13},
doi = {10.1007/3-540-44985-X\_13},
timestamp = {Fri, 27 Mar 2020 08:50:36 +0100},
biburl = {https://dblp.org/rec/conf/swat/BerryBH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Berry99,
author = {Anne Berry},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {A Wide-Range Efficient Algorithm for Minimal Triangulation},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {860--861},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314972},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/Berry99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BerryBC99,
author = {Anne Berry and
Jean Paul Bordat and
Olivier Cogis},
editor = {Peter Widmayer and
Gabriele Neyer and
Stephan J. Eidenbenz},
title = {Generating All the Minimal Separators of a Graph},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop,
{WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1665},
pages = {167--172},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46784-X\_17},
doi = {10.1007/3-540-46784-X\_17},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/wg/BerryBC99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BerryB98,
author = {Anne Berry and
Jean Paul Bordat},
title = {Separability Generalizes Dirac's Theorem},
journal = {Discret. Appl. Math.},
volume = {84},
number = {1-3},
pages = {43--53},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(98)00005-5},
doi = {10.1016/S0166-218X(98)00005-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BerryB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 01: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:
