Etienne Birmelé

27 papers A* 1B 2C 4Journal 17Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Detection of COPD exacerbations with continuous monitoring of breathing rate and inspiratory amplitude under oxygen therapy. BMC Medical Informatics Decis. Mak. Juliana Alves Pegoraro, Antoine Guerder, Thomas Similowski, Philippe Salamitou, Jésus Gonzalez-Bermejo, Etienne Birmelé
2021	J	`jnl`	Identification of deregulation mechanisms specific to cancer subtypes. J. Bioinform. Comput. Biol. Magali Champion, Julien Chiquet, Pierre Neuvial, Mohamed Elati, François Radvanyi, Etienne Birmelé
2021	J	`jnl`	Machine-learning based feature selection for a non-invasive breathing change detection. BioData Min. Juliana Alves Pegoraro, Sophie Lavault, Nicolas Wattiez, Thomas Similowski, Jésus Gonzalez-Bermejo, Etienne Birmelé
2020	J	`jnl`	Decomposing a graph into shortest paths with bounded eccentricity. Discret. Appl. Math. Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot
2019	C	`conf`	On the Minimum Eccentricity Isometric Cycle Problem. LAGOS Etienne Birmelé, Fabien de Montgolfier, Léo Planche
2017	B	`conf`	Decomposing a Graph into Shortest Paths with Bounded Eccentricity. ISAAC Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot
2016	C	`conf`	Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem. COCOA Etienne Birmelé, Fabien de Montgolfier, Léo Planche
2016	J	`jnl`	Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem. CoRR Etienne Birmelé, Fabien de Montgolfier, Léo Planche
2015	B	`conf`	Incremental Complexity of a Bi-objective Hypergraph Transversal Problem. FCT Ricardo Andrade, Etienne Birmelé, Arnaud Mary, Thomas Picchetti, Marie-France Sagot
2015	J	`jnl`	Incremental complexity of a bi-objective hypergraph transversal problem. CoRR Ricardo Andrade, Etienne Birmelé, Arnaud Mary, Thomas Picchetti, Marie-France Sagot
2014	—	`ch.`	Overlapping Clustering Methods for Networks. Handbook of Mixed Membership Models and Their Applications Pierre Latouche, Etienne Birmelé, Christophe Ambroise
2014	J	`jnl`	Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. Bioinform. 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
2013	A*	`conf`	Optimal Listing of Cycles and st-Paths in Undirected Graphs. SODA Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto
2012	C	`conf`	Efficient Bubble Enumeration in Directed Graphs. SPIRE Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot
2012	J	`jnl`	Optimal Listing of Cycles and st-Paths in Undirected Graphs CoRR Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot
2012	J	`jnl`	Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. Theor. Comput. Sci. 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
2011	J	`jnl`	Analyse du nombre de perturbations lors du maintien d'un arbre de connexion de faible diamètre. Tech. Sci. Informatiques Etienne Birmelé, François Delbot, Christian Laforest, Nicolas Thibault
2011	—	`book`	Etude structurelle des réseaux : modèles aléatoires, motifs et cycles. Etienne Birmelé
2010	C	`conf`	Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms. WABI Paulo Vieira Milreu, Vicente Acuña, Etienne Birmelé, Pierluigi Crescenzi, Alberto Marchetti-Spaccamela, Marie-France Sagot, Leen Stougie, Vincent Lacroix
2009	J	`jnl`	A scale-free graph model based on bipartite graphs. Discret. Appl. Math. Etienne Birmelé
2009	J	`jnl`	Mean analysis of an online algorithm for the vertex cover problem. Inf. Process. Lett. Etienne Birmelé, François Delbot, Christian Laforest
2009	J	`jnl`	Tree-width of graphs without a 3×3 grid minor. Discret. Appl. Math. Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed
2008	—	`conf`	Bayesian Methods for Graph Clustering. GfKl Pierre Latouche, Etienne Birmelé, Christophe Ambroise
2008	J	`jnl`	Every longest circuit of a 3-connected, J. Graph Theory Etienne Birmelé
2007	J	`jnl`	The Erdös-Pósa Property For Long Circuits. Comb. Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed
2006	J	`jnl`	Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. J. Graph Theory Stéphane Bessy, Frédéric Havet, Etienne Birmelé
2003	J	`jnl`	Tree-width and circumference of graphs. J. Graph Theory Etienne Birmelé