Skip to main content

11 Result(s)

within Jaroslav Opatrny Remove this filter Theory of Computation Remove this filter

and

  1. No Access

    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\) ...

    Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov in Algorithmica (2024)

  2. No Access

    Chapter and Conference Paper

    Graph Exploration by Energy-Sharing Mobile Agents

    We consider the problem of collective exploration of a known n-node edge-weighted graph by k mobile agents that have limited energy but are capable of energy transfers. The agents are initially placed at an arbit...

    Jurek Czyzowicz, Stefan Dobrev, Ryan Killick… in Structural Information and Communication C… (2021)

  3. No Access

    Chapter and Conference Paper

    The Bike Sharing Problem

    Assume that \(m \ge 1\) m ≥

    Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick… in WALCOM: Algorithms and Computation (2021)

  4. No Access

    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. ...

    Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Maňuch… in Algorithmica (2020)

  5. No Access

    Article

    Search on a line with faulty robots

    We consider the problem of searching on a line using n mobile robots, of which at most f are faulty, and the remaining are reliable. The robots start at the same location and move in parallel along the line with ...

    Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan… in Distributed Computing (2019)

  6. No Access

    Article

    Distributed algorithms for barrier coverage using relocatable sensors

    We study the barrier coverage problem using relocatable sensor nodes. We assume each sensor can sense an intruder or event inside its sensing range. Sensors are initially located at arbitrary positions on the ...

    Mohsen Eftekhari, Evangelos Kranakis, Danny Krizanc… in Distributed Computing (2016)

  7. No Access

    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...

    Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny in Theory of Computing Systems (2014)

  8. No Access

    Chapter and Conference Paper

    A Hybrid Ant-Colony Routing Algorithm for Mobile Ad-Hoc Networks

    The dynamic nature of mobile ad hoc networks makes it difficult to consider a specific model for their topology which might change in a short period of time. Using the knowledge about the location of nodes, se...

    Shahab Kamali, Jaroslav Opatrny in Complex Sciences (2009)

  9. No Access

    Chapter and Conference Paper

    Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges

    We give an algorithm for constructing a connected spanning subgraphs(panner) of a wireless network modelled as a unit disk graph with nodes of irregular transmission ranges, whereby for some parameter 0 < r ≤ 1 t...

    Edgar Chávez, Stefan Dobrev, Evangelos Kranakis… in LATIN 2006: Theoretical Informatics (2006)

  10. No Access

    Chapter and Conference Paper

    Uniform Multi-hop All-to-All Optical Routings in Rings

    We consider all-to-all routing problem in an optical ring network that uses the wavelength-division multiplexing (WDM). Since one-hop, all-to-all optical routing in a WDM optical ring of n nodes needs ...

    Jaroslav Opatrny in LATIN 2000: Theoretical Informatics (2000)

  11. No Access

    Chapter and Conference Paper

    Optical Routing of Uniform Instances in Tori

    We consider the problem of routing uniform communication instances in switched optical tori that use the wavelength division multplexing (or WDM) approach. A communication instance is called uniform if it consist...

    Francesc Comellas, Margarida Mitjana… in Mathematical Foundations of Computer Scien… (2000)