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=45
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A primal-dual schema based approximation algorithm for the element connectivity problem
Kamal Jain
,
Ion Măndoiu
,
Vijay V. Vazirani
,
David P. Williamson
Journal of Algorithms
45
(1), 2002, pp. 1-15
Fast deterministic consensus in a noisy environment
James Aspnes
Journal of Algorithms
45
(1), 2002, pp. 16-39
On the complexity of bicoloring clique hypergraphs of graphs
Jan Kratovíl
,
Zsolt Tuza
Journal of Algorithms
45
(1), 2002, pp. 40-54
Simpler and faster biconnectivity augmentation
Tsan-sheng Hsu
Journal of Algorithms
45
(1), 2002, pp. 55-71
Coloring
k
-colorable graphs using relatively small palettes
Eran Halperin
,
Ram Nathaniel
,
Uri Zwick
Journal of Algorithms
45
(1), 2002, pp. 72-90
Wavelength rerouting in optical networks, or the Venetian routing problem
Alberto Caprara
,
Giuseppe F. Italiano
,
G. Mohan
,
Alessandro Panconesi
,
Aravind Srinivasan
Journal of Algorithms
45
(2), 2002, pp. 93-125
Diagnosability of regular systems
Antonio Caruso
,
Stefano Chessa
,
Piero Maestrini
,
Paolo Santi
Journal of Algorithms
45
(2), 2002, pp. 126-143
Degree constrained book embeddings
David R. Wood
Journal of Algorithms
45
(2), 2002, pp. 144-154
A constructive enumeration of fusenes and benzenoids
Gunnar Brinkmann
,
Gilles Caporossi
,
Pierre Hansen
Journal of Algorithms
45
(2), 2002, pp. 155-166
Polynomial time approximation schemes for general multiprocessor job shop scheduling
Klaus Jansen
,
Lorant Porkolab
Journal of Algorithms
45
(2), 2002, pp. 167-191
Worst-case time bounds for coloring and satisfiability problems
Tomás Feder
,
Rajeev Motwani
Journal of Algorithms
45
(2), 2002, pp. 192-201
A
(2 + \varepsilon)
-approximation algorithm for the generalized preemptive open shop problem with minsum objective
Maurice Queyranne
,
Maxim Sviridenko
Journal of Algorithms
45
(2), 2002, pp. 202-212