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

• Treewidth: Characterizations, applications, and computations
  Hans L. Bodlaender
  Lecture Notes in Computer Science 4271, 2006, pp. 1-14
• Locally injective graph homomorphism: Lists guarantee dichotomy
  Jiȓí Fiala, Jan Kratochvíl
  Lecture Notes in Computer Science 4271, 2006, pp. 15-26
• Generalised dualities and finite maximal antichains
  Jan Foniok, Jaroslav Nes̑etȓil, Claude Tardif
  Lecture Notes in Computer Science 4271, 2006, pp. 27-36
• Chordal deletion is fixed-parameter tractable
  Dániel Marx
  Lecture Notes in Computer Science 4271, 2006, pp. 37-48
• A fixed-parameter algorithm for the minimum weight triangulation problem based on small graph separators
  Christian Knauer, Andreas Spillner
  Lecture Notes in Computer Science 4271, 2006, pp. 49-57
• Divide-and-color
  Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
  Lecture Notes in Computer Science 4271, 2006, pp. 58-67
• Listing chordal graphs and interval graphs
  Masashi Kiyomi, Shuji Kijima, Takeaki Uno
  Lecture Notes in Computer Science 4271, 2006, pp. 68-77
• A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs
  Serge Gaspers, Mathieu Liedloff
  Lecture Notes in Computer Science 4271, 2006, pp. 78-89
• Improved edge-coloring with three colors
  Łukasz Kowalik
  Lecture Notes in Computer Science 4271, 2006, pp. 90-101
• Vertex coloring of comparability+ke and -ke graphs
  Yasuhiko Takenaga, Kenichi Higashide
  Lecture Notes in Computer Science 4271, 2006, pp. 102-112
• Convex drawings of graphs with non-convex boundary
  Seok-Hee Hong, Hiroshi Nagamochi
  Lecture Notes in Computer Science 4271, 2006, pp. 113-124
• How to sell a graph: Guidelines for graph retailers
  Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz
  Lecture Notes in Computer Science 4271, 2006, pp. 125-136
• Strip graphs: Recognition and scheduling
  Magnús M. Halldórsson, Ragnar Karlsson
  Lecture Notes in Computer Science 4271, 2006, pp. 137-146
• Approximating the traffic grooming problem in tree and star networks
  Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
  Lecture Notes in Computer Science 4271, 2006, pp. 147-158
• Bounded arboricity to determine the local structure of sparse graphs
  Gaurav Goel, Jens Gustedt
  Lecture Notes in Computer Science 4271, 2006, pp. 159-167
• An implicit representation of chordal comparabilty graphs in linear-time
  Andrew R. Curtis, Clemente Izurieta, Benson Joeris, Scott Lundberg, Ross M. McConnell
  Lecture Notes in Computer Science 4271, 2006, pp. 168-178
• Partitioned probe comparability graphs
  David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
  Lecture Notes in Computer Science 4271, 2006, pp. 179-190
• Computing graph polynomials on graphs of bounded clique-width
  J.A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin
  Lecture Notes in Computer Science 4271, 2006, pp. 191-204
• Generation of graphs with bounded branchwidth
  Christophe Paul, Andrzej Proskurowski, Jan Arne Telle
  Lecture Notes in Computer Science 4271, 2006, pp. 205-216
• Minimal proper interval completions
  Ivan Rapaport, Karol Suchan, Ioan Todinca
  Lecture Notes in Computer Science 4271, 2006, pp. 217-228
• Monotony properties of connected visible graph searching
  Pierre Fraigniaud, Nicolas Nisse
  Lecture Notes in Computer Science 4271, 2006, pp. 229-240
• Finding intersection models of weakly chordal graphs
  Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
  Lecture Notes in Computer Science 4271, 2006, pp. 241-255
• A fully dynamic algorithm for the recognition of P_4-sparse graphs
  Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
  Lecture Notes in Computer Science 4271, 2006, pp. 256-268
• Clique graph recognition is NP-complete
  L. Alcón, L. Faria, C.M.H. de Figueiredo, M. Gutierrez
  Lecture Notes in Computer Science 4271, 2006, pp. 269-277
• Homogeneity vs. adjacency: Generalising some graph decomposition algorithms
  B.-M. Bui Xuan, M. Habib, V. Limouzy, F. de Montgolfier
  Lecture Notes in Computer Science 4271, 2006, pp. 278-288