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

• Algorithmic problems in wireless ad hoc networks
  Frances F. Yao
  Lecture Notes in Computer Science 3827, 2005, pp. 1-1
• Probability and recursion
  Kousha Etessami, Mihalis Yannakakis
  Lecture Notes in Computer Science 3827, 2005, pp. 2-4
• Embedding point sets into plane graphs of small dilation
  Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas
  Lecture Notes in Computer Science 3827, 2005, pp. 5-16
• The layered net surface problems in discrete geometry and medical image segmentation
  Xiaodong Wu, Danny Z. Chen, Kang Li, Milan Sonka
  Lecture Notes in Computer Science 3827, 2005, pp. 17-27
• Separability with outliers
  Sariel Har-Peled, Vladlen Koltun
  Lecture Notes in Computer Science 3827, 2005, pp. 28-39
• Casting an object with a core
  Hee-Kap Ahn, Sang Won Bae, Siu-Wing Cheng, Kyung-Yong Chwa
  Lecture Notes in Computer Science 3827, 2005, pp. 40-49
• Sparse geometric graphs with small dilation
  Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman Haverkort, Antoine Vigneron
  Lecture Notes in Computer Science 3827, 2005, pp. 50-59
• Multiple polyline to polygon matching
  Mirela Tȃnase, Remco C. Veltkamp, Herman Haverkort
  Lecture Notes in Computer Science 3827, 2005, pp. 60-70
• Minimizing a monotone concave function with laminar covering constraints
  Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige
  Lecture Notes in Computer Science 3827, 2005, pp. 71-81
• Almost optimal solutions for bin coloring problems
  Mingen Lin, Zhiyong Lin, Jinhui Xu
  Lecture Notes in Computer Science 3827, 2005, pp. 82-91
• GEN-LARAC: A generalized approach to the constrained shortest path problem under multiple additive constraints
  Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue
  Lecture Notes in Computer Science 3827, 2005, pp. 92-105
• Simultaneous matchings
  Khaled Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan
  Lecture Notes in Computer Science 3827, 2005, pp. 106-115
• An optimization problem related to VoD broadcasting
  Tsunehiko Kameda, Yi Sun, Luis Goddyn
  Lecture Notes in Computer Science 3827, 2005, pp. 116-125
• A min-max relation on packing feedback vertex sets
  Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
  Lecture Notes in Computer Science 3827, 2005, pp. 126-135
• Average case analysis for tree labelling schemes
  Ming-Yang Kao, Xiang-Yang Li, WeiZhao Wang
  Lecture Notes in Computer Science 3827, 2005, pp. 136-145
• Revisiting T. Uno and M. Yagiura's algorithm
  Binh-Minh Bui Xuan, Michel Habib, Christophe Paul
  Lecture Notes in Computer Science 3827, 2005, pp. 146-155
• Generating cut conjunctions and bridge avoiding extensions in graphs
  L. Khachiyan, E. Boros, K. Borys, K. Elbassioni, V. Gurvich, K. Makino
  Lecture Notes in Computer Science 3827, 2005, pp. 156-165
• Orthogonal drawings of series-parallel graphs with minimum bends
  Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 3827, 2005, pp. 166-175
• Bisecting a four-connected graph with three resource sets
  Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi
  Lecture Notes in Computer Science 3827, 2005, pp. 176-185
• Laminar structure of Ptolemaic graphs and its applications
  Ryuhei Uehara, Yushi Uno
  Lecture Notes in Computer Science 3827, 2005, pp. 186-195
• On the complexity of the G-reconstruction problem
  Zdenȇk Dvoȓák, Vít Jelínek
  Lecture Notes in Computer Science 3827, 2005, pp. 196-205
• Hybrid voting protocols and hardness of manipulation
  Edith Elkind, Helger Lipmaa
  Lecture Notes in Computer Science 3827, 2005, pp. 206-215
• On the complexity of Rocchio's similarity-based relevance feedback algorithm
  Zhixiang Chen, Bin Fu
  Lecture Notes in Computer Science 3827, 2005, pp. 216-225
• Correlation clustering and consensus clustering
  Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang
  Lecture Notes in Computer Science 3827, 2005, pp. 226-235
• An approximation algorithm for scheduling malleable tasks under general precedence constraints
  Klaus Jansen, Hu Zhang
  Lecture Notes in Computer Science 3827, 2005, pp. 236-245