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

• Representing and enumerating edge connectivity cuts in \cal{RNC}
  Dalit Naor, Vijay V. Vazirani
  Lecture Notes in Computer Science 519, 1991, pp. 273-285
• Planar graph augmentation problems
  Goos Kant, Hans L. Bodlaender
  Lecture Notes in Computer Science 519, 1991, pp. 286-298
• Parametric search and locating supply centers in trees
  Greg N. Frederickson
  Lecture Notes in Computer Science 519, 1991, pp. 299-319
• On bends and lengths of rectilinear paths: A graph-theoretic approach
  C.D. Yang, D.T. Lee, C.K. Wong
  Lecture Notes in Computer Science 519, 1991, pp. 320-330
• Computing minimum length paths of a given homotopy class
  John Hershberger, Jack Snoeyink
  Lecture Notes in Computer Science 519, 1991, pp. 331-342
• Approximation algorithms for selecting network centers
  Judit Bar-Ilan, David Peleg
  Lecture Notes in Computer Science 519, 1991, pp. 343-354
• Facility dispersion problems: Heuristics and special cases
  S.S. Ravi, D.J. Rosenkrantz, G.K. Tayi
  Lecture Notes in Computer Science 519, 1991, pp. 355-366
• Optimum guard covers and m-watchmen routes for restricted polygons
  Svante Carlsson, Bengt J. Nilsson, Simeon Ntafos
  Lecture Notes in Computer Science 519, 1991, pp. 367-378
• Applications of a new space partitioning technique
  Pankaj K. Agarwal, Micha Sharir
  Lecture Notes in Computer Science 519, 1991, pp. 379-391
• Offline algorithms for dynamic minimum spanning tree problems
  David Eppstein
  Lecture Notes in Computer Science 519, 1991, pp. 392-399
• An empirical analysis of algorithms for constructing a minimum spanning tree
  Bernard M.E. Moret, Henry D. Shapiro
  Lecture Notes in Computer Science 519, 1991, pp. 400-411
• A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible
  Binary K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint
  Lecture Notes in Computer Science 519, 1991, pp. 412-424
• Dynamically maintaining the visibility graph
  Gert Vegter
  Lecture Notes in Computer Science 519, 1991, pp. 425-436
• An optimal algorithm for computing visibility in the plane
  Paul J. Heffernan, Joseph S.B. Mitchell
  Lecture Notes in Computer Science 519, 1991, pp. 437-448
• Fully persistent data structures for disjoint set union problems
  Giuseppe F. Italiano, Neil Sarnak
  Lecture Notes in Computer Science 519, 1991, pp. 449-460
• Algorithms for generating all spanning trees of undirected, directed and weighted graphs
  Sanjiv Kapoor, H. Ramesh
  Lecture Notes in Computer Science 519, 1991, pp. 461-472
• Sorting multisets and vectors in-place
  J. Ian Munro, Venkatesh Raman
  Lecture Notes in Computer Science 519, 1991, pp. 473-480
• Probabilistic leader election on rings of known size
  Karl Abrahamson, Andrew Adler, Lisa Higham, David Kirkpatrick
  Lecture Notes in Computer Science 519, 1991, pp. 481-495