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 YEAR=2007

• Improved results for a memory allocation problem
  Leah Epstein, Rob van Stee
  Lecture Notes in Computer Science 4619, 2007, pp. 362-373
• Computational and structural advantages of circular boundary representation
  Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder, Zbynȇk S̑ír
  Lecture Notes in Computer Science 4619, 2007, pp. 374-385
• Alpha-beta witness complexes
  Dominique Attali, Herbert Edelsbrunner, John Harer, Yuriy Mileyko
  Lecture Notes in Computer Science 4619, 2007, pp. 386-397
• Cauchy's theorem and edge lengths of convex polyhedra
  Therese Biedl, Anna Lubiw, Michael Spriggs
  Lecture Notes in Computer Science 4619, 2007, pp. 398-409
• Improved algorithms for the feedback vertex set problems
  Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger
  Lecture Notes in Computer Science 4619, 2007, pp. 422-433
• Kernelization algorithms for d-Hitting Set problems
  Faisal N. Abu-Khzam
  Lecture Notes in Computer Science 4619, 2007, pp. 434-445
• Maximizing maximal angles for plane straight-line graphs
  Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
  Lecture Notes in Computer Science 4619, 2007, pp. 458-469
• An improved parameterized algorithm for the minimum node multiway cut problem
  Jianer Chen, Yang Liu, Songjian Lu
  Lecture Notes in Computer Science 4619, 2007, pp. 495-506
• On computing the centroid of the vertices of an arrangement and related problems
  Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary
  Lecture Notes in Computer Science 4619, 2007, pp. 519-528
• Optimal algorithms for the weighted p-center problems on the real line for small p
  Binay Bhattacharya, Qiaosheng Shi
  Lecture Notes in Computer Science 4619, 2007, pp. 529-540
• Faster approximation of distances in graphs
  Piotr Berman, Shiva Prasad Kasiviswanathan
  Lecture Notes in Computer Science 4619, 2007, pp. 541-552
• Approximate shortest paths guided by a small index
  Jörg Derungs, Riko Jacob, Peter Widmayer
  Lecture Notes in Computer Science 4619, 2007, pp. 553-564
• Space-efficient straggler identification in round-trip data streams via Newton's identities and invertible Bloom filters
  David Eppstein, Michael T. Goodrich
  Lecture Notes in Computer Science 4619, 2007, pp. 637-648
• The combinatorics of sequencing the corn genome
  Srinivas Aluru
  Lecture Notes in Computer Science 4598, 2007, pp. 1-1
• Online frequency assignment in wireless communication networks
  Francis Y.L. Chin
  Lecture Notes in Computer Science 4598, 2007, pp. 2-2
• A new field splitting algorithm for intensity-modulated radiation therapy
  Danny Z. Chen, Mark A. Healy, Chao Wang, Xiaodong Wu
  Lecture Notes in Computer Science 4598, 2007, pp. 4-15
• Seed-based exclusion method for non-coding RNA gene search
  Jean-Eudes Duchesne, Mathieu Giraud, Nadia El-Mabrouk
  Lecture Notes in Computer Science 4598, 2007, pp. 27-39
• Connected coloring completion for general graphs: Algorithms and complexity
  Benny Chor, Michael Fellows, Mark A. Ragan, Igor Razgon, Frances Rosamond, Sagi Snir
  Lecture Notes in Computer Science 4598, 2007, pp. 75-85
• Quadratic kernelization for convex recoloring of trees
  Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
  Lecture Notes in Computer Science 4598, 2007, pp. 86-96
• On the number of cycles in planar graphs
  Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
  Lecture Notes in Computer Science 4598, 2007, pp. 97-107
• Scheduling selfish tasks: About the performance of truthful algorithms
  George Christodoulou, Laurent Gourvès, Fanny Pascual
  Lecture Notes in Computer Science 4598, 2007, pp. 187-197
• Improved throughput bounds for interference-aware routing in wireless networks
  Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou
  Lecture Notes in Computer Science 4598, 2007, pp. 210-221
• Generating minimal k-vertex connected spanning subgraphs
  Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gabor Rudolf
  Lecture Notes in Computer Science 4598, 2007, pp. 222-231
• Finding many optimal paths without growing any optimal path trees
  Danny Z. Chen, Ewa Misioƚek
  Lecture Notes in Computer Science 4598, 2007, pp. 232-242
• Colored simultaneous geometric embeddings
  U. Brandes, C. Erten, J. Fowler, F. Frati, M. Geyer, C. Gutwenger, S. Hong, M. Kaufmann, S.G. Kobourov, G. Liotta, P. Mutzel, A. Symvonis
  Lecture Notes in Computer Science 4598, 2007, pp. 254-263