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=Algorithmica AND Volume=35
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The data broadcast problem with non-uniform transmission times
Claire Kenyon
,
Nicolas Schabanel
Algorithmica
35
(2), 2003, pp. 146 - 175
Reporting red-blue intersections between two sets of connected line segments
Julien Basch
,
Leonidas J. Guibas
,
G.D. Ramkumar
Algorithmica
35
(1), 2003, pp. 1-20
Fast concurrent access to parallel disks
Peter Sanders
,
Sebastian Egner
,
Jan Korst
Algorithmica
35
(1), 2003, pp. 21-55
Swapping a failing edge of a single source shortest paths tree is good and fast
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Algorithmica
35
(1), 2003, pp. 56-74
Scanning multiple sequences via cache memory
Kurt Mehlhorn
,
Peter Sanders
Algorithmica
35
(1), 2003, pp. 75-93
The minimum range assignment problem on linear radio networks
Andrea E.F. Clementi
,
Afonso Ferreira
,
Paolo Penna
,
St'ephane Perennes
,
Riccardo Silvestri
Algorithmica
35
(2), 2003, pp. 95-110
TSP heuristics: Domination analysis and complexity
Abraham Punnen
,
Francois Margot
,
Santosh Kabadi
Algorithmica
35
(2), 2003, pp. 111-127
Dynamic programming on the word RAM
David Pisinger
Algorithmica
35
(2), 2003, pp. 128-145
On-line edge-coloring with a fixed number of colors
Lene Monrad Favrholdt
,
Morten Nyhave Nielsen
Algorithmica
35
(2), 2003, pp. 176-191
Efficient parallel algorithms for planar
st
-graphs
Mikhail J. Atallah
,
Danny Z. Chen
,
Ovidiu Daescu
Algorithmica
35
(3), 2003, pp. 194-215
An approximation algorithm for a large-scale facility location problem
Kazuyoshi Hidaka
,
Hiroyuki Okano
Algorithmica
35
(3), 2003, pp. 216-224
Finding a region with the minimum total
L-1
distance from prescribed terminals
Yoshiyuki Kusakari
,
Takao Nishizeki
Algorithmica
35
(3), 2003, pp. 225-256
A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest
Chung Keung Poon
,
Vijaya Ramachandran
Algorithmica
35
(3), 2003, pp. 257-268
A characterization of planar graphs by pseudo-line arrangements
Hisao Tamaki
,
Takeshi Tokuyama
Algorithmica
35
(3), 2003, pp. 269-285
Compressing two-dimensional routing tables
Subhash Suri
,
Tuomas Sandholm
,
Priyank Warkhede
Algorithmica
35
(4), 2003, pp. 287-300
An explicit lower bound for TSP with distances one and two
Lars Engebretsen
Algorithmica
35
(4), 2003, pp. 301-319
Detecting race conditions in parallel programs that use semaphores
Philip N. Klein
,
Hsue-I Liu
,
Robert H.B. Netzer
Algorithmica
35
(4), 2003, pp. 321-345
Approximate matching of run-length compressed strings
Veli Mäkinen
,
Gonzalo Navarro
,
Esko Ukkonen
Algorithmica
35
(4), 2003, pp. 347-369