Volume 363, Number 1, October 2006

• 
  Kyung-Yong Chwa, J. Ian Munro: Preface. 1

• 
  Joel Ratsaby: Complexity of hyperconcepts. 2-10
• 
  Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic: Coloring octrees. 11-17
• 
  Yossi Azar, Amos Fiat, Meital Levy, N. S. Narayanaswamy: An improved algorithm for online coloring of intervals with bandwidth. 18-27
• 
  Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi: The worst-case time complexity for generating all maximal cliques and computational experiments. 28-42
• 
  Tatsuie Tsukiji, Zhi-Zhong Chen: Computing phylogenetic roots with bounded degrees and errors is NP-complete. 43-59
• 
  Jesper Jansson, Wing-Kin Sung: Inferring a level-1 phylogenetic network from a dense set of rooted triplets. 60-68
• 
  Ho-Fung Leung, Zeshan Peng, Hing-Fung Ting: An efficient algorithm for online square detection. 69-75
• 
  Philipp Woelfel: A construction method for optimally universal hash families and its consequences for the existence of RBIBDs. 76-84
• 
  Hanno Lefmann: Large triangles in the d-dimensional unit cube. 85-98
• 
  Yong Zhang, Qi Ge, Rudolf Fleischer, Tao Jiang, Hong Zhu: Approximating the minimum weight weak vertex cover. 99-105

Volume 363, Number 2, October 2006

• 
  Jacques Farré, Igor Litovsky: Editorial. 107

• 
  Arnaud Bailly, Mireille Clerbout, Isabelle Simplot-Ryl: Component composition preserving behavioral contracts based on communication traces. 108-123
• 
  Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Prime normal form and equivalence of simple grammars. 124-134
• 
  Cezar Câmpeanu, Andrei Paun, Jason R. Smith: Incremental construction of minimal deterministic finite cover automata. 135-148
• 
  Oscar H. Ibarra, Hsu-Chun Yen: Deterministic catalytic systems are not universal. 149-161
• 
  Tomasz Jurdzinski, Friedrich Otto: Restarting automata with restricted utilization of auxiliary symbols. 162-181
• 
  Joachim Klein, Christel Baier: Experiments with deterministic omega-automata for formulas of linear temporal logic. 182-195
• 
  Markus Lohrey, Sebastian Maneth: The complexity of tree automata and XPath on grammar-compressed trees. 196-210
• 
  Wojciech Rytter: The structure of subword graphs and suffix trees of Fibonacci words. 211-223
• 
  Christoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier: Observations on determinization of Büchi automata. 224-233
• 
  Hellis Tamm, Matti Nykänen, Esko Ukkonen: On size reduction techniques for multitape automata. 234-246

Volume 363, Number 3, October 2006

• 
  Nimrod Megiddo, Yinfeng Xu, Binhai Zhu: Preface. 247

• 
  Mao-cheng Cai, Xiaotie Deng, Zhongfei Li: Computation of arbitrage in frictional bond markets. 248-256
• 
  Yong He, Weiya Zhong, Huikun Gu: Improved algorithms for two single machine scheduling problems. 257-265
• 
  Mingen Lin, Zhiyong Lin, Jinhui Xu: Graph bandwidth of weighted caterpillars. 266-277
• 
  Jianer Chen, Fenghui Zhang: On product covering in 3-tier supply chain models: Natural complete problems for W[3] and W[4]. 278-288
• 
  Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren: Approximation algorithms for facility location problems with a special class of subadditive cost functions. 289-300

last updated on Thu May 23 04:45:05 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page