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 YEAR=2009

• Exact algorithms for dominating clique problems
  N. Bourgeois, F. Della Croce, B. Escoffier, V.Th. Paschos
  Lecture Notes in Computer Science 5878, 2009, pp. 4-13
• Exact algorithms for the bottleneck Steiner tree problem
  Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa
  Lecture Notes in Computer Science 5878, 2009, pp. 24-33
• Practical discrete unit disk cover using an exact line-separable algorithm
  Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Alejandro Salinger
  Lecture Notes in Computer Science 5878, 2009, pp. 45-54
• A structural lemma in 2-dimensional packing, and its implications on approximability
  Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko
  Lecture Notes in Computer Science 5878, 2009, pp. 77-86
• Fréchet distance problems in weighted regions
  Yam Ki Cheung, Ovidiu Daescu
  Lecture Notes in Computer Science 5878, 2009, pp. 97-111
• The complexity of solving stochastic games on graphs
  Daniel Andersson, Peter Bro Miltersen
  Lecture Notes in Computer Science 5878, 2009, pp. 112-121
• New bounds on the average distance from the Fermat-Weber center of a planar convex body
  Adrian Dumitrescu, Csaba D. Tóth
  Lecture Notes in Computer Science 5878, 2009, pp. 132-141
• Reconstructing numbers from pairwise function values
  Shiteng Chen, Zhiyi Huang, Sampath Kannan
  Lecture Notes in Computer Science 5878, 2009, pp. 142-152
• Online sorted range reporting
  Gerth Stlting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz
  Lecture Notes in Computer Science 5878, 2009, pp. 173-182
• Dynamic 3-sided planar range queries with expected doubly logarithmic time
  Gerth Stlting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas
  Lecture Notes in Computer Science 5878, 2009, pp. 193-202
• Untangled monotonic chains and adaptive range search
  Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala
  Lecture Notes in Computer Science 5878, 2009, pp. 203-212
• Approximating points by a piecewise linear function: I
  Danny Z. Chen, Haitao Wang
  Lecture Notes in Computer Science 5878, 2009, pp. 224-233
• Approximating points by a piecewise linear function: II. Dealing with outliers
  Danny Z. Chen, Haitao Wang
  Lecture Notes in Computer Science 5878, 2009, pp. 234-243
• 1-bounded space algorithms for 2-dimensional bin packing
  Francis Y.L. Chin, Hing-Fung Ting, Yong Zhang
  Lecture Notes in Computer Science 5878, 2009, pp. 321-330
• On the advice complexity of online problems
  Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic̑, Richard Královic̑, Tobias Mömke
  Lecture Notes in Computer Science 5878, 2009, pp. 331-340
• Minimum covering with travel cost
  Sándor P. Fekete, Joseph S.B. Mitchell, Christiane Schmidt
  Lecture Notes in Computer Science 5878, 2009, pp. 393-402
• Complexity of approximating the vertex centroid of a polyhedron
  Khaled Elbassioni, Hans Raj Tiwary
  Lecture Notes in Computer Science 5878, 2009, pp. 413-422
• Algorithmic folding complexity
  Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara
  Lecture Notes in Computer Science 5878, 2009, pp. 452-461
• Linear and sublinear time algorithms for basis of Abelian groups
  Li Chen, Bin Fu
  Lecture Notes in Computer Science 5878, 2009, pp. 493-502
• Good programming in transactional memory - Game theory meets multicore architecture
  Raphael Eidenbenz, Roger Wattenhofer
  Lecture Notes in Computer Science 5878, 2009, pp. 503-513
• A certifying algorithm for 3-colorability of P_5-free graphs
  Daniel Bruce, Chính T. Hoàng, Joe Sawada
  Lecture Notes in Computer Science 5878, 2009, pp. 594-604
• On lower bounds for constant width arithmetic circuits
  V. Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
  Lecture Notes in Computer Science 5878, 2009, pp. 637-646
• Spending is not easier than trading: On the computational equivalence of Fisher and Arrow-Debreu equilibria
  Xi Chen, Shang-Hua Teng
  Lecture Notes in Computer Science 5878, 2009, pp. 647-656
• The identity correspondence problem and its applications
  Paul C. Bell, Igor Potapov
  Lecture Notes in Computer Science 5878, 2009, pp. 657-667
• Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs
  Andrzej Czygrinow, Michaƚ Hańćkowiak, Edyta Szymańska
  Lecture Notes in Computer Science 5878, 2009, pp. 668-678