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: Series=LNCS AND Volume=621
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Testing superperfection of
k
-trees
T. Kloks
,
H. Bodlaender
Lecture Notes in Computer Science
621
, 1992, pp. 292-303
Parametric problems on graphs of bounded tree-width
David Fernández-Baca
,
Giora Slutzki
Lecture Notes in Computer Science
621
, 1992, pp. 304-316
Improvements on geometric pattern matching problems
L. Paul Chew
,
Klara Kedem
Lecture Notes in Computer Science
621
, 1992, pp. 318-325
Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
Deborah Joseph
,
Joao Meidanis
,
Prasoon Tiwari
Lecture Notes in Computer Science
621
, 1992, pp. 326-337
New results on linear programming and related problems
Emo Welzl
Lecture Notes in Computer Science
621
, 1992, pp. 338-339
Dynamic closest pairs - A probabilistic approach
Mordecai J. Golin
Lecture Notes in Computer Science
621
, 1992, pp. 340-351
Two- and three-dimensional point location in rectangular subdivisions
Mark de Berg
,
Marc van Kreveld
,
Jack Snoeyink
Lecture Notes in Computer Science
621
, 1992, pp. 352-363
Decomposing the boundary of a nonconvex polyhedron
Bernard Chazelle
,
Leonidas Palios
Lecture Notes in Computer Science
621
, 1992, pp. 364-375
Convex polygons made from few lines and convex decompositions of polyhedra
John Hershberger
,
Jack Snoeyink
Lecture Notes in Computer Science
621
, 1992, pp. 376-387
Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
Hans-Peter Lenhof
,
Michiel Smid
Lecture Notes in Computer Science
621
, 1992, pp. 388-398
Voronoi diagrams of moving points in higher dimensional spaces
Gerhard Albers
,
Thomas Roos
Lecture Notes in Computer Science
621
, 1992, pp. 399-409
Sorting multisets stably in minimum space
Jyrki Katajainen
,
Tomi Pasanen
Lecture Notes in Computer Science
621
, 1992, pp. 410-421
A framework for adaptive sorting
Ola Petersson
,
Alistair Moffat
Lecture Notes in Computer Science
621
, 1992, pp. 422-433
Seiten
<
1
2