Michael S. Payne

Orcid: 0000-0002-5667-1386

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An exact algorithm for the Euclidean k-Steiner tree problem.
Comput. Geom., 2024

2023
Intersecting longest paths in chordal graphs.
Discret. Math., April, 2023

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

2019
Three-Coloring Three-Dimensional Uniform Hypergraphs.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2017
Bichromatic Lines in the Plane.
SIAM J. Discret. Math., 2017

2016
Ramsey-type theorems for lines in 3-space.
Discret. Math. Theor. Comput. Sci., 2016

Thoughts on Barnette's Conjecture.
Australas. J Comb., 2016

2015
Empty Pentagons in Point Sets with Collinearities.
SIAM J. Discret. Math., 2015

2014
Which point sets admit a k-angulation?
J. Comput. Geom., 2014

Progress on Dirac's Conjecture.
Electron. J. Comb., 2014

2013
On the General Position Subset Selection Problem.
SIAM J. Discret. Math., 2013

2012
On the Connectivity of Visibility Graphs.
Discret. Comput. Geom., 2012

2009
Unit Distance Graphs with Ambiguous Chromatic Number.
Electron. J. Comb., 2009


  Loading...