Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2204

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

Median hulls as Steiner hulls in rectilinear and molecular sequence spaces
Hans-J. Bandelt
Lecture Notes in Computer Science 2204, 2001, pp. 1-7
Data management in networks
Friedhelm Meyer auf der Heide
Lecture Notes in Computer Science 2204, 2001, pp. 8-8
Edge-isoperimetric problems for Cartesian powers of regular graphs
Sergei L. Bezrukov, Robert Elsässer
Lecture Notes in Computer Science 2204, 2001, pp. 9-20
Approximate constrained bipartite edge coloring
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Pino Persiano, Hervé Rivano
Lecture Notes in Computer Science 2204, 2001, pp. 21-31
Maximum clique transversals
Maw-Shang Chang, Ton Kloks, Chuan-Min Lee
Lecture Notes in Computer Science 2204, 2001, pp. 32-43
On the tree-degree of graphs
Maw-Shang Chang, Haiko Müller
Lecture Notes in Computer Science 2204, 2001, pp. 44-54
On constrained minimum vertex covers of bipartite graphs: Improved algorithms
Jianer Chen, Iyad A. Kanj
Lecture Notes in Computer Science 2204, 2001, pp. 55-65
(k,+)-distance-hereditary graphs
Serafino Cicerone, Gianluca D'Ermiliis, Gabriele di Stefano
Lecture Notes in Computer Science 2204, 2001, pp. 66-77
On the relationship between clique-width and treewidth
Derek G. Corneil, Udi Rotics
Lecture Notes in Computer Science 2204, 2001, pp. 78-90
Planarity of the 2-level cactus model
Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner
Lecture Notes in Computer Science 2204, 2001, pp. 91-102
Estimating all pairs shortest paths in restricted graph families: A unified approach
Feodor F. Dragan
Lecture Notes in Computer Science 2204, 2001, pp. 103-116
How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time
Wolfgang Espelage, Frank Gurski, Egon Wanke
Lecture Notes in Computer Science 2204, 2001, pp. 117-128
(g,f)-factorizations orthogonal to k subgraphs
Haodi Feng
Lecture Notes in Computer Science 2204, 2001, pp. 129-139
On star coloring of graphs
Guillaume Fertin, André Raspaud, Bruce Reed
Lecture Notes in Computer Science 2204, 2001, pp. 140-153
Graph subcolorings: Complexity and algorithms
Jiȓí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
Lecture Notes in Computer Science 2204, 2001, pp. 154-165
Approximation of pathwidth of outerplanar graphs
Fedor V. Fomin, Hans L. Bodlaender
Lecture Notes in Computer Science 2204, 2001, pp. 166-176
On the monotonicity of games generated by symmetric submodular functions
Fedor V. Fomin, Dimitrios M. Thilikos
Lecture Notes in Computer Science 2204, 2001, pp. 177-188
Multiple hotlink assignment
Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth
Lecture Notes in Computer Science 2204, 2001, pp. 189-200
Small k-dominating sets in planar graphs with applications
Cyril Gavoille, David Peleg, André Raspaud, Eric Sopena
Lecture Notes in Computer Science 2204, 2001, pp. 201-216
Lower bounds for approximation algorithms for the Steiner tree problem
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel
Lecture Notes in Computer Science 2204, 2001, pp. 217-228
\log n-approximative NLC_k-decomposition in O(n^{2k+1}) time
öjvind Johansson
Lecture Notes in Computer Science 2204, 2001, pp. 229-240
On subfamilies of AT-free graphs
Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart
Lecture Notes in Computer Science 2204, 2001, pp. 241-253
Complexity of coloring graphs without forbidden induced subgraphs
Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger
Lecture Notes in Computer Science 2204, 2001, pp. 254-262
On stable cutsets in line graphs
Van Bang Le, Bert Randerath
Lecture Notes in Computer Science 2204, 2001, pp. 263-271
On strong Menger-connectivity of star graphs
Eunseuk Oh, Jianer Chen
Lecture Notes in Computer Science 2204, 2001, pp. 272-283

Seiten 1 2 >