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

• On the maximum cardinality search lower bound for treewidth
  Hans L. Bodlaender, Arie M.C.A. Koster
  Lecture Notes in Computer Science 3353, 2004, pp. 81-92
• Fully-dynamic recognition algorithm and certificate for directed cographs
  Christophe Crespelle, Christophe Paul
  Lecture Notes in Computer Science 3353, 2004, pp. 93-104
• A graph-theoretic generalization of the least common subsumer and the most specific concept in the description logic \varepsilon L
  Franz Baader
  Lecture Notes in Computer Science 3353, 2004, pp. 177-188
• The computational complexity of the minimum weight processor assignment problem
  Hajo J. Broersma, Daniel Paulusma, Gerard J.M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger
  Lecture Notes in Computer Science 3353, 2004, pp. 189-200
• A stochastic location problem with applications to tele-diagnostic
  Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano
  Lecture Notes in Computer Science 3353, 2004, pp. 201-213
• Linear kernels in linear time, or how to save k colors in O(n^2) steps
  Benny Chor, Mike Fellows, David Juedes
  Lecture Notes in Computer Science 3353, 2004, pp. 257-269
• Planar graphs, via well-orderly maps and trees
  Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer
  Lecture Notes in Computer Science 3353, 2004, pp. 270-284
• Efficient computation of the Lovász theta function for a class of circulant graphs
  Valentin E. Brimkov, Reneta P. Barneva, Reinhard Klette, Joseph Straight
  Lecture Notes in Computer Science 3353, 2004, pp. 285-295
• Computing bounded-degree phylogenetic roots of disconnected graphs
  Zhi-Zhong Chen, Tatsuie Tsukiji
  Lecture Notes in Computer Science 3353, 2004, pp. 308-319
• Crossing reduction in circular layouts
  Michael Baur, Ulrik Brandes
  Lecture Notes in Computer Science 3353, 2004, pp. 332-343
• Characterization and recognition of generalized clique-Helly graphs
  Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter
  Lecture Notes in Computer Science 3353, 2004, pp. 344-354
• Edge-connectivity augmentation and network matrices
  Michele Conforti, Anna Galluccio, Guido Proietti
  Lecture Notes in Computer Science 3353, 2004, pp. 355-364
• Core stability of minimum coloring games
  Thomas Bietenhader, Yoshio Okamoto
  Lecture Notes in Computer Science 3353, 2004, pp. 389-401
• Puzzles, art, and magic with algorithms
  Erik D. Demaine
  Lecture Notes in Computer Science 3341, 2004, pp. 1-1
• Pareto optimality in house allocation problems
  David J. Abraham, Katarína Cechlárová, David F. Manlove, Kurt Mehlhorn
  Lecture Notes in Computer Science 3341, 2004, pp. 3-15
• Property-preserving data reconstruction
  Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
  Lecture Notes in Computer Science 3341, 2004, pp. 16-27
• On the monotone circuit complexity of quadratic Boolean functions
  Kazuyuki Amano, Akira Maruoka
  Lecture Notes in Computer Science 3341, 2004, pp. 28-40
• Generalized function matching
  Amihood Amir, Igor Nor
  Lecture Notes in Computer Science 3341, 2004, pp. 41-52
• Approximate distance oracles for graphs with dense clusters
  Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
  Lecture Notes in Computer Science 3341, 2004, pp. 53-64
• Multicriteria global minimum cuts
  Amitai Armon, Uri Zwick
  Lecture Notes in Computer Science 3341, 2004, pp. 65-76
• Polyline fitting of planar points under min-sum criteria
  Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
  Lecture Notes in Computer Science 3341, 2004, pp. 77-88
• A generalization of magic squares with applications to digital halftoning
  Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
  Lecture Notes in Computer Science 3341, 2004, pp. 89-100
• Voronoi diagrams with a transportation network on the Euclidean plane
  Sang Won Bae, Kyung-Yong Chwa
  Lecture Notes in Computer Science 3341, 2004, pp. 101-112
• Structural alignment of two RNA sequences with Lagrangian relaxation
  Markus Bauer, Gunnar W. Klau
  Lecture Notes in Computer Science 3341, 2004, pp. 113-123
• Poly-APX- and PTAS-completeness in standard and differential approximation
  Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
  Lecture Notes in Computer Science 3341, 2004, pp. 124-136