Motivated by real-life situations in which exact input data is not available initially but can be
obtained at a cost, one can consider the model of computing with uncertainty where the …

In this paper, we introduce a new variant of the p-median facility location problem in which it
is assumed that the exact location of the potential facilities is unknown. Instead, each of the …

Considering the model of computing under uncertainty where element weights are uncertain
but can be obtained at a cost by query operations, we study the problem of identifying a …

Abstract This paper studies Minimum Spanning Trees under incomplete information
assuming that it is only known that vertices belong to some neighborhoods that are second …

In this paper, we deal with some variants of classical facility location problems on graphs in
which both the customers and the facilities belong to a non-necessarily convex …

In the dispersion problem for ordered intervals, the input is an ordered list of intervals on the
real line, and the task is to select one point from each interval, such that the ordering of …

In this paper, we propose F2-Bubbles, a set overlay visualization technique that addresses
overlap** artifacts and supports interactive editing with intelligent suggestions. The core of …

We consider a setting where we are given a graph G=(R, E), where R={R_1, ..., R_n\} is a set
of polygonal regions in the plane. Placing a point p_i inside each region R_i turns G into an …

The input to the distant representatives problem is a set of $ n $ objects in the plane and the
goal is to find a representative point from each object while maximizing the distance …

In this paper we study a natural special case of the Traveling Salesman Problem (TSP) with
point-locational-uncertainty which we will call the {\em adversarial TSP} problem (ATSP) …