Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1969

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

Voronoi-based systems of coordinates and surface reconstruction
Jean-Daniel Boissonnat
Lecture Notes in Computer Science 1969, 2000, pp. 1-1
Essentially every unimodular matrix defines an expander
Jin-Yi Cai
Lecture Notes in Computer Science 1969, 2000, pp. 2-22
Strategies for hotlink assignments
Prosenjit Bose, Jurek Czyzowicz, Leszek Ga̧sieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Miguel Vargas Martin
Lecture Notes in Computer Science 1969, 2000, pp. 23-34
A new competitive analysis of randomized caching
Ching Law, Charles E. Leiserson
Lecture Notes in Computer Science 1969, 2000, pp. 35-46
Online routing in convex subdivisions
Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro
Lecture Notes in Computer Science 1969, 2000, pp. 47-59
A simple linear-time approximation algorithm for multi-processor job scheduling on four processors
Jingui Huang, Jianer Chen, Songqiao Chen
Lecture Notes in Computer Science 1969, 2000, pp. 60-71
Classification of various neighborhood operations for the nurse scheduling problem
Takayuki Osogami, Hiroshi Imai
Lecture Notes in Computer Science 1969, 2000, pp. 72-83
Optimal bid sequences for multiple-object auctions with unequal budgets
Yuyu Chen, Ming-Yang Kao, Hsueh-I. Lu
Lecture Notes in Computer Science 1969, 2000, pp. 84-95
Coping with delays and time-outs in binary search procedures
Ferdinando Cicalese, Ugo Vaccaro
Lecture Notes in Computer Science 1969, 2000, pp. 96-107
Some formal analysis of Rocchio's similarity-based relevance feedback algorithm
Zhixiang Chen, Binhai Zhu
Lecture Notes in Computer Science 1969, 2000, pp. 108-119
Reasoning with ordered binary decision diagrams
Takashi Horiyama, Toshihide Ibaraki
Lecture Notes in Computer Science 1969, 2000, pp. 120-131
On approximating minimum vertex cover for graphs with perfect matching
Jianer Chen, Iyad A. Kanj
Lecture Notes in Computer Science 1969, 2000, pp. 132-143
A 2-approximation algorithm for path coloring on trees of rings
Xiaotie Deng, Guojun Li, Wenan Zang, Yi Zhou
Lecture Notes in Computer Science 1969, 2000, pp. 144-155
An approximate algorithm for the weighted Hamiltonian path completion problem on a tree
Q.S. Wu, C.L. Lu, R.C.T. Lee
Lecture Notes in Computer Science 1969, 2000, pp. 156-167
Finding independent spanning trees in partial k-trees
Xiao Zhou, Takao Nishizeki
Lecture Notes in Computer Science 1969, 2000, pp. 168-179
On efficient fixed parameter algorithms for WEIGHTED VERTEX COVER
Rolf Niedermeier, Peter Rossmanith
Lecture Notes in Computer Science 1969, 2000, pp. 180-191
Constructive linear time algorithms for small cutwidth and carving-width
Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
Lecture Notes in Computer Science 1969, 2000, pp. 192-203
Approximation algorithms for the maximum power consumption problem on combinatorial circuits
Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda
Lecture Notes in Computer Science 1969, 2000, pp. 204-215
A simple and quick approximation algorithm for Traveling Salesman Problem in the plane
Norihiro Kubo, Katsuhiro Muramoto, Shinichi Shimozono
Lecture Notes in Computer Science 1969, 2000, pp. 216-227
Simple algorithms for a weighted interval selection problem
Thomas Erlebach, Frits C.R. Spieksma
Lecture Notes in Computer Science 1969, 2000, pp. 228-240
Efficient minus and signed domination in graphs
Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang
Lecture Notes in Computer Science 1969, 2000, pp. 241-253
Convex grid drawings of four-connected plane graphs
Kazuyuki Miura, Shin-ichi Nakano, Takao Nishizeki
Lecture Notes in Computer Science 1969, 2000, pp. 254-265
An algorithm for finding three dimensional symmetry in series parallel digraphs
Seok-Hee Hong, Peter Eades
Lecture Notes in Computer Science 1969, 2000, pp. 266-277
Undecidability results for monoids with linear-time decidable word problems
Masashi Katsura, Yuji Kobayashi, Friedrich Otto
Lecture Notes in Computer Science 1969, 2000, pp. 278-289
Secret key exchange using random deals of cards on hierarchical structures
Reina Yoshikawa, Shimin Guo, Kazuhiro Motegi, Yoshihide Igarashi
Lecture Notes in Computer Science 1969, 2000, pp. 290-301

Seiten 1 2 >