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

• A new algorithm for finding trees with many leaves
  Joachim Kneis, Alexander Langer, Peter Rossmanith
  Lecture Notes in Computer Science 5369, 2008, pp. 270-281
• Faster parameterized algorithms for MINIMUM FILL-IN
  Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger
  Lecture Notes in Computer Science 5369, 2008, pp. 282-293
• Graph layout problems parameterized by vertex cover
  Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh
  Lecture Notes in Computer Science 5369, 2008, pp. 294-305
• A linear kernel for the k-disjoint cycle problem on planar graphs
  Hans L. Bodlaender, Eelko Penninkx, Richard B. Tan
  Lecture Notes in Computer Science 5369, 2008, pp. 306-317
• How to guard a graph?
  Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús̑ Mihalák, Elias Vicari, Peter Widmayer
  Lecture Notes in Computer Science 5369, 2008, pp. 318-329
• Tree decontamination with temporary immunity
  Paola Flocchini, Bernard Mans, Nicola Santoro
  Lecture Notes in Computer Science 5369, 2008, pp. 330-341
• Reconfiguration of cube-style modular robots using O(\log n) parallel moves
  Greg Aloupis, Sébastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristán, Stefanie Wuhrer
  Lecture Notes in Computer Science 5369, 2008, pp. 342-353
• Squaring the circle with weak mobile robots
  Yoann Dieudonné, Franck Petit
  Lecture Notes in Computer Science 5369, 2008, pp. 354-365
• Evaluation of general set expressions
  Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh
  Lecture Notes in Computer Science 5369, 2008, pp. 366-377
• Computing with priced information: When the value makes the price
  Ferdinando Cicalese, Martin Milanic̑
  Lecture Notes in Computer Science 5369, 2008, pp. 378-389
• Deductive inference for the interiors and exteriors of Horn theories
  Kazuhisa Makino, Hirotaka Ono
  Lecture Notes in Computer Science 5369, 2008, pp. 390-401
• Leaf powers and their properties: Using the trees
  R. Michael Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle
  Lecture Notes in Computer Science 5369, 2008, pp. 402-413
• Deterministic sparse column based matrix reconstruction via greedy approximation of SVD
  Ali Çivril, Malik Magdon-Ismail
  Lecture Notes in Computer Science 5369, 2008, pp. 414-423
• Minimizing total flow-time: The unrelated case
  Naveen Garg, Amit Kumar, V.N. Muralidhara
  Lecture Notes in Computer Science 5369, 2008, pp. 424-435
• Approximating the volume of unions and intersections of high-dimensional geometric objects
  Karl Bringmann, Tobias Friedrich
  Lecture Notes in Computer Science 5369, 2008, pp. 436-447
• Space-efficient informational redundancy
  Christian Glaßer
  Lecture Notes in Computer Science 5369, 2008, pp. 448-459
• Minkowski sum selection and finding
  Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao
  Lecture Notes in Computer Science 5369, 2008, pp. 460-471
• Constructing the simplest possible phylogenetic network from triplets
  Leo van Iersel, Steven Kelk
  Lecture Notes in Computer Science 5369, 2008, pp. 472-483
• New results on optimizing rooted triplets consistency
  Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
  Lecture Notes in Computer Science 5369, 2008, pp. 484-495
• A method to overcome computer word size limitation in bit-parallel pattern matching
  M. Og̑uzhan Külekci
  Lecture Notes in Computer Science 5369, 2008, pp. 496-506
• Inducing polygons of line arrangements
  Ludmila Scharf, Marc Scherfenberg
  Lecture Notes in Computer Science 5369, 2008, pp. 507-519
• Free-form surface partition in 3-D
  Danny Z. Chen, Ewa Misioƚek
  Lecture Notes in Computer Science 5369, 2008, pp. 520-531
• Approximate nearest neighbor search under translation invariant Hausdorff distance
  Christian Knauer, Marc Scherfenberg
  Lecture Notes in Computer Science 5369, 2008, pp. 532-543
• Preprocessing imprecise points and splitting triangulations
  Marc van Kreveld, Maarten Löffler, Joseph S.B. Mitchell
  Lecture Notes in Computer Science 5369, 2008, pp. 544-555
• Efficient output-sensitive construction of Reeb graphs
  Harish Doraiswamy, Vijay Natarajan
  Lecture Notes in Computer Science 5369, 2008, pp. 556-567