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 [2]	Hilfe

Suche: Series=LNCS AND Volume=1879

• Simpler and faster vertex-connectivity augmentation algorithms
  Tsan-sheng Hsu
  Lecture Notes in Computer Science 1879, 2000, pp. 278-289
• Scheduling broadcasts in wireless networks
  Bala Kalyanasundaram, Kirk Pruhs, Mahe Velauthapillai
  Lecture Notes in Computer Science 1879, 2000, pp. 290-301
• Jitter regulation in an Internet router with delay consideration
  Hisashi Koga
  Lecture Notes in Computer Science 1879, 2000, pp. 302-313
• Approximation of curvature-constrained shortest paths through a sequence of points
  Jae-Ha Lee, Otfried Cheong, Woo-Cheol Kwon, Sung Yong Shin, Kyung-Yong Chwa
  Lecture Notes in Computer Science 1879, 2000, pp. 314-325
• Resource constrained shortest paths
  Kurt Mehlhorn, Mark Ziegelmann
  Lecture Notes in Computer Science 1879, 2000, pp. 326-337
• On the competitiveness of linear search
  J. Ian Munro
  Lecture Notes in Computer Science 1879, 2000, pp. 338-345
• Maintaining a minimum spanning tree under transient node failures
  Enrico Nardelli, Guido Proietti, Peter Widmayer
  Lecture Notes in Computer Science 1879, 2000, pp. 346-355
• Minimum depth graph embedding
  Maurizio Pizzonia, Roberto Tamassia
  Lecture Notes in Computer Science 1879, 2000, pp. 356-367
• New algorithms for two-label point labeling
  Zhongping Qin, Alexander Wolff, Yinfeng Xu, Binhai Zhu
  Lecture Notes in Computer Science 1879, 2000, pp. 368-379
• Analysing the cache behaviour of non-uniform distribution sorting algorithms
  Naila Rahman, Rajeev Raman
  Lecture Notes in Computer Science 1879, 2000, pp. 380-391
• How helpers hasten h-relations
  Peter Sanders, Roberto Solis-Oba
  Lecture Notes in Computer Science 1879, 2000, pp. 392-402
• Computing optimal linear layouts of trees in linear time
  Konstantin Skodinis
  Lecture Notes in Computer Science 1879, 2000, pp. 403-414
• Coloring sparse random graphs in polynomial average time
  C.R. Subramanian
  Lecture Notes in Computer Science 1879, 2000, pp. 415-426
• Restarts can help in the on-line minimization of the maximum delivery time on a single machine
  Marjan van den Akker, Han Hoogeveen, Nodari Vakhania
  Lecture Notes in Computer Science 1879, 2000, pp. 427-436
• Collision detection using bounding boxes: Convexity helps
  Yunhong Zhou, Subhash Suri
  Lecture Notes in Computer Science 1879, 2000, pp. 437-448