Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
We study vertex-colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3-connected plane graph with n vert...
Research on virtual environments has provided insights into the experience of presence (or being there) and copresence (being there together). Several dimensions of this experienc...
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
— In this paper, we study coverage with connectivity properties in large wireless sensor networks. We consider three classes: full coverage with connectivity, partial coverage wi...