Joel Hass

Patricia Francis-Lyon, Shengyin Gu, Joel Hass, Nina Amenta, Patrice Koehl: Sampling the conformation of protein surface residues for flexible protein docking. BMC Bioinformatics 11: 575 (2010)

Joel Hass, Tahl Nowik: Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle. Discrete & Computational Geometry 44(1): 91-95 (2010)

Joel Hass, Rida T. Farouki, Chang Yong Han, Xiaowen Song, Thomas W. Sederberg: Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme. Adv. Comput. Math. 27(1): 1-26 (2007)

Rida T. Farouki, Chang Yong Han, Joel Hass: Boundary evaluation algorithms for Minkowski combinations of complex sets using topological analysis of implicit curves. Numerical Algorithms 40(3): 251-283 (2005)

Xiaowen Song, Thomas W. Sederberg, Jianmin Zheng, Rida T. Farouki, Joel Hass: Linear perturbation methods for topologically consistent representations of free-form surface intersections. Computer Aided Geometric Design 21: 303-319 (2004)

Xiaowen Song, Thomas W. Sederberg, Jianmin Zheng, Rida T. Farouki, Joel Hass: Corrigendum to: 'Linear perturbation methods for topologically consistent representations of free-form surface intersections': Computer Aided Geometric Design 21 (2004) 303-319. Computer Aided Geometric Design 21: 321 (2004)

Rida T. Farouki, Chang Yong Han, Joel Hass, Thomas W. Sederberg: Topologically consistent trimmed surface approximations based on triangular patches. Computer Aided Geometric Design 21: 459-478 (2004)

Joel Hass, Jack Snoeyink, William P. Thurston: The Size of Spanning Disks for Polygonal Curves. Discrete & Computational Geometry 29(1): 1-17 (2003)

Ian Agol, Joel Hass, William P. Thurston: 3-MANIFOLD KNOT GENUS is NP-complete. IEEE Conference on Computational Complexity 2002: 24

Ian Agol, Joel Hass, William P. Thurston: 3-manifold knot genus is NP-complet. STOC 2002: 761-766

Joel Hass, J. C. Lagarias, Nicholas Pippenger: The Computational Complexity of Knot and Link Problems. J. ACM 46(2): 185-211 (1999)

Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin: Emerging Challenges in Computational Topology. CoRR cs.CG/9909001 (1999)

Joel Hass, J. C. Lagarias, Nicholas Pippenger: The Computational Complexity of Knot and Link Problems. FOCS 1997: 172-181