| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Eun Jung Kim, Christophe Paul, Geevarghese Philip |
A single-exponential FPT algorithm for the $K_4$-minor cover problem  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Emeric Gioan, Christophe Paul |
Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul |
Contracting chordal graphs and bipartite graphs to paths and trees. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé |
Hitting and Harvesting Pumpkins |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul |
Obtaining a Bipartite Graph by Contracting Few Edges |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul |
Contracting Graphs to Paths and Trees |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Christophe Paul, Anthony Perez, Stéphan Thomassé |
Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil |
Practical and Efficient Split Decomposition via Graph-Labelled Trees |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil |
Circle Graph Recognition in Time $O(n+m) \alpha(n+m)$ |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé |
Kernels for feedback arc set in tournaments. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé |
Hitting and Harvesting Pumpkins. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Anthony Perez, Stéphan Thomassé |
Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul |
Contracting Graphs to Paths and Trees. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul |
Obtaining a Bipartite Graph by Contracting Few Edges. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul |
A survey of the algorithmic aspects of modular decomposition. |
Computer Science Review |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Crespelle, Christophe Paul |
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Guillemot, Christophe Paul, Anthony Perez |
On the (non-)existence of polynomial kernels for Pl-free edge modification problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Bessy, Christophe Paul, Anthony Perez |
Polynomial kernels for 3-leaf power graph modification problems. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu |
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Michel Habib (eds.) |
Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle |
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Guillemot, Christophe Paul, Anthony Perez |
On the (Non-)existence of Polynomial Kernels for Pl-free Edge Modification Problems. |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Jan Arne Telle |
Edge-maximal graphs of branchwidth k: The k-branches. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel H. Huson, Regula Rupp, Vincent Berry, Philippe Gambette, Christophe Paul |
Computing galled networks from real data. |
Bioinformatics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas |
Linear time 3-approximation for the MAST problem. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
maximum agreement subtree, maximum compatible subtree, Approximation algorithm, phylogenetic tree |
| 1 | Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé |
Kernels for Feedback Arc Set In Tournaments |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul |
A survey on algorithmic aspects of modular decomposition |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu |
Abstract Milling with Turn Costs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stephane Durocher, Christophe Paul |
Kinetic maintenance of mobile k-centres on trees. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Guillemot, François Nicolas, Vincent Berry, Christophe Paul |
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Jan Arne Telle |
Branchwidth of chordal graphs. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle |
Interval Completion Is Fixed Parameter Tractable. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Gambette, Vincent Berry, Christophe Paul |
The Structure of Level-k Phylogenetic Networks. |
CPM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Christophe Paul, Anthony Perez |
Polynomial Kernels for 3-Leaf Power Graph Modification Problems. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé |
Kernels for Feedback Arc Set In Tournaments. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sèverine Bérard, Cedric Chauve, Christophe Paul |
A more efficient algorithm for perfect sorting by reversals. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul |
Competitive graph searches. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Guillemot, François Nicolas, Vincent Berry, Christophe Paul |
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Bessy, Christophe Paul, Anthony Perez |
Polynomial kernels for 3-leaf power graph modification problems |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Emeric Gioan, Christophe Paul |
Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul |
A Simple Linear Time LexBFS Cograph Recognition Algorithm. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Cyril Gavoille, Christophe Paul |
Optimal Distance Labeling for Interval Graphs and Related Graph Families. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul |
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Svetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget, Stephen K. Wismath |
A note on alpha-drawable k-trees. |
CCCG |
2008 |
DBLP BibTeX RDF |
|
| 1 | Sèverine Bérard, Annie Chateau, Cedric Chauve, Christophe Paul, Eric Tannier |
Perfect DCJ Rearrangement. |
RECOMB-CG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul |
Can transitive orientation make sandwich problems easier? |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul |
Simple, linear-time modular decomposition |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul |
Perfect Sorting by Reversals Is Not Always Difficult. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2007 |
DBLP DOI BibTeX RDF |
Evolution scenarios, reversals, common intervals |
| 1 | Emeric Gioan, Christophe Paul |
Dynamic Distance Hereditary Graphs Using Split Decomposition. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephane Durocher, Christophe Paul |
Kinetic Maintenance of Mobile k-Centres on Trees. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger |
Interval completion with few edges. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
FPT algorithm, edge completion, profile minimization, interval graphs, branching, physical mapping |
| 1 | Pierre Fraigniaud, Cyril Gavoille, Christophe Paul |
Eclecticism shrinks even small worlds. |
Distributed Computing |
2006 |
DBLP DOI BibTeX RDF |
Milgram’s experiment, Routing, Small world graphs |
| 1 | Christophe Crespelle, Christophe Paul |
Fully dynamic recognition algorithm and certificate for directed cographs. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Andrzej Proskurowski, Jan Arne Telle |
Generation of Graphs with Bounded Branchwidth. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Jan Arne Telle |
Edge-maximal graphs of branchwidth k. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul |
A simple linear time algorithm for cograph recognition. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Crespelle, Christophe Paul |
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Jan Arne Telle |
New Tools and Simpler Algorithms for Branchwidth. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul |
Perfect Sorting by Reversals Is Not Always Difficult. |
WABI |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul |
On the Approximation of Computing Evolutionary Trees. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul |
Revisiting T. Uno and M. Yagiura's Algorithm . |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Crespelle, Christophe Paul |
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Fabien de Montgolfier, Christophe Paul |
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul, Mathieu Raffinot |
Maximal Common Connected Sets of Interval Graphs. |
CPM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Fraigniaud, Cyril Gavoille, Christophe Paul |
Eclecticism shrinks even small worlds. |
PODC |
2004 |
DBLP DOI BibTeX RDF |
routing, distributed hash tables, small world graphs |
| 1 | Michel Habib, Emmanuelle Lebhar, Christophe Paul |
A note on finding all homogeneous set sandwiches. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cyril Gavoille, Christophe Paul |
Distance labeling scheme and split decomposition. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul |
A Simple Linear Time LexBFS Cograph Recognition Algorithm. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cyril Gavoille, Christophe Paul |
Optimal Distance Labeling for Interval and Circular-Arc Graphs. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
distance queries, Data-structure, interval graphs, labeling scheme, circular-arc graphs |
| 1 | Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano |
Approximate Multicommodity Flow for WDM Networks Design. |
SIROCCO |
2003 |
DBLP BibTeX RDF |
|
| 1 | Cyril Gavoille, Christophe Paul |
Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Damiand, Michel Habib, Christophe Paul |
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul, Laurent Viennot |
Linear time recognition of P4-indifference graphs. |
Discrete Mathematics & Theoretical Computer Science |
2001 |
DBLP BibTeX RDF |
|
| 1 | Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul |
Diameter determination on restricted graph families. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg |
Approximate Distance Labeling Schemes. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
Local representations, approximate distance, distributed data structures, labeling schemes |
| 1 | Cyril Gavoille, Christophe Paul |
Approximate Distance Labeling Schemes. |
Electronic Notes in Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul, Laurent Viennot |
Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. |
Int. J. Found. Comput. Sci. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul |
Diameter Determination on Restricted Graph Faminlies. |
WG |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul, Laurent Viennot |
A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Galinier, Michel Habib, Christophe Paul |
Chordal Graphs and Their Clique Graphs. |
WG |
1995 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")