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=47
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A 2-approximation algorithm for path coloring on a restricted class of trees of rings
Xiaotie Deng
,
Guojun Li
,
Wenan Zang
,
Yi Zhou
Journal of Algorithms
47
(1), 2003, pp. 1-13
Elastic labels around the perimeter of a map
Claudia Iturriaga
,
Anna Lubiw
Journal of Algorithms
47
(1), 2003, pp. 14-39
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
Konstantin Skodinis
Journal of Algorithms
47
(1), 2003, pp. 40-59
Erratum to ''Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true''
Hatem M. Bahig
,
Ken Nakamula
Journal of Algorithms
47
(1), 2003, pp. 60-61
On efficient fixed-parameter algorithms for weighted vertex cover
Rolf Niedermeier
,
Peter Rossmanith
Journal of Algorithms
47
(2), 2003, pp. 63-77
Expected search duration for finite backtracking adaptive search
D.L.J. Alexander
,
D.W. Bulger
,
G.R. Wood
Journal of Algorithms
47
(2), 2003, pp. 78-86
Testing satisfiability
Noga Alon
,
Asaf Shapira
Journal of Algorithms
47
(2), 2003, pp. 87-103
Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation
Boaz Tsaban
Journal of Algorithms
47
(2), 2003, pp. 104-121
Approximation algorithms for MAX-MIN tiling
Piotr Berman
,
Bhaskar DasGupta
,
S. Muthukrishnan
Journal of Algorithms
47
(2), 2003, pp. 122-134