Discrete Applied Mathematics

Editorial Board
pp. v-vii

Contents Vol. 136/1
pp. viii-ix(1)

Preface
pp. 1-1(1)
Authors: Chen J.; Liu Y.; Chen S.; Chen S.

(2+f(n))-SAT and its properties
pp. 3-11(9)
Authors: Zhao Y.; Deng X.; Lee C.H.; Zhu H.

On the computational complexity of upper total domination
pp. 13-22(10)
Author: Fang Q.

Limits of theory sequences over algebraically closed fields and applications
pp. 23-43(21)
Authors: Li W.; Ma S.

f-Factors in bipartite (mf)-graphs
pp. 45-54(10)
Authors: Liu G.; Zang W.

Connectivity of k-extendable graphs with large k
pp. 55-61(7)
Authors: Lou D.; Yu Q.

Expanding and forwarding parameters of product graphs
pp. 63-82(20)
Authors: Qian J.; Zhang F.

A note on Nordhaus-Gaddum inequalities for domination
pp. 83-85(3)
Authors: Erfang S.; Chuangyin D.; Liying K.

Completeness of temporal logics over infinite intervals
pp. 87-103(17)
Authors: Wang H.; Xu Q.

An algorithm for solving partial differential parametric systems
pp. 105-116(12)
Authors: Wang J.; Gao X.-S.

On unicyclic graphs whose second largest eigenvalue dose not exceed 1
pp. 117-124(8)
Author: Xu G.-H.

On the average similarity degree between solutions of random k-SAT and random CSPs
pp. 125-149(25)
Authors: Xu K.; Li W.

The effect of side-information on smooth entropy
pp. 151-157(7)
Authors: Yang B.; Zhang T.; Pei C.