Related papers: The Runaway Rectangle Escape Problem
In this paper, we study two extensions of the maximum bichromatic separating rectangle (MBSR) problem introduced in \cite{Armaselu-CCCG, Armaselu-arXiv}. One of the extensions, introduced in \cite{Armaselu-FWCG}, is called \textit{MBSR with…
A rectangle blanket is a set of non-overlapping axis-aligned rectangles, used to approximately represent the two dimensional image of a shape approximately. The use of a rectangle blanket is a widely considered strategy for speeding-up the…
We investigate a diffusive motion of a system of interacting Brownian particles in quasi-one-dimensional micropores. In particular, we consider a semi-infinite 1D geometry with a partially absorbing boundary and the hard-core inter-particle…
We study the replacement paths problem in the $\mathsf{CONGEST}$ model of distributed computing. Given an $s$-$t$ shortest path $P$, the goal is to compute, for every edge $e$ in $P$, the shortest-path distance from $s$ to $t$ avoiding $e$.…
The Traveling Tournament Problem (TTP) is a challenging combinatorial optimization problem that has attracted the interest of researchers around the world. This paper proposes an improved search neighbourhood for the TTP that has been…
Mobility-on-demand (MoD) ridesharing is a promising way to improve the occupancy rate of personal vehicles and reduce traffic congestion and emissions. Maximizing the number of passengers served and maximizing a profit target are major…
We study $N$-point rational distance sets ($\textrm{RDS}(N)$) on the parabola $y=x^2$. Previous approaches to the problem include efforts made using elliptic curves and diophantine chains, with successful analysis for $N\leq 4$. We extend…
We study the boundedness problem for unions of conjunctive regular path queries with inverses (UC2RPQs). This is the problem of, given a UC2RPQ, checking whether it is equivalent to a union of conjunctive queries (UCQ). We show the problem…
In this paper we develop an encounter-based model of a run-and-tumble particle (RTP) confined to a finite interval $[0,L]$ with partially absorbing, sticky boundaries at both ends. We assume that the particle switches between two constant…
We analyze the computational complexity of the following computational problems called Bounded-Density Edge Deletion and Bounded-Density Vertex Deletion: Given a graph $G$, a budget $k$ and a target density $\tau_\rho$, are there $k$ edges…
We investigate the Dispersive Art Gallery Problem with vertex guards and rectangular visibility ($r$-visibility) for a class of orthogonal polygons that reflect the properties of real-world floor plans: these office-like polygons consist of…
This paper investigates the problem of computing the shortest path between two states under resource constraints in environments with resource-replenishment regions. Namely, the length of the path is limited by a budget that can be restored…
An ill-posed problem of synthesis of the Pierce electrodes for a cylindrical beam with a polygonal cross-section is considered. It is assumed that a beam of charged particles is extracted from a space-charge-limited planar diode and the…
Two-dimensional random Lorentz gases with absorbing traps are considered in which a moving point particle undergoes elastic collisions on hard disks and annihilates when reaching a trap. In systems of finite spatial extension, the…
In the rectilinear Steiner arborescence problem the task is to build a shortest rectilinear Steiner tree connecting a given root and a set of terminals which are placed in the plane such that all root-terminal-paths are shortest paths. This…
We study the d-dimensional hypercube knapsack problem where we are given a set of d-dimensional hypercubes with associated profits, and a knapsack which is a unit d-dimensional hypercube. The goal is to find an axis-aligned non-overlapping…
For several combinatorial optimization problems over random structures, the theory of local weak convergence from probability and the cavity method from statistical physics can be used to deduce a recursive equation for the distribution of…
A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns…
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is…
We investigate the problem of partitioning a rectilinear polygon $P$ with $n$ vertices and no holes % with no holes into rectangles using disjoint line segments drawn inside $P$ under two optimality criteria. In the minimum ink partition,…