-
The Multicolored Graph Realization Problem
We introduce the Multicolored Graph Realization problem (MGRP). The inpu...
03/24/2021 ∙ by Josep Diaz, et al. ∙
0
∙
share
read it
-
On List k-Coloring Convex Bipartite Graphs
List k-Coloring (Li k-Col) is the decision problem asking if a given gra...
02/07/2020 ∙ by Josep Diaz, et al. ∙
0
∙
share
read it
-
Algorithmically Efficient Syntactic Characterization of Possibility Domains
We call domain any arbitrary subset of a Cartesian power of the set {0,1...
01/01/2019 ∙ by Josep Diaz, et al. ∙
0
∙
share
read it
-
Learning random points from geometric graphs or orderings
Suppose that there is a family of n random points X_v for v ∈ V, indepen...
09/26/2018 ∙ by Josep Diaz, et al. ∙
0
∙
share
read it
-
Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions
The Maximal points in a set S are those that aren't dominated by any o...
07/18/2018 ∙ by Josep Diaz, et al. ∙
0
∙
share
read it
