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 8th Conference on Graphtheoretic Concepts in Computer Science, WG'82 (Neunkirchen a. Br., F.R. Germany, June 16-18, 1982)

• A relational view on gotos and dynamic logic
  R. Berghammer, G. Schmidt
  Applied Computer Science, 1982, pp. 13-24
• Network flows in trees and knapsack problems with nested constraints
  P. Brucker
  Applied Computer Science, 1982, pp. 25-35
• A linear disjoint path algorithm
  J. Ebert
  Applied Computer Science, 1982, pp. 37-45
• Specification of a programming support environment by graph grammars
  G. Engels, W. Schäfer
  Applied Computer Science, 1982, pp. 47-62
• A language for linearizing graphics
  Göttler, A. Völk
  Applied Computer Science, 1982, pp. 63-77
• K best cuts in planar and nonplanar networks
  H. Hamacher
  Applied Computer Science, 1982, pp. 79-89
• Concurrency of node-label-controlled graph transformations
  D. Janssens, H.-J. Kreowski, G. Rozenberg, H. Ehrig
  Applied Computer Science, 1982, pp. 91-108
• Variants of multidimensional B-trees as dynamic index structures for associative retrieval in database systems
  H.-P. Kriegel
  Applied Computer Science, 1982, pp. 109-128
• Decomposing data for comparison in systolic (VLSI) arrays
  R. Laue
  Applied Computer Science, 1982, pp. 129-135
• On concurrency control in shared B-trees
  G. Lausen
  Applied Computer Science, 1982, pp. 137-149
• On the solution of inequality systems relevant to IC-layout
  T. Lengauer
  Applied Computer Science, 1982, pp. 151-163
• Graph grammars as a tool for description in computer processed control: A case study
  B. Mahr, A. Wilharm
  Applied Computer Science, 1982, pp. 165-176
• Iterative algorithms on grammar graphs
  U. Möncke, R. Wilhelm
  Applied Computer Science, 1982, pp. 177-194
• The complexity of determing a shortest cycle of even length
  B. Monien
  Applied Computer Science, 1982, pp. 195-208
• The complexity of the vertex coloring problem on hierarchies of sparse graphs
  H. Müller
  Applied Computer Science, 1982, pp. 209-223
• Lower bounds and upper bounds on VLSI-layouts for perfect binary trees
  M.H. Overmars
  Applied Computer Science, 1982, pp. 225-231
• Flowshop scheduling with no wait in process on three machines
  H. Röck
  Applied Computer Science, 1982, pp. 233-250
• Kernels in bipartite graphs
  G. Schmidt, T. Ströhlein
  Applied Computer Science, 1982, pp. 251-256
• Reporting intersections of line segments: An improvement of the Ottmann-Bentley algorithm
  A. Schmitt
  Applied Computer Science, 1982, pp. 257-266
• The separation problem
  O. Vornberger
  Applied Computer Science, 1982, pp. 267-280