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=52
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient communication in an ad-hoc network
Abraham Flaxman
,
Alan Frieze
,
Eli Upfal
Journal of Algorithms
52
(1), 2004, pp. 1-7
Logarithmic inapproximability of the radio broadcast problem
Michael Elkin
,
Guy Kortsarz
Journal of Algorithms
52
(1), 2004, pp. 8-25
Parameterized complexity: Exponential speed-up for planar graph problems
Jochen Alber
,
Henning Fernau
,
Rolf Niedermeier
Journal of Algorithms
52
(1), 2004, pp. 26-56
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
Matthew Andrews
,
Lisa Zhang
Journal of Algorithms
52
(1), 2004, pp. 57-81
Efficient algorithms for the scaled indexing problem
Biing-Feng Wang
,
Jyh-Jye Lin
,
Shan-Chyun Ku
Journal of Algorithms
52
(1), 2004, pp. 82-100
Parameterized self-adjusting heaps
Amr Elmasry
Journal of Algorithms
52
(2), 2004, pp. 103-119
All-norm approximation algorithms
Yossi Azar
,
Leah Epstein
,
Yossi Richter
,
Gerhard J. Woeginger
Journal of Algorithms
52
(2), 2004, pp. 120-133
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
Jochen Alber
,
Jiȓí Fiala
Journal of Algorithms
52
(2), 2004, pp. 134-151
The dominating set problem is fixed parameter tractable for graphs of bounded genus
J. Ellis
,
H. Fan
,
M. Fellows
Journal of Algorithms
52
(2), 2004, pp. 152-168
Seat reservation allowing seat changes
Joan Boyar
,
Susan Krarup
,
Morten N. Nielsen
Journal of Algorithms
52
(2), 2004, pp. 169-192
Performance guarantee for EDF under overload
Tak-Wah Lam
,
Tsuen-Wan Johnny Ngan
,
Kar-Keung To
Journal of Algorithms
52
(2), 2004, pp. 193-206