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: Author="Nielsen, Frank"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the smallest enclosing information disk
Frank Nielsen
,
Richard Nock
Information Processing Letters
105
(3), 2007, pp. 93-97
Self-improved gaps almost everywhere for the agnostic approximation of monomials
Richard Nock
,
Frank Nielsen
Theoretical Computer Science
377
(1-3), 2007, pp. 139-150
A fast deterministic smallest enclosing disk approximation algorithm
Frank Nielsen
,
Richard Nock
Information Processing Letters
93
(6), 2005, pp. 263-268
On domain-partitioning induction criteria: Worst-case bounds for the worst-case based
Richard Nock
,
Frank Nielsen
Theoretical Computer Science
321
(2-3), 2004, pp. 371-382
Maintenance of a piercing set for intervals with applications
Matthew J. Katz
,
Frank Nielsen
,
Michael Segal
Algorithmica
36
(1), 2003, pp. 59-73
Combinatorial optimization algorithms for radio network planning
Patrice Calégari
,
Frédéric Guidec
,
Pierre Kuonen
,
Frank Nielsen
Theoretical Computer Science
263
(1-2), 2001, pp. 235-245
On point covers of
c
-oriented polygons
Frank Nielsen
Theoretical Computer Science
263
(1-2), 2001, pp. 17-29
Maintenance of a piercing set for intervals with applications
Matthew J. Katz
,
Frank Nielsen
,
Michael Segal
Lecture Notes in Computer Science
1969
, 2000, pp. 552-563
Fast stabbing of boxes in high dimensions
Frank Nielsen
Theoretical Computer Science
246
(1-2), 2000, pp. 53-72