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

• Minimal conflicting sets for the consecutive ones property in ancestral genome reconstruction
  Cedric Chauve, Utz-Uwe Haus, Tamon Stephen, Vivija P. You
  Lecture Notes in Computer Science 5817, 2009, pp. 48-58
• Finding nested common intervals efficiently
  Guillaume Blin, Jens Stoye
  Lecture Notes in Computer Science 5817, 2009, pp. 59-69
• Pseudo Boolean programming for partially ordered genomes
  Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette
  Lecture Notes in Computer Science 5817, 2009, pp. 126-137
• Computing the summed adjacency disruption number between two genomes with duplicate genes using pseudo-Boolean optimization
  João Delgado, Inês Lynce, Vasco Manquinho
  Lecture Notes in Computer Science 5817, 2009, pp. 138-149
• A statistically fair comparison of ancestral genome reconstructions, based on breakpoint and rearrangement distances
  Zaky Adam, David Sankoff
  Lecture Notes in Computer Science 5817, 2009, pp. 193-204
• Improved approximation algorithms for label cover problems
  Moses Charikar, MohammadTaghi Hajiaghayi, Howard Karloff
  Lecture Notes in Computer Science 5757, 2009, pp. 23-34
• On inducing polygons and related problems
  Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
  Lecture Notes in Computer Science 5757, 2009, pp. 47-58
• Computing 3D periodic triangulations
  Manuel Caroli, Monique Teillaud
  Lecture Notes in Computer Science 5757, 2009, pp. 59-70
• Cauchy's theorem for orthogonal polyhedra of genus 0
  Therese Biedl, Burkay Genc
  Lecture Notes in Computer Science 5757, 2009, pp. 71-82
• A global-optimization algorithm for mixed-integer nonlinear programs having separable non-convexity
  Claudia D'Ambrosio, Jon Lee, Andreas Wächter
  Lecture Notes in Computer Science 5757, 2009, pp. 107-118
• Constructing Delaunay triangulations along space-filling curves
  Kevin Buchin
  Lecture Notes in Computer Science 5757, 2009, pp. 119-130
• Piercing translates and homothets of a convex body
  Adrian Dumitrescu, Minghui Jiang
  Lecture Notes in Computer Science 5757, 2009, pp. 131-142
• Output-sensitive algorithms for enumerating minimal transversals for some geometric hypergraphs
  Khaled Elbassioni, Kazuhisa Makino, Imran Rauf
  Lecture Notes in Computer Science 5757, 2009, pp. 143-154
• On revenue maximization in second-price ad auctions
  Yossi Azar, Benjamin Birnbaum, Anna R. Karlin, C. Thach Nguyen
  Lecture Notes in Computer Science 5757, 2009, pp. 155-166
• Geometric spanners for weighted point sets
  Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel Smid
  Lecture Notes in Computer Science 5757, 2009, pp. 190-202
• k-outerplanar graphs, planar duality, and low stretch spanning trees
  Yuval Emek
  Lecture Notes in Computer Science 5757, 2009, pp. 203-214
• Narrow-shallow-low-light trees with and without Steiner points
  Michael Elkin, Shay Solomon
  Lecture Notes in Computer Science 5757, 2009, pp. 215-226
• Bounded budget betweenness centrality game for strategic network formations
  Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhang, Jiajie Zhu
  Lecture Notes in Computer Science 5757, 2009, pp. 227-238
• Exact and approximate equilibria for optimal Group Network Formation
  Elliot Anshelevich, Bugra Caskurlu
  Lecture Notes in Computer Science 5757, 2009, pp. 239-250
• On the performance of approximate equilibria in congestion games
  George Christodoulou, Elias Koutsoupias, Paul G. Spirakis
  Lecture Notes in Computer Science 5757, 2009, pp. 251-262
• Optimality and competitiveness of exploring polygons by mobile robots
  Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
  Lecture Notes in Computer Science 5757, 2009, pp. 263-274
• Algorithms meet art, puzzles, and magic
  Erik D. Demaine
  Lecture Notes in Computer Science 5757, 2009, pp. 289-289
• Breaking the O(m2^n) barrier for minimum cycle bases
  Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi
  Lecture Notes in Computer Science 5757, 2009, pp. 301-312
• On the power of uniform power: Capacity of wireless networks with bounded resources
  Chen Avin, Zvi Lotker, Yvonne-Anne Pignolet
  Lecture Notes in Computer Science 5757, 2009, pp. 373-384
• On optimally partitioning a text to improve its compression
  Paolo Ferragina, Igor Nitto, Rossano Venturini
  Lecture Notes in Computer Science 5757, 2009, pp. 420-431