@Article{HP04,

author = {M. Habib and C. Paul},

title = {A Simple Linear Time Algorithm for Cographs Recognition},

journal = {Discrete Applied Mathematics},

year = 2004,

number = 145,

volume = 2

pages = {183-187}

@TECHREPORT{CC04,

AUTHOR = {C. Crespelle and C. Paul},

TITLE = {Fully Dynamic Recognition Algorithm and Certificate for Directed Cographs},

INSTITUTION = {LIRMM, Universit\'e Montpellier 2},

YEAR = 2004,

MONTH = February,

NUMBER = {RR-LIRMM-04047},

ANNOTE = {}

}

@TECHREPORT{FGP03,

AUTHOR = {P. Fraigniaud and C. Gavoille and C. Paul},

TITLE = {Eclecticism Shrink the World},

INSTITUTION = {LRI, Univ. Paris 6},

YEAR = 2003,

MONTH = November,

NUMBER = {LRI-1376},

ANNOTE = {}

}

@Article{HLP03, author = {M. Habib and E. Lebhar and C. Paul}, title = {A Note on Finding All Homogeneous Set Sandwiches}, journal = {Information Processing Letters}, year = 2003, number = 87, pages = {147-151}, note = {Appears as RR-LIRMM-02141} } @TECHREPORT{GHPR03, AUTHOR = {A.-T. Gai and M. Habib and C. Paul and M. Raffinot}, TITLE = {Identifying Common Connected Components of Graphs}, INSTITUTION = {LIRMM, Université de Montpellier 2}, YEAR = 2003, MONTH = July, NUMBER = {RR-LIRMM-03016}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/rr03-016.pdf} } @TECHREPORT{HPR03, AUTHOR = {M. Habib and C. Paul and M. Raffinot}, TITLE = {Common connected Components of Interval Graphs}, INSTITUTION = {LIRMM, Université de Montpellier 2}, YEAR = 2003, MONTH = July, NUMBER = {RR-LIRMM-03014}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/rr03-014.pdf} } @TECHREPORT{HKLP03, AUTHOR = {M. Habib and D. Kelly and E. Lebhar and C. Paul}, TITLE = {On Poset Sandwich Problems}, INSTITUTION = {LIP ENS-Lyon}, YEAR = 2003, MONTH = April, NUMBER = {RR-LIP 2003-27}, ANNOTE = {} } @TECHREPORT{HdMP03, AUTHOR = {M. Habib and F. de Montgolfier and C. Paul}, TITLE = {A simple linear-time modular decomposition algorithm}, INSTITUTION = {LIRMM, Université de Montpellier 2}, YEAR = 2003, MONTH = April, NUMBER = {RR-LIRMM-03007}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/rr03-007.ps} } @UNPUBLISHED{BCLPR03, AUTHOR = {M. Bouklit and D. Coudert and J.-F. Lalande and C. Paul and H. Rivano}, TITLE = {Approximate multicommodity flow for WDM networks design}, YEAR = 2003, MONTH = March, NOTE = {Submitted to SIROCCO'03} } @TECHREPORT{HPT03, AUTHOR = {M. Habib and C. Paul and J.A. Telle}, TITLE = {A linear-time algorithm for recognition of catval graphs}, INSTITUTION = {LIRMM, Université de Montpellier 2}, YEAR = 2003, MONTH = March, NUMBER = {RR-LIRMM-03004}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/rr03-004.ps} } @INPROCEEDINGS{BCLPR03, AUTHOR = {M. Bouklit and D. Coudert and J-F. Lalande and C. Paul and H. Rivano}, TITLE = {Approximate multicommodity flow for {WDM} networks design}, BOOKTITLE = {SIROCCO 10}, PAGES = {43--56}, YEAR = {2003}, EDITOR = {J. Sibeyn}, NUMBER = {17}, SERIES = {Proceedings in Informatics}, ADRESS = {Umea, Sweden}, MONTH = June, PUBLISHER = {Carleton Scientific}, PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publica tion/BCLPR-SIROCCO03.pdf}, @UNPUBLISHED{BCHP03, AUTHOR = {A. Bretscher and D.G. Corneil and M. Habib and C. Paul}, TITLE = {A Simple Linear Time LexBFS Cograph Recognition Algorithm}, YEAR = 2003, MONTH = February, NOTE = {To appear in WG'03} } @TECHREPORT{GP03, AUTHOR = {C. Gavoille and C. Paul}, TITLE = {Small Universal Distance Matrix}, INSTITUTION = {LIRMM, Université de Montpellier 2}, YEAR = 2003, MONTH = January, NUMBER = {RR-LIRMM-03001}, NOTE = {To Appear in ESA'03}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/spaa03.ps} } @TECHREPORT{HLP02, AUTHOR = {M. Habib and E. Lebhar and C. Paul}, TITLE = {A note on finding all homogeneous set sandwiches}, INSTITUTION = {LIRMM, Université de Montpellier 2}, YEAR = 2002, MONTH = October, NUMBER = {RR-LIRMM-02141}, NOTE = {To appear in Information Processing Letters}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/rr-02141.ps} } @ARTICLE{CDHP01, AUTHOR = {D. Corneil and F. Dragan and M. Habib and C. Paul}, TITLE = {Diameter Determination on Restricted Graph Families}, JOURNAL = {Discrete Applied Mathematics}, YEAR = 2001, VOLUME = 113, NUMBER = {2-3}, PAGES = {143-166}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/Diam-new.ps} } @ARTICLE{DHP01, 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 = 2001, VOLUME = 263, PAGES = {99-111}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/tcs-lix.ps} } @INPROCEEDINGS{GKKPP01, AUTHOR = {Gavoille and M. Katz and N. Katz and C. Paul and D. Peleg}, TITLE = {Approximate Distance Labeling Scheme}, BOOKTITLE = {Algorithms - ESA 2001}, PAGES = {476-487}, YEAR = 2001, EDITOR = {Meyer auf der Heide}, NUMBER = 2161, SERIES = {Lecture Notes in Computer Science}, ORGANIZATION = {9th Annual European Symposium on Algorithms}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/esa01.ps} } @INPROCEEDINGS{GP01, AUTHOR = {C. Gavoille and C. Paul}, TITLE = {Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graph}, BOOKTITLE = {Euroconference on Combinatorics, Graph Theory and Applications, COMB'01}, YEAR = 2001, VOLUME = 10, SERIES = {Electronique Notes on Discrete Mathematics}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/comb01.ps} } @TECHREPORT{GP01b, AUTHOR = {C. Gavoille and C. Paul}, TITLE = {Distance Labeling and Split Decomposition}, INSTITUTION = {LIRMM, Université de Montpellier 2}, YEAR = 2001, NUMBER = {RR-LIRMM-01222}, NOTE = {Submitted to COMB'01 Special Issue of Discrete Mathematics}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/comb01-dm.ps} } @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, VOLUME = 4, NUMBER = 2, PAGES = {173-178}, NOTE = {Special issue: Graph Decomposition}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/dmtcs-P4Indif.ps} } @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}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/RR-1250-00.ps} } @INPROCEEDINGS{GP00, AUTHOR = {C. Gavoille and C. Paul}, TITLE = {Approximate distance labeling scheme}, BOOKTITLE = {6th International Conference on Graph Theory, IGCT}, YEAR = 2000, VOLUME = 5, SERIES = {Electronique Notes on Discrete Mathematics}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/comb01.ps} } @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}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/tcs.ps} } @TECHREPORT{HP00, AUTHOR = {M. Habib and C. Paul}, TITLE = {A new vertex splitting algorithm for cograph recognition}, INSTITUTION = {LaBRI}, YEAR = 2000, NUMBER = {RR-123800}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/cographe-17-09-01.ps} } @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}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/ijfcs.ps} } @INPROCEEDINGS{HPV99b, AUTHOR = {M. Habib and C. Paul and L. Viennot}, TITLE = {Partition refinement and graph decomposition}, BOOKTITLE = {SODA}, YEAR = 1999, ORGANIZATION = {Tenth Annual ACM-SIAM Symposium On Discrete Algorithm}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/soda.ps} } @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}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/diametre.ps} } @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}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/stacs.ps} } @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, ANNOTE = {http://www.lirmm.fr/~paul/These/these.ps} } @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}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/wgllncs2.ps} } @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}, ANNOTE = {http://www.lirmm.fr/~paul/Biblio/Postscript/marseille.ps} }