36 citations · 61 across the 14 of their papers we have counts for
20 papers
The Multicolored Graph Realization Problem
Josep Díaz, Öznur Yaşar Diner, Maria Serna +1
We introduce the Multicolored Graph Realization problem (MGRP). The input to the problem is a colored graph , i.e., a graph together with a coloring on its vertices. We can…
On List k-Coloring Convex Bipartite Graphs
Josep Díaz, Öznur Yaşar Diner, Maria Serna +1
List k-Coloring (Li k-Col) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1,2,..,k…
Algorithmically Efficient Syntactic Characterization of Possibility Domains
Josep Díaz, Lefteris Kirousis, Sofia Kokonezi +1
In the field of Judgment Aggrgation, a domain, that is a subset of a Cartesian power of , is considered to reflect abstract rationality restrictions on vectors of two-valu…
Learning random points from geometric graphs or orderings
Josep Diaz, Colin McDiarmid, Dieter Mitsche
Suppose that there is a family of random points for , independently and uniformly distributed in the square of area .…
Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions
Josep Diaz, Mordecai Golin
The {\em Maximal} points in a set S are those that aren't {\em dominated} by any other point in S. Such points arise in multiple application settings in which they are called by a…
Optimizing the Social Cost of Congestion Games by Imposing Variable Delays
Josep Díaz, Ioannis Giotis, Lefteris Kirousis +2
We describe a new coordination mechanism for non-atomic congestion games that leads to a (selfish) social cost which is arbitrarily close to the non-selfish optimal. This mechanism…