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 [1]	Hilfe

Suche: Series=LNCS AND Volume=2832

• Sublinear computing
  Bernard Chazelle
  Lecture Notes in Computer Science 2832, 2003, pp. 1-1
• Authenticated data structures
  Roberto Tamassia
  Lecture Notes in Computer Science 2832, 2003, pp. 2-5
• Approximation algorithms and network games
  Éva Tardos
  Lecture Notes in Computer Science 2832, 2003, pp. 6-6
• I/O-efficient structures for orthogonal range-max and stabbing-max queries
  Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi
  Lecture Notes in Computer Science 2832, 2003, pp. 7-18
• Line system design and a generalized coloring problem
  Mansoor Alicherry, Randeep Bhatia
  Lecture Notes in Computer Science 2832, 2003, pp. 19-30
• Lagrangian relaxation for the k-median problem: New insights and continuity properties
  Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys
  Lecture Notes in Computer Science 2832, 2003, pp. 31-42
• Scheduling for flow-time with admission control
  Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere
  Lecture Notes in Computer Science 2832, 2003, pp. 43-54
• On approximating a geometric prize-collecting Traveling Salesman Problem with time windows
  Reuven Bar-Yehuda, Guy Even, Shimon (Moni) Shahar
  Lecture Notes in Computer Science 2832, 2003, pp. 55-66
• Semi-clairvoyant scheduling
  Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs
  Lecture Notes in Computer Science 2832, 2003, pp. 67-77
• Algorithms for graph rigidity and scene analysis
  Alex R. Berg, Tibor Jordán
  Lecture Notes in Computer Science 2832, 2003, pp. 78-89
• Optimal dynamic video-on-demand using adaptive broadcasting
  Therese Biedl, Erik D. Demaine, Alexander Golynski, Joseph D. Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper
  Lecture Notes in Computer Science 2832, 2003, pp. 90-101
• Multi-player and multi-round auctions with severely bounded communication
  Liad Blumrosen, Noam Nisan, Ilya Segal
  Lecture Notes in Computer Science 2832, 2003, pp. 102-113
• Network lifetime and power assignment in ad hoc wireless networks
  Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky
  Lecture Notes in Computer Science 2832, 2003, pp. 114-126
• Disjoint unit spheres admit at most two line transversals
  Otfried Cheong, Xavier Goaoc, Hyeon-Suk Na
  Lecture Notes in Computer Science 2832, 2003, pp. 127-135
• An optimal algorithm for the maximum-density segment problem
  Kai-min Chung, Hsueh-I Lu
  Lecture Notes in Computer Science 2832, 2003, pp. 136-147
• Estimating dominance norms of multiple data streams
  Graham Cormode, S. Muthukrishnan
  Lecture Notes in Computer Science 2832, 2003, pp. 148-160
• Smoothed motion complexity
  Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler
  Lecture Notes in Computer Science 2832, 2003, pp. 161-171
• Kinetic dictionaries: How to shoot a moving target
  Mark de Berg
  Lecture Notes in Computer Science 2832, 2003, pp. 172-183
• Deterministic rendezvous in graphs
  Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc
  Lecture Notes in Computer Science 2832, 2003, pp. 184-195
• Fast integer programming in fixed dimension
  Friedrich Eisenbrand
  Lecture Notes in Computer Science 2832, 2003, pp. 196-207
• Correlation clustering - Minimizing disagreements on arbitrary weighted graphs
  Dotan Emanuel, Amos Fiat
  Lecture Notes in Computer Science 2832, 2003, pp. 208-220
• Dominating sets and local treewidth
  Fedor V. Fomin, Dimtirios M. Thilikos
  Lecture Notes in Computer Science 2832, 2003, pp. 221-229
• Approximating energy efficient paths in wireless multi-hop networks
  Stefan Funke, Domagoj Matijevic, Peter Sanders
  Lecture Notes in Computer Science 2832, 2003, pp. 230-241
• Bandwidth maximization in multicasting
  Naveen Garg, Rohit Khandekar, Keshav Kunal, Vinayaka Pandit
  Lecture Notes in Computer Science 2832, 2003, pp. 242-253
• Optimal distance labeling for interval and circular-arc graphs
  Cyril Gavoille, Christophe Paul
  Lecture Notes in Computer Science 2832, 2003, pp. 254-265