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 YEAR=1981

• Reachability homomorphisms on nets
  Jürgen Ebert, Jürgen Perl
  Lecture Notes in Computer Science 100, 1981, pp. 326-334
• A bird's eye view to path problems
  Bernd Mahr
  Lecture Notes in Computer Science 100, 1981, pp. 335-353
• The Chinese postman problem for mixed graphs
  Peter Brucker
  Lecture Notes in Computer Science 100, 1981, pp. 354-366
• Alternating cycle covers and paths
  Oliver Vornberger
  Lecture Notes in Computer Science 100, 1981, pp. 367-378
• Generating all planar 0-,1-,2-,3-connected graphs
  Peter Läuchli
  Lecture Notes in Computer Science 100, 1981, pp. 379-382
• Optimal (s,t)-cuts
  Horst Hamacher
  Lecture Notes in Computer Science 100, 1981, pp. 383-387
• F-factors, perfect matchings and related concepts
  Ulrich Derigs
  Lecture Notes in Computer Science 100, 1981, pp. 388-403