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

• Efficient broadcasting in random power law networks
  Robert Elsässer, Adrian Ogierman
  Lecture Notes in Computer Science 6410, 2010, pp. 279-291
• Graphs with large obstacle numbers
  Padmini Mukkamala, János Pach, Deniz Sarıöz
  Lecture Notes in Computer Science 6410, 2010, pp. 292-303
• The complexity of vertex coloring problems in uniform hypergraphs with high degree
  Edyta Szymańska
  Lecture Notes in Computer Science 6410, 2010, pp. 304-314
• The number of bits needed to represent a unit disk graph
  Colin McDiarmid, Tobias Müller
  Lecture Notes in Computer Science 6410, 2010, pp. 315-323
• Lattices and maximum flow algorithms in planar graphs
  Jannik Matuschke, Britta Peis
  Lecture Notes in Computer Science 6410, 2010, pp. 324-335