default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEtienne Birmelé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j13]Juliana Alves Pegoraro
, Sophie Lavault, Nicolas Wattiez, Thomas Similowski, Jésus Gonzalez-Bermejo, Etienne Birmelé:
Machine-learning based feature selection for a non-invasive breathing change detection. BioData Min. 14(1) (2021)- [j12]Magali Champion, Julien Chiquet, Pierre Neuvial, Mohamed Elati, François Radvanyi, Etienne Birmelé:
Identification of deregulation mechanisms specific to cancer subtypes. J. Bioinform. Comput. Biol. 19(1): 2140003:1-2140003:16 (2021) - 2020
- [j11]Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot:
Decomposing a graph into shortest paths with bounded eccentricity. Discret. Appl. Math. 284: 353-374 (2020)
2010 – 2019
- 2019
- [c8]Etienne Birmelé, Fabien de Montgolfier, Léo Planche:
On the Minimum Eccentricity Isometric Cycle Problem. LAGOS 2019: 159-169 - 2017
- [c7]Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot:
Decomposing a Graph into Shortest Paths with Bounded Eccentricity. ISAAC 2017: 15:1-15:13 - 2016
- [c6]Etienne Birmelé, Fabien de Montgolfier, Léo Planche:
Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem. COCOA 2016: 216-229 - [i3]Etienne Birmelé, Fabien de Montgolfier, Léo Planche:
Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem. CoRR abs/1609.04593 (2016) - 2015
- [c5]Ricardo Andrade, Etienne Birmelé, Arnaud Mary, Thomas Picchetti, Marie-France Sagot:
Incremental Complexity of a Bi-objective Hypergraph Transversal Problem. FCT 2015: 202-213 - [i2]Ricardo Andrade, Etienne Birmelé, Arnaud Mary, Thomas Picchetti, Marie-France Sagot:
Incremental complexity of a bi-objective hypergraph transversal problem. CoRR abs/1505.06025 (2015) - 2014
- [j10]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:
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. Bioinform. 30(1): 61-70 (2014) - [r1]Pierre Latouche, Etienne Birmelé, Christophe Ambroise:
Overlapping Clustering Methods for Networks. Handbook of Mixed Membership Models and Their Applications 2014: 547-567 - 2013
- [c4]Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto:
Optimal Listing of Cycles and st-Paths in Undirected Graphs. SODA 2013: 1884-1896 - 2012
- [j9]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:
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. Theor. Comput. Sci. 457: 1-9 (2012) - [c3]Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot:
Efficient Bubble Enumeration in Directed Graphs. SPIRE 2012: 118-129 - [i1]Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot:
Optimal Listing of Cycles and st-Paths in Undirected Graphs. CoRR abs/1205.2766 (2012) - 2011
- [b1]Etienne Birmelé:
Etude structurelle des réseaux : modèles aléatoires, motifs et cycles. University of Évry Val d'Essonne, France, 2011 - [j8]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. Tech. Sci. Informatiques 30(7): 781-808 (2011) - 2010
- [c2]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
2000 – 2009
- 2009
- [j7]Etienne Birmelé:
A scale-free graph model based on bipartite graphs. Discret. Appl. Math. 157(10): 2267-2284 (2009) - [j6]Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed:
Tree-width of graphs without a 3×3 grid minor. Discret. Appl. Math. 157(12): 2577-2596 (2009) - [j5]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
- [j4]Etienne Birmelé:
Every longest circuit of a 3-connected, K3, 3-minor free graph has a chord. J. Graph Theory 58(4): 293-298 (2008) - [c1]Pierre Latouche, Etienne Birmelé, Christophe Ambroise:
Bayesian Methods for Graph Clustering. GfKl 2008: 229-239 - 2007
- [j3]Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed:
The Erdös-Pósa Property For Long Circuits. Comb. 27(2): 135-145 (2007) - 2006
- [j2]Stéphane Bessy, Frédéric Havet, Etienne Birmelé:
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. J. Graph Theory 53(4): 315-332 (2006) - 2003
- [j1]Etienne Birmelé:
Tree-width and circumference of graphs. J. Graph Theory 43(1): 24-25 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
