Etienne Birmelé

According to our database, Etienne Birmelé authored at least 23 papers between 2003 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

Identification of deregulation mechanisms specific to cancer subtypes.

Magali Champion, Julien Chiquet, Pierre Neuvial, Mohamed Elati, François Radvanyi, Etienne Birmelé

J. Bioinform. Comput. Biol., 2021

Machine-learning based feature selection for a non-invasive breathing change detection.

Juliana Alves Pegoraro, Sophie Lavault, Nicolas Wattiez, Thomas Similowski, Jésus Gonzalez-Bermejo, Etienne Birmelé

BioData Min., 2021

2020

Decomposing a graph into shortest paths with bounded eccentricity.

Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot

Discret. Appl. Math., 2020

2019

On the Minimum Eccentricity Isometric Cycle Problem.

Etienne Birmelé, Fabien de Montgolfier, Léo Planche

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2016

Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem.

Etienne Birmelé, Fabien de Montgolfier, Léo Planche

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Incremental Complexity of a Bi-objective Hypergraph Transversal Problem.

Ricardo Andrade, Etienne Birmelé, Arnaud Mary, Thomas Picchetti, Marie-France Sagot

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014

Overlapping Clustering Methods for Networks.

Pierre Latouche, Etienne Birmelé, Christophe Ambroise

Proceedings of the Handbook of Mixed Membership Models and Their Applications., 2014

Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure.

Paulo Vieira Milreu, Cecilia Coimbra Klein, Ludovic Cottret, Vicente Acuña, Etienne Birmelé, Michele Borassi, Christophe Junot, Alberto Marchetti-Spaccamela, Andrea Marino, Leen Stougie, Fabien Jourdan, Pierluigi Crescenzi, Vincent Lacroix, Marie-France Sagot

Bioinform., 2014

2013

Optimal Listing of Cycles and st-Paths in Undirected Graphs.

Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets.

Vicente Acuña, Etienne Birmelé, Ludovic Cottret, Pierluigi Crescenzi, Fabien Jourdan, Vincent Lacroix, Alberto Marchetti-Spaccamela, Andrea Marino, Paulo Vieira Milreu, Marie-France Sagot, Leen Stougie

Theor. Comput. Sci., 2012

Optimal Listing of Cycles and st-Paths in Undirected Graphs

Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot

CoRR, 2012

Efficient Bubble Enumeration in Directed Graphs.

Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot

Proceedings of the String Processing and Information Retrieval, 2012

2011

Analyse du nombre de perturbations lors du maintien d'un arbre de connexion de faible diamètre.

Etienne Birmelé, François Delbot, Christian Laforest, Nicolas Thibault

Tech. Sci. Informatiques, 2011

Etude structurelle des réseaux : modèles aléatoires, motifs et cycles.

Etienne Birmelé

, 2011

2010

Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms.

Paulo Vieira Milreu, Vicente Acuña, Etienne Birmelé, Pierluigi Crescenzi, Alberto Marchetti-Spaccamela, Marie-France Sagot, Leen Stougie, Vincent Lacroix

Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

2009

Mean analysis of an online algorithm for the vertex cover problem.

Etienne Birmelé, François Delbot, Christian Laforest

Inf. Process. Lett., 2009

Tree-width of graphs without a 3×3 grid minor.

Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed

Discret. Appl. Math., 2009

A scale-free graph model based on bipartite graphs.

Etienne Birmelé

Discret. Appl. Math., 2009

2008

Every longest circuit of a 3-connected, <i>K</i>_{3, 3}-minor free graph has a chord.

Etienne Birmelé

J. Graph Theory, 2008

Bayesian Methods for Graph Clustering.

Pierre Latouche, Etienne Birmelé, Christophe Ambroise

Proceedings of the Advances in Data Analysis, Data Handling and Business Intelligence, 2008

2007

The Erdös-Pósa Property For Long Circuits.

Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed

Comb., 2007

2006

Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree.

Stéphane Bessy, Frédéric Havet, Etienne Birmelé

J. Graph Theory, 2006

2003

Tree-width and circumference of graphs.

Etienne Birmelé

J. Graph Theory, 2003