#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1993

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc
- Algorithmica
- 2003

Two mobile agents having distinct identifiers and located in nodes of an unknown anonymous connected graph, have to meet at some node of the graph. We seek fast deterministic algorithms for this rendezvous problem, under two scenarios: simultaneous startup, when both agents start executing the algorithm at the same time, and arbitrary startup, when starting… (More)

- Anders Dessmark, Andrzej Pelc
- ESA
- 2002

A robot has to visit all nodes and traverse all edges of an unknown undirected connected graph, using as few edge traversals as possible. The quality of an exploration algorithm A is measured by comparing its cost (number of edge traversals) to that of the optimal algorithm having full knowledge of the graph. The ratio between these costs, maximized over… (More)

- Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
- Int. J. Found. Comput. Sci.
- 2006

We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number of edges within the clusters is maximized (Max-ECP), or the number of edges between clusters is minimized (Min-ECP). These problems arise naturally in the DNA clone… (More)

- Anders Dessmark, Andrzej Lingas, Anil Maheshwari
- STACS
- 1993

- Anders Dessmark, Andrzej Pelc
- SPAA
- 2001

We consider deterministic broadcasting in <i>geometric radio networks</i> (GRN) whose nodes know only a limited part of the network Nodes of a GRN are situated in the plane and each of them is equipped with a transmitter of some range <i>r</i>. A signal from this node can reach all nodes at distance at most <i>r</i> from it but if a node is situated within… (More)

- Anders Dessmark, Andrzej Pelc
- Networks
- 2001

We consider distributed deterministic broadcasting in synchronous radio networks. A node receives a message in a given round if and only if exactly one of its neighbors transmits. The source message has to reach all nodes. We assume that nodes do not know the network topology or even their immediate neighborhood. (Such networks are called ad hoc.) We are… (More)

- Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
- Algorithmica
- 2000

The problem of determining whether a k -connected partial k -tree is isomorphic to a subgraph of another partial k -tree is shown to be solvable in time O(n k+2 ) . The presented time-bounds considerably improve the corresponding bounds known in the literature. They rely in part on a new characterization of width-k tree-decomposition of k -connected partial… (More)

- Anders Dessmark, Andrzej Lingas, Oscar Garrido
- MFCS
- 1994

- Anders Dessmark, Klaus Jansen, Andrzej Lingas
- ISAAC
- 1993