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: Booktitle=Proceedings of the 13th Annual European Symposium on Algorithms, ESA'2005 (Palma de Mallorca, Spain, October 3-6, 2005)

• Designing reliable algorithms in unreliable memories
  Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
  Lecture Notes in Computer Science 3669, 2005, pp. 1-8
• From balanced graph partitioning to balanced metric labeling
  Joseph Naor
  Lecture Notes in Computer Science 3669, 2005, pp. 9-9
• Fearful symmetries: Quantum computing, factoring, and graph isomorphism
  Cristopher Moore
  Lecture Notes in Computer Science 3669, 2005, pp. 10-10
• Exploring an unknown graph efficiently
  Rudolf Fleischer, Gerhard Trippen
  Lecture Notes in Computer Science 3669, 2005, pp. 11-22
• Online routing in faulty meshes with sub-linear comparative time and traffic ratio
  Stefan Rührup, Christian Schindelhauer
  Lecture Notes in Computer Science 3669, 2005, pp. 23-34
• Heuristic improvements for computing maximum multicommodity flow and minimum multicut
  Garima Batra, Naveen Garg, Garima Gupta
  Lecture Notes in Computer Science 3669, 2005, pp. 35-46
• Relax-and-cut for capacitated network design
  Georg Kliewer, Larissa Timajev
  Lecture Notes in Computer Science 3669, 2005, pp. 47-58
• On the price of anarchy and stability of correlated equilibria of linear congestion games
  George Christodoulou, Elias Koutsoupias
  Lecture Notes in Computer Science 3669, 2005, pp. 59-70
• The complexity of games on highly regular graphs
  Konstantinos Daskalakis, Christos H. Papadimitriou
  Lecture Notes in Computer Science 3669, 2005, pp. 71-82
• Computing equilibrium prices: Does theory meet practice?
  Bruno Codenotti, Benton McCune, Rajiv Raman, Kasturi Varadarajan
  Lecture Notes in Computer Science 3669, 2005, pp. 83-94
• Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions
  Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
  Lecture Notes in Computer Science 3669, 2005, pp. 95-106
• An algorithm for the SAT problem for formulae of linear length
  Magnus Wahlström
  Lecture Notes in Computer Science 3669, 2005, pp. 107-118
• Linear-time enumeration of isolated cliques
  Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi
  Lecture Notes in Computer Science 3669, 2005, pp. 119-130
• Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
  Sergio Cabello, Bojan Mohar
  Lecture Notes in Computer Science 3669, 2005, pp. 131-142
• Delineating boundaries for imprecise regions
  Iris Reinbacher, Marc Benkert, Marc van Kreveld, Joseph S.B. Mitchell, Alexander Wolff
  Lecture Notes in Computer Science 3669, 2005, pp. 143-154
• EXACUS: Efficient and exact algorithms for curves and surfaces
  Eric Berberich, Arno Eigenwillig, Michael Hemmer, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Joachim Reichel, Susanne Schmitt, Elmar Schömer, Nicola Wolpert
  Lecture Notes in Computer Science 3669, 2005, pp. 155-166
• Min sum clustering with penalties
  Refael Hassin, Einat Or
  Lecture Notes in Computer Science 3669, 2005, pp. 167-178
• Improved approximation algorithms for metric Max TSP
  Zhi-Zhong Chen, Takayuki Nagoya
  Lecture Notes in Computer Science 3669, 2005, pp. 179-190
• Unbalanced graph cuts
  Ara Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina
  Lecture Notes in Computer Science 3669, 2005, pp. 191-202
• Low degree connectivity in ad-hoc networks
  Ludȇk Kuc̑era
  Lecture Notes in Computer Science 3669, 2005, pp. 203-214
• 5-regular graphs are 3-colorable with positive probability
  J. Díaz, G. Grammatikopoulos, A.C. Kaporis, L.M. Kirousis, X. Pérez, D.G. Sotiropoulos
  Lecture Notes in Computer Science 3669, 2005, pp. 215-225
• Optimal integer alphabetic trees in linear time
  T.C. Hu, Lawrence L. Larmore, J. David Morgenthaler
  Lecture Notes in Computer Science 3669, 2005, pp. 226-237
• Predecessor queries in constant time?
  Marek Karpinski, Yakov Nekrich
  Lecture Notes in Computer Science 3669, 2005, pp. 238-248
• An algorithm for node-capacitated ring routing
  András Frank, Zoltán Király, Balázs Kotnyek
  Lecture Notes in Computer Science 3669, 2005, pp. 249-258
• On degree constrained shortest paths
  Samir Khuller, Kwangil Lee, Mark Shayman
  Lecture Notes in Computer Science 3669, 2005, pp. 259-270