![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Exploration of High-Dimensional Grids by Finite State Machines
We consider the problem of finding a “treasure” at an unknown point of an n-dimensional infinite grid, \(n\ge 3\) ...
-
Article
Weak Coverage of a Rectangular Barrier
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. Each sensor can monitor a circular area of specific diameter around its position, called the sensor diameter. ...
-
Article
Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs
We study the advice complexity of the online version of the Maximum Independent Set problem, restricted to the sparse, and bipartite graphs, respectively. We show that for sparse graphs, constant-sized advice ...
-
Article
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors
We consider the problem of monitoring the Euclidean plane using rotating sensors with detection sectors and beam sensors. We assume that intruders can appear anywhere at any time and move arbitrarily fast, and...
-
Article
On the page number of RNA secondary structures with pseudoknots
Let \({\mathcal {S}}\) denote the set of (possibly noncanonical) base pairs {i, j} of an RNA tertiary structure; i.e....
-
Article
Mobile Search for a Black Hole in an Anonymous Ring
In this paper we address the problem of mobile agents searching for a highly harmful item (called a black hole) in a ring network. The black hole is a stationary process that destroys visiting agents upon thei...
-
Article
Searching for a black hole in arbitrary networks: optimal mobile agents protocols
Consider a networked environment, supporting mobile agents, where there is a black hole: a harmful host that disposes of visiting agents upon their arrival, leaving no observable trace of such a destruction. T...
-
Article
Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults
We consider the problem of message (and bit) efficient broadcasting in complete networks with dynamic faults. Despite the simplicity of the setting, the problem turned out to be surprisingly interesting from ...