#### Filter Results:

- Full text PDF available (37)

#### Publication Year

2002

2017

- This year (8)
- Last 5 years (20)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
- ICALP
- 2003

Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct communication, no memory of the past, deterministic) moving freely in the plane and able to sense the positions of the other robots. We study the primitive task of gathering them at a point not… (More)

- Mark Cieliebak
- LATIN
- 2004

We study the Gathering Problem, where we want to gather a set of n autonomous mobile robots at a point in the plane. This point is not fixed in advance. The robots are very weak, in the sense that they have no common coordinate system, no identities, no central coordination, no means of direct communication, and no synchronization. Each robot can only sense… (More)

- Mark Cieliebak, Giuseppe Prencipe
- SIROCCO
- 2002

We study the problem of coordinating a set of autonomous mobile robots that can freely move in a two-dimensional plane; in particular, we want them to gather at a point not fixed in advance (GATHERING PROBLEM). We introduce a model of weak robots (decentralized, asynchronous, no common knowledge, no identities, no central coordination, no direct… (More)

- Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
- SIAM J. Comput.
- 2012

Consider a set of n > 2 identical mobile computational entities in the plane, called robots, operating in Look-Compute-Move cycles, without any means of direct communication. The Gathering Problem is the primitive task of all entities gathering in finite time at a point not fixed in advance, without any external control. The problem has been extensively… (More)

- Mark Cieliebak, Stephan Eidenbenz, Paolo Penna
- WABI
- 2003

The problem to find the coordinates of n points on a line such that the pairwise distances of the points form a given multi-set of n 2 distances is known as Partial Digest problem, which occurs for instance in DNA physical mapping and de novo sequencing of proteins. Although Partial Digest was – as a combinatorial problem – already proposed in the 1930’s,… (More)

- Mark Cieliebak, Stephan Eidenbenz
- LATIN
- 2004

The Partial Digest problem asks for the coordinates of m points on a line such that the pairwise distances of the points form a given

- Luzi Anderegg, Mark Cieliebak, Giuseppe Prencipe
- ICTCS
- 2005

A set of n points in the plane is in equiangular configuration if there exist a center and an ordering of the points such that the angle of each two adjacent points w.r.t. the center is 360 ◦ n , i.e., if all angles between adjacent points are equal. We show that there is at most one center of equiangularity, and we give a linear time algorithm that decides… (More)

- Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger
- COCOON
- 2003

We revisit the double digest problem, which occurs in sequencing of large DNA strings and consists of reconstructing the relative positions of cut sites from two different enzymes: we rst show that double digest is strongly NP-complete, improving previous results that only showed weak NP-completeness. Even the (experimentally more meaningful) variation in… (More)

- Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis, Konrad Schlude
- Nord. J. Comput.
- 2008

The Equal Sum Subsets problem, where we are given a set of positive integers and we ask for two nonempty disjoint subsets such that their elements add up to the same total, is known to be NP-hard. In this paper we give (pseudo-)polynomial algorithms and/or (strong) NP-hardness proofs for several natural variations of Equal Sum Subsets. Among others we… (More)

- Jonas Grossmann, Franz F. Roos, +5 authors Sacha Baginsky
- Journal of proteome research
- 2005

We present AUDENS, a new platform-independent open source tool for automated de novo sequencing of peptides from MS/MS data. We implemented a dynamic programming algorithm and combined it with a flexible preprocessing module which is designed to distinguish between signal and other peaks. By applying a user-defined set of heuristics, AUDENS screens through… (More)