30 citations · 157 across the 83 of their papers we have counts for
5 papers · 1 filter
Edge Degeneracy: Algorithmic and Structural Results
Stratis Limnios, Christophe Paul, Joanny Perret +1
We consider a cops and robber game where the cops are blocking edges of a graph, while the robber occupies its vertices. At each round of the game, the cops choose some set of edge…
k-apices of minor-closed graph classes. II. Parameterized algorithms
Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos
Let be a minor-closed graph class. We say that a graph is a -apex of if contains a set of at most vertices such that belongs…
A linear fixed parameter tractable algorithm for connected pathwidth
Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos
The graph parameter of pathwidth can be seen as a measure of the topological resemblance of a graph to a path. A popular definition of pathwidth is given in terms of node search wh…
Hcore-Init: Neural Network Initialization based on Graph Degeneracy
Stratis Limnios, George Dasoulas, Dimitrios M. Thilikos +1
Neural networks are the pinnacle of Artificial Intelligence, as in recent years we witnessed many novel architectures, learning and optimization techniques for deep learning. Capit…
A polynomial time algorithm to compute the connected tree-width of a series-parallel graph
Guillaume Mescoff, Christophe Paul, Dimitrios Thilikos
It is well known that the treewidth of a graph corresponds to the node search number where a team of cops is pursuing a robber that is lazy, visible and has the ability to move…