1 citations · 2 across the 3 of their papers we have counts for
3 papers
A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees
Lars Jaffke, Paloma T. de Lima, Wojciech Nadara +1
Computing bounded depth decompositions is a bottleneck in many applications of the treedepth parameter. The fastest known algorithm, which is due to Reidl, Rossmanith, Sánchez Vill…
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves
Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach +1
For a given graph , a depth-first search (DFS) tree of is an -rooted spanning tree such that every edge of is either an edge of or is between a \textit{descen…
Prediction of Facebook Post Metrics using Machine Learning
Emmanuel Sam, Sergey Yarushev, Sebastián Basterrech +1
In this short paper, we evaluate the performance of three well-known Machine Learning techniques for predicting the impact of a post in Facebook. Social medias have a huge influenc…