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

• Splitting a Delaunay triangulation in linear time
  Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud
  Lecture Notes in Computer Science 2161, 2001, pp. 312-320
• A fast algorithm for approximating the detour of a polygonal chain
  Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas
  Lecture Notes in Computer Science 2161, 2001, pp. 321-332
• An approximation algorithm for MINIMUM CONVEX COVER with logarithmic performance guarantee
  Stephan Eidenbenz, Peter Widmayer
  Lecture Notes in Computer Science 2161, 2001, pp. 333-344
• Distributed O(\delta \log n)-edge-coloring algorithm
  A. Czygrinow, M. Hańćkowiak, M. Karoński
  Lecture Notes in Computer Science 2161, 2001, pp. 345-355
• Modeling replica placement in a distributed file system: Narrowing the gap between analysis and simulation
  John R. Douceur, Roger P. Wattenhofer
  Lecture Notes in Computer Science 2161, 2001, pp. 356-367
• Computing cycle covers without short cycles
  Markus Bläser, Bodo Siebert
  Lecture Notes in Computer Science 2161, 2001, pp. 368-379
• A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth
  Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
  Lecture Notes in Computer Science 2161, 2001, pp. 380-390
• Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
  Norbert Sensen
  Lecture Notes in Computer Science 2161, 2001, pp. 391-403
• Fast pricing of European Asian options with provable accuracy: Single-stock and basket options
  Karhan Akcoglu, Ming-Yang Kao, Shuba V. Raghavan
  Lecture Notes in Computer Science 2161, 2001, pp. 404-415
• Competitive auctions for multiple digital goods
  Andrew V. Goldberg, Jason D. Hartline
  Lecture Notes in Computer Science 2161, 2001, pp. 416-427
• Algorithms for efficient filtering in content-based multicast
  Stefan Langerman, Sachin Lodha, Rahul Shah
  Lecture Notes in Computer Science 2161, 2001, pp. 428-439
• Approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode
  Pierre Fraigniaud
  Lecture Notes in Computer Science 2161, 2001, pp. 440-451
• Round robin is optimal for fault-tolerant broadcasting on wireless networks
  Andrea E.F. Clementi, Angelo Monti, Riccardo Silvestri
  Lecture Notes in Computer Science 2161, 2001, pp. 452-463
• Online and offline distance constrained labeling of disk graphs
  Jiȓí Fiala, Aleksei V. Fishkin, Fedor V. Fomin
  Lecture Notes in Computer Science 2161, 2001, pp. 464-475
• Approximate distance labeling schemes
  Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, David Peleg
  Lecture Notes in Computer Science 2161, 2001, pp. 476-487
• On the parameterized complexity of layered graph drawing
  V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, D.R. Wood
  Lecture Notes in Computer Science 2161, 2001, pp. 488-499
• A general model of undirected web graphs
  Colin Cooper, Alan M. Frieze
  Lecture Notes in Computer Science 2161, 2001, pp. 500-511
• Packing cycles and cuts in undirected graphs
  Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
  Lecture Notes in Computer Science 2161, 2001, pp. 512-523
• Greedy algorithms for minimisation problems in random regular graphs
  Michele Zito
  Lecture Notes in Computer Science 2161, 2001, pp. 524-536