Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=3998

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

Distance approximating trees: Complexity and algorithms
Feodor F. Dragan, Chenyu Yan
Lecture Notes in Computer Science 3998, 2006, pp. 260-271
How to pack directed acyclic graphs into small blocks
Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano
Lecture Notes in Computer Science 3998, 2006, pp. 272-283
On-line coloring of H-free bipartite graphs
H.J. Broersma, A. Capponi, D. Paulusma
Lecture Notes in Computer Science 3998, 2006, pp. 284-295
Distributed approximation algorithms for planar graphs
Andrzej Czygrinow, Michaƚ Hańćkowiak, Edyta Szymańska
Lecture Notes in Computer Science 3998, 2006, pp. 296-307
A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is small
Raghav Kulkarni
Lecture Notes in Computer Science 3998, 2006, pp. 308-319
Fixed-parameter tractability results for feedback set problems in tournaments
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß
Lecture Notes in Computer Science 3998, 2006, pp. 320-331
Parameterized algorithms for HITTING SET: The weighted case
Henning Fernau
Lecture Notes in Computer Science 3998, 2006, pp. 332-343
Fixed-parameter tractable generalizations of cluster editing
Peter Damaschke
Lecture Notes in Computer Science 3998, 2006, pp. 344-355
The linear arrangement problem parameterized above guaranteed value
Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
Lecture Notes in Computer Science 3998, 2006, pp. 356-367
Universal relations and \#P-completeness
Hervé Fournier, Guillaume Malod
Lecture Notes in Computer Science 3998, 2006, pp. 368-379
Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes
Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
Lecture Notes in Computer Science 3998, 2006, pp. 380-391

Seiten < 1 2