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

• Hypertree decompositions: Structure, algorithms, and applications
  Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello
  Lecture Notes in Computer Science 3787, 2005, pp. 1-15
• Combinatorial search on graphs motivated by bioinformatics applications: A brief survey
  Mathilde Bouvel, Vladimir Grebinski, Gregory Kucherov
  Lecture Notes in Computer Science 3787, 2005, pp. 16-27
• Domination search on graphs with low dominating-target-number
  Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun
  Lecture Notes in Computer Science 3787, 2005, pp. 28-37
• Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
  Christophe Crespelle, Christophe Paul
  Lecture Notes in Computer Science 3787, 2005, pp. 38-48
• Approximating rank-width and clique-width quickly
  Sang-il Oum
  Lecture Notes in Computer Science 3787, 2005, pp. 49-58
• Computing the Tutte polynomial on graphs of bounded clique-width
  Omer Giménez, Petr Hlinȇný, Marc Noy
  Lecture Notes in Computer Science 3787, 2005, pp. 59-68
• Minimizing NLC-width is NP-complete
  Frank Gurski, Egon Wanke
  Lecture Notes in Computer Science 3787, 2005, pp. 69-80
• Channel assignment and improper choosability of graphs
  Frédéric Havet, Jean-Sébastien Sereni
  Lecture Notes in Computer Science 3787, 2005, pp. 81-90
• Computing treewidth and minimum fill-in for permutation graphs in linear time
  Daniel Meister
  Lecture Notes in Computer Science 3787, 2005, pp. 91-102
• Roman domination over some graph classes
  Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng
  Lecture Notes in Computer Science 3787, 2005, pp. 103-114
• Algorithms for comparability of matrices in partial orders imposed by graph homomorphisms
  Jiȓí Fiala, Daniël Paulusma, Jan Arne Telle
  Lecture Notes in Computer Science 3787, 2005, pp. 115-126
• Network discovery and verification
  Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús̑ Mihal'ák, L. Shankar Ram
  Lecture Notes in Computer Science 3787, 2005, pp. 127-138
• Complete graph drawings up to triangle mutations
  Emeric Gioan
  Lecture Notes in Computer Science 3787, 2005, pp. 139-150
• Collective tree 1-spanners for interval graphs
  Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan
  Lecture Notes in Computer Science 3787, 2005, pp. 151-162
• On stable cutsets in claw-free graphs and planar graphs
  Van Bang Le, Raffaele Mosca, Haiko Müller
  Lecture Notes in Computer Science 3787, 2005, pp. 163-174
• Induced subgraphs of bounded degree and bounded treewidth
  Prosenjit Bose, Vida Dujmović, David R. Wood
  Lecture Notes in Computer Science 3787, 2005, pp. 175-186
• Optimal broadcast domination of arbitrary graphs in polynomial time
  Pinar Heggernes, Daniel Lokshtanov
  Lecture Notes in Computer Science 3787, 2005, pp. 187-198
• Ultimate generalizations of LexBFS and LEX M
  Anne Berry, Richard Krueger, Genevieve Simonet
  Lecture Notes in Computer Science 3787, 2005, pp. 199-213
• Adding an edge in a cograph
  Stavros D. Nikolopoulos, Leonidas Palios
  Lecture Notes in Computer Science 3787, 2005, pp. 214-226
• The computational complexity of delay management
  Michael Gatto, Riko Jacob, Leon Peeters, Anita Schöbel
  Lecture Notes in Computer Science 3787, 2005, pp. 227-238
• Acyclic choosability of graphs with small maximum degree
  Daniel Gonçalves, Mickaël Montassier
  Lecture Notes in Computer Science 3787, 2005, pp. 239-248
• Generating colored trees
  Shin-ichi Nakano, Takeaki Uno
  Lecture Notes in Computer Science 3787, 2005, pp. 249-260
• Optimal hypergraph tree-realization
  Ephraim Korach, Margarita Razgon
  Lecture Notes in Computer Science 3787, 2005, pp. 261-270
• Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
  Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
  Lecture Notes in Computer Science 3787, 2005, pp. 271-282
• On the fixed-parameter enumerability of cluster editing
  Peter Damaschke
  Lecture Notes in Computer Science 3787, 2005, pp. 283-294