#### Filter Results:

- Full text PDF available (152)

#### Publication Year

1994

2018

- This year (12)
- Last 5 years (46)
- Last 10 years (107)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

In the Nearest Neighbor problem (NN), the objects in the database that are nearer to a given query object than any other objects in the database have to be found. In the conceptually inverse problem,â€¦ (More)

- Hugues Bersini, Marco Dorigo, Stefan Langerman, Gregory Seront, Luca Maria Gambardella
- International Conference on Evolutionaryâ€¦
- 1996

- Stefan Langerman, Pat Morin
- ESA
- 2002

An abstract NP-hard covering problem is presented and xed-parameter tractable algorithms for this problem are described. The running times of the algorithms are expressed in terms of threeâ€¦ (More)

- David Bremner, Erik D. Demaine, +4 authors Godfried T. Toussaint
- WADS
- 2003

Given a set R of red points and a set B of blue points, the nearest-neighbour decision rule classifies a new point q as red (respectively, blue) if the closest point to q in R âˆª B comes from Râ€¦ (More)

- David Bremner, Timothy M. Chan, +5 authors Perouz Taslakian
- Algorithmica
- 2006

We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alignment is measuredâ€¦ (More)

- Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin, Stefan Langerman, David R. Wood
- Electronic Notes in Discrete Mathematics
- 2008

To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertexâ€¦ (More)

- Boris Aronov, Prosenjit Bose, +4 authors Michiel H. M. Smid
- Algorithmica
- 2006

We consider preprocessing a set S of n points in convex position in the plane into a data structure supporting queries of the following form: given a point q and a directed lineÂ $$\ell $$ â„“ in theâ€¦ (More)

We study several coloring problems for geometric range-spaces. In addition to their theoretical interest, some of these problems arise in sensor networks. Given a set of points in R or R, we want toâ€¦ (More)

We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred by a customer, where theâ€¦ (More)

- Boris Aronov, Franz Aurenhammer, +4 authors Carlos Seara
- CCCG
- 2005

Given a set P of points in the plane, a set of points Q is a weak Îµ-net with respect to a family of sets S (e.g., rectangles, disks, or convex sets) if every set of S containing Îµ|P | points containsâ€¦ (More)