#### Filter Results:

- Full text PDF available (26)

#### Publication Year

2003

2019

- This year (8)
- Last 5 years (46)
- Last 10 years (105)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc
- Distributed Computing
- 2010

Two identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has beenâ€¦ (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â€¦ (More)

- Pierre Fraigniaud, Marc Heinrich, Adrian Kosowski
- IEEE 57th Annual Symposium on Foundations ofâ€¦
- 2016

Locally finding a solution to symmetry-breaking tasks such as vertex-coloring, edge-coloring, maximal matching, maximal independent set, etc., is a long-standing challenge in distributed networkâ€¦ (More)

- Colin S Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski
- Distributed Computing
- 2011

We consider the problem of exploring an anonymous undirected graph using an oblivious robot. The studied exploration strategies are designed so that the next edge in the robotâ€™s walk is chosen usingâ€¦ (More)

- Adrian Kosowski, Lukasz Kuszner
- ICAISC
- 2006

In the self-stabilizing model we consider a connected system of autonomous asynchronous nodes, each of which has only local information about the system. Regardless of the initial state, the systemâ€¦ (More)

- JÃ©rÃ©mie Chalopin, Shantanu Das, Adrian Kosowski
- OPODIS
- 2010

We study the problem of mapping an unknown environment represented as an unlabelled undirected graph. A robot (or automaton) starting at a single vertex of the graph G has to traverse the graph andâ€¦ (More)

We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse anâ€¦ (More)

- Ralf Klasing, Adrian Kosowski, Alfredo Navarra
- OPODIS
- 2008

- Adrian Kosowski, Laurent Viennot
- SODA
- 2017

The goal of a hub-based distance labeling scheme for a network G = (V,E) is to assign a small subset S(u) âŠ† V to each node u âˆˆ V , in such a way that for any pair of nodes u, v, the intersection ofâ€¦ (More)

- Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
- PODC
- 2013

The <i>rotor-router mechanism</i> was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, an agent is initially placed at one of the nodes of the graph.â€¦ (More)