- 10
- 6
- 6
- 4
- 4
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
Etienne Birmele
46
Documents
Publications
- 9
- 8
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 21
- 15
- 5
- 4
- 1
- 4
- 2
|
Identification of deregulated transcription factors involved in subtypes of cancersProceedings of the 12th International Conference on Bioinformatics and Computational Biology, Mar 2020, SAN FRANCISCO, United States. pp.1--10, ⟨10.29007/v7qj⟩
Communication dans un congrès
hal-01516892v2
|
Decomposing a Graph into Shortest Paths with Bounded Eccentricity28th International Symposium on Algorithms and Computation (ISAAC 2017), Dec 2017, Phuket, Thailand. ⟨10.4230/LIPIcs.ISAAC.2017.15⟩
Communication dans un congrès
hal-01671718v1
|
|
|
Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity ProblemCOCOA 2016, Combinatorial Optimization and Applications - 10th International Conference, Dec 2016, Hong Kong, China. pp.216 - 229, ⟨10.1007/978-3-319-48749-6_16⟩
Communication dans un congrès
hal-01424469v1
|
|
Incremental complexity of a bi-objective hypergraph transversal problemFundamentals of Computation Theory (FCT2015), Aug 2015, Gdansk, Poland. pp.202-213, ⟨10.1007/978-3-319-22177-9_16⟩
Communication dans un congrès
hal-01149392v1
|
Optimal Listing of Cycles and st-Paths in Undirected Graphs24th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2013, New Orleans, United States
Communication dans un congrès
hal-00751345v1
|
|
|
Efficient Bubble Enumeration in Directed GraphsString Processing and Information Retrieval (SPIRE), Oct 2012, Cartagena, Colombia. pp.118-129, ⟨10.1007/978-3-642-34109-0_13⟩
Communication dans un congrès
hal-00738927v1
|
NeMo: Fast Count and Statistical Significance of Network MotifsMARAMI 2011 : 2. Conférence sur les Modèles et l'Analyse des Réseaux : Approches Mathématiques et Informatique, Oct 2011, Grenoble, France. n.p
Communication dans un congrès
hal-00999907v1
|
|
Telling StoriesICALP 2011 satellite workshop: Graph Algorithms and Applications (GA), 2011, Zurich, Switzerland. ⟨10.1016/j.tcs.2012.07.023⟩
Communication dans un congrès
hal-00748788v1
|
|
NeMo: Fast Count of Network MotifsJournées Ouvertes Biologie Informatique Mathématiques (JOBIM), Jun 2011, Paris, France. pp.53-60
Communication dans un congrès
hal-01000038v1
|
|
|
Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and AlgorithmsWorkshop on Algorithms in Bioinformatics (WABI), Sep 2010, Liverpool, United Kingdom. pp.226-237, ⟨10.1007/978-3-642-15294-8_19⟩
Communication dans un congrès
hal-00751339v1
|
|
Modèles de graphe aléatoire à classes chevauchantes pour l'analyse des réseaux42èmes Journées de Statistique, 2010, Marseille, France, France
Communication dans un congrès
inria-00494820v1
|
|
Uncovering overlapping clusters in biological networksJournées Ouvertes en Biologie, Informatique et Mathématiques (JOBIM), Jun 2009, Nantes, France. pp.28
Communication dans un congrès
hal-00629321v1
|
|
A latent logistic model to uncover overlapping clusters in networksAtelier AGS (Apprentissage et Graphes pour les Systèmes complexes), May 2009, Hammamet, Tunisia. pp.3-8
Communication dans un congrès
hal-00629310v1
|
|
Overlapping clustering methods for networksEdoardo M. Airoldi, David Blei, Elena A. Erosheva, Stephen E. Fienberg. Chapman and Hall/CRC. Handbook of Mixed Membership Models and Their Applications, Chapman and Hall/CRC, in press, 2014
Chapitre d'ouvrage
hal-00984395v1
|
|
Bayesian methods for graph clusteringAndreas Fink, Berthold Lausen, Wilfried Seidel and Alfred Ultsch. Advances in Data Analysis, Data Handling and Business Intelligence, Springer, pp.229-239, 2009, Studies in Classification, Data Analysis, and Knowledge Organization, 978-3-642-01043-9. ⟨10.1007/978-3-642-01044-6⟩
Chapitre d'ouvrage
hal-00629294v1
|
Brambles, prisms and gridsGraph Theory in Paris - Proceedings of a Conference in Memory of Claude Berge, Birkhauser, pp.37-44, 2007
Chapitre d'ouvrage
hal-00730790v1
|
Consensus gene modules strategy identifies candidate blood-based biomarkers for primary Sjogren's disease2023
Pré-publication, Document de travail
pasteur-04250559v1
|
|
|
ENUMERATING SETS OF GENOMIC ALTERATIONS CHARACTERIZING A USER-DEFINED SUBGROUP2021
Pré-publication, Document de travail
hal-03174404v1
|
Causal mediation analysis in presence of multiple mediators uncausally related2018
Pré-publication, Document de travail
hal-01879552v1
|
|
|
Decomposing a Graph into Shortest Paths with Bounded Eccentricity2017
Pré-publication, Document de travail
hal-01511357v2
|
|
Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem2016
Pré-publication, Document de travail
hal-01366782v1
|
|
Choose Outsiders First: a mean 2-approximation random algorithm for covering problems.2012
Pré-publication, Document de travail
hal-00726287v1
|
|
Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree[Research Report] RR-5364, INRIA. 2004, pp.20
Rapport
inria-00070639v1
|
|
Etude structurelle des réseaux : modèles aléatoires, motifs et cycles.Bio-informatique [q-bio.QM]. Université d'Evry-Val d'Essonne, 2011
HDR
tel-00750375v1
|