|
Search the dblp DataBase
Christophe Paul:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- Michel Habib, Christophe Paul, Mathieu Raffinot
Maximal Common Connected Sets of Interval Graphs. [Citation Graph (0, 0)][DBLP] CPM, 2004, pp:359-372 [Conf]
- 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]
- Cyril Gavoille, Christophe Paul
Optimal Distance Labeling for Interval and Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP] ESA, 2003, pp:254-265 [Conf]
- Christophe Paul, Jan Arne Telle
New Tools and Simpler Algorithms for Branchwidth. [Citation Graph (0, 0)][DBLP] ESA, 2005, pp:379-390 [Conf]
- 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]
- Pierre Fraigniaud, Cyril Gavoille, Christophe Paul
Eclecticism shrinks even small worlds. [Citation Graph (0, 0)][DBLP] PODC, 2004, pp:169-178 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Christophe Crespelle, Christophe Paul
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. [Citation Graph (0, 0)][DBLP] WG, 2004, pp:93-104 [Conf]
- 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]
- Philippe Galinier, Michel Habib, Christophe Paul
Chordal Graphs and Their Clique Graphs. [Citation Graph (0, 0)][DBLP] WG, 1995, pp:358-371 [Conf]
- Christophe Paul, Andrzej Proskurowski, Jan Arne Telle
Generation of Graphs with Bounded Branchwidth. [Citation Graph (0, 0)][DBLP] WG, 2006, pp:205-216 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
A note on alpha-drawable k-trees. [Citation Graph (, )][DBLP]
The Structure of Level-k Phylogenetic Networks. [Citation Graph (, )][DBLP]
Kernels for Feedback Arc Set In Tournaments. [Citation Graph (, )][DBLP]
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. [Citation Graph (, )][DBLP]
Kinetic Maintenance of Mobile k-Centres on Trees. [Citation Graph (, )][DBLP]
Dynamic Distance Hereditary Graphs Using Split Decomposition. [Citation Graph (, )][DBLP]
Perfect DCJ Rearrangement. [Citation Graph (, )][DBLP]
Polynomial Kernels for 3-Leaf Power Graph Modification Problems. [Citation Graph (, )][DBLP]
Computing galled networks from real data. [Citation Graph (, )][DBLP]
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems [Citation Graph (, )][DBLP]
Polynomial kernels for 3-leaf power graph modification problems [Citation Graph (, )][DBLP]
Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs [Citation Graph (, )][DBLP]
Kernels for Feedback Arc Set In Tournaments [Citation Graph (, )][DBLP]
A survey on algorithmic aspects of modular decomposition [Citation Graph (, )][DBLP]
On the (non-)existence of polynomial kernels for Pl-free edge modification problems [Citation Graph (, )][DBLP]
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. [Citation Graph (, )][DBLP]
Branchwidth of chordal graphs. [Citation Graph (, )][DBLP]
Kinetic maintenance of mobile k-centres on trees. [Citation Graph (, )][DBLP]
Polynomial kernels for 3-leaf power graph modification problems. [Citation Graph (, )][DBLP]
Edge-maximal graphs of branchwidth k: The k-branches. [Citation Graph (, )][DBLP]
Search in 0.023secs, Finished in 0.026secs
|