![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Yam Ki Cheung
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [c9]Yam Ki Cheung, Ovidiu Daescu, J. Steven Kirtzic, Lech Papiez:
Volume matching with application in medical treatment planning. ICCABS 2012: 1-6 - 2011
- [j3]Yam Ki Cheung, Ovidiu Daescu:
Line facility location in weighted regions. J. Comb. Optim. 22(1): 52-70 (2011) - [c8]Yam Ki Cheung, Ovidiu Daescu, Lech Papiez:
Volume matching with application in medical treatment planning. BCB 2011: 487-489 - [c7]Yam Ki Cheung, Ovidiu Daescu, Marko Zivanic:
Kinetic Red-Blue Minimum Separating Circle. COCOA 2011: 448-463 - 2010
- [j2]Yam Ki Cheung, Ovidiu Daescu:
FréChet Distance Problems in Weighted Regions. Discret. Math. Algorithms Appl. 2(2): 161-180 (2010) - [c6]Steven Bitner, Yam Ki Cheung, Ovidiu Daescu:
Minimum Separating Circle for Bichromatic Points in the Plane. ISVD 2010: 50-55 - [c5]Steven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk:
Visiting a Sequence of Points with a Bevel-Tip Needle. LATIN 2010: 492-502 - [i2]Yam Ki Cheung, Ovidiu Daescu:
Approximate Point-to-Face Shortest Paths in R^3. CoRR abs/1004.1588 (2010) - [i1]Yam Ki Cheung, Ovidiu Daescu:
Fréchet Distance Problems in Weighted Regions. CoRR abs/1004.4901 (2010)
2000 – 2009
- 2009
- [j1]Ovidiu Daescu, Yam Ki Cheung, James D. Palmer:
Parallel Optimal Weighted Links. Trans. Comput. Sci. 3: 66-81 (2009) - [c4]Yam Ki Cheung, Ovidiu Daescu:
Line Segment Facility Location in Weighted Subdivisions. AAIM 2009: 100-113 - [c3]Yam Ki Cheung, Ovidiu Daescu:
Fréchet Distance Problems in Weighted Regions. ISAAC 2009: 97-111 - 2008
- [c2]Yam Ki Cheung, Ovidiu Daescu:
Line Facility Location in Weighted Regions. AAIM 2008: 109-119 - [c1]Yam Ki Cheung, Ovidiu Daescu, Anastasia Kurdia:
A New Modeling for Finding Optimal Weighted Distances. BIOTECHNO 2008: 41-46
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint