PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Soss, Michael A."

Author of the publication

copydeleteadd this publication to your clipboard
Long proteins with unique optimal foldings in the H-P model.

, , , , , and . Comput. Geom., 25 (1-2): 139-159 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

A. Laukemann

A. Laukemann

A. Laukemann

A. Vo{\ss}

A. Afkari

 

Other publications of authors with the same name

Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles., , and . STACS, volume 2285 of Lecture Notes in Computer Science, page 250-261. Springer, (2002)Convexifying polygons with simple projections., , , , and . Inf. Process. Lett., 80 (2): 81-86 (2001)Convexifying Monotone Polygons., , , , and . ISAAC, volume 1741 of Lecture Notes in Computer Science, page 415-424. Springer, (1999)Reconfiguring Convex Polygons., , , , , , and . CCCG, (2000)Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D., , , , , , and . Discrete & Computational Geometry, 39 (1-3): 17-37 (2008)The Size of the Open Sphere of Influence Graph in Linfty Metric Spaces.. Graph Drawing, volume 1547 of Lecture Notes in Computer Science, page 458-459. Springer, (1998)Long proteins with unique optimal foldings in the H-P model., , , , , and . Comput. Geom., 25 (1-2): 139-159 (2003)Algorithms for bivariate medians and a Fermat-Torricelli problem for lines., , , and . Comput. Geom., 26 (1): 69-79 (2003)Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible, , and . CoRR, (2002)Preprocessing chains for fast dihedral rotations is hard or even impossible., , and . Comput. Geom., 26 (3): 235-246 (2003)