In this paper, we study a variant of hedonic games, called \textsc{Seat Arrangement}. The model is defined by a bijection from agents with preferences to vertices in a graph. The utility of an agent depends on the neighbors ...

Traditionally, systems supporting blended learning focus only on one portion of the course by tracing students’ interaction with learning content at home. In this paper, we argue that in-class activity can be also instrumental ...

We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with n nodes can be drawn on a n−−√ by n−−√ grid. We also show that testing whether a given rooted ...

Background: Glucose metabolism has been reported to be affected by dietary patterns, while the underlying mechanisms involved remain unclear. This study aimed to investigate the potential mediation role of circulating ...

Tipping elements are nonlinear subsystems of the Earth system that can potentially abruptly and irreversibly shift if environmental change occurs. Among these tipping elements is the Amazon rainforest, which is threatened ...

We study a natural variant of scheduling that we call partial scheduling: in this variant an instance of a scheduling problem along with an integer k is given and one seeks an optimal schedule where not all, but only k ...

Projection algorithms such as t-SNE or UMAP are useful for the visualization of high dimensional data, but depend on hyperparameters which must be tuned carefully. Unfortunately, iteratively recomputing projections to find ...

We introduce and study level-planar straight-line drawings with a fixed number λ of slopes. For proper level graphs (all edges connect vertices of adjacent levels), we give an O(nlog2n/loglogn) -time algorithm that either ...

Let be a set of n colored imprecise points, where each point is colored by one of k colors. Each imprecise point is specified by a unit disk in which the point lies. We study the problem of computing the smallest and the ...