The following pages link to Etienne Birmelé (Q542475):
Displaying 22 items.
- Overlapping stochastic block models with application to the French political blogosphere (Q542476) (← links)
- Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets (Q714835) (← links)
- Decomposing a graph into shortest paths with bounded eccentricity (Q777405) (← links)
- (Q967300) (redirect page) (← links)
- Tree-width of graphs without a \(3\times 3\) grid minor (Q967302) (← links)
- Mean analysis of an online algorithm for the vertex cover problem (Q987781) (← links)
- A scale-free graph model based on bipartite graphs (Q1026182) (← links)
- Detecting local network motifs (Q1950844) (← links)
- Model selection in overlapping stochastic block models (Q2015159) (← links)
- On the minimum eccentricity isometric cycle problem (Q2132344) (← links)
- The Erdős-Pósa property for long circuits (Q2460617) (← links)
- Incremental Complexity of a Bi-objective Hypergraph Transversal Problem (Q2947881) (← links)
- Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem (Q2958315) (← links)
- Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree (Q3418196) (← links)
- (Q3424767) (← links)
- (Q3621238) (← links)
- Every longest circuit of a 3‐connected,<i>K</i><sub>3,3</sub>‐minor free graph has a chord (Q3630835) (← links)
- Tree-width and circumference of graphs (Q4808403) (← links)
- (Q5136231) (← links)
- Variational Bayesian inference and complexity control for stochastic block models (Q5193329) (← links)
- Optimal Listing of Cycles and st-Paths in Undirected Graphs (Q5741844) (← links)
- Causal mediation analysis in presence of multiple mediators uncausally related (Q6636019) (← links)
