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

• Efficient algorithms for intensity map splitting problems in radiation therapy
  Xiaodong Wu
  Lecture Notes in Computer Science 3595, 2005, pp. 504-513
• Distributions of points in d dimensions and large k-point simplices
  Hanno Lefmann
  Lecture Notes in Computer Science 3595, 2005, pp. 514-523
• Exploring simple grid polygons
  Christian Icking, Tom Kamphans, Rolf Klein, Elmar Langetepe
  Lecture Notes in Computer Science 3595, 2005, pp. 524-533
• Approximation algorithms for cutting out polygons with lines and rays
  Xuehou Tan
  Lecture Notes in Computer Science 3595, 2005, pp. 534-543
• Efficient non-intersection queries on aggregated geometric data
  Prosenjit Gupta, Ravi Janardan, Michiel Smid
  Lecture Notes in Computer Science 3595, 2005, pp. 544-553
• An upper bound on the number of rectangulations of a point set
  Eyal Ackerman, Gill Barequet, Ron Y. Pinter
  Lecture Notes in Computer Science 3595, 2005, pp. 554-559
• Opportunistic data structures for range queries
  Chung Keung Poon, Wai Keung Yiu
  Lecture Notes in Computer Science 3595, 2005, pp. 560-569
• Generating combinations by prefix shifts
  Frank Ruskey, Aaron Williams
  Lecture Notes in Computer Science 3595, 2005, pp. 570-576
• Error-set codes and related objects
  An Braeken, Ventzislav Nikov, Svetla Nikova
  Lecture Notes in Computer Science 3595, 2005, pp. 577-585
• On Walrasian price of CPU time
  Xiaotie Deng, Li-Sha Huang, Minming Li
  Lecture Notes in Computer Science 3595, 2005, pp. 586-595
• On-line algorithms for market equilibria
  Spyros Angelopoulos, Atish Das Sarma, Avner Magen, Anastasios Viglas
  Lecture Notes in Computer Science 3595, 2005, pp. 596-607
• Interval subset sum and uniform-price auction clearing
  Anshul Kothari, Subhash Suri, Yunhong Zhou
  Lecture Notes in Computer Science 3595, 2005, pp. 608-620
• Improved algorithms for the K-maximum subarray problem for small K
  Sung E. Bae, Tadao Takaoka
  Lecture Notes in Computer Science 3595, 2005, pp. 621-631
• Server allocation algorithms for tiered systems
  Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Tarjan, Yunhong Zhou
  Lecture Notes in Computer Science 3595, 2005, pp. 632-643
• An improved approximation algorithm for uncapacitated facility location problem with penalties
  Guang Xu, Jinhui Xu
  Lecture Notes in Computer Science 3595, 2005, pp. 644-653
• The reverse greedy algorithm for the metric k-median problem
  Marek Chrobak, Claire Kenyon, Neal E. Young
  Lecture Notes in Computer Science 3595, 2005, pp. 654-660
• On approximate balanced bi-clustering
  Guoxuan Ma, Jiming Peng, Yu Wei
  Lecture Notes in Computer Science 3595, 2005, pp. 661-670
• Toroidal grids are anti-magic
  Tao-Ming Wang
  Lecture Notes in Computer Science 3595, 2005, pp. 671-679
• Optimally balanced forward degree sequence
  Xiaomin Chen, Mario Szegedy, Lei Wang
  Lecture Notes in Computer Science 3595, 2005, pp. 680-689
• Conditionally critical indecomposable graphs
  Chandan K. Dubey, Shashank K. Mehta, Jitender S. Deogun
  Lecture Notes in Computer Science 3595, 2005, pp. 690-700
• A tight analysis of the maximal matching heuristic
  Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot
  Lecture Notes in Computer Science 3595, 2005, pp. 701-709
• New streaming algorithms for counting triangles in graphs
  Hossein Jowhari, Mohammad Ghodsi
  Lecture Notes in Computer Science 3595, 2005, pp. 710-716
• A new approach and faster exact methods for the maximum common subgraph problem
  W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, Christopher T. Symons, Nagiza F. Samatova, Michael A. Langston
  Lecture Notes in Computer Science 3595, 2005, pp. 717-727
• On the power of lookahead in on-line vehicle routing problems
  Luca Allulli, Giorgio Ausiello, Luigi Laura
  Lecture Notes in Computer Science 3595, 2005, pp. 728-736
• Efficient algorithms for simplifying flow networks
  Ewa Misioƚek, Danny Z. Chen
  Lecture Notes in Computer Science 3595, 2005, pp. 737-746