Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2697

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

Distributed algorithm for better approximation of the maximum matching
A. Czygrinow, M. Hańćkowiak
Lecture Notes in Computer Science 2697, 2003, pp. 242-251
Efficient mappings for parity-declustered data layouts
Eric J. Schwabe, Ian M. Sutherland
Lecture Notes in Computer Science 2697, 2003, pp. 252-261
Approximate rank aggregation
Xiaotie Deng, Qizhi Fang, Shanfeng Zhu
Lecture Notes in Computer Science 2697, 2003, pp. 262-271
Perturbation of the hyper-linked environment
Hyun Chul Lee, Allan Borodin
Lecture Notes in Computer Science 2697, 2003, pp. 272-283
Fast construction of generalized suffix trees over a very large alphabet
Zhixiang Chen, Richard Fowler, Ada Wai-Chee Fu, Chunyue Wang
Lecture Notes in Computer Science 2697, 2003, pp. 284-293
Complexity theoretic aspects of some cryptographic functions
Eike Kiltz, Hans Ulrich Simon
Lecture Notes in Computer Science 2697, 2003, pp. 294-303
Quantum sampling for balanced allocations
Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita
Lecture Notes in Computer Science 2697, 2003, pp. 304-318
Fault-Hamiltonicity of product graph of path and cycle
Jung-Heum Park, Hee-Chul Kim
Lecture Notes in Computer Science 2697, 2003, pp. 319-328
How to obtain the complete list of caterpillars
Yosuke Kikuchi, Hiroyuki Tanaka, Shin-ichi Nakano, Yukio Shibata
Lecture Notes in Computer Science 2697, 2003, pp. 329-338
Randomized approximation of the stable marriage problem
Magnús Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
Lecture Notes in Computer Science 2697, 2003, pp. 339-350
Tetris is hard, even to approximate
Erik D. Demaine, Susan Hohenberger, David Liben-Nowell
Lecture Notes in Computer Science 2697, 2003, pp. 351-363
Approximate MST for UDG locally
Xiang-Yang Li
Lecture Notes in Computer Science 2697, 2003, pp. 364-373
Efficient construction of low weight bounded degree planar spanner
Xiang-Yang Li, Yu Wang
Lecture Notes in Computer Science 2697, 2003, pp. 374-384
Isoperimetric inequalities and the width parameters of graphs
L. Sunil Chandran, T. Kavitha, C.R. Subramanian
Lecture Notes in Computer Science 2697, 2003, pp. 385-393
Graph coloring and the immersion order
Faisal N. Abu-Khzam, Michael A. Langston
Lecture Notes in Computer Science 2697, 2003, pp. 394-403
Optimal MST maintenance for transient deletion of every node in planar graphs
Carlo Gaibisso, Guido Proietti, Richard B. Tan
Lecture Notes in Computer Science 2697, 2003, pp. 404-414
Scheduling broadcasts with deadlines
Jae-Hoon Kim, Kyung-Yong Chwa
Lecture Notes in Computer Science 2697, 2003, pp. 415-424
Improved competitive algorithms for online scheduling with partial job values
Francis Y.L. Chin, Stanley P.Y. Fung
Lecture Notes in Computer Science 2697, 2003, pp. 425-434
Majority equilibrium for public facility allocation
Lihua Chen, Xiaotie Deng, Qizhi Fang, Feng Tian
Lecture Notes in Computer Science 2697, 2003, pp. 435-444
On constrained minimum pseudotriangulations
Günter Rote, Cao An Wang, Lusheng Wang, Yinfeng Xu
Lecture Notes in Computer Science 2697, 2003, pp. 445-454
Pairwise data clustering and applications
Xiaodong Wu, Danny Z. Chen, James J. Mason, Steven R. Schmid
Lecture Notes in Computer Science 2697, 2003, pp. 455-466
Covering a set of points with a minimum number of turns
Michael J. Collins
Lecture Notes in Computer Science 2697, 2003, pp. 467-474
Area-efficient order-preserving planar straight-line drawings of ordered trees
Ashim Garg, Adrian Rusu
Lecture Notes in Computer Science 2697, 2003, pp. 475-486
Bounds for convex crossing numbers
Farhad Shahrokhi, Ondrej Sýkora, Laszlo A. Székely, Imrich Vrt'o
Lecture Notes in Computer Science 2697, 2003, pp. 487-495
On spectral graph drawing
Yehuda Koren
Lecture Notes in Computer Science 2697, 2003, pp. 496-508

Seiten < 1 2 3 >