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=2880

• Short cycles in planar graphs
  Łukasz Kowalik
  Lecture Notes in Computer Science 2880, 2003, pp. 284-296
• Complexity of hypergraph coloring and Seidel's switching
  Jan Kratochvíl
  Lecture Notes in Computer Science 2880, 2003, pp. 297-308
• Feedback vertex set and longest induced path on AT-free graphs
  Dieter Kratsch, Haiko Müller, Ioan Todinca
  Lecture Notes in Computer Science 2880, 2003, pp. 309-321
• The complexity of graph contractions
  Asaf Levin, Daniel̈ Paulusma, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2880, 2003, pp. 322-333
• Tree spanners, Cayley graphs, and diametrically uniform graphs
  Paul Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel
  Lecture Notes in Computer Science 2880, 2003, pp. 334-345
• The probabilistic minimum coloring problem
  Cécile Murat, Vangelis Th. Paschos
  Lecture Notes in Computer Science 2880, 2003, pp. 346-357
• Recognizing bipolarizable and P_4-simplicial graphs
  Stavros D. Nikolopoulos, Leonidas Palios
  Lecture Notes in Computer Science 2880, 2003, pp. 358-369
• Coloring powers of graphs of bounded clique-width
  Ioan Todinca
  Lecture Notes in Computer Science 2880, 2003, pp. 370-382