66 citations · 206 across the 36 of their papers we have counts for
50 papers
Making the Most of Parallel Composition in Differential Privacy
Josh Smith, Hassan Jameel Asghar, Gianpaolo Gioiosa +3
We show that the `optimal' use of the parallel composition theorem corresponds to finding the size of the largest subset of queries that `overlap' on the data domain, a quantity we…
From Matching with Diversity Constraints to Matching with Regional Quotas
Haris Aziz, Serge Gaspers, Zhaohong Sun +1
In the past few years, several new matching models have been proposed and studied that take into account complex distributional constraints. Relevant lines of work include (1) scho…
Enumeration of Preferred Extensions in Almost Oriented Digraphs
Serge Gaspers, Ray Li
In this paper, we present enumeration algorithms to list all preferred extensions of an argumentation framework. This task is equivalent to enumerating all maximal semikernels of a…
Cluster Editing with Vertex Splitting
Faisal N. Abu-Khzam, Emmanuel Arrighi, Matthias Bentert +7
Cluster Editing, also known as Correlation Clustering, is a well-studied graph modification problem. In this problem, one is given a graph and the task is to perform up to edge…
Minimizing and Computing the Inverse Geodesic Length on Trees
Serge Gaspers, Joshua Lau
For any fixed measure that maps graphs to real numbers, the MinH problem is defined as follows: given a graph , an integer , and a target , is there a set of v…
-Free Graphs are 4-Colorable
Serge Gaspers, Shenwei Huang
In this paper, we show that every -free graph is 4-colorable. The bound is attained by the five-wheel and the complement of the seven-cycle. This answers an open questi…