Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2573

• Maximum cardinality search for computing minimal triangulations
  Anne Berry, Jean R.S. Blair, Pinar Heggernes
  Lecture Notes in Computer Science 2573, 2002, pp. 1-12
• DNA sequencing, Eulerian graphs
  Jacek Bƚażewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2573, 2002, pp. 13-24
• On the minimum size of a contraction-universal tree
  Olivier Bodini
  Lecture Notes in Computer Science 2573, 2002, pp. 25-34
• Optimal area algorithm for planar polyline drawings
  Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah
  Lecture Notes in Computer Science 2573, 2002, pp. 35-46
• Cycles in generalized networks
  Franz J. Brandenburg
  Lecture Notes in Computer Science 2573, 2002, pp. 47-56
• New graph classes of bounded clique-width
  Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
  Lecture Notes in Computer Science 2573, 2002, pp. 57-67
• More about subcolorings
  Hajo Broersma, Fedor V. Fomin, Jaroslav Nes̑etȓil, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2573, 2002, pp. 68-79
• Search in indecomposable graphs
  Alain Cournier
  Lecture Notes in Computer Science 2573, 2002, pp. 80-91
• On the complexity of (k,l)-graph sandwich problems
  Simone Dantas, Celina M.H. de Figueiredo, Luerbio Faria
  Lecture Notes in Computer Science 2573, 2002, pp. 92-101
• Algorithms and models for the on-line vertex-covering
  Marc Demange, Vangelis Th. Paschos
  Lecture Notes in Computer Science 2573, 2002, pp. 102-113
• Weighted node coloring: When stable sets are expensive
  Marc Demange, D. de Werra, J. Monnot, Vangelis Th. Paschos
  Lecture Notes in Computer Science 2573, 2002, pp. 114-125
• The complexity of restrictive H-coloring
  Josep Díaz, Maria Serna, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 2573, 2002, pp. 126-137
• A new 3-color criterion for planar graphs
  Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski
  Lecture Notes in Computer Science 2573, 2002, pp. 138-149
• An additive stretched routing scheme for chordal graphs
  Yon Dourisboure
  Lecture Notes in Computer Science 2573, 2002, pp. 150-163
• Complexity of pattern coloring of cycle systems
  Zdenȇk Dvoȓák, Jan Kára, Daniel Král', Ondȓej Pangrác
  Lecture Notes in Computer Science 2573, 2002, pp. 164-175
• Safe reduction rules for weighted treewidth
  Frank van den Eijkhof, Hans L. Bodlaender
  Lecture Notes in Computer Science 2573, 2002, pp. 176-185
• Graph seperator algorithms: A refined analysis
  Henning Fernau
  Lecture Notes in Computer Science 2573, 2002, pp. 186-197
• Generalized H-coloring and H-covering of trees
  Jiȓí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle
  Lecture Notes in Computer Science 2573, 2002, pp. 198-210
• The complexity of approximating the oriented diameter of chordal graphs
  Fedor V. Fomin, Martín Matamala, Ivan Rapaport
  Lecture Notes in Computer Science 2573, 2002, pp. 211-222
• Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
  D.A. Fotakis, S.E. Nikoletseas, V.G. Papadopoulou, P.G. Spirakis
  Lecture Notes in Computer Science 2573, 2002, pp. 223-234
• Completely independent spanning trees in maximal planar graphs
  Toru Hasunuma
  Lecture Notes in Computer Science 2573, 2002, pp. 235-245
• Facets of the directed acyclic graph layering polytope
  Patrick Healy, Nikola S. Nikolov
  Lecture Notes in Computer Science 2573, 2002, pp. 246-257
• Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
  Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
  Lecture Notes in Computer Science 2573, 2002, pp. 258-269
• Complexity of some infinite games played on finite graphs
  Hajime Ishihara, Bakhadyr Khoussainov
  Lecture Notes in Computer Science 2573, 2002, pp. 270-281
• New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs
  Ton Kloks, C.M. Lee, Jiping Liu
  Lecture Notes in Computer Science 2573, 2002, pp. 282-295