#### Filter Results:

- Full text PDF available (82)

#### Publication Year

1985

2017

- This year (5)
- Last 5 years (39)
- Last 10 years (69)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Prosenjit Bose, Evangelos Kranakis, +4 authors Leszek Gasieniec
- ISAAC
- 2000

Consider a DAG (directed acyclic graph) G = (V; E) representing a collection V of web pages connected via links E. All web pages can be reached from a designated source page, represented by a source node s of G. Each web page carries a weight representative of the frequency with which it is visited. By adding hotlinks, at most one per page, we are… (More)

- Jurek Czyzowicz, Evangelos Kranakis, +6 authors Mohammadreza Yazdani
- ADHOC-NOW
- 2010

A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensors in arbitrary initial positions on the line (not necessarily inside I) and the sensing ranges of the sensors, we are interested in finding final positions of sensors which… (More)

- Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc
- Theor. Comput. Sci.
- 2006

Autonomous identical robots represented by unit discsmove deterministically in the plane. They do not have any common coordinate system, do not communicate, do not have memory of the past and are totally asynchronous. Gathering such robots means forming a configuration for which the union of all discs representing them is connected.We solve the gathering… (More)

- Jurek Czyzowicz, Evangelos Kranakis, +6 authors Mohammadreza Yazdani
- ADHOC-NOW
- 2009

We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the line. An intruder traversing the barrier can be detected only when it is within the sensing range of at least one sensor. The sensor network establishes barrier coverage of the… (More)

A set of k mobile agents are placed on the boundary of a simply connected planar object represented by a cycle of unit length. Each agent has its own predefined maximal speed, and is capable of moving around this boundary without exceeding its maximal speed. The agents are required to protect the boundary from an intruder which attempts to penetrate to the… (More)

- Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc
- Fundam. Inform.
- 2006

A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the task of locating a black hole in a (partially) synchronous network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents capable to… (More)

- Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia
- WADS
- 1991

- Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Mogiel V. Martin
- J. Web Eng.
- 2003

- Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Arnaud Labourel
- ICALP
- 2010

- Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia
- Int. J. Comput. Geometry Appl.
- 1999

Let shape P be any simply-connected set in the plane, bounded by a Jordan curve, that is not a circular disk. We say that a set of points I on the boundary of P immobilize the shape if any rigid motion of P in the plane causes at least one point of I to penetrate the interior of P. We prove that four points always suffice to immobilize any shape. For a… (More)