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

• Approximating the traveling tournament problem with maximum tour length 2
  Clemens Thielen, Stephan Westphal
  Lecture Notes in Computer Science 6507, 2010, pp. 303-314
• Alphabet partitioning for compressed rank/select and applications
  Jérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich
  Lecture Notes in Computer Science 6507, 2010, pp. 315-326
• Entropy-bounded representation of point grids
  Arash Farzan, Travis Gagie, Gonzalo Navarro
  Lecture Notes in Computer Science 6507, 2010, pp. 327-338
• Identifying approximate palindromes in run-length encoded strings
  Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao
  Lecture Notes in Computer Science 6507, 2010, pp. 339-350
• Minimum cost partitions of trees with supply and demand
  Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 6507, 2010, pp. 351-362
• Computing the (t, k)-diagnosability of component-composition graphs and its application
  Sun-Yuan Hsieh, Chun-An Chen
  Lecture Notes in Computer Science 6507, 2010, pp. 363-374
• Why depth-first search efficiently identifies two and three-connected graphs
  Amr Elmasry
  Lecture Notes in Computer Science 6507, 2010, pp. 375-386
• Beyond good shapes: Diffusion-based graph partitioning is relaxed cut optimization
  Henning Meyerhenke
  Lecture Notes in Computer Science 6507, 2010, pp. 387-398
• Induced subgraph isomorphism on interval and proper interval graphs
  Pinar Heggernes, Daniel Meister, Yngve Villanger
  Lecture Notes in Computer Science 6507, 2010, pp. 399-409
• Testing simultaneous planarity when the common graph is 2-connected
  Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw
  Lecture Notes in Computer Science 6507, 2010, pp. 410-421
• Computing the discrete Fréchet distance with imprecise input
  Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron
  Lecture Notes in Computer Science 6507, 2010, pp. 422-433
• Connectivity graphs of uncertainty regions
  Erin Chambers, Alejandro Erickson, Sándor Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christoph Weibel, Sue Whitesides
  Lecture Notes in Computer Science 6507, 2010, pp. 434-445
• \pi/2-angle Yao graphs are spanners
  Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel Smid, Stefanie Wuhrer
  Lecture Notes in Computer Science 6507, 2010, pp. 446-457
• Identifying shapes using self-assembly
  Matthew J. Patitz, Scott M. Summers
  Lecture Notes in Computer Science 6507, 2010, pp. 458-469