Platforms of Rydberg atoms have been proposed as promising candidates to solve some
combinatorial optimization problems. Here we compute quantitative requirements on the …

Rydberg atom arrays operated by a quantum adiabatic principle are among the most
promising quantum simulating platforms due to their scalability and long coherence time …

We consider the problem of efficient packet dissemination in wireless networks with point-to-
multi-point wireless broadcast channels. We propose a dynamic policy, which achieves the …

We consider special cases of,,, and problems for axis-parallel squares and axis-parallel
rectangles in the plane, where the objects are intersecting an, or equivalently a. We prove …

Maximum independent set from a given set D of unit disks intersecting a horizontal line can
be solved in O (n 2) time and O (n 2) space. As a corollary, we design a factor 2 …

Graph structure is widely used to describe problems in different fields. Problems in many
areas, such as security and transportation, are among them. The problems can be solved …

In the problem of minimum connected dominating set with routing cost constraint, we are
given a graph G=(V, E) and a positive integer α, and the goal is to find the smallest …

Optimal placement of charging stations in a workspace is a crucial problem to address, for
efficient operation of battery-driven mobile robots. When the battery charge of a robot …

We consider the maximum (weight) independent set problem in unit disk graphs. The high
complexity of the existing polynomial-time approximation schemes motivated the …

The way in which a graph is described visually is crucial for the understanding and analysis
of its structure. In this study we explore how different drawing layouts affect our perception of …