| Publication | Date of Publication | Type |
|---|
Group Lasso based selection for high-dimensional mediation analysis
Statistics in Medicine | 2026-03-24 | Paper |
Causal mediation analysis in presence of multiple mediators uncausally related
The International Journal of Biostatistics | 2024-11-12 | Paper |
| On the minimum eccentricity isometric cycle problem | 2022-04-27 | Paper |
| Decomposing a graph into shortest paths with bounded eccentricity | 2020-11-25 | Paper |
Decomposing a graph into shortest paths with bounded eccentricity
Discrete Applied Mathematics | 2020-07-07 | Paper |
Variational Bayesian inference and complexity control for stochastic block models
Statistical Modelling | 2019-09-10 | Paper |
Optimal listing of cycles and \(st\)-paths in undirected graphs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Minimum eccentricity shortest path problem: an approximation algorithm and relation with the \(k\)-laminarity problem
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Incremental complexity of a bi-objective hypergraph transversal problem
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Model selection in overlapping stochastic block models
Electronic Journal of Statistics | 2014-06-23 | Paper |
Model selection in overlapping stochastic block models
Electronic Journal of Statistics | 2014-06-23 | Paper |
Detecting local network motifs
Electronic Journal of Statistics | 2013-05-28 | Paper |
Detecting local network motifs
Electronic Journal of Statistics | 2013-05-28 | Paper |
Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets
Theoretical Computer Science | 2012-10-11 | Paper |
Overlapping stochastic block models with application to the French political blogosphere
The Annals of Applied Statistics | 2011-06-10 | Paper |
Mean analysis of an online algorithm for the vertex cover problem
Information Processing Letters | 2010-08-16 | Paper |
Tree-width of graphs without a \(3\times 3\) grid minor
Discrete Applied Mathematics | 2010-04-28 | Paper |
A scale-free graph model based on bipartite graphs
Discrete Applied Mathematics | 2009-06-24 | Paper |
Every longest circuit of a 3‐connected,K3,3‐minor free graph has a chord
Journal of Graph Theory | 2009-06-04 | Paper |
| Network motifs: mean and variance for the count | 2009-04-15 | Paper |
The Erdős-Pósa property for long circuits
Combinatorica | 2007-11-12 | Paper |
| Brambles, prisms and grids | 2007-03-05 | Paper |
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
Journal of Graph Theory | 2007-02-02 | Paper |
Tree-width and circumference of graphs
Journal of Graph Theory | 2003-05-22 | Paper |
