Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3341

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

The maximum agreement of two nested phylogenetic networks
Jesper Jansson, Wing-Kin Sung
Lecture Notes in Computer Science 3341, 2004, pp. 581-593
Sequences of radius k: How to fetch many huge objects into small memory for pairwise computations
Jerzy W. Jaromczyk, Zbigniew Lonc
Lecture Notes in Computer Science 3341, 2004, pp. 594-605
New bounds on map labeling with circular labels
Minghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu
Lecture Notes in Computer Science 3341, 2004, pp. 606-617
Optimal buffer management via resource augmentation
Jae-Hoon Kim
Lecture Notes in Computer Science 3341, 2004, pp. 618-628
Oriented paths in mixed graphs
Egon Wanke, Rolf Kötter
Lecture Notes in Computer Science 3341, 2004, pp. 629-643
Polynomial deterministic rendezvous in arbitrary graphs
Dariusz R. Kowalski, Andrzej Pelc
Lecture Notes in Computer Science 3341, 2004, pp. 644-656
Distributions of points and large quadrangles
Hanno Lefmann
Lecture Notes in Computer Science 3341, 2004, pp. 657-668
Cutting out polygons with lines and rays
Ovidiu Daescu, Jun Luo
Lecture Notes in Computer Science 3341, 2004, pp. 669-680
Advantages of backward searching - Efficient secondary memory and distributed implementation of compressed suffix arrays
Veli Mäkinen, Gonzalo Navarro, Kunihiko Sadakane
Lecture Notes in Computer Science 3341, 2004, pp. 681-692
Inner rectangular drawings of plane graphs
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
Lecture Notes in Computer Science 3341, 2004, pp. 693-704
Approximating the minmax subtree cover problem in a cactus
Hiroshi Nagamochi, Taizo Kawada
Lecture Notes in Computer Science 3341, 2004, pp. 705-716
Boundary-optimal triangulation flooding
Richard Nowakowski, Norbert Zeh
Lecture Notes in Computer Science 3341, 2004, pp. 717-728
Exact computation of polynomial zeros expressible by square roots
Timo von Oertzen
Lecture Notes in Computer Science 3341, 2004, pp. 729-741
Many-to-many disjoint path covers in a graph with faulty elements
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
Lecture Notes in Computer Science 3341, 2004, pp. 742-753
An O(n \log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
Zeshan Peng, Hingfung Ting
Lecture Notes in Computer Science 3341, 2004, pp. 754-765
Planning the transportation of multiple commodities in bidirectional pipeline networks
Artur Alves Pessoa
Lecture Notes in Computer Science 3341, 2004, pp. 766-777
Efficient algorithms for the hotlink assignment problem: The worst case search
Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza
Lecture Notes in Computer Science 3341, 2004, pp. 778-792
Dynamic tree cross products
Marcus Raitner
Lecture Notes in Computer Science 3341, 2004, pp. 793-804
Spanners, weak spanners, and power spanners for wireless networks
Christian Schindelhauer, Klaus Volbert, Martin Ziegler
Lecture Notes in Computer Science 3341, 2004, pp. 805-821
Techniques for indexing and querying temporal observations for a collection of objects
Qingmin Shi, Joseph JaJa
Lecture Notes in Computer Science 3341, 2004, pp. 822-834
Approximation algorithms for the consecutive ones submatrix problem on sparse matrices
Jinsong Tan, Louxin Zhang
Lecture Notes in Computer Science 3341, 2004, pp. 835-846
The two-guard problem revisited and its generalization
Xuehou Tan
Lecture Notes in Computer Science 3341, 2004, pp. 847-858
Canonical data structure for interval probe graphs
Ryuhei Uehara
Lecture Notes in Computer Science 3341, 2004, pp. 859-870
Efficient algorithms for the longest path problem
Ryuhei Uehara, Yushi Uno
Lecture Notes in Computer Science 3341, 2004, pp. 871-883
Randomized algorithms for motif detection
Lusheng Wang, Liang Dong, Hui Fan
Lecture Notes in Computer Science 3341, 2004, pp. 884-895

Seiten < 1 2 3 4 >