For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudak...
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
Tinaz Ekim, Pavol Hell, Juraj Stacho, Dominique de...
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...