You can find the results of your search below. If you didn't find what you were looking for, you can create or edit the page named after your query with the appropriate tool.
on]],
[[http://www2.math.binghamton.edu/p/people/dobbins/|MichaelDobbins]],
[[http://www2.math.binghamton.edu/p/... >
<HTML><li></HTML>
**Tuesday, 1/27**\\
Speaker: MichaelDobbins (Binghamton)\\
Title: Transversal Ratios of Conve... e examining committee consists of Laura Anderson, MichaelDobbins, and Thomas Zaslavsky (chair). The talks are ope... e examining committee consists of Laura Anderson, MichaelDobbins, and Thomas Zaslavsky (chair). The talks are ope
s_a_low_rank_matrix_completion_problem.pdf|
[1]
Michael Gene Dobbins. Realizability of polytopes as a low rank matrix ...
Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer,
Akitoshi Kawamura, Matias Kor... gments_in_a_convex_3-polytope_is_np-hard.pdf|
[3] Michael Gene Dobbins, Heuna Kim. Packing segments in a convex 3-polyto... es_problem_for_non-crossing_convex_sets.pdf|
[4]
Michael Gene Dobbins, Andreas Holmsen, and Alfredo Hubard. The Erdős-S
{{pic_crop.jpg?200}}
====== Michael Gene Dobbins ======
mɑɪkəl dʒin dɑbɪnz
----
I will be joining the [[http://www2.... ==== Publications =====
{{barycenter_fig.svg}}
Michael Gene Dobbins. A point in a nd-polytope is the barycenter of n ... bs/1312.4411|arXiv]]
{{regular_system_fig.svg}}
Michael Gene Dobbins, Andreas Holmsen, and Alfredo Hubard. Regular sys... appear. [[http://arxiv.org/abs/1307.0909|arXiv]]
Michael Gene Dobbins. Realizability of polytopes as a low rank matrix