Theoretical Computer Science, Volume 396

Volume 396, Numbers 1-3, May 2008

• Wenbin Chen, Jiangtao Meng, Dengpan Yin:
  An improved lower bound for approximating minimum GCD multiplier in l_infinity norm (GCDM_infinity). 1-9
  
• Luis Salinas, Eric Goles Ch.:
  Covering by squares. 10-27
  
• Longcheng Liu, Enyu Yao:
  Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance. 28-34
  
• W. M. B. Dukes, M. F. Flanagan, Toufik Mansour, Vincent Vajnovszki:
  Combinatorial Gray codes for classes of pattern avoiding permutations. 35-49
  
• Min-Zheng Shieh, Shi-Chun Tsai:
  Jug measuring: Algorithms and complexity. 50-62
  
• Bruno Escoffier, Jérôme Monnot:
  A better differential approximation ratio for symmetric TSP. 63-70
  
• Miguel Couceiro, Maurice Pouzet:
  On a quasi-ordering on Boolean functions. 71-87
  
• Trevor I. Fenner, Mark Levene, George Loizou:
  Modelling the navigation potential of a web page. 88-96
  
• Xavier Défago, Samia Souissi:
  Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. 97-112
  
• Paul E. Dunne, Yann Chevaleyre:
  The complexity of deciding reachability properties of distributed negotiation schemes. 113-144
  
• Raphael Yuster:
  All-pairs disjoint paths from a common ancestor in O~(n^infinit) time. 145-150
  
• Xueliang Li, Wenli Zhou:
  The 2nd-order conditional 3-coloring of claw-free graphs. 151-157
  
• Sandy Irani, Vitus J. Leung:
  Probabilistic analysis for scheduling with conflicts. 158-179
  
• Chen Wang, Myung Ah Park, James Willson, Yongxi Cheng, Andras Farago, Weili Wu:
  On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity. 180-190
  
• Ying-You Chen, Dyi-Rong Duh, Tai-Ling Ye, Jung-Sheng Fu:
  Weak-vertex-pancyclicity of (n, k)-star graphs. 191-199
  
• Regant Y. S. Hung, H. F. Ting:
  Competitive analysis of most-request-first for scheduling broadcasts with start-up delay. 200-211
  
• David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
  Partitioned probe comparability graphs. 212-222
  
• Joan Boyar, René Peralta:
  Tight bounds for the multiplicative complexity of symmetric functions. 223-246
  

• Eric Goles Ch., Luis Salinas:
  Comparison between parallel and serial dynamics of Boolean networks. 247-253
  
• James D. Currie:
  Palindrome positions in ternary square-free words. 254-257
  
• Guizhen Liu, Ping Li:
  Paths in circuit graphs of matroids. 258-263
  
• Lila Kari, Petr Sosík:
  On the weight of universal insertion grammars. 264-270
  
• Samuel R. Buss, Jan Hoffmann:
  The NP-hardness of finding a directed acyclic graph for regular resolution. 271-276
  
• Gregory Neven:
  A simple transitive signature scheme for directed trees. 277-282
  
• Lingfa Lu, Liqi Zhang, Jinjiang Yuan:
  The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. 283-289
  
• Young-Soo Myung:
  On the clique partitioning problem in weighted interval graphs. 290-293
  
• Oleg Verbitsky:
  On the obfuscation complexity of planar graphs. 294-300
  

Last update Tue May 21 19:44:38 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page