
%------ 2001 ---------------------------------------------------------


@Article{HPV01,
  author = 	 {M. Habib and C. Paul and L. Viennot},
  title = 	 {Linear time recognition of $P_4$-indifference graphs},
  journal = 	 {Discrete Mathematics and Theoretical Computer Science},
  year = 	 2001,
  note =	 {To appear}
}


%------ 2000 ---------------------------------------------------------


@TechReport{HP00,
  author = 	 {M. Habib and C. Paul},
  title = 	 {A new vertex splitting  algorithm for cograph recognition},
  institution =  {LaBRI},
  year = 	 2000,
  number =	 {RR-123800}
}


@Article{HMcCPV00,
  author = 	 {M. Habib and R. McConnell and C. Paul and L. Viennot},
  title = 	 {Lex-BFS and Partition Refinement, with Applications
                  to Transitive Orientation, Interval Graph
                  Recognition and Consecutive Ones Testing},
  journal = 	 {Theoretical Computer Science},
  year = 	 2000,
  volume =	 234,
  pages =	 {59--84}
}


@TechReport{GKKPP00,
  author = 	 {C. Gavoille and M. Katz and N. Katz and C. Paul and D. Peleg},
  title = 	 {Approximate Distance Labeling Scheme},
  institution =  {Université  Bordeaux I, LaBRI},
  year = 	 2000,
  number =	 {RR-1250-0}
}


@Article{CDHP00,
  author = 	 {D. Corneil and F. Dragan and M. Habib and C. Paul},
  title = 	 {Diameter Determination on Restricted Graph Families},
  journal = 	 {Discrete Applied Mathematics},
  year = 	 2000,
  note =	 {To appear}
}


%------ 1999 ---------------------------------------------------------


@Article{HPV99,
  author = 	 {M. Habib and C. Paul and L. Viennot},
  title = 	 {Partition refinement: an interested algorithmic tool kit},
  journal = 	 {International Journal of Foundation of Computer Science},
  year = 	 1999,
  volume =	 10,
  number =	 2,
  pages =	 {147--170}
}


@Article{DGP99,
  author = 	 {G. Damiand and M. Habib and C. Paul},
  title = 	 {A simple paradigm for graph recognition:
                  application to cographs and distance hereditary
                  graphs},  
  journal = 	 {Theoretical Computer Science},
  year = 	 1999,
  note =	 {To appear}
}


@TechReport{HPV99b,
  author = 	 {M. Habib and C. Paul and L. Viennot},
  title = 	 {Linear time recognition of $P_4$-indifference graphs},
  institution =  {INRIA},
  year = 	 1999,
  number =	 3779,
  note =	 {To appear in DMTCS}
}


%------ 1998 ---------------------------------------------------------


@InProceedings{HPV98,
  author = 	 {M. Habib and C. Paul and L. Viennot},
  title = 	 {A synthesis on partition refinement: a useful
                  routine for strings, graphs, boolean matrices and
                  automata}, 
  booktitle = 	 {STACS 98},
  number =	 1373,
  series =	 {LNCS},
  year =	 1998,
  organization = {15th Symposium on Theoretical Aspect of Computer Science},
  pages =	 {25--38}
}


@PhdThesis{Pau98,
  author = 	 {C. Paul},
  title = 	 {Parcours en largeur lexicographique~: un algorithme
                  de partitionnement, application aux graphes et généralisation},
  school = 	 {LIRMM, Université de Montpellier II},
  year = 	 1998
}


@InProceedings{CDHP98,
  author = 	 {D. Corneil and F. Dragan and M. Habib and C. Paul},
  title = 	 {Diameter Determination on Restricted Graph Families},
  booktitle = 	 {Graph-Theoretic Concepts in Computer Science, WG'98},
  year =	 1998,
  series =	 {Lecture Notes in Computer Science},
  volume =	 1517,
  organization = {24st Internationnal Workshop WG'98}
}


%------ 1997 ---------------------------------------------------------


@Article{HMcCPV97,
  author = 	 {M. Habib and R. McConnell and C. Paul and L. Viennot},
  title = 	 {Lex-BFS and Partition Refinement, with Applications
                  to Transitive Orientation, Interval Graph
                  Recognition and Consecutive Ones Testing},   
  journal = 	 {Theoretical Computer Science},
  year = 	 1997,
  note =	 {To appear}
}


%------ 1995 ---------------------------------------------------------


@TechReport{GHP95b,
  author = 	 {P. Galinier and M. Habib and C. Paul},
  title = 	 {Maximal Intersection Search: a new algorithm for
		  chordal graph recognition},
  institution =  {LIRM Montpellier},
  year = 	 1995,
  adress =       {161 rue Ada, 34392 Montpellier Cedex 5},
  number =	 95044,
  month =	 {October}
}


@InProceedings{GHP95,
  author = 	 {P. Galinier and M. Habib and C. Paul},
  title = 	 {Chordal graphs and their clique graph},
  booktitle = 	 {Graph-Theoretic Concepts in Computer Science, WG'95},
  editor =	 {M. Nagl (Ed.)},
  volume =	 1017,
  series =	 {Lecture Notes in Computer Science},
  year =	 1995,
  organization = {21st Internationnal Workshop WG'95},
  publisher =	 {Springer},
  address =	 {Aachen, Germany},
  month =	 {June},
  pages =	 {358--371}
}

