Graphs & Applications
Publications of Christophe PAUL

(bibtex format)
[publications of the team]

Copyrights for some of the papers below have been transfered, or will be transfered to various publishers of journals, conferences proceedings, etc. For such papers I am required to post the following notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. Publisher's copyright policy are available at © SIAM, © ACM, © IEEE, © Springer, © Elsevier, © Ideal, © King's College.


[ 2001 | 2000 | 1999 | 1998 | 1997 | 1995]


2001

  1. M. Habib, C. Paul, and L. Viennot. Linear time recognition of p_4-indifference graphs. Discrete Mathematics and Theoretical Computer Science, 2001. To appear.



2000

  1. M. Habib and C. Paul. A new vertex splitting algorithm for cograph recognition. Technical Report RR-123800, LaBRI, 2000.

  2. M. Habib, R. McConnell, C. Paul, and L. Viennot. Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoretical Computer Science, 234:59-84, 2000.

  3. C. Gavoille, M. Katz, N. Katz, C. Paul, and D. Peleg. Approximate distance labeling scheme. Technical Report RR-1250-0, Université Bordeaux I, LaBRI, 2000.

  4. D. Corneil, F. Dragan, M. Habib, and C. Paul. Diameter determination on restricted graph families. Discrete Applied Mathematics, 2000. To appear.



1999

  1. G. Damiand, M. Habib, and C. Paul. A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theoretical Computer Science, 1999. To appear.

  2. M. Habib, C. Paul, and L. Viennot. Partition refinement: an interested algorithmic tool kit. International Journal of Foundation of Computer Science, 10(2):147-170, 1999.

  3. M. Habib, C. Paul, and L. Viennot. Linear time recognition of p_4-indifference graphs. Technical Report 3779, INRIA, 1999. To appear in DMTCS.



1998

  1. M. Habib, C. Paul, and L. Viennot. A synthesis on partition refinement: a useful routine for strings, graphs, boolean matrices and automata. In STACS 98, number 1373 in LNCS, pages 25-38. 15th Symposium on Theoretical Aspect of Computer Science, 1998.

  2. C. Paul. Parcours en largeur lexicographique : un algorithme de partitionnement, application aux graphes et généralisation. PhD thesis, LIRMM, Université de Montpellier II, 1998.

  3. D. Corneil, F. Dragan, M. Habib, and C. Paul. Diameter determination on restricted graph families. In Graph-Theoretic Concepts in Computer Science, WG'98, volume 1517 of Lecture Notes in Computer Science. 24st Internationnal Workshop WG'98, 1998.



1997

  1. M. Habib, R. McConnell, C. Paul, and L. Viennot. Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoretical Computer Science, 1997. To appear.



1995

  1. P. Galinier, M. Habib, and C. Paul. Maximal intersection search: a new algorithm for chordal graph recognition. Technical Report 95044, LIRM Montpellier, October 1995.

  2. P. Galinier, M. Habib, and C. Paul. Chordal graphs and their clique graph. In M. Nagl (Ed.), editor, Graph-Theoretic Concepts in Computer Science, WG'95, volume 1017 of Lecture Notes in Computer Science, pages 358-371, Aachen, Germany, June 1995. 21st Internationnal Workshop WG'95, Springer.



10 janvier 2008 (14)
[home page of the team]