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: Series=LNCS AND Volume=344

• NC-Algorithms for graphs with small treewidth
  H.L. Bodlaender
  Lecture Notes in Computer Science 344, 1989, pp. 1-10
• Graph-theoretic properties compatible with graph derivations
  A. Habel
  Lecture Notes in Computer Science 344, 1989, pp. 11-29
• The monadic second-order logic of graphs
  B. Courcelle
  Lecture Notes in Computer Science 344, 1989, pp. 30-53
• On systems of equations defining infinite graphs
  M. Bauderon
  Lecture Notes in Computer Science 344, 1989, pp. 54-73
• Fault tolerant networks of specified diameter
  H. Meijer, R. Dawes
  Lecture Notes in Computer Science 344, 1989, pp. 74-86
• DFS tree construction
  E. Korach, Z. Ostfeld
  Lecture Notes in Computer Science 344, 1989, pp. 87-106
• Serializable graphs
  K. Vidyasankar
  Lecture Notes in Computer Science 344, 1989, pp. 107-121
• Transitive closure algorithms for very large databases
  J. Biskup, H. Stiefeling
  Lecture Notes in Computer Science 344, 1989, pp. 122-147
• A graph-based decomposition approach for recursive query processing
  D. Seipel
  Lecture Notes in Computer Science 344, 1989, pp. 148-165
• Construction of deterministic transition graphs from dynamic integrity constraints
  U.W. Lipeck, D. Feng
  Lecture Notes in Computer Science 344, 1989, pp. 166-179
• (Time x space)-efficient implementations of hierarchical conceptual models
  N. Santoro
  Lecture Notes in Computer Science 344, 1989, pp. 180-189
• Dominance in the presence of obstacles
  M.T. de Berg, M.H. Overmars
  Lecture Notes in Computer Science 344, 1989, pp. 190-201
• Separating a polyhedron by one translation from a set of obstacles
  O. Nurmi, J.-R. Sack
  Lecture Notes in Computer Science 344, 1989, pp. 202-212
• Linear time algorithms for testing approximate congruence in the plane
  S. Iwanowski
  Lecture Notes in Computer Science 344, 1989, pp. 213-228
• Moving regular k-gons in contact
  S. Abramowski, B. Lang, H. Müller
  Lecture Notes in Computer Science 344, 1989, pp. 229-242
• Epsilon-nets for halfplanes
  G. Wöginger
  Lecture Notes in Computer Science 344, 1989, pp. 243-252
• Greedy triangulation can be efficiently implemented in the average case
  A. Lingas
  Lecture Notes in Computer Science 344, 1989, pp. 253-261
• A simple systolic method to find all bridges of an undirected graph
  M. Schimmler, H. Schröder
  Lecture Notes in Computer Science 344, 1989, pp. 262-267
• Colouring perfect planar graphs in parallel
  I.A. Stewart
  Lecture Notes in Computer Science 344, 1989, pp. 268-275
• An efficient parallel algorithm for the all pairs shortest path problem
  T. Takaoka
  Lecture Notes in Computer Science 344, 1989, pp. 276-287
• A parallel algorithm for channel routing
  J.E. Savage, M.G. Wloka
  Lecture Notes in Computer Science 344, 1989, pp. 288-303
• Application of graph theory to topology generation for logic gates
  H. Kaeslin
  Lecture Notes in Computer Science 344, 1989, pp. 304-316
• On the estimate of the size of a directed graph
  A. Marchetti-Spaccamela
  Lecture Notes in Computer Science 344, 1989, pp. 317-326
• The average size of ordered binary subgraphs
  P.H. Hartel
  Lecture Notes in Computer Science 344, 1989, pp. 327-351
• O(n^2) algorithms for graph planarization
  R. Jayakumar, K. Thulasiraman, M.N.S. Swamy
  Lecture Notes in Computer Science 344, 1989, pp. 352-377