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

• On Salesmen, Repairmen, Spiders, and other Traveling agents
  Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela
  Lecture Notes in Computer Science 1767, 2000, pp. 1-16
• Computing a diameter-constrained minimum spanning tree in parallel
  Narsingh Deo, Ayman Abdalla
  Lecture Notes in Computer Science 1767, 2000, pp. 17-31
• Algorithms for a simple point placement problem
  Joshua Redstone, Walter L. Ruzzo
  Lecture Notes in Computer Science 1767, 2000, pp. 32-43
• Duality in ATM layout problems
  Shmuel Zaks
  Lecture Notes in Computer Science 1767, 2000, pp. 44-58
• The independence number of random interval graphs
  W. Fernandez de la Vega
  Lecture Notes in Computer Science 1767, 2000, pp. 59-62
• Online strategies for backups
  Peter Damaschke
  Lecture Notes in Computer Science 1767, 2000, pp. 63-71
• Towards the notion of stability of approximation for hard optimization tasks and the Traveling Salesman Problem
  Hans-Joachim Böckenhauer, Juraj Hromkovic̑, Ralf Klasing, Sebastian Seibert, Walter Unger
  Lecture Notes in Computer Science 1767, 2000, pp. 72-86
• Semantical counting circuits
  Fabrice Noilhan, Miklos Santha
  Lecture Notes in Computer Science 1767, 2000, pp. 87-101
• The hardness of placing street names in a Manhattan type map
  Sebastian Seibert, Walter Unger
  Lecture Notes in Computer Science 1767, 2000, pp. 102-112
• Labeling downtown
  Gabriele Neyer, Frank Wagner
  Lecture Notes in Computer Science 1767, 2000, pp. 113-124
• The online dial-a-ride problem under reasonable load
  Dietrich Hauptmeier, Sven O. Krumke, Jörg Rambau
  Lecture Notes in Computer Science 1767, 2000, pp. 125-136
• The online-TSP against fair adversaries
  Michiel Blom, Sven O. Krumke, Willem de Paepe, Leen Stougie
  Lecture Notes in Computer Science 1767, 2000, pp. 137-149
• QuickHeapsort, an efficient mix of classical sorting algorithms
  Domenico Cantone, Gianluca Cincotti
  Lecture Notes in Computer Science 1767, 2000, pp. 150-162
• Triangulations without minimum-weight drawing
  Cao An Wang, Francis Y. Chin, Boting Yang
  Lecture Notes in Computer Science 1767, 2000, pp. 163-173
• Faster exact solutions for MAX2SAT
  Jens Gramm, Rolf Niedermeier
  Lecture Notes in Computer Science 1767, 2000, pp. 174-186
• Dynamically maintaining the widest k-dense corridor
  Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
  Lecture Notes in Computer Science 1767, 2000, pp. 187-198
• Reconstruction of discrete sets from three or more X-rays
  Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Maurice Nivat
  Lecture Notes in Computer Science 1767, 2000, pp. 199-210
• Modified binary searching for static tables
  Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri
  Lecture Notes in Computer Science 1767, 2000, pp. 211-225
• An efficient algorithm for the approximate median selection problem
  Sebastiano Battiato, Domenico Cantone, Dario Catalano, Gianluca Cincotti, Micha Hofri
  Lecture Notes in Computer Science 1767, 2000, pp. 226-238
• Extending the implicit computational complexity approach to the sub-elementary time-space classes
  Emanuele Covino, Giovanni Pani, Salvatore Caporaso
  Lecture Notes in Computer Science 1767, 2000, pp. 239-252
• Group updates for red-black trees
  Sabine Hanke, Eljas Soisalon-Soininen
  Lecture Notes in Computer Science 1767, 2000, pp. 253-262
• Approximating SVP\infty to within almost-polynomial factors is NP-hard
  Irit Dinur
  Lecture Notes in Computer Science 1767, 2000, pp. 263-276
• Convergence analysis of simulated annealing-based algorithms solving flow shop scheduling problems
  Kathleen Steinhöfel, Andreas Albrecht, Chak-Kuen Wong
  Lecture Notes in Computer Science 1767, 2000, pp. 277-290
• On the Lovász number of certain circulant graphs
  Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini
  Lecture Notes in Computer Science 1767, 2000, pp. 291-305
• Speeding up pattern matching by text compression
  Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa
  Lecture Notes in Computer Science 1767, 2000, pp. 306-315