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

• An efficient quasidictionary
  Torben Hagerup, Rajeev Raman
  Lecture Notes in Computer Science 2368, 2002, pp. 1-18
• Combining pattern discovery and probabilistic modeling in data mining
  Heikki Mannila
  Lecture Notes in Computer Science 2368, 2002, pp. 19-19
• Time and space efficient multi-method dispatching
  Stephen Alstrup, Gerth Stlting Brodal, Inge Li Grtz, Theis Rauhe
  Lecture Notes in Computer Science 2368, 2002, pp. 20-29
• Linear time approximation schemes for vehicle scheduling
  John E. Augustine, Steven S. Seiden
  Lecture Notes in Computer Science 2368, 2002, pp. 30-39
• Minimizing makespan for the Lazy Bureaucrat Problem
  Clint Hepner, Cliff Stein
  Lecture Notes in Computer Science 2368, 2002, pp. 40-50
• A PTAS for the single machine scheduling problem with controllable processing times
  Monaldo Mastrolilli
  Lecture Notes in Computer Science 2368, 2002, pp. 51-59
• Optimum inapproximability results for finding minimum hidden guard sets in polygons and terrains
  Stephan Eidenbenz
  Lecture Notes in Computer Science 2368, 2002, pp. 60-68
• Simplex range searching and k nearest neighbors of a line segment in 2D
  Partha P. Goswami, Sandip Das, Subhas C. Nandy
  Lecture Notes in Computer Science 2368, 2002, pp. 69-79
• Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains
  Christos Levcopoulos, Andrzej Lingas, Joseph S.B. Mitchell
  Lecture Notes in Computer Science 2368, 2002, pp. 80-89
• Exact algorithms and approximation schemes for base station placement problems
  Nissan Lev-Tov, David Peleg
  Lecture Notes in Computer Science 2368, 2002, pp. 90-99
• A factor-2 approximation for labeling points with maximum sliding labels
  Zhongping Qin, Binhai Zhu
  Lecture Notes in Computer Science 2368, 2002, pp. 100-109
• Optimal algorithm for a special point-labeling problem
  Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
  Lecture Notes in Computer Science 2368, 2002, pp. 110-120
• Random arc allocation and applications
  Peter Sanders, Berthold Vöcking
  Lecture Notes in Computer Science 2368, 2002, pp. 121-130
• On neighbors in geometric permutations
  Micha Sharir, Shakhar Smorodinsky
  Lecture Notes in Computer Science 2368, 2002, pp. 131-139
• Powers of geometric intersection graphs and dispersion algorithms
  Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
  Lecture Notes in Computer Science 2368, 2002, pp. 140-149
• Efficient data reduction for DOMINATING SET: A linear problem kernel for the planar case
  Jochen Alber, Michael R. Fellows, Rolf Niedermeier
  Lecture Notes in Computer Science 2368, 2002, pp. 150-159
• Planar graph coloring with forbidden subgraphs: Why trees and paths are dangerous
  Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2368, 2002, pp. 160-169
• Approximation hardness of the Steiner tree problem on graphs
  Miroslav Chlebík, Janka Chlebíková
  Lecture Notes in Computer Science 2368, 2002, pp. 170-179
• The dominating set problem is fixed parameter tractable for graphs of bounded genus
  J. Ellis, H. Fan, M. Fellows
  Lecture Notes in Computer Science 2368, 2002, pp. 180-189
• The dynamic vertex minimum problem and its application to clustering-type approximation algorithms
  Harold N. Gabow, Seth Pettie
  Lecture Notes in Computer Science 2368, 2002, pp. 190-199
• A polynomial time algorithm to find the minimum cycle basis of a regular matroid
  Alexander Golynski, Joseph D. Horton
  Lecture Notes in Computer Science 2368, 2002, pp. 200-209
• Approximation algorithms for edge-dilation k-center problems
  Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha
  Lecture Notes in Computer Science 2368, 2002, pp. 210-219
• Forewarned is fore-armed: Dynamic digraph connectivity with lookahead speeds up a static clustering algorithm
  Sarnath Ramnath
  Lecture Notes in Computer Science 2368, 2002, pp. 220-229
• Improved algorithms for the random cluster graph model
  Ron Shamir, Dekel Tsur
  Lecture Notes in Computer Science 2368, 2002, pp. 230-239
• \Delta-list vertex coloring in linear time
  San Skulrattanakulchai
  Lecture Notes in Computer Science 2368, 2002, pp. 240-248