Discrete Applied Mathematics, Volume 136

Volume 136, Number 1, 30 January 2004

• Jianer Chen, Yanpei Liu, Suowang Chen, Songqiao Chen:
  Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS). 1
  
• Yunlei Zhao, Xiaotie Deng, Chan H. Lee, Hong Zhu:
  (2+f(n))-SAT and its properties. 3-11
  
• Qizhi Fang:
  On the computational complexity of upper total domination. 13-22
  
• Wei Li, Shilong Ma:
  Limits of theory sequences over algebraically closed fields and applications. 23-43
  
• Guizhen Liu, Wenan Zang:
  f-Factors in bipartite (mf)-graphs. 45-54
  
• Dingjun Lou, Qinglin Yu:
  Connectivity of k-extendable graphs with large k. 55-61
  
• Jianguo Qian, Fuji Zhang:
  Expanding and forwarding parameters of product graphs. 63-82
  
• Erfang Shan, Chuangyin Dang, Liying Kang:
  A note on Nordhaus-Gaddum inequalities for domination. 83-85
  
• Hanpin Wang, Qiwen Xu:
  Completeness of temporal logics over infinite intervals. 87-103
  
• Jimin Wang, Xiao-Shan Gao:
  An algorithm for solving partial differential parametric systems. 105-116
  
• Guang-Hui Xu:
  On unicyclic graphs whose second largest eigenvalue dose not exceed 1. 117-124
  
• Ke Xu, Wei Li:
  On the average similarity degree between solutions of random k-SAT and random CSPs. 125-149
  
• Bo Yang, Tong Zhang, Changxing Pei:
  The effect of side-information on smooth entropy. 151-157
  

Volume 136, Number 2-3, 15 February 2004

• Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann Hurink:
  Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. 159-160
  
• Jørgen Bang-Jensen, Anders Yeo:
  Making a tournament k-arc-strong by reversing or deorienting arcs. 161-171
  
• Paul S. Bonsma:
  Sparsest cuts and concurrent flows in product graphs. 173-182
  
• Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca:
  On treewidth approximations. 183-196
  
• Paolo Detti, Carlo Meloni:
  A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. 197-215
  
• Thomas Epping, Winfried Hochstättler, Peter Oertel:
  Complexity results on a paint shop problem. 217-226
  
• Irene Finocchi, Rossella Petreschi:
  Divider-based algorithms for hierarchical tree partitioning. 227-247
  
• Sounaka Mishra, Kripasindhu Sikdar:
  On approximability of linear ordering and related NP-optimization problems on graphs. 249-269
  
• Sven Peyer, Martin Zachariasen, David Grove Jørgensen:
  Delay-related secondary objectives for rectilinear Steiner minimum trees. 271-298
  
• Bert Randerath, Ingo Schiermeyer:
  3-Colorability in P for P₆-free graphs. 299-313
  
• Jens Schreyer, Hansjoachim Walther:
  Edge-oblique polyhedral graphs. 315-327
  
• Ron Shamir, Roded Sharan:
  A fully dynamic algorithm for modular decomposition and recognition of cographs. 329-340
  
• Oswaldo Vernet, Lilian Markenzon:
  Solving problems for maximal reducible flowgraphs. 341-348
  
• Ligong Wang, Xueliang Li, Shenggui Zhang:
  Families of integral trees with diameters 4, 6, and 8. 349-362
  
• Xuehou Tan:
  Approximation algorithms for the watchman route and zookeeper's problems. 363-376
  
• Blaz Zmazek, Janez Zerovnik:
  The obnoxious center problem on weighted cactus graphs. 377-386