Steven Bitner

According to our database, Steven Bitner authored at least 9 papers between 2007 and 2021.

Collaborative distances:

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

2021

Nifty Assignments.

Nick Parlante, Julie Zelenski, Adrian A. de Freitas, Troy B. Weingart, Keith Schwarz, Ben Stephenson, Steven Bitner

Proceedings of the SIGCSE '21: The 52nd ACM Technical Symposium on Computer Science Education, 2021

2012

Minimum-sum dipolar spanning tree in R³.

Steven Bitner, Ovidiu Daescu

Comput. Geom., 2012

2010

Minimum Sum Dipolar Spanning Tree in R^3

Steven Bitner, Ovidiu Daescu

CoRR, 2010

Visiting a Sequence of Points with a Bevel-Tip Needle.

Steven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Minimum Separating Circle for Bichromatic Points in the Plane.

Steven Bitner, Yam Ki Cheung, Ovidiu Daescu

Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

2009

Farthest segments and extremal triangles spanned by points in R³.

Steven Bitner, Ovidiu Daescu

Inf. Process. Lett., 2009

2008

Finding a Minimum-Sum Dipolar Spanning Tree in R3.

Steven Bitner, Ovidiu Daescu

Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

2007

Minimum-sum Dipolar Spanning Tree for Points in R³.

Steven Bitner, Ovidiu Daescu

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Finding Segments and Triangles Spanned by Points in R³.

Steven Bitner, Ovidiu Daescu

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007