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

• Geodesic disks and clustering in a simple polygon
  Magdalene G. Borgelt, Marc van Kreveld, Jun Luo
  Lecture Notes in Computer Science 4835, 2007, pp. 656-667
• Optimal triangulation with Steiner points
  Boris Aronov, Tetsuo Asano, Stefan Funke
  Lecture Notes in Computer Science 4835, 2007, pp. 681-691
• In-place algorithm for image rotation
  Tetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuaki Usui
  Lecture Notes in Computer Science 4835, 2007, pp. 704-715
• Fast evaluation of union-intersection expressions
  Philip Bille, Anna Pagh, Rasmus Pagh
  Lecture Notes in Computer Science 4835, 2007, pp. 739-750
• A sub-cubic time algorithm for the k-maximum subarray problem
  Sung Eun Bae, Tadao Takaoka
  Lecture Notes in Computer Science 4835, 2007, pp. 751-762
• Finding popular places
  Marc Benkert, Bojan Djordjevic, Joachim Gudmundsson, Thomas Wolle
  Lecture Notes in Computer Science 4835, 2007, pp. 776-787
• Maintaining extremal points and its applications to deciding optimal orientations
  Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Sunghee Choi, Kyung-Yong Chwa
  Lecture Notes in Computer Science 4835, 2007, pp. 788-799
• The monomial ideal membership problem and polynomial identity testing
  V. Arvind, Partha Mukhopadhyay
  Lecture Notes in Computer Science 4835, 2007, pp. 800-811
• The space complexity of k-tree isomorphism
  V. Arvind, Bireswar Das, Johannes Köbler
  Lecture Notes in Computer Science 4835, 2007, pp. 822-833
• 2-stage fault tolerant interval group testing
  Ferdinando Cicalese, José Amgarten Quitzau
  Lecture Notes in Computer Science 4835, 2007, pp. 858-868
• Weighted treewidth algorithmic techniques and results
  Emgad Bachoore, Hans L. Bodlaender
  Lecture Notes in Computer Science 4835, 2007, pp. 893-903
• Analytic solutions of linear difference equations, formal series, and bottom summation
  S.A. Abramov, M. Petkovs̑ek
  Lecture Notes in Computer Science 4770, 2007, pp. 1-10
• Computations in modules over commutative domains
  Alkiviadis G. Akritas, Gennadi I. Malaschonok
  Lecture Notes in Computer Science 4770, 2007, pp. 11-23
• Advances on the continued fractions method using better estimations of positive root bounds
  Alkiviadis A. Akritas, Adam W. Strzeboński, Panagiotis S. Vigklas
  Lecture Notes in Computer Science 4770, 2007, pp. 24-30
• An efficient LLL gram using buffered transformations
  Werner Backes, Susanne Wetzel
  Lecture Notes in Computer Science 4770, 2007, pp. 31-44
• On the computation of a A _\infty-maps
  Ainhoa Berciano, María José Jiménez, Pedro Real
  Lecture Notes in Computer Science 4770, 2007, pp. 45-57
• Algebraic visualization of relations using RELVIEW
  Rudolf Berghammer, Gunther Schmidt
  Lecture Notes in Computer Science 4770, 2007, pp. 58-72
• Comprehensive triangular decomposition
  Changbo Chen, Oleg Golubitsky, François Lemaire, Marc Maza, Wei Pan
  Lecture Notes in Computer Science 4770, 2007, pp. 73-101
• Stability investigation of a difference scheme for incompressible Navier-Stokes equations
  Dmytro Chibisov, Victor Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov
  Lecture Notes in Computer Science 4770, 2007, pp. 102-117
• A symbolic-numerical algorithm for solving the eigenvalue problem for a hydrogen atom in the magnetic field: Cylindrical coordinates
  Ochbadrakh Chuluunbaatar, Alexander Gusev, Vladimir Gerdt, Michail Kaschiev, Vitaly Rostovtsev, Valentin Samoylov, Tatyana Tupikova, Sergue Vinitsky
  Lecture Notes in Computer Science 4770, 2007, pp. 118-133
• An algorithm for construction of normal forms
  Victor F. Edneral
  Lecture Notes in Computer Science 4770, 2007, pp. 134-142
• On the representation of the differential operator in bases of periodic coiflets and it's application
  Anna Deytseva
  Lecture Notes in Computer Science 4770, 2007, pp. 448-457
• Recognizing bipartite tolerance graphs in linear time
  Arthur H. Busch, Garth Isaak
  Lecture Notes in Computer Science 4769, 2007, pp. 12-20
• Graph operations characterizing rank-width and balanced graph expressions
  Bruno Courcelle, Mamadou Moustapha Kanté
  Lecture Notes in Computer Science 4769, 2007, pp. 66-75
• The 3-Steiner root problem
  Maw-Shang Chang, Ming-Tat Ko
  Lecture Notes in Computer Science 4769, 2007, pp. 109-120