Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Discrete Appl.~Math. AND Volume=109
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generalized self-approaching curves
Oswin Aichholzer
,
Franz Aurenhammer
,
Christian Icking
,
Rolf Klein
,
Elmar Langetepe
,
Günter Rote
Discrete Applied Mathematics
109
(1-2), 2001, pp. 3-24
Interval arithmetic yields efficient dynamic filters for computational geometry
Hervé Brönnimann
,
Christoph Burnikel
,
Sylvain Pion
Discrete Applied Mathematics
109
(1-2), 2001, pp. 25-47
On exclusion regions for optimal triangulations
R.L. (Scot) Drysdale
,
Scott McElfresh
,
Jack Scott Snoeyink
Discrete Applied Mathematics
109
(1-2), 2001, pp. 49-65
Sweeps, arrangements and signotopes
Stefan Felsner
,
Helmut Weil
Discrete Applied Mathematics
109
(1-2), 2001, pp. 67-94
Minimum convex partition of a constrained point set
Thomas Fevens
,
Henk Meijer
,
David Rappaport
Discrete Applied Mathematics
109
(1-2), 2001, pp. 95-107
Separating objects in the plane by wedges and strips
Ferran Hurtado
,
Marc Noy
,
Pedro A. Ramos
,
Carlos Seara
Discrete Applied Mathematics
109
(1-2), 2001, pp. 109-138
On bisectors for different distance functions
Christian Icking
,
Rolf Klein
,
Lihong Ma
,
Stefan Nickel
,
Ansgar Weiss̈ler
Discrete Applied Mathematics
109
(1-2), 2001, pp. 139-161
Ramsey-remainder for convex sets and the Erd\Hos-Szekeres theorem
Gyula Károlyi
Discrete Applied Mathematics
109
(1-2), 2001, pp. 163-175
A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions
Ulrich Kühn
Discrete Applied Mathematics
109
(1-2), 2001, pp. 177-196
Best reduction of the quadratic semi-assignment problem
Alain Billionnet
,
Sourour Elloumi
Discrete Applied Mathematics
109
(3), 2001, pp. 197-213
The pagenumber of
k
-trees is
O(k)
Joseph L. Ganley
,
Lenwood S. Heath
Discrete Applied Mathematics
109
(3), 2001, pp. 215-221
A generalization of maximal independent sets
Arun Jagota
,
Giri Narasimhan
,
L̑ubomír S̑oltés
Discrete Applied Mathematics
109
(3), 2001, pp. 223-235
k-p
-infix codes and semaphore codes
Dongyang Long
,
Weijia Jia
,
Jian Ma
,
Duanning Zhou
Discrete Applied Mathematics
109
(3), 2001, pp. 237-252
On the combinatorics of leftist trees
P. Nogueira
Discrete Applied Mathematics
109
(3), 2001, pp. 253-278
An asymmetric analogue of van der Veen conditions and the Traveling Salesman problem
Yoshiaki Oda
Discrete Applied Mathematics
109
(3), 2001, pp. 279-292
The
k
-centrum multi-facility location problem
Arie Tamir
Discrete Applied Mathematics
109
(3), 2001, pp. 293-307