default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael A. Soss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
Journal Articles
- 2008
[j6]Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman
, Pat Morin, Micha Sharir, Michael A. Soss:
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. Discret. Comput. Geom. 39(1-3): 17-37 (2008)- 2003
- [j5]Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristán, Michael A. Soss:
Long proteins with unique optimal foldings in the H-P model. Comput. Geom. 25(1-2): 139-159 (2003) - [j4]Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint:
Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. Comput. Geom. 26(1): 69-79 (2003) - [j3]Michael A. Soss, Jeff Erickson, Mark H. Overmars:
Preprocessing chains for fast dihedral rotations is hard or even impossible. Comput. Geom. 26(3): 235-246 (2003) - 2001
- [j2]Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint:
Reconfiguring convex polygons. Comput. Geom. 20(1-2): 85-95 (2001) - [j1]Jorge Alberto Calvo, Danny Krizanc, Pat Morin, Michael A. Soss, Godfried T. Toussaint:
Convexifying polygons with simple projections. Inf. Process. Lett. 80(2): 81-86 (2001)
Conference and Workshop Papers
- 2007
- [c9]Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael A. Soss, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint:
Deflating the Pentagon. KyotoCGGT 2007: 56-67 - 2002
- [c8]Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint:
Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 2002: 369-380 - [c7]Stefan Langerman, Pat Morin, Michael A. Soss:
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles. STACS 2002: 250-261 - 2001
- [c6]Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint:
Algorithms for bivariate medians and a fermat-torricelli problem for lines. CCCG 2001: 21-24 - 2000
- [c5]Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint:
Reconfiguring Convex Polygons. CCCG 2000 - 1999
- [c4]Michael A. Soss:
On the size of the euclidean sphere of influence graph. CCCG 1999 - [c3]Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss:
Convexifying Monotone Polygons. ISAAC 1999: 415-424 - 1998
- [c2]Michael A. Soss:
The size of the open sphere of influence graph in metric spaces. CCCG 1998 - [c1]Michael A. Soss:
The Size of the Open Sphere of Influence Graph in Linfty Metric Spaces. GD 1998: 458-459
Informal and Other Publications
- 2002
- [i2]Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristán, Michael A. Soss:
Long Proteins with Unique Optimal Foldings in the H-P Model. CoRR cs.CG/0201018 (2002) - [i1]Michael A. Soss, Jeff Erickson, Mark H. Overmars:
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible. CoRR cs.CG/0204042 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
