Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=650

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Rectilinear paths among rectilinear obstacles
D.T. Lee
Lecture Notes in Computer Science 650, 1992, pp. 5-20
Linear time algorithms for k-cutwidth problem
Maw-Hwa Chen, Sing-Ling Lee
Lecture Notes in Computer Science 650, 1992, pp. 21-30
The k-edge-connectivity augmentation problem of weighted graphs
Toshimasa Watanabe, Toshiya Mashita, Satoshi Taoka
Lecture Notes in Computer Science 650, 1992, pp. 31-40
Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity
Sachin Patkar, H. Narayanan
Lecture Notes in Computer Science 650, 1992, pp. 41-50
The application of the searching over separators strategy to solve some NP-complete problems on planar graphs
R.Z. Hwang, R.C.T. Lee
Lecture Notes in Computer Science 650, 1992, pp. 51-60
Parallel and on-line graph coloring algorithms
Magnús M. Halldórsson
Lecture Notes in Computer Science 650, 1992, pp. 61-70
Competitive analysis of the round robin algorithm
Tsuyoshi Matsumoto
Lecture Notes in Computer Science 650, 1992, pp. 71-77
Competitive analysis of the on-line algorithms for multiple stacks systems
Been-Chian Chien, Rong-Jaye Chen, Wei-Pang Yang
Lecture Notes in Computer Science 650, 1992, pp. 78-87
Self-adjusting augmented search trees
Tony W. Lai
Lecture Notes in Computer Science 650, 1992, pp. 88-96
Algorithms for a class of min-cut and max-cut problem
Teofilo F. Gonzalez, Toshio Murayama
Lecture Notes in Computer Science 650, 1992, pp. 97-105
Algorithms for rectilinear optimal multicast tree problem
Jan-Ming Ho, M.T. Ko, Tze-Heng Ma, Ting-Yi Sung
Lecture Notes in Computer Science 650, 1992, pp. 106-115
Approximating treewidth and pathwidth of some classes of perfect graphs
Ton Kloks, Hans Bodlaender
Lecture Notes in Computer Science 650, 1992, pp. 116-125
Graph spanners and connectivity
Shuichi Ueno, Michihiro Yamazaki, Yoji Kajitani
Lecture Notes in Computer Science 650, 1992, pp. 126-134
Randomized range-maxima in nearly-constant parallel time
Omer Berkman, Yossi Matias, Uzi Vishkin
Lecture Notes in Computer Science 650, 1992, pp. 135-144
Fault-tolerant broadcasting in binary jumping networks
Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura
Lecture Notes in Computer Science 650, 1992, pp. 145-154
Routing problems on the mesh of buses
Kazuo Iwama, Eiji Miyano, Yahiko Kambayashi
Lecture Notes in Computer Science 650, 1992, pp. 155-164
Selection networks with 8n \log_2n size and O(\log n) depth
Shuji Jimbo, Akira Maruoka
Lecture Notes in Computer Science 650, 1992, pp. 165-174
Relativizations of the P=?NP and other problems: Some developments in structural complexity theory
Ronald V. Book
Lecture Notes in Computer Science 650, 1992, pp. 175-186
Searching a solid pseudo 3-sided orthoconvex grid
Antonios Symvonis, Spyros Tragoudas
Lecture Notes in Computer Science 650, 1992, pp. 188-197
An efficient parallel algorithm for geometrically characterizing drawings of a class of 3-D objects
Nick D. Dendris, Iannis A. Kalafatis, Lefteris M. Kirousis
Lecture Notes in Computer Science 650, 1992, pp. 198-208
Topologically consistent algorithms related to convex polyhedra
Kokichi Sugihara
Lecture Notes in Computer Science 650, 1992, pp. 209-218
Characterizing and recognizing visibility graphs of funnel-shaped polygons
Seung-Hak Choi, Sung Yong Shin, Kyung-Yong Chwa
Lecture Notes in Computer Science 650, 1992, pp. 219-228
On the complexity of composite numbers
Toshiya Itoh, Kenji Horikawa
Lecture Notes in Computer Science 650, 1992, pp. 229-238
On malign input distributions for algorithms
Kojiro Kobayashi
Lecture Notes in Computer Science 650, 1992, pp. 239-248
Lowness and the complexity of sparse and tally descriptions
V. Arvind, J. Köbler, M. Mundhenk
Lecture Notes in Computer Science 650, 1992, pp. 249-258

Seiten 1 2 >