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

• A simple linear-time algorithm to recognize interval graphs
  N. Korte, R.H. Möhring
  Lecture Notes in Computer Science 246, 1987, pp. 1-16
• On approximation algorithms for Steiner's problem in graphs
  P. Widmayer
  Lecture Notes in Computer Science 246, 1987, pp. 17-28
• Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity
  M. Kaul
  Lecture Notes in Computer Science 246, 1987, pp. 29-40
• ADA concurrency specified by graph grammars
  M. Jackel
  Lecture Notes in Computer Science 246, 1987, pp. 41-57
• CABRI, an interactive system for graph manipulation
  M. Dao, M. Habib, J.P. Richard, D. Tallot
  Lecture Notes in Computer Science 246, 1987, pp. 58-67
• An interactive graphical manipulation system for higher objects based on relational algebra
  H. Zierer, G. Schmidt, R. Berghammer
  Lecture Notes in Computer Science 246, 1987, pp. 68-81
• Behaviour preserving refinements of Petri nets
  W. Vogler
  Lecture Notes in Computer Science 246, 1987, pp. 82-93
• The bandwidth of planar distributive lattices
  U. Faigle, G. Gierz
  Lecture Notes in Computer Science 246, 1987, pp. 94-105
• The node visit cost of brother trees
  R. Klein, D. Wood
  Lecture Notes in Computer Science 246, 1987, pp. 106-117
• Searching connected components in very large grid graphs
  St. Abramowski, H. Müller
  Lecture Notes in Computer Science 246, 1987, pp. 118-130
• A simple implementation of Warshall's algorithm on a VLSI chip
  Ramesh Dewangan, C. Pandu Rangan
  Lecture Notes in Computer Science 246, 1987, pp. 131-145
• On some generalizations of outerplanar graphs: Results and open problems
  M.M. Sysƚo
  Lecture Notes in Computer Science 246, 1987, pp. 146-164
• Recognizing outerplanar graphs in linear time
  M. Wiegers
  Lecture Notes in Computer Science 246, 1987, pp. 165-176
• Graphs and graph polynomials of interest in chemistry
  I. Gutman
  Lecture Notes in Computer Science 246, 1987, pp. 177-187
• Applications of parallel scheduling to perfect graphs
  D. Helmbold, E. Mayr
  Lecture Notes in Computer Science 246, 1987, pp. 188-203
• A graph-theoretic approach for designing fair distributed resource scheduling algorithms
  H.F. Wedde
  Lecture Notes in Computer Science 246, 1987, pp. 204-226
• Improved diameter bounds for altered graphs
  A. Schoone, H. Bodlaender, J. van Leeuwen
  Lecture Notes in Computer Science 246, 1987, pp. 227-236
• Separability of sets of polygons
  F. Dehne, J.-R. Sack
  Lecture Notes in Computer Science 246, 1987, pp. 237-251
• Centipede graphs and visibility on a cylinder
  R. Tamassia, I.G. Tollis
  Lecture Notes in Computer Science 246, 1987, pp. 252-263
• The diameter of connected components of random graphs
  P. Spirakis
  Lecture Notes in Computer Science 246, 1987, pp. 264-276
• An algorithm for testing planarity of hierarchical graphs
  G. Di Battista, E. Nardelli
  Lecture Notes in Computer Science 246, 1987, pp. 277-289
• EDM - A data model for electronic CAD/CAM-applications
  D. Ruland
  Lecture Notes in Computer Science 246, 1987, pp. 290-305