Related papers: Beyond Level Planarity
We study Clustered Planarity with Linear Saturators, which is the problem of augmenting an $n$-vertex planar graph whose vertices are partitioned into independent sets (called clusters) with paths - one for each cluster - that connect all…
Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…
Covering all edges of a graph by a small number of vertices, this is the NP-complete Vertex Cover problem. It is among the most fundamental graph-algorithmic problems. Following a recent trend in studying temporal graphs (a sequence of…
We introduce a new bilevel version of the classic shortest path problem and completely characterize its computational complexity with respect to several problem variants. In our problem, the leader and the follower each control a subset of…
A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…
S. Blank solved the question of classifying immersed circles in $\mathbb{R}^{2}$ that extend to immersed disks, and how many topologically inequivalent disks can be extended. The quetions of various cases in $2$-dimension have already been…
Graph packing and partitioning problems have been studied in many contexts, including from the algorithmic complexity perspective. Consider the packing problem of determining whether a graph contains a spanning tree and a cycle that do not…
First we characterize all the polynomial vector fields in $\R^4$ which have the Clifford torus as an invariant surface. After we study the number of invariant meridians and parallels that such polynomial vector fields can have in function…
Graph-level representations are crucial tools for characterising structural differences between graphs. However, comparing graphs with different cardinalities, even when sampled from the same underlying distribution, remains challenging.…
We study the solvability of a class of fully nonlinear equations on the flat torus. The equations arise in the study of some Calabi-Yau type problems in torus bundles.
When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings? This problem generalizes the classic theory of…
Recent research revealed the existence of gaps in the complexity landscape of locally checkable labeling (LCL) problems in the LOCAL model of distributed computing. For example, the deterministic round complexity of any LCL problem on…
The Generalized Sliding-Tile Puzzle (GSTP), allowing many square tiles on a board to move in parallel while enforcing natural geometric collision constraints on the movement of neighboring tiles, provide a high-fidelity mathematical model…
Temporal graphs are graphs with time-stamped edges. We study the problem of finding a small vertex set (the separator) with respect to two designated terminal vertices such that the removal of the set eliminates all temporal paths…
We count tilings of the $n \times m$ rectangular grid, cylinder, and torus with arbitrary tile sets up to arbitrary symmetries of the square and rectangle, along with cyclic shifting of rows and columns. This provides a unifying framework…
We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…
Consider a smooth complex surface $X$ which is a double cover of the projective plane $\mathbb{P}^2$ branched along a smooth curve of degree $2s$. In this article, we study the geometric conditions which are equivalent to the existence of…
Given two independent sets $I, J$ of a graph $G$, and imagine that a token (coin) is placed at each vertex of $I$. The Sliding Token problem asks if one could transform $I$ to $J$ via a sequence of elementary steps, where each step requires…
There exists a variety of coloring problems for plane graphs, involving vertices, edges, and faces in all possible combinations. For instance, in the \emph{entire coloring} of a plane graph we are to color these three sets so that any pair…
Smooth complex surfaces polarized with an ample and globally generated line bundle of degree three and four, such that the adjoint bundle is not globally generated, are considered. Scrolls of a vector bundle over a smooth curve are shown to…