2009 | ||
---|---|---|
46 | EE | Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas: Linear time 3-approximation for the MAST problem. ACM Transactions on Algorithms 5(2): (2009) |
45 | EE | Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle: Interval Completion Is Fixed Parameter Tractable. SIAM J. Comput. 38(5): 2007-2020 (2009) |
2008 | ||
44 | Svetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget, Stephen K. Wismath: A note on alpha-drawable k-trees. CCCG 2008 | |
43 | EE | Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. ICALP (1) 2008: 634-645 |
42 | EE | Sèverine Bérard, Annie Chateau, Cedric Chauve, Christophe Paul, Eric Tannier: Perfect DCJ Rearrangement. RECOMB-CG 2008: 158-169 |
41 | EE | Sylvain Guillemot, François Nicolas, Vincent Berry, Christophe Paul: On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems CoRR abs/0802.2736: (2008) |
40 | EE | Stéphane Bessy, Christophe Paul, Anthony Perez: Polynomial kernels for 3-leaf power graph modification problems CoRR abs/0809.2858: (2008) |
39 | EE | Emeric Gioan, Christophe Paul: Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs CoRR abs/0810.1823: (2008) |
38 | EE | Sèverine Bérard, Cedric Chauve, Christophe Paul: A more efficient algorithm for perfect sorting by reversals. Inf. Process. Lett. 106(3): 90-95 (2008) |
37 | EE | Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul: Competitive graph searches. Theor. Comput. Sci. 393(1-3): 72-80 (2008) |
2007 | ||
36 | EE | Stephane Durocher, Christophe Paul: Kinetic Maintenance of Mobile k-Centres on Trees. ISAAC 2007: 341-352 |
35 | EE | Emeric Gioan, Christophe Paul: Dynamic Distance Hereditary Graphs Using Split Decomposition. ISAAC 2007: 41-51 |
34 | EE | Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger: Interval completion with few edges. STOC 2007: 374-381 |
33 | EE | Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul: Simple, linear-time modular decomposition CoRR abs/0710.3901: (2007) |
32 | EE | Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul: Can transitive orientation make sandwich problems easier? Discrete Mathematics 307(16): 2030-2041 (2007) |
31 | EE | Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul: Perfect Sorting by Reversals Is Not Always Difficult. IEEE/ACM Trans. Comput. Biology Bioinform. 4(1): 4-16 (2007) |
2006 | ||
30 | EE | Christophe Paul, Andrzej Proskurowski, Jan Arne Telle: Generation of Graphs with Bounded Branchwidth. WG 2006: 205-216 |
29 | EE | Christophe Crespelle, Christophe Paul: Fully dynamic recognition algorithm and certificate for directed cographs. Discrete Applied Mathematics 154(12): 1722-1741 (2006) |
28 | EE | Pierre Fraigniaud, Cyril Gavoille, Christophe Paul: Eclecticism shrinks even small worlds. Distributed Computing 18(4): 279-291 (2006) |
2005 | ||
27 | EE | Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul: On the Approximation of Computing Evolutionary Trees. COCOON 2005: 115-125 |
26 | EE | Christophe Paul, Jan Arne Telle: New Tools and Simpler Algorithms for Branchwidth. ESA 2005: 379-390 |
25 | EE | Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul: Revisiting T. Uno and M. Yagiura's Algorithm . ISAAC 2005: 146-155 |
24 | EE | Sèverine Bérard, Anne Bergeron, Cedric Chauve, Christophe Paul: Perfect Sorting by Reversals Is Not Always Difficult. WABI 2005: 228-238 |
23 | EE | Christophe Crespelle, Christophe Paul: Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs. WG 2005: 38-48 |
22 | EE | Michel Habib, Christophe Paul: A simple linear time algorithm for cograph recognition. Discrete Applied Mathematics 145(2): 183-197 (2005) |
21 | EE | Christophe Paul, Jan Arne Telle: Edge-maximal graphs of branchwidth k. Electronic Notes in Discrete Mathematics 22: 363-368 (2005) |
2004 | ||
20 | EE | Michel Habib, Christophe Paul, Mathieu Raffinot: Maximal Common Connected Sets of Interval Graphs. CPM 2004: 359-372 |
19 | EE | Pierre Fraigniaud, Cyril Gavoille, Christophe Paul: Eclecticism shrinks even small worlds. PODC 2004: 169-178 |
18 | EE | Michel Habib, Fabien de Montgolfier, Christophe Paul: A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. SWAT 2004: 187-198 |
17 | EE | Christophe Crespelle, Christophe Paul: Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. WG 2004: 93-104 |
2003 | ||
16 | EE | Cyril Gavoille, Christophe Paul: Optimal Distance Labeling for Interval and Circular-Arc Graphs. ESA 2003: 254-265 |
15 | Mohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano: Approximate Multicommodity Flow for WDM Networks Design. SIROCCO 2003: 43-56 | |
14 | EE | Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul: A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG 2003: 119-130 |
13 | EE | Cyril Gavoille, Christophe Paul: Distance labeling scheme and split decomposition. Discrete Mathematics 273(1-3): 115-130 (2003) |
12 | EE | Michel Habib, Emmanuelle Lebhar, Christophe Paul: A note on finding all homogeneous set sandwiches. Inf. Process. Lett. 87(3): 147-151 (2003) |
2001 | ||
11 | EE | Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg: Approximate Distance Labeling Schemes. ESA 2001: 476-487 |
10 | Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul: Diameter determination on restricted graph families. Discrete Applied Mathematics 113(2-3): 143-166 (2001) | |
9 | EE | Michel Habib, Christophe Paul, Laurent Viennot: Linear time recognition of P4-indifference graphs. Discrete Mathematics & Theoretical Computer Science 4(2): 173-178 (2001) |
8 | EE | Cyril Gavoille, Christophe Paul: Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs. Electronic Notes in Discrete Mathematics 10: 117-120 (2001) |
7 | EE | Guillaume Damiand, Michel Habib, Christophe Paul: A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theor. Comput. Sci. 263(1-2): 99-111 (2001) |
2000 | ||
6 | EE | Cyril Gavoille, Christophe Paul: Approximate Distance Labeling Schemes. Electronic Notes in Discrete Mathematics 5: 134-137 (2000) |
5 | EE | 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. 234(1-2): 59-84 (2000) |
1999 | ||
4 | Michel Habib, Christophe Paul, Laurent Viennot: Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. Int. J. Found. Comput. Sci. 10(2): 147-170 (1999) | |
1998 | ||
3 | Michel Habib, Christophe Paul, Laurent Viennot: A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. STACS 1998: 25-38 | |
2 | Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul: Diameter Determination on Restricted Graph Faminlies. WG 1998: 192-202 | |
1995 | ||
1 | Philippe Galinier, Michel Habib, Christophe Paul: Chordal Graphs and Their Clique Graphs. WG 1995: 358-371 |