#### Filter Results:

- Full text PDF available (62)

#### Publication Year

1973

2017

- This year (5)
- Last 5 years (47)
- Last 10 years (97)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

#### Organism

Learn More

- Pierre Fraigniaud, Marc Heinrich, Adrian Kosowski
- 2016 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 computing. More recently, it has also become a challenge in the framework of centralized local computation. We introduce conflict coloring as a general… (More)

- Adrian Kosowski, Michal Malafiejski, Tomasz Noinski
- ICWL
- 2007

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)

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

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 only local information, and so that some local equity (fairness) criterion is satisfied for the adjacent undirected edges. Such strategies can be seen as an… (More)

- Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner, Alfredo Navarra
- Networks
- 2009

Distributed Greedy Coloring is an interesting and intuitive variation of the standard Coloring problem. Given an order among the colors, a coloring is said to be greedy if there does not exist a vertex for which its associated color can be replaced by a color of lower position in the fixed order without violating the property that neighbouring vertices must… (More)

- Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti
- OPODIS
- 2009

The paper considers a team of robots which has to explore a graph G where some nodes can be harmful. Robots are initially located at the so called home base node. The dangerous nodes are the so called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that the minimum… (More)

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion… (More)

- Florent Becker, Adrian Kosowski, +4 authors Ioan Todinca
- Distributed Computing
- 2012

In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and links may indicate telephone calls). Since such graphs are massive they need to be processed in a distributed and streaming way. When computing graph theoretic properties, nodes… (More)

- Adrian Kosowski
- Discrete Applied Mathematics
- 2009

The rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node maintains a cyclic ordering of its outgoing arcs, and… (More)