The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christophe Paul: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul
    On the Approximation of Computing Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:115-125 [Conf]
  2. Michel Habib, Christophe Paul, Mathieu Raffinot
    Maximal Common Connected Sets of Interval Graphs. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:359-372 [Conf]
  3. Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg
    Approximate Distance Labeling Schemes. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:476-487 [Conf]
  4. Cyril Gavoille, Christophe Paul
    Optimal Distance Labeling for Interval and Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:254-265 [Conf]
  5. Christophe Paul, Jan Arne Telle
    New Tools and Simpler Algorithms for Branchwidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:379-390 [Conf]
  6. Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
    Revisiting T. Uno and M. Yagiura's Algorithm . [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:146-155 [Conf]
  7. Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
    Eclecticism shrinks even small worlds. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:169-178 [Conf]
  8. Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano
    Approximate Multicommodity Flow for WDM Networks Design. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:43-56 [Conf]
  9. Michel Habib, Christophe Paul, Laurent Viennot
    A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:25-38 [Conf]
  10. Michel Habib, Fabien de Montgolfier, Christophe Paul
    A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:187-198 [Conf]
  11. Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul
    Perfect Sorting by Reversals Is Not Always Difficult. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:228-238 [Conf]
  12. Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
    A Simple Linear Time LexBFS Cograph Recognition Algorithm. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:119-130 [Conf]
  13. Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
    Diameter Determination on Restricted Graph Faminlies. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:192-202 [Conf]
  14. Christophe Crespelle, Christophe Paul
    Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:93-104 [Conf]
  15. Christophe Crespelle, Christophe Paul
    Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:38-48 [Conf]
  16. Philippe Galinier, Michel Habib, Christophe Paul
    Chordal Graphs and Their Clique Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:358-371 [Conf]
  17. Christophe Paul, Andrzej Proskurowski, Jan Arne Telle
    Generation of Graphs with Bounded Branchwidth. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:205-216 [Conf]
  18. Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
    Diameter determination on restricted graph families. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:143-166 [Journal]
  19. Michel Habib, Christophe Paul
    A simple linear time algorithm for cograph recognition. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:183-197 [Journal]
  20. Christophe Crespelle, Christophe Paul
    Fully dynamic recognition algorithm and certificate for directed cographs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:12, pp:1722-1741 [Journal]
  21. Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
    Eclecticism shrinks even small worlds. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:4, pp:279-291 [Journal]
  22. Cyril Gavoille, Christophe Paul
    Distance labeling scheme and split decomposition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:115-130 [Journal]
  23. Michel Habib, Christophe Paul, Laurent Viennot
    Linear time recognition of P4-indifference graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:173-178 [Journal]
  24. Michel Habib, Christophe Paul, Laurent Viennot
    Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:147-170 [Journal]
  25. Michel Habib, Emmanuelle Lebhar, Christophe Paul
    A note on finding all homogeneous set sandwiches. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:3, pp:147-151 [Journal]
  26. Guillaume Damiand, Michel Habib, Christophe Paul
    A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:99-111 [Journal]
  27. Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot
    Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:59-84 [Journal]
  28. Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger
    Interval completion with few edges. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:374-381 [Conf]
  29. Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
    Simple, linear-time modular decomposition [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  30. Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul
    Can transitive orientation make sandwich problems easier? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2030-2041 [Journal]
  31. Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul
    Perfect Sorting by Reversals Is Not Always Difficult. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2007, v:4, n:1, pp:4-16 [Journal]

  32. A note on alpha-drawable k-trees. [Citation Graph (, )][DBLP]


  33. The Structure of Level-k Phylogenetic Networks. [Citation Graph (, )][DBLP]


  34. Kernels for Feedback Arc Set In Tournaments. [Citation Graph (, )][DBLP]


  35. Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. [Citation Graph (, )][DBLP]


  36. Kinetic Maintenance of Mobile k-Centres on Trees. [Citation Graph (, )][DBLP]


  37. Dynamic Distance Hereditary Graphs Using Split Decomposition. [Citation Graph (, )][DBLP]


  38. Perfect DCJ Rearrangement. [Citation Graph (, )][DBLP]


  39. Polynomial Kernels for 3-Leaf Power Graph Modification Problems. [Citation Graph (, )][DBLP]


  40. Computing galled networks from real data. [Citation Graph (, )][DBLP]


  41. On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems [Citation Graph (, )][DBLP]


  42. Polynomial kernels for 3-leaf power graph modification problems [Citation Graph (, )][DBLP]


  43. Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs [Citation Graph (, )][DBLP]


  44. Kernels for Feedback Arc Set In Tournaments [Citation Graph (, )][DBLP]


  45. A survey on algorithmic aspects of modular decomposition [Citation Graph (, )][DBLP]


  46. On the (non-)existence of polynomial kernels for Pl-free edge modification problems [Citation Graph (, )][DBLP]


  47. On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. [Citation Graph (, )][DBLP]


  48. Branchwidth of chordal graphs. [Citation Graph (, )][DBLP]


  49. Kinetic maintenance of mobile k-centres on trees. [Citation Graph (, )][DBLP]


  50. Polynomial kernels for 3-leaf power graph modification problems. [Citation Graph (, )][DBLP]


  51. Edge-maximal graphs of branchwidth k: The k-branches. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002