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

• Acyclic orientation of drawings
  Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
  Lecture Notes in Computer Science 4059, 2006, pp. 268-279
• Improved algorithms for quantum identification of Boolean oracles
  Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita
  Lecture Notes in Computer Science 4059, 2006, pp. 280-291
• Approximability of minimum AND-circuits
  Jan Arpe, Bodo Manthey
  Lecture Notes in Computer Science 4059, 2006, pp. 292-303
• Triangles, 4-cycles and parameterized (in-)tractability
  Venkatesh Raman, Saket Saurabh
  Lecture Notes in Computer Science 4059, 2006, pp. 304-315
• Better approximation schemes for disk graphs
  Erik van Leeuwen
  Lecture Notes in Computer Science 4059, 2006, pp. 316-327
• An approximation algorithm for the wireless gathering problem
  Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
  Lecture Notes in Computer Science 4059, 2006, pp. 328-338
• Minimum membership set covering and the consecutive ones property
  Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
  Lecture Notes in Computer Science 4059, 2006, pp. 339-350
• Approximating rational objectives is as easy as approximating linear ones
  José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi
  Lecture Notes in Computer Science 4059, 2006, pp. 351-362
• In-place algorithms for computing (layers of) maxima
  Henrik Blunck, Jan Vahrenhold
  Lecture Notes in Computer Science 4059, 2006, pp. 363-374
• Largest and smallest tours and convex hulls for imprecise points
  Maarten Löffler, Marc van Kreveld
  Lecture Notes in Computer Science 4059, 2006, pp. 375-387
• On spanners of geometric graphs
  Joachim Gudmundsson, Michiel Smid
  Lecture Notes in Computer Science 4059, 2006, pp. 388-399
• The weighted maximum-mean subtree and other bicriterion subtree problems
  Josiah Carlson, David Eppstein
  Lecture Notes in Computer Science 4059, 2006, pp. 400-410
• Linear-time algorithms for tree root problems
  Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu
  Lecture Notes in Computer Science 4059, 2006, pp. 411-422
• Generalized powers of graphs and their algorithmic use
  Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan
  Lecture Notes in Computer Science 4059, 2006, pp. 423-434