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=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cutwidth I: A linear time fixed parameter algorithm
Dimitrios M. Thilikos
,
Maria Serna
,
Hans L. Bodlaender
Journal of Algorithms
56
(1), 2005, pp. 1-24
Cutwidth II: Algorithms for partial
w
-trees of bounded degree
Dimitrios M. Thilikos
,
Maria Serna
,
Hans L. Bodlaender
Journal of Algorithms
56
(1), 2005, pp. 25-49
Conditional location of path and tree shaped facilities on trees
A. Tamir
,
J. Puerto
,
J.A. Mesa
,
A.M. Rodríuez-Chía
Journal of Algorithms
56
(1), 2005, pp. 50-75
A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph
Hiroshi Nagamochi
Journal of Algorithms
56
(2), 2005, pp. 77-95
Insufficiency of four known necessary conditions on string unavoidability
Christine E. Heitsch
Journal of Algorithms
56
(2), 2005, pp. 96-123
Transposition invariant string matching
Veli Mäkinen
,
Gonzalo Navarro
,
Esko Ukkonen
Journal of Algorithms
56
(2), 2005, pp. 124-153
An online throughput-competitive algorithm for multicast routing and admission control
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
Journal of Algorithms
55
(1), 2005, pp. 1-20
Irreducibility testing of lacunary 0,1-polynomials
Michael Filaseta
,
Douglas B. Meade
Journal of Algorithms
55
(1), 2005, pp. 21-28
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs
Petra S̑parl
,
Janez Z̑erovnik
Journal of Algorithms
55
(1), 2005, pp. 29-41
Data migration to minimize the total completion time
Yoo-Ah Kim
Journal of Algorithms
55
(1), 2005, pp. 42-57
An improved data stream summary: The count-min sketch and its aplications
Graham Cormode
,
S. Muthukrishnan
Journal of Algorithms
55
(1), 2005, pp. 58-75
On approximating a geometric prize-collecting Traveling Salesman problem with time windows
Reuven Bar-Yehuda
,
Guy Even
,
Shimon (Moni) Shahar
Journal of Algorithms
55
(1), 2005, pp. 76-92
On fairness in the carpool problem
Moni Naor
Journal of Algorithms
55
(1), 2005, pp. 93-98
Tight bounds for the performance of Longest In System on DAGs
Micah Adler
,
Adi Rosén
Journal of Algorithms
55
(2), 2005, pp. 101-112
Competitive queue policies for differentiated services
William A. Aiello
,
Yishay Mansour
,
S. Rajagopolan
,
Adi Rosén
Journal of Algorithms
55
(2), 2005, pp. 113-141
The Guessing Secrets problem: A probabilistic approach
Alberto Del Lungo
,
Guy Louchard
,
Claudio Marini
,
Franco Montagna
Journal of Algorithms
55
(2), 2005, pp. 142-176
A polynomial-time algorithm for near-unanimity graphs
Benoit Larose
,
Cynthia Loten
,
László Zádori
Journal of Algorithms
55
(2), 2005, pp. 177-191
Randomized
k
-server algorithms for growth-rate bounded graphs
Yair Bartal
,
Manor Mendel
Journal of Algorithms
55
(2), 2005, pp. 192-202
Factoring into coprimes in essentially linear time
Daniel J. Bernstein
Journal of Algorithms
54
(1), 2005, pp. 1-30
Simple constant amortized time generation of fixed length numeric partitions
John M. Boyer
Journal of Algorithms
54
(1), 2005, pp. 31-39
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Rainer Schuler
Journal of Algorithms
54
(1), 2005, pp. 40-44
Linear time algorithms for the ring loading problem with demand splitting
Biing-Feng Wang
Journal of Algorithms
54
(1), 2005, pp. 45-57
A probabilistic model for the degree of the cancellation polynomial in Gosper's algorithm
Robin Pemantle
Journal of Algorithms
54
(1), 2005, pp. 58-71
Cycles in random
k
-ary maps and the poor performance of random number generation
Robin Pemantle
Journal of Algorithms
54
(1), 2005, pp. 72-84
Approximation algorithms for array partitioning problems
S. Muthukrishnan
,
Torsten Suel
Journal of Algorithms
54
(1), 2005, pp. 85-104
Seiten 1
2
>