We give an interpretation of the reduction algorithm of Gauss in terms of carks, which are certain types of infinite ribbon graphs (or infinite dessins). We then describe an alternative reduction which is slightly faster than Gauss’. We also solve the minimal value problem and describe an algorithmic solution to the representation problem of indefinite binary quadratic forms.