The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joel Hass: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ian Agol, Joel Hass, William P. Thurston
    3-MANIFOLD KNOT GENUS is NP-complete. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:24- [Conf]
  2. Joel Hass, J. C. Lagarias, Nicholas Pippenger
    The Computational Complexity of Knot and Link Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:172-181 [Conf]
  3. Ian Agol, Joel Hass, William P. Thurston
    3-manifold knot genus is NP-complet. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:761-766 [Conf]
  4. Rida T. Farouki, Chang Yong Han, Joel Hass, Thomas W. Sederberg
    Topologically consistent trimmed surface approximations based on triangular patches. [Citation Graph (0, 0)][DBLP]
    , 2004, v:, n:, pp:459-478 [Journal]
  5. Xiaowen Song, Thomas W. Sederberg, Jianmin Zheng, Rida T. Farouki, Joel Hass
    Linear perturbation methods for topologically consistent representations of free-form surface intersections. [Citation Graph (0, 0)][DBLP]
    , 2004, v:, n:, pp:303-319 [Journal]
  6. 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. [Citation Graph (0, 0)][DBLP]
    , 2004, v:, n:, pp:321- [Journal]
  7. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  8. Joel Hass, Jack Snoeyink, William P. Thurston
    The Size of Spanning Disks for Polygonal Curves. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:29, n:1, pp:1-17 [Journal]
  9. Joel Hass, J. C. Lagarias, Nicholas Pippenger
    The Computational Complexity of Knot and Link Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:2, pp:185-211 [Journal]
  10. 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. [Citation Graph (0, 0)][DBLP]
    Adv. Comput. Math., 2007, v:27, n:1, pp:1-26 [Journal]

  11. Unknot Diagrams Requiring a Quadratic Number of Reidemeister Moves to Untangle. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002