Abstract. Coxeter groups have presentations S : (st) m st ∀s, t ∈ S where for all s, t ∈ S, m st ∈ {1, 2, . . . , ∞}, m st = m ts and m st = 1 if and only if s = t. A fundamental question in the theory of Coxeter groups is: Given two such "Coxeter" presentations, do they present the same group? There are two known ways to change a Coxeter presentation, generally referred to as twisting and simplex exchange. We solve the isomorphism question for Coxeter groups with an even Coxeter presentation (one in which m st is even or ∞ when s = t). More specifically, we give an algorithm that describes a sequence of twists and triangle-edge exchanges that either converts an arbitrary finitely generated Coxeter presentation into a unique even presentation or identifies the group as a non-even Coxeter group. Our technique can be used to produce all Coxeter presentations for a given even Coxeter group.