 | 2011 |
|---|
| 9 |       | Etienne Birmelé,
François Delbot,
Christian Laforest,
Nicolas Thibault:
Analyse du nombre de perturbations lors du maintien d'un arbre de connexion de faible diamètre.
Technique et Science Informatiques 30(7): 781-808 (2011) |
| 2010 |
|---|
| 8 | | Paulo Vieira Milreu,
Vicente Acuña,
Etienne Birmelé,
Pierluigi Crescenzi,
Alberto Marchetti-Spaccamela,
Marie-France Sagot,
Leen Stougie,
Vincent Lacroix:
Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms.
WABI 2010: 226-237 |
| 2009 |
|---|
| 7 | | Etienne Birmelé:
A scale-free graph model based on bipartite graphs.
Discrete Applied Mathematics 157(10): 2267-2284 (2009) |
| 6 | | Etienne Birmelé,
John Adrian Bondy,
Bruce A. Reed:
Tree-width of graphs without a 3×3 grid minor.
Discrete Applied Mathematics 157(12): 2577-2596 (2009) |
| 5 | | Etienne Birmelé,
François Delbot,
Christian Laforest:
Mean analysis of an online algorithm for the vertex cover problem.
Inf. Process. Lett. 109(9): 436-439 (2009) |
| 2008 |
|---|
| 4 | | Pierre Latouche,
Etienne Birmelé,
Christophe Ambroise:
Bayesian Methods for Graph Clustering.
GfKl 2008: 229-239 |
| 3 | | Etienne Birmelé:
Every longest circuit of a 3-connected, K3, 3-minor free graph has a chord.
Journal of Graph Theory 58(4): 293-298 (2008) |
| 2007 |
|---|
| 2 | | Etienne Birmelé,
John Adrian Bondy,
Bruce A. Reed:
The Erdös-Pósa Property For Long Circuits.
Combinatorica 27(2): 135-145 (2007) |
| 2006 |
|---|
| 1 | | Stéphane Bessy,
Frédéric Havet,
Etienne Birmelé:
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree.
Journal of Graph Theory 53(4): 315-332 (2006) |
Data released under the ODC-BY 1.0 license — See also our legal information page