Michael Gene Dobbins

Orcid: 0000-0003-1428-406X

Affiliations:
  • Binghamton University, Department of Mathematical Sciences


According to our database1, Michael Gene Dobbins authored at least 15 papers between 2014 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Inscribable Order Types.
Discret. Comput. Geom., September, 2024

Transversals and Colorings of Simplicial Spheres.
Discret. Comput. Geom., March, 2024

Colorful Intersections and Tverberg Partitions.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Completeness for the Complexity Class $\forall \exists \mathbb {R}$ and Area-Universality.
Discret. Comput. Geom., July, 2023

2022
The inverse Kakeya problem.
Period. Math. Hung., 2022

Weight balancing on boundaries.
J. Comput. Geom., 2022

2019
A Universality Theorem for Nested Polytopes.
CoRR, 2019

2018
Smoothed Analysis of the Art Gallery Problem.
CoRR, 2018

∀∃ℝ-Completeness and Area-Universality.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2017
Realization Spaces of Arrangements of Convex Bodies.
Discret. Comput. Geom., 2017

Antiprismlessness, or: Reducing Combinatorial Equivalence to Projective Equivalence in Realizability Problems for Polytopes.
Discret. Comput. Geom., 2017

The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions.
Discret. Comput. Geom., 2017

2015
The Shadows of a Cycle Cannot All Be Paths.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Realizability of Polytopes as a Low Rank Matrix Completion Problem.
Discret. Comput. Geom., 2014

Weight Balancing on Boundaries and Skeletons.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014


  Loading...