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

• Account on intervals
  Dieter Rautenbach
  Lecture Notes in Computer Science 7551, 2012, pp. 1-1
• Account on intervals
  Dieter Rautenbach
  Lecture Notes in Computer Science 7551, 2012, pp. 1-1
• Constructing resilient structures in graphs: Rigid vs. competitive fault-tolerance
  David Peleg
  Lecture Notes in Computer Science 7551, 2012, pp. 2-2
• Constructing resilient structures in graphs: Rigid vs. competitive fault-tolerance
  David Peleg
  Lecture Notes in Computer Science 7551, 2012, pp. 2-2
• Alternating reachability and integer sum of closed alternating trails: The 3rd annual Uri N. Peled memorial lecture
  Amitava Bhattacharya
  Lecture Notes in Computer Science 7551, 2012, pp. 3-3
• Alternating reachability and integer sum of closed alternating trails: The 3rd annual Uri N. Peled memorial lecture
  Amitava Bhattacharya
  Lecture Notes in Computer Science 7551, 2012, pp. 3-3
• Student poster session
  Sabine Büttner, Shiri Chechik, Marcin Jurkiewicz, Moti Medina, Merav Parter, Roei Tov
  Lecture Notes in Computer Science 7551, 2012, pp. 4-6
• Student poster session
  Sabine Büttner, Shiri Chechik, Marcin Jurkiewicz, Moti Medina, Merav Parter, Roei Tov
  Lecture Notes in Computer Science 7551, 2012, pp. 4-6
• Triangulation and clique separator decomposition of claw-free graphs
  Anne Berry, Annegret Wagler
  Lecture Notes in Computer Science 7551, 2012, pp. 7-21
• Triangulation and clique separator decomposition of claw-free graphs
  Anne Berry, Annegret Wagler
  Lecture Notes in Computer Science 7551, 2012, pp. 7-21
• Minimum weighted clique cover on strip-composed perfect graphs
  Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels
  Lecture Notes in Computer Science 7551, 2012, pp. 22-33
• Minimum weighted clique cover on strip-composed perfect graphs
  Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels
  Lecture Notes in Computer Science 7551, 2012, pp. 22-33
• Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
  Stefan Kratsch, Pascal Schweitzer
  Lecture Notes in Computer Science 7551, 2012, pp. 34-45
• Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
  Stefan Kratsch, Pascal Schweitzer
  Lecture Notes in Computer Science 7551, 2012, pp. 34-45
• Optimization problems in dotted interval graphs
  Danny Hermelin, Julián Mestre, Dror Rawitz
  Lecture Notes in Computer Science 7551, 2012, pp. 46-56
• Optimization problems in dotted interval graphs
  Danny Hermelin, Julián Mestre, Dror Rawitz
  Lecture Notes in Computer Science 7551, 2012, pp. 46-56
• The maximum clique problem in multiple interval graphs
  Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
  Lecture Notes in Computer Science 7551, 2012, pp. 57-68
• The maximum clique problem in multiple interval graphs
  Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
  Lecture Notes in Computer Science 7551, 2012, pp. 57-68
• Solutions for the stable roommates problem with payments
  Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
  Lecture Notes in Computer Science 7551, 2012, pp. 69-80
• Solutions for the stable roommates problem with payments
  Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
  Lecture Notes in Computer Science 7551, 2012, pp. 69-80
• Which multi-peg tower of Hanoi problems are exponential?
  Daniel Berend, Amir Sapir
  Lecture Notes in Computer Science 7551, 2012, pp. 81-90
• Which multi-peg tower of Hanoi problems are exponential?
  Daniel Berend, Amir Sapir
  Lecture Notes in Computer Science 7551, 2012, pp. 81-90
• h-quasi planar drawings of bounded treewidth graphs in linear area
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
  Lecture Notes in Computer Science 7551, 2012, pp. 91-102
• h-quasi planar drawings of bounded treewidth graphs in linear area
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
  Lecture Notes in Computer Science 7551, 2012, pp. 91-102
• The duals of upward planar graphs on cylinders
  Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer
  Lecture Notes in Computer Science 7551, 2012, pp. 103-113