1 citations · 1 across the 13 of their papers we have counts for
4 papers · 1 filter
Temporal Path Covers: Dilworth Properties and Parameterized Complexity
Lapo Cioni, Sotiris Kanellopoulos, Edouard Nemery +3
The Temporal Path Cover (TPC) and Temporally Disjoint Path Cover (TDPC) problems were introduced by [Chakraborty, Dailly, Foucaud, Klasing, MFCS '24] as the natural temporal analog…
Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset
Robert Ganian, Manolis Vasilakis, Simon Wietheger
Instance selection is a vital technique for mitigating the computational bottlenecks of nearest-neighbor classification in large-scale supervised clustering. A classical theoretica…
Faster Parameterized Broadcasting
Édouard Bonnet, Carl Feghali, Manolis Vasilakis
Given a connected graph and a source , what is the smallest number of rounds necessary for all vertices of to receive a message initially only held by , wher…
Parameterized Capacitated Vertex Cover Revisited
Michael Lampis, Manolis Vasilakis
Capacitated Vertex Cover is a generalization of Vertex Cover where we seek a set of vertices covering all edges, but with the added constraint that for each vertex we are given…