activity
20072018
most citedEvery longest circuit of a 3-connected, -minor free graph has a chord

6 citations · 16 across the 9 of their papers we have counts for

collaborators

10 papers

stat.ME2018★ 4 cited

Causal mediation analysis in presence of multiple mediators uncausally related

Allan Jerolon, Laura Baglietto, Etienne Birmele +2

Mediation analysis aims at disentangling the effects of a treatment on an outcome through alternative causal mechanisms and has become a popular practice in biomedical and social s…

cs.CC2016

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

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

The Minimum Eccentricity Shortest Path (MESP) Problem consists in determining a shortest path (a path whose length is the distance between its extremities) of minimum eccentricity…

cs.CC2015

Incremental complexity of a bi-objective hypergraph transversal problem

Ricardo Andrade, Etienne Birmelé, Arnaud Mary +2

The hypergraph transversal problem has been intensively studied, from both a theoretical and a practical point of view. In particular , its incremental complexity is known to be qu…

stat.AP2015★ 6 cited

A model for gene deregulation detection using expression data

Thomas Picchetti, Julien Chiquet, Mohamed Elati +3

In tumoral cells, gene regulation mechanisms are severely altered, and these modifications in the regulations may be characteristic of different subtypes of cancer. However, these…

stat.ME2014

Model Selection in Overlapping Stochastic Block Models

P. Latouche, E. Birmelé, C. Ambroise

Networks are a commonly used mathematical model to describe the rich set of interactions between objects of interest. Many clustering methods have been developed in order to partit…

cs.DS2012

Optimal Listing of Cycles and st-Paths in Undirected Graphs

Rui Ferreira, Roberto Grossi, Andrea Marino +3

We present the first optimal algorithm for the classical problem of listing all the cycles in an undirected graph. We exploit their properties so that the total cost is the time ta…

stat.AP2010

Detecting local network motifs

Etienne Birmele

Studying the topology of so-called real networks, that is networks obtained from sociological or biological data for instance, has become a major field of interest in the last deca…

stat.AP2009

Variational Bayesian Inference and Complexity Control for Stochastic Block Models

Pierre Latouche, Etienne Birmele, Christophe Ambroise

It is now widely accepted that knowledge can be acquired from networks by clustering their vertices according to connection profiles. Many methods have been proposed and in this pa…

stat.AP2009

Detection of network motifs by local concentration

Etienne Birmele

Studying the topology of so-called {\em real networks}, that is networks obtained from sociological or biological data for instance, has become a major field of interest in the las…

math.CO2007★ 6 cited

Every longest circuit of a 3-connected, -minor free graph has a chord

E. Birmelé

Carsten Thomassen conjectured that every longest circuit in a 3-connected graph has a chord. We prove the conjecture for graphs having no minor, and consequently for plan…