Anne Berry   Talks
back to top of page

1. La séparabilité, généralisation du théorème de Dirac.

LIM (Marseille).
4 février 1997.
 
2. Des orthotreillis à la généralisation du théorème de Dirac.

EHESS (Ecole des Hautes Etudes de Sciences Sociales),Paris.
17 février 1997.

3. LexBFS sur un graphe quelconque.

LIM, Marseille,Journée des Doctorants.
juillet 1997.

4. Des moplex d'un graphe.

DIF, Montpellier.
27 septembre 1997.
abstract of talk

5. Effeuillage d'un graphe.

LIRMM, Montpellier, Journée des Doctorants.
janvier 1998.

6. Deconstructing a Graph.

Friedrich-Schiller-Universität, Jena (Germany).
October 5, 1998.

7. Désarticulation d'un graphe.

LIM (Marseille).
17 novembre 1998.

8. A Wide-Range Efficient Algorithm for Minimal Triangulation.

SODA'99 SIAM Conference, Baltimore (USA).
January 17, 1999.

9. Moplexes as extremities of a Graph.

SIAM Conference rump-session, Baltimore (USA).
January 19, 1999.

10. Les séparateurs minimaux dans les graphes minimalement imparfaits - surtout des questions ouvertes.

LIFO (Orléans), Rencontre Graphes et Algorithmes.
2 avril 1999.

11. Deconstructing a graph.

Institutt for informatikk, Bergen (Norway).
April 29, 1999.

12. Defining a minimal fill-in using an arbitrary vertex ordering.

Institutt for informatikk, Bergen (Norway).
April 30, 1999.
abstract of talk

13. Generating all the minimal separators of a Graph.

WG'99 Conference. University of Lugano.
June 23, 1999.

14. Les Treillis Orthocomplémentés finis.

LIP.
Lyon, France, 17 novembre 1999.

15. Triangulation par traitement des sommets dans un ordre aléatoire.

Séminaire du LIM.
Marseille, France, 30 novembre 1999.

16. Recognizing Weakly Triangulated Graphs by Edge Separability.

SWAT 2000 conference.
Bergen, Norway, July 2000.

17. Les séparateurs minimaux.

Séminaire IMAG.
Grenoble, France, 29 Juin 2000.
abstract of talk

18. Triangulated and Weakly Triangulated Graphs: Simpliciality in Vertices and Edges.

6th International Conference on Graph Theory (ICGT 2000).
Marseille, France, September 1,  2000.

19. Représentation d'une phylogénie par une famille de graphes.

With C. Sinoquet.
Groupe de travail Alphy.
Avignon, 28 mars 2001.

20. Triangulation et faible triangulation.

3e Rencontre Graphes et algorithmes.
Clermont-Ferrand, France, 4 mai 2001.

21. Moplex Elimination Orderings

First Cologne-Twente Wokshop.
Cologne, Germany, June 2001.

22. Clique minimal separator decomposition

Dagstuhl seminar No. 01251,  17.06.2001-22.06.2001, Graph Decompositions and Algorithmic Applications
Seminar  Report No. 312
Dagstuhl, Germany, June 2001.

23. Des treillis pour les graphes, des graphes pour les treillis

Seminaire de l'IRIN.
Nantes, 5 juillet 2001.
abstract of talk

24. Edge composition schemes for triangulated and weakly triangulated graphs

Institutt for informatikk.
Bergen, Norway, October 11, 2001.
abstract of talk

25. Codage d'un treillis des concepts par un graphe.

4e Journées Graphes et Algorithmes.
Nantes, France.
28 mars 2002.

26. Representing a concept lattice by a graph.

2nd SIAM Conference on Data Mining
Workshop on Discrete Maths for Data Mining
Arlington, VA (USA)
April 13, 2002.

27. La séparation dans un graphe : un outil sémantique puissant

Séminaire du LIRMM.
Montpellier, France, 30 mai 2002.
abstract en html

28. La structure articulatoire d'un graphe, outil de description des treillis de Galois.

Séminaires du LaPCS.
Lyon, France, 26 juin 2002.
abstract

29. Obtaining and maintaining polynomial-sized concept lattices.

Workshop FCAKDD, in ECAI conference..
Lyon, France, July 23,  2002.

30. Maintaining Class Membership Information

Workshop MASPEGHI, Montpellier.
Montpellier, France, September 1, 2002.

31. Minimal separation and minimal triangulation.

Caesarea Rothschild Institute, University of Haifa.
Haifa, Israel, January 15, 2003.
abstract of talk

32. Representing a Concept Lattice by a Graph.

Caesarea Rothschild Institute, University of Haifa.
Haifa, Israel, January 22, 2003.
abstract of talk

33. Concept Lattices and Domination in Graphs

First International Conference on Formal Concept Analysis.
Technische Universität, Darmstadt.
Darmstadt, February 27, 2003.

34. La triangulation minimum

5e journées Graphes et Algorithmes.
Dijon, France, 3 avril 2003.

35. Generalized Domination in Closure Systems.

3rd SIAM Conference on Data Mining
Workshop on Discrete Maths for Data Mining
San Francisco, USA, May 3, 2003.

36. Partitioning Chordal Probe Graphs.

Third Haifa Conference on Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms, honoring Peter Hammer.
Invited talk.
Haifa, Israel, May 28, 2003.

37. The Minimum Degree Heuristic and the Minimal Triangulation Process.

WG 2003.
Elspeet, Netherlands, June 2003.

38. Systèmes de fermeture et domination dans les graphes.

Paris, EHESS, 17 novembre 2003.

39. Graph Extremities and Minimal Separation.

Invited Lecture.
JIM 2003.
Metz, September 4, 2003.

40. Weaving Through a Crowd of Minimal Separators.

Habilitation, Anne Berry.
December 11, 2003.

41. Two tricks to Triangulate Chordal Probe Graphs in Polynomial Time.

SODA 2004
New Orleans, January 2004.

42. Embedding a graph into a chordal/weakly chordal graph.

Franco-Israeli Cnference on Graph Classes and Algorithms.
Haifa, April 25, 2004.

43. Partitioning Chordal Probe Graphs

Dagstuhl Seminar on Robust Algorithms.
Dagstuhl, May 25, 2004.