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 YEAR=2004
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
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
Selecting the branches for an evolutionary tree: A polynomial time approximation scheme
Jonathan Badger
,
Paul Kearney
,
Ming Li
,
John Tsang
,
Tao Jiang
Journal of Algorithms
51
(1), 2004, pp. 1-14
Uniform consensus is harder than consensus
Bernadette Charron-Bost
,
André Schiper
Journal of Algorithms
51
(1), 2004, pp. 15-37
Tree exploration with little memory
Krzysztof Diks
,
Pierre Fraigniaud
,
Evangelos Kranakis
,
Andrzej Pelc
Journal of Algorithms
51
(1), 2004, pp. 38-63
Splay trees: A reweighing lemma and a proof of competitiveness vs. dynamic balanced trees
George F. Georgakopoulos
Journal of Algorithms
51
(1), 2004, pp. 64-76
Parallel algorithms for
P
-comparability graphs
Stavros D. Nikolopoulos
,
Leonidas Palios
Journal of Algorithms
51
(1), 2004, pp. 77-104
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Magnus Wahlström
Journal of Algorithms
51
(2), 2004, pp. 107-121
Seiten 1
2
>