S. J. Gismondi

According to our database, S. J. Gismondi authored at least 3 papers between 2004 and 2017.

Collaborative distances:

• no known Dijkstra number.
• no known Erdős number.

2017

Using Matching to Detect Infeasibility of Some Integer Programs.

S. J. Gismondi, E. R. Swart

CoRR, 2017

2016

Deciding Graph non-Hamiltonicity via a Closure Algorithm.

E. R. Swart, S. J. Gismondi, N. R. Swart, C. E. Bell, A. Lee

CoRR, 2016

2004

A model of the coNP-complete non-Hamilton tour decision problem for directed graphs.

S. J. Gismondi, E. R. Swart

Math. Program., 2004