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	Hilfe

Suche: Booktitle=Proceedings of the Workshop WG'79, 5th Conference on Graphtheoretic Concepts in Computer Science (Berlin, West, Germany, June 21-23, 1979)

• The graphsack problem
  Gottfried Tinhofer
  Applied Computer Science, 1980, pp. 1-16
• Dynamic solution of decomposable searching problems
  H.A. Maurer, Th. Ottmann
  Applied Computer Science, 1980, pp. 17-24
• GRAPL - A programming language for handling dynamic problems on graphs
  Manfred Nagl
  Applied Computer Science, 1980, pp. 25-45
• GRAMAS - A graph manipulation system
  Uwe Pape
  Applied Computer Science, 1980, pp. 47-63
• On the relative complexity in deciding graph isomorphism
  F. Schweiggert
  Applied Computer Science, 1980, pp. 65-76
• Isomorphism of labelled graphs
  Klaus Förster, Bernd Mahr
  Applied Computer Science, 1980, pp. 77-91
• Canonical F-factors of graphs
  Jörg R. Mühlbacher, Franz-X. Steinparz
  Applied Computer Science, 1980, pp. 93-104
• Reachability-homomorphisms on graphs
  Jürgen Perl
  Applied Computer Science, 1980, pp. 105-113
• Finding spanning forests: A problem of data manipulation
  Jürgen Ebert
  Applied Computer Science, 1980, pp. 115-130
• An O (n^3) algorithm for the decomposition of a digraph
  Walter Knödel
  Applied Computer Science, 1980, pp. 131-140
• Subgradient methods in combinatorial optimization
  Rainer E. Burkard
  Applied Computer Science, 1980, pp. 141-151
• Maximal algebraic flows: Algorithms and examples
  Horst Hamacher
  Applied Computer Science, 1980, pp. 153-166
• A consoderation of the Traveling Salesman Problem using the assignment problem
  B. Monien, N. Urmetzer, O. Vornberger
  Applied Computer Science, 1980, pp. 167-179
• Scaling techniques for minimal cost network flows
  Hans Röck
  Applied Computer Science, 1980, pp. 181-191
• Application of graph-theoretical methods to computeraided design of large-scale integrated circuits
  U. Lauther
  Applied Computer Science, 1980, pp. 193-204
• Die automatische Einbettung planarer Graphen in die Ebene
  Peter Läuchli
  Applied Computer Science, 1980, pp. 205-208
• Efficiency of sparse matrix storage techniques
  Karl Dürre, Gernot Fels
  Applied Computer Science, 1980, pp. 209-221
• A graph grammer approach to optimal and consistent schedules in data base systems
  H. Ehrig, H.-J. Kreowski
  Applied Computer Science, 1980, pp. 223-239
• On solving conflicts in Petri nets
  Wolfgang Reisig
  Applied Computer Science, 1980, pp. 241-253
• Liveness in NSC-Petri nets
  W. Griese
  Applied Computer Science, 1980, pp. 255-264
• Ein Kalkül zur Konstruktion deadlockfreier systeme
  S. Keramidis
  Applied Computer Science, 1980, pp. 265-268