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=43
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A simple test for the consecutive ones property
Wen-Lian Hsu
Journal of Algorithms
43
(1), 2002, pp. 1-16
Embedding graphs with bounded treewidth into their optimal hypercubes
Volker Heun
,
Ernst W. Mayr
Journal of Algorithms
43
(1), 2002, pp. 17-50
Efficient dynamic embeddings of binary trees into hypercubes
Volker Heun
,
Ernst W. Mayr
Journal of Algorithms
43
(1), 2002, pp. 51-84
The stable roommates problem with ties
Robert W. Irving
,
David F. Manlove
Journal of Algorithms
43
(1), 2002, pp. 85-105
Kayles and Nimbers
Hans L. Bodlaender
,
Dieter Kratsch
Journal of Algorithms
43
(1), 2002, pp. 106-119
The dynamic stream merging algorithm
E.G., Jr. Coffman
,
Predrag Jelenković
,
Petar Momc̑ilović
Journal of Algorithms
43
(1), 2002, pp. 120-137
Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem
Daya Ram Gaur
,
Toshihide Ibaraki
,
Ramesh Krishnamurti
Journal of Algorithms
43
(1), 2002, pp. 138-152
A linear time algorithm for recognizing regular Boolean functions
Kazuhisa Makino
Journal of Algorithms
43
(2), 2002, pp. 155-176
Fast broadcasting and gossiping in radio networks
Marek Chrobak
,
Leszek Ga̧sieniec
,
Wojciech Rytter
Journal of Algorithms
43
(2), 2002, pp. 177-189
Approximation of pathwidth of outerplanar graphs
Hans L. Bodlaender
,
Fedor V. Fomin
Journal of Algorithms
43
(2), 2002, pp. 190-200
Improved approximation of Max-Cut on graphs of bounded degree
Uriel Feige
,
Marek Karpinski
,
Michael Langberg
Journal of Algorithms
43
(2), 2002, pp. 201-219
Exploiting structure in quantified formulas
Richard E. Stearns
,
Harry B. Hunt III
Journal of Algorithms
43
(2), 2002, pp. 220-263
Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
David Liben-Nowell
Journal of Algorithms
43
(2), 2002, pp. 264-283