54 citations · 152 across the 16 of their papers we have counts for
4 papers · 1 filter
Parameterized and Approximation Complexity of Partial VC Dimension
Cristina Bazgan, Florent Foucaud, Florian Sikora
We introduce the problem Partial VC Dimension that asks, given a hypergraph and integers and , whether one can select a set of vertices of $H…
Finding Disjoint Paths on Edge-Colored Graphs: More Tractability Results
Riccardo Dondi, Florian Sikora
The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph (called MaxCDP) has been recently introduced in literature, motivated by appli…
Parameterized Complexity and Approximation Issues for the Colorful Components Problems
Riccardo Dondi, Florian Sikora
The quest for colorful components (connected components where each color is associated with at most one vertex) inside a vertex-colored graph has been widely considered in the last…
A note on Edge Isoperimetric Numbers and Regular Graphs
Edouard Bonnet, Florian Sikora
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It shows an equivalence between regular graphs and graphs for which a sequence of in…