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 YEAR=2006

• Algorithms on graphs with small dominating targets
  Divesh Aggarwal, Chandan K. Dubey, Shashank K. Mehta
  Lecture Notes in Computer Science 4288, 2006, pp. 141-152
• Diamond triangulations contain spanners of bounded degree
  Prosenjit Bose, Michiel Smid, Daming Xu
  Lecture Notes in Computer Science 4288, 2006, pp. 173-182
• Optimal construction of the city Voronoi diagram
  Sang Won Bae, Jae-Hoon Kim, Kyung-Yong Chwa
  Lecture Notes in Computer Science 4288, 2006, pp. 183-192
• Quality tetrahedral mesh generation for macromolecules
  Ho-Lun Cheng, Xinwei Shi
  Lecture Notes in Computer Science 4288, 2006, pp. 203-212
• The complexity of quasigroup isomorphism and the minimum generating set problem
  V. Arvind, Jacobo Torán
  Lecture Notes in Computer Science 4288, 2006, pp. 233-242
• The interval liar game
  Benjamin Doerr, Johannes Lengler, David Steurer
  Lecture Notes in Computer Science 4288, 2006, pp. 318-327
• How much independent should individual contacts be to form a small-world?
  Gennaro Cordasco, Luisa Gargano
  Lecture Notes in Computer Science 4288, 2006, pp. 328-338
• Faster centralized communication in radio networks
  Ferdinando Cicalese, Fredrik Manne, Qin Xin
  Lecture Notes in Computer Science 4288, 2006, pp. 339-348
• Optimal algorithms for the path/tree-shaped facility location problems in trees
  Binay Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir
  Lecture Notes in Computer Science 4288, 2006, pp. 379-388
• On isomorphism and canonization of tournaments and hypertournaments
  V. Arvind, Bireswar Das, Partha Mukhopadhyay
  Lecture Notes in Computer Science 4288, 2006, pp. 449-459
• Deterministic random walks on the two-dimensional grid
  Benjamin Doerr, Tobias Friedrich
  Lecture Notes in Computer Science 4288, 2006, pp. 474-483
• Balanced cut approximation in random geometric graphs
  Josep Diaz, Fabrizio Grandoni, Alberto Marchetti Spaccamela
  Lecture Notes in Computer Science 4288, 2006, pp. 527-536
• On approximating the maximum simple sharing problem
  Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu
  Lecture Notes in Computer Science 4288, 2006, pp. 547-556
• Lower bounds on the deterministic and quantum communication complexities of Hamming-distance problems
  Andris Ambainis, William Gasarch, Aravind Srinivasan, Andrey Utis
  Lecture Notes in Computer Science 4288, 2006, pp. 628-637
• Energy-efficient broadcast scheduling for speed-controlled transmission channels
  Patrick Briest, Christian Gunia
  Lecture Notes in Computer Science 4288, 2006, pp. 670-679
• Online packet admission and oblivious routing in sensor networks
  Mohamed Aly, John Augustine
  Lecture Notes in Computer Science 4288, 2006, pp. 680-689
• Field splitting problems in intensity-modulated radiation therapy
  Danny Z. Chen, Chao Wang
  Lecture Notes in Computer Science 4288, 2006, pp. 690-700
• Shape rectangularization problems in intensity-modulated radiation therapy
  Danny Z. Chen, Xiaobo S. Hu, Shuang Luan, Ewa Misioƚek, Chao Wang
  Lecture Notes in Computer Science 4288, 2006, pp. 701-711
• Tessellation of quadratic elements
  Scott E. Dillard, Vijay Natarajan, Gunther H. Weber, Valerio Pascucci, Bernd Hamann
  Lecture Notes in Computer Science 4288, 2006, pp. 722-731
• Effective elections for anonymous mobile agents
  Shantanu Das, Paola Flocchini, Amiya Nayak, Nicola Santoro
  Lecture Notes in Computer Science 4288, 2006, pp. 732-743
• Treewidth: Characterizations, applications, and computations
  Hans L. Bodlaender
  Lecture Notes in Computer Science 4271, 2006, pp. 1-14
• An implicit representation of chordal comparabilty graphs in linear-time
  Andrew R. Curtis, Clemente Izurieta, Benson Joeris, Scott Lundberg, Ross M. McConnell
  Lecture Notes in Computer Science 4271, 2006, pp. 168-178
• Partitioned probe comparability graphs
  David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
  Lecture Notes in Computer Science 4271, 2006, pp. 179-190
• Clique graph recognition is NP-complete
  L. Alcón, L. Faria, C.M.H. de Figueiredo, M. Gutierrez
  Lecture Notes in Computer Science 4271, 2006, pp. 269-277
• Homogeneity vs. adjacency: Generalising some graph decomposition algorithms
  B.-M. Bui Xuan, M. Habib, V. Limouzy, F. de Montgolfier
  Lecture Notes in Computer Science 4271, 2006, pp. 278-288