Unit Distance Graphs with Ambiguous Chromatic Number. - Michael S. Payne (Electron. J. Comb., 2009)

On the Connectivity of Visibility Graphs. - Michael S. Payne; Attila Pór; Pavel Valtr 001; David R. Wood (Discret. Comput. Geom., 2012)

On the General Position Subset Selection Problem. - Michael S. Payne; David R. Wood (SIAM J. Discret. Math., 2013)

Progress on Dirac's Conjecture. - Michael S. Payne; David R. Wood (Electron. J. Comb., 2014)

Which point sets admit a k-angulation? - Michael S. Payne; Jens M. Schmidt; David R. Wood (J. Comput. Geom., 2014)

Combinatorial geometry of point sets with collinearities. - Michael S. Payne (2014)

Empty Pentagons in Point Sets with Collinearities. - János Barát; Vida Dujmovic; Gwenaël Joret; Michael S. Payne; Ludmila Scharf; Daria Schymura; Pavel Valtr 001; David R. Wood (SIAM J. Discret. Math., 2015)

Thoughts on Barnette's Conjecture. - Helmut Alt; Michael S. Payne; Jens M. Schmidt; David R. Wood (Australas. J Comb., 2016)

Ramsey-type theorems for lines in 3-space. - Jean Cardinal; Michael S. Payne; Noam Solomon (Discret. Math. Theor. Comput. Sci., 2016)

Bichromatic Lines in the Plane. - Michael S. Payne (SIAM J. Discret. Math., 2017)

Three-Coloring Three-Dimensional Uniform Hypergraphs. - Ahmad Biniaz; Prosenjit Bose; Jean Cardinal; Michael S. Payne (CCCG, 2019)

Overlaid oriented Voronoi diagrams and the 1-Steiner tree problem. - Michael S. Payne; Charl J. Ras; Marcus Volz (CoRR, 2020)

Intersecting longest paths in chordal graphs. - Daniel J. Harvey; Michael S. Payne (Discret. Math., 2023)

An exact algorithm for the Euclidean k-Steiner tree problem. - Marcus Brazil; Michael Hendriksen; Jae Lee; Michael S. Payne; Charl J. Ras; Doreen A. Thomas (Comput. Geom., 2024)