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

• The unpredictable deviousness of models
  Franco P. Preparata
  Lecture Notes in Computer Science 4112, 2006, pp. 1-1
• Security issues in collaborative computing
  Mikhail J. Atallah
  Lecture Notes in Computer Science 4112, 2006, pp. 2-2
• A simplicial approach for discrete fixed point theorems
  Xi Chen, Xiaotie Deng
  Lecture Notes in Computer Science 4112, 2006, pp. 3-12
• On incentive compatible competitive selection protocol
  Xi Chen, Xiaotie Deng, Becky Jie Liu
  Lecture Notes in Computer Science 4112, 2006, pp. 13-22
• Edge pricing of multicommodity networks for selfish users with elastic demands
  George Karakostas, Stavros G. Kolliopoulos
  Lecture Notes in Computer Science 4112, 2006, pp. 23-32
• Aggregating strategy for online auctions
  Shigeaki Harada, Eiji Takimoto, Akira Maruoka
  Lecture Notes in Computer Science 4112, 2006, pp. 33-41
• On indecomposability preserving elimination sequences
  Chandan K. Dubey, Shashank K. Mehta
  Lecture Notes in Computer Science 4112, 2006, pp. 42-51
• Improved algorithms for the minmax regret 1-median problem
  Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang
  Lecture Notes in Computer Science 4112, 2006, pp. 52-62
• Partitioning a multi-weighted graph to connected subgraphs of almost uniform size
  Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 4112, 2006, pp. 63-72
• Characterizations and linear time recognition of Helly circular-arc graphs
  Min Chih Lin, Jayme L. Szwarcfiter
  Lecture Notes in Computer Science 4112, 2006, pp. 73-82
• Varieties generated by certain models of reversible finite automata
  Marats Golovkins, Jean-Eric Pin
  Lecture Notes in Computer Science 4112, 2006, pp. 83-93
• Iterated TGR languages: Membership problem and effective closure properties
  Ian McQuillan, Kai Salomaa, Mark Daley
  Lecture Notes in Computer Science 4112, 2006, pp. 94-103
• On the negation-limited circuit complexity of sorting and inverting k-tonic sequences
  Takayuki Sato, Kazuyuki Amano, Akira Maruoka
  Lecture Notes in Computer Science 4112, 2006, pp. 104-115
• Robust quantum algorithms with \epsilon-biased oracles
  Tomoya Suzuki, Shigeru Yamashita, Masaki Nakanishi, Katsumasa Watanabe
  Lecture Notes in Computer Science 4112, 2006, pp. 116-125
• The complexity of black-box ring problems
  V. Arvind, Bireswar Das, Partha Mukhopadhyay
  Lecture Notes in Computer Science 4112, 2006, pp. 126-135
• Lower bounds and parameterized approach for longest common subsequence
  Xiuzhen Huang
  Lecture Notes in Computer Science 4112, 2006, pp. 136-145
• Finding patterns with variable length gaps or don't cares
  M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth
  Lecture Notes in Computer Science 4112, 2006, pp. 146-155
• The matrix orthogonal decomposition problem in intensity-modulated radiation therapy
  Xin Dou, Xiaodong Wu, John E. Bayouth, John M. Buatti
  Lecture Notes in Computer Science 4112, 2006, pp. 156-165
• A polynomial-time approximation algorithm for a geometric dispersion problem
  Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff
  Lecture Notes in Computer Science 4112, 2006, pp. 166-175
• A PTAS for cutting out polygons with lines
  Sergey Bereg, Ovidiu Daescu, Minghui Jiang
  Lecture Notes in Computer Science 4112, 2006, pp. 176-185
• On unfolding lattice polygons/trees and diameter-4 trees
  Sheung-Hung Poon
  Lecture Notes in Computer Science 4112, 2006, pp. 186-195
• Restricted mesh simplification using edge contractions
  Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
  Lecture Notes in Computer Science 4112, 2006, pp. 196-204
• Enumerating non-crossing minimally rigid frameworks
  David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
  Lecture Notes in Computer Science 4112, 2006, pp. 205-215
• Sequences characterizing k-trees
  Zvi Lotker, Debapriyo Majumdar, N.S. Narayanaswamy, Ingmar Weber
  Lecture Notes in Computer Science 4112, 2006, pp. 216-225
• On the threshold of having a linear treewidth in random graphs
  Yong Gao
  Lecture Notes in Computer Science 4112, 2006, pp. 226-234