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

• Graph labelings derived from models in distributed computing
  Jérémie Chalopin, Daniël Paulusma
  Lecture Notes in Computer Science 4271, 2006, pp. 301-312
• Flexible matchings
  Miklós Bartha, Miklós Krész
  Lecture Notes in Computer Science 4271, 2006, pp. 313-324
• Circular-perfect concave-round graphs
  Sylvain Coulonges
  Lecture Notes in Computer Science 4271, 2006, pp. 348-355
• Comparison maps for relatively free resolutions
  V. Álvarez, J.A. Armario, M.D. Frau, P. Real
  Lecture Notes in Computer Science 4194, 2006, pp. 1-22
• A symbolic-numeric approach for solving the eigenvalue problem for the one-dimensional Schrödinger equation
  I.N. Belyaeva, N.A. Chekanov, A.A. Gusev, V.A. Rostovtsev, S.I. Vinitsky
  Lecture Notes in Computer Science 4194, 2006, pp. 23-32
• Reducing computational costs in the basic perturbation lemma
  Ainhoa Berciano, María José Jiménez, Pedro Real
  Lecture Notes in Computer Science 4194, 2006, pp. 33-48
• Solving algorithmic problems on orders and lattices by relation algebra and RELVIEW
  Rudolf Berghammer
  Lecture Notes in Computer Science 4194, 2006, pp. 49-63
• Intervals, Syzygies, numerical Gröbner bases: A mixed study
  Marco Bodrato, Alberto Zanoni
  Lecture Notes in Computer Science 4194, 2006, pp. 64-76
• Application of computer algebra for construction of quasi-periodic solutions for restricted circular planar three body problem
  V.P. Borunov, Yu.A. Ryabov, O.V. Surkov
  Lecture Notes in Computer Science 4194, 2006, pp. 77-88
• Efficient preprocessing methods for quantifier elimination
  Christopher W. Brown, Christian Gross
  Lecture Notes in Computer Science 4194, 2006, pp. 89-100
• Symbolic and numerical calculation of transport integrals for some organic crystals
  A. Casian, R. Dusciac, V. Dusciac, V. Patsiuk
  Lecture Notes in Computer Science 4194, 2006, pp. 101-108
• On the provably tight approximation of optimal meshing for non-convex regions
  Dmytro Chibisov, Victor Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov
  Lecture Notes in Computer Science 4194, 2006, pp. 109-128
• Providing modern software environments to computer algebra systems
  Svetlana Cojocaru, Ludmila Malahova, Alexander Colesnicov
  Lecture Notes in Computer Science 4194, 2006, pp. 129-140
• The instability of the rhombus-like central configurations in Newton 9-body problem
  D. Diarova, N.I. Zemtsova
  Lecture Notes in Computer Science 4194, 2006, pp. 141-148
• Origami, linkages, and polyhedra: Folding with algorithms
  Erik D. Demaine
  Lecture Notes in Computer Science 4168, 2006, pp. 1-1
• Kinetic collision detection for convex fat objects
  M.A. Abam, M. de Berg, S.-H. Poon, B. Speckmann
  Lecture Notes in Computer Science 4168, 2006, pp. 4-15
• Dynamic connectivity for axis-parallel rectangles
  Peyman Afshani, Timothy M. Chan
  Lecture Notes in Computer Science 4168, 2006, pp. 16-27
• Single machine precedence constrained scheduling is a vertex cover problem
  Christoph Ambühl, Monaldo Mastrolilli
  Lecture Notes in Computer Science 4168, 2006, pp. 28-39
• Cooperative TSP
  Amitai Armon, Adi Avidor, Oded Schwartz
  Lecture Notes in Computer Science 4168, 2006, pp. 40-51
• Fréchet distance for curves, revisited
  Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk
  Lecture Notes in Computer Science 4168, 2006, pp. 52-63
• Resource allocation in bounded degree trees
  Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz
  Lecture Notes in Computer Science 4168, 2006, pp. 64-75
• Dynamic algorithms for graph spanners
  Surender Baswana
  Lecture Notes in Computer Science 4168, 2006, pp. 76-87
• Latency constrained aggregation in sensor networks
  Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti
  Lecture Notes in Computer Science 4168, 2006, pp. 88-99
• Competitive analysis of flash-memory algorithms
  Avraham Ben-Aroya, Sivan Toledo
  Lecture Notes in Computer Science 4168, 2006, pp. 100-111
• Contention resolution with heterogeneous job sizes
  Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
  Lecture Notes in Computer Science 4168, 2006, pp. 112-123