#### Filter Results:

- Full text PDF available (60)

#### Publication Year

1990

2017

- This year (2)
- Last five years (20)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ralf Klasing, Euripides Markou, Andrzej Pelc
- ISAAC
- 2006

We consider the problem of gathering identical, memoryless, mobile robots in one node of an anonymous unoriented ring. Robots start from different nodes of the ring. They operate in Look-Compute-Move cycles and have to end up in the same node. In one cycle, a robot takes a snapshot of the current configuration (Look), makes a decision to stay idle or to… (More)

- Ralf Klasing, Alfredo Navarra, Aris A. Papadopoulos, Stéphane Pérennes
- NETWORKING
- 2004

In this paper we present a new heuristic called Adaptive Broadcast Consumption (ABC for short) for the Minimum-Energy Broadcast Routing (MEBR) problem. We first investigate the problem trying to understand which are the main properties not taken into account by the classic and well–studied MST and BIP heuristics, then we propose a new algorithm proving that… (More)

- Jean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing
- Fourth Annual IEEE International Conference on…
- 2006

In this paper, we address the problem of gathering information in a central node of a radio network, where interference constraints are present. We take into account the fact that, when a node transmits, it produces interference in an area bigger than the area in which its message can actually be received. The network is modeled by a graph; a node is able… (More)

- Ralf Klasing, Nelson Morales, Stéphane Pérennes
- Theor. Comput. Sci.
- 2008

In this paper we define and study a call scheduling problem that is motivated by radio networks. In such networks the physical space is a common resource that nodes have to share, since concurrent transmissions cannot be interfering. We study how one can satisfy steady bandwidth demands according to this constraint. This leads to the definition of a call… (More)

- Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
- Inf. Process. Lett.
- 2000

- Juraj Hromkovi, Ralf Klasing, Burkhard Monien, Regine Peine
- 1996

PREFACE Considerable attention in recent theoretical computer science is devoted to parallel computing. Here, we would like to present a special part of this large topic, namely, the part devoted to an abstract study of the dissemination of information in interconnection networks. The importance of this research area lies in the fact that the ability of a… (More)

- Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger
- Texts in Theoretical Computer Science. An EATCS…
- 2005

- Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
- J. Parallel Distrib. Comput.
- 1991

We consider several graph embedding problems which have applications in parallel and distributed computing and which have been unsolved so far. Our major result is that the complete binary tree can be embedded into the square grid of the same size with almost optimal dilation (up to a very small factor). To achieve this, we rst state an embedding of the… (More)

- Ralf Klasing, Christian Laforest
- Inf. Process. Lett.
- 2004

- Michele Flammini, Ralf Klasing, Alfredo Navarra, Stéphane Pérennes
- Algorithmica
- 2004

In this paper we present new results on the performance of the Minimum Spanning Tree heuristic for the <i>Minimum-Energy Broadcast Routing</i> (MEBR) problem. We first prove that, for any number of dimensions <i>d</i> ≥ 2, the approximation ratio of the heuristic does not increase when the power attenuation coefficient α, that is the exponent to… (More)