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

• The interval constrained 3-coloring problem
  Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità
  Lecture Notes in Computer Science 6034, 2010, pp. 591-602
• Counting hexagonal patches and independent sets in circle graphs
  Paul Bonsma, Felix Breuer
  Lecture Notes in Computer Science 6034, 2010, pp. 603-614
• Approximating maximum diameter-bounded subgraphs
  Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo
  Lecture Notes in Computer Science 6034, 2010, pp. 615-626
• Largest induced acyclic tournament in random digraphs: A 2-point concentration
  Kunal Dutta, C.R. Subramanian
  Lecture Notes in Computer Science 6034, 2010, pp. 627-637
• The complexity of counting Eulerian tours in 4-regular graphs
  Qi Ge, Daniel S̑tefankovic̑
  Lecture Notes in Computer Science 6034, 2010, pp. 638-649
• Efficient edge domination on hole-free graphs in polynomial time
  Andreas Brandstädt, Christian Hundt, Ragnar Nevries
  Lecture Notes in Computer Science 6034, 2010, pp. 650-661
• Computational complexity of the Hamiltonian cycle problem in dense hypergraphs
  Marek Karpiński, Andrzej Ruciński, Edyta Szymańska
  Lecture Notes in Computer Science 6034, 2010, pp. 662-673
• Rank selection in multidimensional data
  Amalia Duch, Rosa M. Jiménez, Conrado Martínez
  Lecture Notes in Computer Science 6034, 2010, pp. 674-685
• Layered working-set trees
  Prosenjit Bose, Karim Douïeb, Vida Dujmović, John Howat
  Lecture Notes in Computer Science 6034, 2010, pp. 686-696
• Lightweight data indexing and compression in external memory
  Paolo Ferragina, Travis Gagie, Giovanni Manzini
  Lecture Notes in Computer Science 6034, 2010, pp. 697-710