Michael S. Payne

According to our database, Michael S. Payne authored at least 13 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

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

2023

Intersecting longest paths in chordal graphs.

Daniel J. Harvey, Michael S. Payne

Discret. Math., April, 2023

2020

Overlaid oriented Voronoi diagrams and the 1-Steiner tree problem.

Michael S. Payne, Charl J. Ras, Marcus Volz

CoRR, 2020

2019

Three-Coloring Three-Dimensional Uniform Hypergraphs.

Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2017

Bichromatic Lines in the Plane.

Michael S. Payne

SIAM J. Discret. Math., 2017

2016

Ramsey-type theorems for lines in 3-space.

Jean Cardinal, Michael S. Payne, Noam Solomon

Discret. Math. Theor. Comput. Sci., 2016

Thoughts on Barnette's Conjecture.

Helmut Alt, Michael S. Payne, Jens M. Schmidt, David R. Wood

Australas. J Comb., 2016

2015

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, David R. Wood

SIAM J. Discret. Math., 2015

2014

Which point sets admit a k-angulation?

Michael S. Payne, Jens M. Schmidt, David R. Wood

J. Comput. Geom., 2014

Progress on Dirac's Conjecture.

Michael S. Payne, David R. Wood

Electron. J. Comb., 2014

2013

On the General Position Subset Selection Problem.

Michael S. Payne, David R. Wood

SIAM J. Discret. Math., 2013

2012

On the Connectivity of Visibility Graphs.

Michael S. Payne, Attila Pór, Pavel Valtr, David R. Wood

Discret. Comput. Geom., 2012

2009

Unit Distance Graphs with Ambiguous Chromatic Number.

Michael S. Payne

Electron. J. Comb., 2009