Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1665

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

Silver graphs: Achievements and new challenges
Hartmut Noltemeier
Lecture Notes in Computer Science 1665, 1999, pp. 1-9
Online algorithms: A study of graph-theoretic concepts
Susanne Albers
Lecture Notes in Computer Science 1665, 1999, pp. 10-26
Discrete optimization methods for packing problems in two and three dimensions - With applications in the textile and car manufacturing industries
Thomas Lengauer
Lecture Notes in Computer Science 1665, 1999, pp. 27-28
Informatica, scuola, communità: Uno sguardo dall'occhio del ciclone
N. Santoro
Lecture Notes in Computer Science 1665, 1999, pp. 29-29
Proximity-preserving labeling schemes and their applications
David Peleg
Lecture Notes in Computer Science 1665, 1999, pp. 30-41
Euler is standing in line - Dial-a-ride problems with precedence-constraints
D. Hauptmeier, S.O. Krumke, J. Rambau, H.-C. Wirth
Lecture Notes in Computer Science 1665, 1999, pp. 42-54
Lower bounds for approximating shortest suberstrings over an alphabet of size 2
Sascha Ott
Lecture Notes in Computer Science 1665, 1999, pp. 55-64
Complexity classification of some edge modification problems
Assaf Natanzon, Ron Shamir, Roded Sharan
Lecture Notes in Computer Science 1665, 1999, pp. 65-77
On minimum diameter spanning trees under reload costs
Hans-Christoph Wirth, Jan Steffan
Lecture Notes in Computer Science 1665, 1999, pp. 78-88
Induced matchings in regular graphs and trees
Michele Zito
Lecture Notes in Computer Science 1665, 1999, pp. 89-100
Mod-2 independence and domination in graphs
Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
Lecture Notes in Computer Science 1665, 1999, pp. 101-109
NLC_2-decomposition in polynomial time
Öjvind Johansson
Lecture Notes in Computer Science 1665, 1999, pp. 110-121
On the nature of structure and its identification
Benno Stein, Oliver Niggemann
Lecture Notes in Computer Science 1665, 1999, pp. 122-134
On the clique-width of perfect graph classes
Martin Charles Golumbic, Udi Rotics
Lecture Notes in Computer Science 1665, 1999, pp. 135-147
An improved algorithm for finding tree decompositions of small width
Ljubomir Perković, Bruce Reed
Lecture Notes in Computer Science 1665, 1999, pp. 148-154
Efficient analysis of graphs with small minimal separators
K. Skodinis
Lecture Notes in Computer Science 1665, 1999, pp. 155-166
Generating all the minimal separators of a graph
Anne Berry, Jean-Paul Bordat, Olivier Cogis
Lecture Notes in Computer Science 1665, 1999, pp. 167-172
Two broadcasting problems in faulty hypercubes
Stefan Dobrev, Imrich Vrt̑o
Lecture Notes in Computer Science 1665, 1999, pp. 173-178
Routing permutations in the hypercube
Olivier Baudon, Guillaume Fertin, Ivan Havel
Lecture Notes in Computer Science 1665, 1999, pp. 179-190
An optimal fault-tolerant routing for triconnected planar graphs
Koichi Wada, Yoriyuki Nagata, Wei Chen
Lecture Notes in Computer Science 1665, 1999, pp. 191-201
Optimal irreversible dynamos in chordal rings
Paola Flocchini, Frédéric Geurts, Nicola Santoro
Lecture Notes in Computer Science 1665, 1999, pp. 202-214
Recognizing bipartite incident-graphs of circulant digraphs
Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille
Lecture Notes in Computer Science 1665, 1999, pp. 215-227
Optimal cuts for powers of the Petersen graph
Sergei L. Bezrukov, Sajal K. Das, Robert Elsässer
Lecture Notes in Computer Science 1665, 1999, pp. 228-239
Dihamiltonian decomposition of regular graphs with degree three
Jung-Heum Park, Hee-Chul Kim
Lecture Notes in Computer Science 1665, 1999, pp. 240-249
Box-rectangular drawings of plane graphs
Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki
Lecture Notes in Computer Science 1665, 1999, pp. 250-261

Seiten 1 2 >