Partenaires



UNIVERSITE

PARIS DESCARTES

MAP5

Pages personnelles

No title

Publications


Birmelé E., de Montgolfier F., Planche L. and Viennot L. (2017), Decomposing a Graph into Shortest Paths with Bounded Eccentricity, International Symposium on Algorithms and Computation (ISAAC 2017), to appear.

Birmelé E., de Montgolfier F. and Planche L. (2016), Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem , Conference on Combinatorial Optimization and Applications (COCOA'16), Lecture Notes in Computer Science 10043, 216-229.

Picchetti T., Chiquet J., Elati M., Neuvial P., Nicolle R. and Birmelé E. (2015), A model for gene deregulation detection using expression data , BMC Systems Biology 2015, 9(Suppl 6):S6

Andrade R., Birmelé E., Mary A., Picchetti T. and Sagot M.-F. (2015), Incremental complexity of a bi-objective hypergraph transversal problem , Fundamentals of Computation Theory 2015, Lecture Notes in Computer Science 9210, 202-213.

Latouche, P., Birmelé, E., and Ambroise, C. (2014), Model selection in overlapping stochastic block models, Electronic Journal of Statistics, 8, 762-794.

Milreu, P., Coimbre Klein, C., Cottret, L., Acuna, V., Birmelé, E., Borassi, M., Junot, C., Marchetti-Spaccamela, A., Marino, A., Stougie, L., Jourdan, F., Crescenzi, P., Lacroix, V. and Sagot, M.-F. (2014), Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure , Bioinformatics 30 (1): 61-70

Birmelé, E., Ferreira, R., Grossi, R., Marino, A., Pisanti, N., Rizzi, R. and Sacomoto, G. (2013),
Optimal Listing of Cycles and st-Paths in Undirected Graphs , Proceedings of 24th ACM/SIAM Symposium On Discrete Algorithms (SODA) 2013, ACM Press

Birmelé, E. (2012), Detecting local network motifs, Electronic Journal of Statistics, 6, 908-933.

Acuna, V., Birmelé, E., Cottret, L., Crescenzi, P., Jourdan, F., Lacroix, V., Marchetti-Spaccamela, A., Marino, A., Vieira Milreu, P., Sagot, M.-F. and Stougie, L. (2012), Telling Stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets , Theoretical Computer Science, 457(2), 1-9.

Birmelé, E., Crescenzi, P., Ferreira, R., Grossi, R., Lacroix, V., Marino, A., Pisanti, N., Sacomoto, G. and Sagot, M.-F. (2012), Efficient bubble enumeration in directed graphs , String Processing and Information Retrieval (SPIRE) 2012, Lecture Notes in Computer Science.

Latouche, P., Birmelé, E., and Ambroise, C. (2012), Variational Bayesian inference and complexity control for stochastic block models , Statistical Modelling, 12(1), 93-115.

Latouche, P., Birmelé,E., and Ambroise, C. (2011), Overlapping stochastic block model with application to the french political blogosphere, Annals of Applied Statistics, 5(1), 309-336.

Birmelé, E., Delbot, F., Laforest, C. and Thibaut, N. (2011), Analyse du nombre de perturbations lors du maintien d'un arbre de connexion de faible diamètre,Techniques et Sciences Informatiques, 30(7), 781-808. (in french)

Milreu, P., Acuna, V., Birmelé, E., Crescenzi, P., Marchetti-Spaccamela, A., Sagot, M.-F., Stougie, L., and Lacroix, V. (2010), Enumerating chemical organisations in consistent metabolic networks: Complexity and algorithms, WABI'2010, 6293, 226-237.

Birmelé, E.,
A scale-free graph model based on bipartite graphs (2009). Discrete Applied Mathematics, 157(10), 2267-2284.

Birmelé, E., Delbot, F. and Laforest, C. (2009), Mean analysis of an online algorithm for the vertex cover problem , Information Processing Letters, 109, 436-439.

Birmelé,E., Bondy, J.A., and Reed, B.A. (2009). Tree-width of graphs without a 3 by 3 grid minor, Discrete Applied Mathematics, 157(12), 2577-2596.

Birmelé, E., Elati, M., Rouveirol, C., and Ambroise, C. (2008). Identification of functional modules based on transcriptional regulation structure, BMC Proceedings, 2(4):S4.

Birmelé, E. (2008). Every longest circuit of a 3-connected, $K_{3,3}$-minor free graph has a chord, J. Graph Theory, 58(4), 293-298..

Birmelé, E., Bondy, J.A., and Reed, B.A. (2007). The Erdos-Posa property for long circuits, Combinatorica, 27(2), 135-145.

Birmelé, E., Bondy, J.A., and Reed, B.A. (2007). Brambles, prisms and grids, Graph Theory in Paris - Proceedings of a Conference in Memory of Claude Berge, Birkhause.

Matias, C., Schbath, S., Birmelé, E., Daudin, J.-J., and Robin, S. (2006). Networks motifs: mean and variance for the count, Revstat, 4(1), 31-51.

Bessy, S., Birmelé, E., and Havet, F. (2006). Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree, J. Graph Theory, 53(4), 315-332.

Birmelé, E. (2003). Tree-width and circumference of graphs, J. Graph Theory, 43(1), 24-25


Photo