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

• Disjoint paths in the hypercube
  Seshu Madhavapeddy, I. Hal Sudborough
  Lecture Notes in Computer Science 411, 1989, pp. 3-18
• Time bounds for broadcasting in bounded degree graphs
  Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
  Lecture Notes in Computer Science 411, 1989, pp. 19-33
• t/s-diagnosable systems: A characterization and diagnosis algorithm
  A. Das, K. Thulasiraman, V.K. Agarwal, K.B. Lakshmanan
  Lecture Notes in Computer Science 411, 1989, pp. 34-45
• Toward a complete representation of graphoids in graphs
  Robert Y. Geva, Azaria Paz
  Lecture Notes in Computer Science 411, 1989, pp. 46-62
• CADULA - A graph based model for monitoring CAD-processes
  Detlev Ruland
  Lecture Notes in Computer Science 411, 1989, pp. 63-77
• On hyperedge replacement and BNLC graph grammars
  Walter Vogler
  Lecture Notes in Computer Science 411, 1989, pp. 78-93
• Graph rewriting systems with priorities
  Michel Billaud, Pierre Lafon, Yves Metivier, Eric Sopena
  Lecture Notes in Computer Science 411, 1989, pp. 94-106
• Filtering hyperedge-replacement languages through compatible properties
  Annegret Habel, Hans-Jörg Kreowski
  Lecture Notes in Computer Science 411, 1989, pp. 107-120
• Describing distributed systems by categorical graph grammars
  H.J. Schneider
  Lecture Notes in Computer Science 411, 1989, pp. 121-135
• A parser for context free plex grammars
  H. Bunke, B. Haller
  Lecture Notes in Computer Science 411, 1989, pp. 136-150
• Introduction to PROGRESS, an attribute graph grammar based specification language
  Andy Schürr
  Lecture Notes in Computer Science 411, 1989, pp. 151-165
• On the complexity of optimal drawings of graphs
  Franz J. Brandenburg
  Lecture Notes in Computer Science 411, 1989, pp. 166-180
• Bounds to the page number of partially ordered sets
  Maciej M. Syslo
  Lecture Notes in Computer Science 411, 1989, pp. 181-195
• Beyond Steiner's problem: A VLSI oriented generalization
  Gabriele Reich, Peter Widmayer
  Lecture Notes in Computer Science 411, 1989, pp. 196-210
• A fast sequential and parallel algorithm for the computation of the k-closure of a graph
  Ingo Schiermeyer
  Lecture Notes in Computer Science 411, 1989, pp. 211-217
• On feedback problems in digraph
  Ewald Speckenmeyer
  Lecture Notes in Computer Science 411, 1989, pp. 218-231
• Improved self-reduction algorithms for graphs with bounded treewidth
  Hans L. Bodlaender
  Lecture Notes in Computer Science 411, 1989, pp. 232-244
• Finding a minimal transitive reduction in a strongly connected digraph within linear time
  Klaus Simon
  Lecture Notes in Computer Science 411, 1989, pp. 245-259
• Paging binary trees with external balancing
  Andreas Henrich, Hans-Werner Six, Peter Widmayer
  Lecture Notes in Computer Science 411, 1989, pp. 260-276
• The complexity of graph problems for succintly represented graphs
  Antonio Lozano, José L. Balcázar
  Lecture Notes in Computer Science 411, 1989, pp. 277-286
• An O(n\log n) algorithm for 1-D tile compaction
  Richard Anderson, Simon Kahan, Martine Schlag
  Lecture Notes in Computer Science 411, 1989, pp. 287-301
• Weighted parallel triangulation of simple polygons
  K. Menzel, B. Monien
  Lecture Notes in Computer Science 411, 1989, pp. 302-315
• Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry
  Frank Dehne, Andrew Rau-Chaplin
  Lecture Notes in Computer Science 411, 1989, pp. 316-329
• k-nearest-neighbor Voronoi diagrams for sets of convex polygons, line segments and points
  Thomas Roos
  Lecture Notes in Computer Science 411, 1989, pp. 330-340
• Finding squares and rectangles in sets of points
  Marc J. van Krefeld, Mark T. de Berg
  Lecture Notes in Computer Science 411, 1989, pp. 341-355