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 Volume=3353

• Lexicographic breadth first search - A survey
  Derek G. Corneil
  Lecture Notes in Computer Science 3353, 2004, pp. 1-19
• Wireless networking: Graph theory unplugged
  Roger Wattenhofer
  Lecture Notes in Computer Science 3353, 2004, pp. 20-32
• Constant time generation of trees with specified diameter
  Shin-ichi Nakano, Takeaki Uno
  Lecture Notes in Computer Science 3353, 2004, pp. 33-45
• Treelike comparability graphs: Characterization, recognition, and applications
  Sabine Cornelsen, Gabriele di Stefano
  Lecture Notes in Computer Science 3353, 2004, pp. 46-57
• Elegant distance constrained labelings of trees
  Jiȓí Fiala, Petr A. Golovach, Jan Kratochvíl
  Lecture Notes in Computer Science 3353, 2004, pp. 58-67
• Collective tree spanners and routing in AT-free related graphs
  Feodor Dragan, Chenyu Yan, Derek G. Corneil
  Lecture Notes in Computer Science 3353, 2004, pp. 68-80
• 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
• Recognizing HHD-free and Welsh-Powell opposition graphs
  Stavros D. Nikolopoulos, Leonidas Palios
  Lecture Notes in Computer Science 3353, 2004, pp. 105-116
• Bimodular decomposition of bipartite graphs
  Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe
  Lecture Notes in Computer Science 3353, 2004, pp. 117-128
• Coloring a graph using split decomposition
  Michaeël Rao
  Lecture Notes in Computer Science 3353, 2004, pp. 129-141
• Decremental clique problem
  Fabrizio Grandoni, Giuseppe F. Italiano
  Lecture Notes in Computer Science 3353, 2004, pp. 142-153
• A symbolic approach to the all-pairs shortest-paths problem
  Daniel Sawitzki
  Lecture Notes in Computer Science 3353, 2004, pp. 154-167
• Minimal de Bruijn sequence in a language with forbidden substrings
  Eduardo Moreno, Martín Matamala
  Lecture Notes in Computer Science 3353, 2004, pp. 168-176
• 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
• A robust PTAS for maximum weight independent sets in unit disk graphs
  Tim Nieberg, Johann Hurink, Walter Kern
  Lecture Notes in Computer Science 3353, 2004, pp. 214-221
• Tolerance based algorithms for the ATSP
  Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen
  Lecture Notes in Computer Science 3353, 2004, pp. 222-234
• Finding k disjoint triangles in an arbitrary graph
  Mike Fellows, Pinar Heggernes, Franes Rosamond, Christian Sloper, Jan Arne Teller
  Lecture Notes in Computer Science 3353, 2004, pp. 235-244
• Exact (exponential) algorihtms for the dominating set problem
  Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger
  Lecture Notes in Computer Science 3353, 2004, pp. 245-256
• 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
• Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters
  Mordecai J. Golin, Yiu Cho Leung
  Lecture Notes in Computer Science 3353, 2004, pp. 296-307