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=J. Algorithms AND Volume=53
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Detecting tetrahedralizations of a set of line segments
Boting Yang
,
Cao An Wang
Journal of Algorithms
53
(1), 2004, pp. 1-35
Inverse parametric sequence alignment
Fangting Sun
,
David Fernández-Baca
,
Wei Yu
Journal of Algorithms
53
(1), 2004, pp. 36-54
Approximation algorithms for partial covering problems
Rajiv Gandhi
,
Samir Khuller
,
Aravind Srinivasan
Journal of Algorithms
53
(1), 2004, pp. 55-84
Distance labeling in graphs
Cyril Gavoille
,
David Peleg
,
Stéphane Pérennes
,
Ran Raz
Journal of Algorithms
53
(1), 2004, pp. 85-112
A locality-preserving cache-oblivious dynamic dictionary
Michael A. Bender
,
Ziyang Duan
,
John Iacono
,
Jing Wu
Journal of Algorithms
53
(2), 2004, pp. 115-136
Analysis of queueing policies in QoS switches
An Zhu
Journal of Algorithms
53
(2), 2004, pp. 137-168
MAX CUT in cubic graphs
Eran Halperin
,
Dror Livnat
,
Uri Zwick
Journal of Algorithms
53
(2), 2004, pp. 169-185
On external-memory MST, SSSP and multi-way planar graph separation
Lars Arge
,
Gerth Stlting Brodal
,
Laura Toma
Journal of Algorithms
53
(2), 2004, pp. 186-206