Christophe Paul
20
Documents
Publications
- 20
- 4
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 2
- 3
- 1
- 2
- 2
- 4
- 3
- 1
- 1
- 1
Simple, Linear-Time Modular DecompositionICALP: International Colloquium on Automata, Languages and Programming, Jul 2008, Reykjavik, Iceland. pp.634-645
Communication dans un congrès
lirmm-00324557v1
|
|
Revisiting Uno and Yagiura's AlgorithmsISAAC'05: 16th Annual Symposium on Algorithms and Computation, 2005
Communication dans un congrès
lirmm-00106037v1
|
|
|
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order ExtensionSWAT 2004 - 9th Scandinavian Workshop on Algorithm Theory, Jul 2004, Humlebaek, Denmark. pp.187-198, ⟨10.1007/978-3-540-27810-8_17⟩
Communication dans un congrès
hal-00159601v1
|
|
Maximal Common Connected Sets of Interval GraphsCPM: Combinatorial Pattern Matching, 2004, Istanbul, Turkey. pp.359-372, ⟨10.1007/978-3-540-27801-6_27⟩
Communication dans un congrès
lirmm-00108787v1
|
|
A Linear-Time Algorithm for Recognition of Catval GraphsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2003, Prague, Czech Republic
Communication dans un congrès
lirmm-00269443v1
|
A Simple Linear Time LexBFS Cograph Recognition AlgorithmWG 2003 - 29th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2003, Elspeet, Netherlands. pp.119-130, ⟨10.1007/978-3-540-39890-5_11⟩
Communication dans un congrès
lirmm-00269525v1
|
|
On Poset Sandwich ProblemsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2003, Prague, Czech Republic
Communication dans un congrès
lirmm-00269577v1
|
|
|
Partition refinement and graph decompositionSymposium on Discrete Algorithms (SODA), 1999, Baltimore, United States. pp.1-2
Communication dans un congrès
inria-00471612v1
|
|
A Synthesis on Partition Refinement: a Usefull Routine for Strings, Graphs, Boolean Matrices and AutomataSTACS: Symposium on Theoretical Aspects of Computer Science, Feb 1998, Paris, France. pp.25-38, ⟨10.1007/BFb0028546⟩
Communication dans un congrès
inria-00471611v1
|
WG'09: International Workshop on Theoretic Concepts in Computer Science5911, 352 p., 2010, Lecture Notes in Computer Science
Ouvrages
lirmm-00533518v1
|