146 citations
- Université Paris Dauphine-PSLFR65 papers
- Centre National de la Recherche ScientifiqueFR52 papers
- Université Paris Sciences et LettresFR27 papers
- University of LuxembourgLU9 papers
- École Nationale de l’Aviation CivileFR6 papers
- Institut Universitaire de FranceFR6 papers
- Laboratoire d'Intégration des Systèmes et des TechnologiesFR5 papers
- AGH University of KrakowPL4 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR4 papers
- Hungarian Academy of SciencesHU4 papers
- Korea Advanced Institute of Science and TechnologyKR4 papers
- Laboratoire des Sciences pour la Conception, l'Optimisation et la ProductionFR4 papers
4 papers · 2 filters
Data-compression for Parametrized Counting Problems on Sparse graphs
Eun Jung Kim, Maria Serna, Dimitrios M. Thilikos
We study the concept of \emph{compactor}, which may be seen as a counting-analogue of kernelization in counting parameterized complexity. For a function and a pa…
Covering with Clubs: Complexity and Approximability
Riccardo Dondi, Giancarlo Mauri, Florian Sikora +1
Finding cohesive subgraphs in a network is a well-known problem in graph theory. Several alternative formulations of cohesive subgraph have been proposed, a notable example being $…
Graph-based Clustering under Differential Privacy
Rafael Pinot, Anne Morvan, Florian Yger +2
In this paper, we present the first differentially private clustering method for arbitrary-shaped node clusters in a graph. This algorithm takes as input only an approximate Minimu…
Parameterized Power Vertex Cover
Eric Angel, Evripidis Bampis, Bruno Escoffier +1
We study a recently introduced generalization of the Vertex Cover (VC) problem, called Power Vertex Cover (PVC). In this problem, each edge of the input graph is supplied with a po…