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

• Discrepancy theory and computational geometry
  Bernard Chazelle
  Lecture Notes in Computer Science 1272, 1997, pp. 1-2
• Dynamic motion planning in low obstacle density environments
  Robert-Paul Berretty, Mark Overmars, A. Frank van der Stappen
  Lecture Notes in Computer Science 1272, 1997, pp. 3-16
• Visibility-based pursuit-evasion in a polygonal environment
  Leonidas J. Guibas, Jean-Claude Latombe, Steven M. LaValle, David Lin, Rajeev Motwani
  Lecture Notes in Computer Science 1272, 1997, pp. 17-30
• Maintaining the extent of a moving point set
  Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach
  Lecture Notes in Computer Science 1272, 1997, pp. 31-44
• Finding cores of limited length
  Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup
  Lecture Notes in Computer Science 1272, 1997, pp. 45-54
• On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
  Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrt'O
  Lecture Notes in Computer Science 1272, 1997, pp. 55-68
• Approximation algorithms for a genetic diagnostics problem
  S. Rao Kosaraju, Alejandro A. Schäffer, Leslie G. Biesecker
  Lecture Notes in Computer Science 1272, 1997, pp. 69-92
• Cartographic line simplication and polygon CSG formulae in O(n \log n) time
  John Hershberger, Jack Snoeyink
  Lecture Notes in Computer Science 1272, 1997, pp. 93-103
• Constrained TSP and low-power computing
  Moses Charikar, Rajeev Motwani, Prabhakar Raghavan, Craig Silverstein
  Lecture Notes in Computer Science 1272, 1997, pp. 104-115
• On-line load balancing for related machines
  Piotr Berman, Moses Charikar, Marek Karpinski
  Lecture Notes in Computer Science 1272, 1997, pp. 116-125
• A linear-time algorithm for the 1-mismatch problem
  Nikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross Hardison, Webb Miller
  Lecture Notes in Computer Science 1272, 1997, pp. 126-135
• On some geometric optimization problems in layered manufacturing
  Jayanth Majhi, Ravi Janardan, Michiel Smid, Prosenjit Gupta
  Lecture Notes in Computer Science 1272, 1997, pp. 136-149
• New TSP construction heuristics and their relationships to the 2-opt
  Hiroyuki Okano, Shinji Misono, Kazuo Iwano
  Lecture Notes in Computer Science 1272, 1997, pp. 150-159
• Pattern matching in hypertext
  Amihood Amir, Moshe Lewenstein, Noa Lewenstein
  Lecture Notes in Computer Science 1272, 1997, pp. 160-173
• Multiple approximate string matching
  Ricardo Baeza-Yates, Gonzalo Navarro
  Lecture Notes in Computer Science 1272, 1997, pp. 174-184
• Applied computational Geometry
  David P. Dobkin
  Lecture Notes in Computer Science 1272, 1997, pp. 185-185
• Checking the convexity of polytopes and the planarity of subdivisions
  O. Devillers, G. Liotta, F.P. Preparata, R. Tamassia
  Lecture Notes in Computer Science 1272, 1997, pp. 186-199
• Voronoi diagrams for polygon-offset distance functions
  Gill Barequet, Matthew T. Dickerson, Michael T. Goodrich
  Lecture Notes in Computer Science 1272, 1997, pp. 200-209
• Randomized algorithms for that ancient scheduling problem
  Steve Seiden
  Lecture Notes in Computer Science 1272, 1997, pp. 210-223
• Optimal parallel algorithms for proximate points with applications
  Tatsuya Hayashi, Koji Nakano, Stephan Olariu
  Lecture Notes in Computer Science 1272, 1997, pp. 224-233
• An efficient algorithm for shortest paths in vertical and horizontal segments
  David Eppstein, David W. Hart
  Lecture Notes in Computer Science 1272, 1997, pp. 234-247
• On geometric path query problems
  Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk
  Lecture Notes in Computer Science 1272, 1997, pp. 248-257
• On-line scheduling with hard deadlines
  Sally A. Goldman, Jyoti Parwatikar, Subhash Suri
  Lecture Notes in Computer Science 1272, 1997, pp. 258-271
• Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
  Sajal K. Das, M. Cristina Pinotti
  Lecture Notes in Computer Science 1272, 1997, pp. 272-281
• Parallel vs. parametric complexity
  Ketan Mulmuley
  Lecture Notes in Computer Science 1272, 1997, pp. 282-283