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

• (Un)-stable routing in the Internet: A survey from the algorithmic perspective
  Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini
  Lecture Notes in Computer Science 5344, 2008, pp. 1-13
• Memory efficient anonymous graph exploration
  Leszek Ga̧sieniec, Tomasz Radzik
  Lecture Notes in Computer Science 5344, 2008, pp. 14-29
• Algorithmic meta theorems
  Martin Grohe
  Lecture Notes in Computer Science 5344, 2008, pp. 30-30
• A most general edge elimination polynomial
  Ilia Averbouch, Benny Godlin, Johann A. Makowsky
  Lecture Notes in Computer Science 5344, 2008, pp. 31-42
• Approximating the metric TSP in linear time
  Davide Bilò, Luca Forlizzi, Guido Proietti
  Lecture Notes in Computer Science 5344, 2008, pp. 43-54
• The valve location problem in simple network topologies
  Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks
  Lecture Notes in Computer Science 5344, 2008, pp. 55-65
• A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
  Paul Bonsma, Florian Zickfeld
  Lecture Notes in Computer Science 5344, 2008, pp. 66-77
• On the pseudo-achromatic number problem
  Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
  Lecture Notes in Computer Science 5344, 2008, pp. 78-89
• Making role assignment feasible: A polynomial-time algorithm for computing ecological colorings
  Pilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca
  Lecture Notes in Computer Science 5344, 2008, pp. 90-100
• Faster exact bandwidth
  Marek Cygan, Marcin Pilipczuk
  Lecture Notes in Computer Science 5344, 2008, pp. 101-109
• Additive spanners for circle graphs and polygonal graphs
  Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang
  Lecture Notes in Computer Science 5344, 2008, pp. 110-121
• Upward straight-line embeddings of directed graphs into point sets
  Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov
  Lecture Notes in Computer Science 5344, 2008, pp. 122-133
• Complexity of the packing coloring problem for trees
  Jiȓí Fiala, Petr A. Golovach
  Lecture Notes in Computer Science 5344, 2008, pp. 134-145
• Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
  J. Joseph Fowler, Michael Jünger, Stephen Kobourov, Michael Schulz
  Lecture Notes in Computer Science 5344, 2008, pp. 146-158
• A lower bound on the area requirements of series-parallel graphs
  Fabrizio Frati
  Lecture Notes in Computer Science 5344, 2008, pp. 159-170
• On independent sets and bicliques in graphs
  Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
  Lecture Notes in Computer Science 5344, 2008, pp. 171-182
• Evaluations of graph polynomials
  Benny Godlin, Tomer Kotek, Johann A. Makowsky
  Lecture Notes in Computer Science 5344, 2008, pp. 183-194
• Parameterized complexity for domination problems on degenerate graphs
  Petr A. Golovach, Yngve Villanger
  Lecture Notes in Computer Science 5344, 2008, pp. 195-205
• An algorithm for finding input-output constrained convex sets in an acyclic digraph
  Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo
  Lecture Notes in Computer Science 5344, 2008, pp. 206-217
• Cutwidth of split graphs, threshold graphs, and proper interval graphs
  Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos
  Lecture Notes in Computer Science 5344, 2008, pp. 218-229
• The rank-width of the square grid
  Vít Jelínek
  Lecture Notes in Computer Science 5344, 2008, pp. 230-239
• Improved upper bounds for partial vertex cover
  Joachim Kneis, Alexander Langer, Peter Rossmanith
  Lecture Notes in Computer Science 5344, 2008, pp. 240-251
• On the expressive power of CNF formulas of bounded tree- and clique-width
  Pascal Koiran, Klaus Meer
  Lecture Notes in Computer Science 5344, 2008, pp. 252-263
• Planar feedback vertex set and face cover: Combinatorial bounds and subexponential algorithms
  Athanassios Koutsonas, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 5344, 2008, pp. 264-274
• What is between chordal and weakly chordal graphs?
  Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
  Lecture Notes in Computer Science 5344, 2008, pp. 275-286