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 [2]	Hilfe

Suche: Series=LNCS AND Volume=2573

• A multi-scale algorithm for the linear arrangement problem
  Yehuda Koren, David Harel
  Lecture Notes in Computer Science 2573, 2002, pp. 296-309
• On the b-chromatic number of graphs
  Jan Kratochvíl, Zsolt Tuza, Margit Voigt
  Lecture Notes in Computer Science 2573, 2002, pp. 310-320
• Budgeted maximum graph coverage
  Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S.S. Ravi, Hans-Christoph Wirth
  Lecture Notes in Computer Science 2573, 2002, pp. 321-332
• Online call admission in optical networks with larger demands
  Sven Oliver Krumke, Diana Poensgen
  Lecture Notes in Computer Science 2573, 2002, pp. 333-344
• The forest wrapping problem on outerplanar graphs
  Isabella Lari, Federica Ricca, Andrea Scozzari
  Lecture Notes in Computer Science 2573, 2002, pp. 345-354
• On the recognition of P_4-comparability graphs
  Stavros D. Nikolopoulos, Leonidas Palios
  Lecture Notes in Computer Science 2573, 2002, pp. 355-366
• Bend-minimum orthogonal drawings of plane 3-graphs
  Md. Saidur Rahman, Takao Nishizeki
  Lecture Notes in Computer Science 2573, 2002, pp. 367-378
• Cluster graph modification problems
  Ron Shamir, Roded Sharan, Dekel Tsur
  Lecture Notes in Computer Science 2573, 2002, pp. 379-390
• Two counterexamples in graph drawing
  O. Sýkora, L.A. Székely, I. Vrt'o
  Lecture Notes in Computer Science 2573, 2002, pp. 391-398
• Connected and loosely connected list homomorphisms
  Narayan Vikas
  Lecture Notes in Computer Science 2573, 2002, pp. 399-412
• Any load-balancing regimen for evolving tree computations on circulant graphs is asymptotically optimal
  Rolf Wanka
  Lecture Notes in Computer Science 2573, 2002, pp. 413-420