Остановите войну!
for scientists:
default search action
L. Paul Chew
- > Home > Persons > L. Paul Chew
Publications
- 2008
- [j15]Isana Veksler-Lublinsky, Danny Barash, Chai Avisar, Einav Troim, L. Paul Chew, Klara Kedem:
FASH: A web application for nucleotides sequence search. Source Code Biol. Medicine 3 (2008) - 2004
- [j14]L. Paul Chew, Klara Kedem:
Finding the Consensus Shape for a Protein Family. Algorithmica 38(1): 115-129 (2004) - [j12]Amit Weisman, L. Paul Chew, Klara Kedem:
Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations. Inf. Process. Lett. 92(5): 245-251 (2004) - 2002
- [j11]L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem:
Walking around fat obstacles. Inf. Process. Lett. 83(3): 135-140 (2002) - [c19]L. Paul Chew, Klara Kedem:
Finding the consensus shape for a protein family. SCG 2002: 64-73 - 1999
- [j10]L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem:
Geometric Pattern Matching in d -Dimensional Space. Discret. Comput. Geom. 21(2): 257-274 (1999) - [j9]L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg:
Fast Detection of Common Geometric Substructure in Proteins. J. Comput. Biol. 6(3/4): 313-325 (1999) - [c15]L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg:
Fast detection of common geometric substructure in proteins. RECOMB 1999: 104-114 - 1998
- [j8]L. Paul Chew, Klara Kedem:
Getting around a lower bound for the minimum Hausdorff distance. Comput. Geom. 10(3): 197-202 (1998) - [j7]L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl:
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. J. Algorithms 29(2): 238-255 (1998) - 1997
- [j4]L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets:
Geometric Pattern Matching Under Euclidean Motion. Comput. Geom. 7: 113-124 (1997) - 1995
- [c12]L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem:
Geometric Pattern Matching in d-Dimensional Space. ESA 1995: 264-279 - [c10]L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl:
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. SODA 1995: 197-204 - 1993
- [j3]L. Paul Chew, Klara Kedem:
A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion. Comput. Geom. 3: 59-89 (1993) - [c9]L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets:
Geometric Pattern Matching Under Euclidean Motion. CCCG 1993: 151-156 - 1992
- [c6]L. Paul Chew, Klara Kedem:
Improvements on Geometric Pattern Matching Problems. SWAT 1992: 318-325 - 1991
- [j2]Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell:
An Efficiently Computable Metric for Comparing Polygonal Shapes. IEEE Trans. Pattern Anal. Mach. Intell. 13(3): 209-216 (1991) - 1990
- [c5]Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell:
An Efficiently Computable Metric for Comparing Polygonal Shapes. SODA 1990: 129-137 - 1989
- [c4]L. Paul Chew, Klara Kedem:
Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles. SCG 1989: 167-173
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-04-21 17:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint