How I implemented the Karmarkar algorithm in one evening. - E. R. Swart (ACM SIGAPL APL Quote Quad, 1985)

A model of the coNP-complete non-Hamilton tour decision problem for directed graphs. - S. J. Gismondi; E. R. Swart (Math. Program., 2004)

Deciding Graph non-Hamiltonicity via a Closure Algorithm. - E. R. Swart; S. J. Gismondi; N. R. Swart; C. E. Bell; A. Lee (CoRR, 2016)

Using Matching to Detect Infeasibility of Some Integer Programs. - S. J. Gismondi; E. R. Swart (CoRR, 2017)