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

• Algorithmic barriers from phase transitions in graphs
  Dimitris Achlioptas
  Lecture Notes in Computer Science 6410, 2010, pp. 1-1
• Algorithmic graph minors and bidimensionality
  Erik D. Demaine
  Lecture Notes in Computer Science 6410, 2010, pp. 2-2
• Complexity results for the spanning tree congestion problem
  Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen
  Lecture Notes in Computer Science 6410, 2010, pp. 3-14
• Max-cut éand containment relations in graphs
  Marcin Kamiński
  Lecture Notes in Computer Science 6410, 2010, pp. 15-26
• The longest path problem is polynomial on cocomparability graphs
  Kyriaki Ioannidou, Stavros D. Nikolopoulos
  Lecture Notes in Computer Science 6410, 2010, pp. 27-38
• Colorings with few colors: Counting, enumeration and combinatorial bounds
  Petr A. Golovach, Dieter Kratsch, Jean-Francois Couturier
  Lecture Notes in Computer Science 6410, 2010, pp. 39-50
• On stable matchings and flows
  Tamás Fleiner
  Lecture Notes in Computer Science 6410, 2010, pp. 51-62
• Narrowing down the gap on the complexity of coloring P_k-free graphs
  Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
  Lecture Notes in Computer Science 6410, 2010, pp. 63-74
• Computing the cutwidth of bipartite permutation graphs in linear time
  Pinar Heggernes, Pim van át Hof, Daniel Lokshtanov, Jesper Nederlof
  Lecture Notes in Computer Science 6410, 2010, pp. 75-87
• Solving capacitated dominating set by using covering by subsets and maximum matching
  Mathieu Liedloff, Ioan Todinca, Yngve Villanger
  Lecture Notes in Computer Science 6410, 2010, pp. 88-99
• Efficient algorithms for eulerian extension
  Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller
  Lecture Notes in Computer Science 6410, 2010, pp. 100-111
• On the small cycle transversal of planar graphs
  Ge Xia, Yong Zhang
  Lecture Notes in Computer Science 6410, 2010, pp. 112-122
• Milling a graph with turn costs: A parameterized complexity perspective
  Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances Rosamond, et al.
  Lecture Notes in Computer Science 6410, 2010, pp. 123-134
• Graphs that admit right angle crossing drawings
  Karin Arikushi, Radoslav Fulek, Baláazs Keszegh, Filip Morić, Csaba D. Tóth
  Lecture Notes in Computer Science 6410, 2010, pp. 135-146
• Kernelization hardness of connectivity problems in d-degenerate graphs
  Marek Cygan, Marcin Pilipczuk, Michaƚ Pilipczuk, Jakub Onufry Wojtaszczyk
  Lecture Notes in Computer Science 6410, 2010, pp. 147-158
• On the boolean-width of a graph: Structure and applications
  Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, et al.
  Lecture Notes in Computer Science 6410, 2010, pp. 159-170
• Generalized graph clustering: Recognizing (p,q)-cluster graphs
  Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle
  Lecture Notes in Computer Science 6410, 2010, pp. 171-183
• Colouring vertices of triangle-free graphs
  Konrad Dabrowski, Vadim Lozin, Rajiv Raman, Bernard Ries
  Lecture Notes in Computer Science 6410, 2010, pp. 184-195
• A quartic kernel for pathwidth-one vertex deletion
  Geevarghese Philip, Venkatesh Raman, Yngve Villanger
  Lecture Notes in Computer Science 6410, 2010, pp. 196-207
• Network exploration by silent and oblivious robots
  Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro
  Lecture Notes in Computer Science 6410, 2010, pp. 208-219
• Uniform sampling of digraphs with a fixed degree sequence
  Annabell Berger, Matthias Müller-Hannemann
  Lecture Notes in Computer Science 6410, 2010, pp. 220-231
• Measuring indifference: Unit interval vertex deletion
  René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
  Lecture Notes in Computer Science 6410, 2010, pp. 232-243
• Parameterized complexity of the arc-preserving subsequence problem
  Dániel Marx, Ildikó Schlotter
  Lecture Notes in Computer Science 6410, 2010, pp. 244-255
• From path graphs to directed path graphs
  Steven Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato
  Lecture Notes in Computer Science 6410, 2010, pp. 256-265
• Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces
  Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas
  Lecture Notes in Computer Science 6410, 2010, pp. 266-278