Finding Segments and Triangles Spanned by Points in R3. - Steven Bitner; Ovidiu Daescu (CCCG, 2007)

Minimum-sum Dipolar Spanning Tree for Points in R3. - Steven Bitner; Ovidiu Daescu (CCCG, 2007)

Finding a Minimum-Sum Dipolar Spanning Tree in R3. - Steven Bitner; Ovidiu Daescu (HICSS, 2008)

Farthest segments and extremal triangles spanned by points in R3. - Steven Bitner; Ovidiu Daescu (Inf. Process. Lett., 2009)

Minimum Separating Circle for Bichromatic Points in the Plane. - Steven Bitner; Yam Ki Cheung; Ovidiu Daescu (ISVD, 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 (LATIN, 2010)

Minimum Sum Dipolar Spanning Tree in R^3 - Steven Bitner; Ovidiu Daescu (CoRR, 2010)

Minimum-sum dipolar spanning tree in R3. - Steven Bitner; Ovidiu Daescu (Comput. Geom., 2012)

Nifty Assignments. - Nick Parlante; Julie Zelenski; Adrian A. de Freitas; Troy B. Weingart; Keith Schwarz; Ben Stephenson; Steven Bitner (SIGCSE, 2021)