 | 2011 |
|---|
| 10 |       | Christophe Crespelle,
Fabien Tarissan:
Evaluation of a new method for measuring the internet degree distribution: Simulation results.
Computer Communications 34(5): 635-648 (2011) |
| 2010 |
|---|
| 9 | | Matthieu Latapy,
Thi Ha Duong Phan,
Christophe Crespelle,
Thanh Qui Nguyen:
Termination of Multipartite Graph Series Arising from Complex Network Modelling.
COCOA (1) 2010: 1-10 |
| 8 | | Christophe Crespelle,
Ioan Todinca:
An O(n2){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem.
TAMC 2010: 175-186 |
| 7 | | Christophe Crespelle,
Christophe Paul:
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs.
Algorithmica 58(2): 405-432 (2010) |
| 6 | | Christophe Crespelle,
Philippe Gambette:
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time.
Inf. Process. Lett. 110(12-13): 497-502 (2010) |
| 2009 |
|---|
| 5 | | Christophe Crespelle,
Philippe Gambette:
Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search.
IWOCA 2009: 146-157 |
| 4 | | Christophe Crespelle:
Fully Dynamic Representations of Interval Graphs.
WG 2009: 77-87 |
| 2006 |
|---|
| 3 | | Christophe Crespelle,
Christophe Paul:
Fully dynamic recognition algorithm and certificate for directed cographs.
Discrete Applied Mathematics 154(12): 1722-1741 (2006) |
| 2005 |
|---|
| 2 | | Christophe Crespelle,
Christophe Paul:
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs.
WG 2005: 38-48 |
| 2004 |
|---|
| 1 | | Christophe Crespelle,
Christophe Paul:
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs.
WG 2004: 93-104 |
Data released under the ODC-BY 1.0 license — See also our legal information page