Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 2002
- Wansoo T. Rhee:
Packing Random Rectangles of Given Volume. Math. Oper. Res. 27(1): 244-252 (2002) - 2001
- Wansoo T. Rhee:
Packing rectangles and intervals. Int. J. Comput. Math. 76(4): 479-488 (2001) - 2000
- Wansoo T. Rhee, Michel Talagrand:
The Random Weighted Interval Packing Problem: the Intermediate Density Case. Math. Oper. Res. 25(1): 105-117 (2000) - 1999
- Wansoo T. Rhee:
Some exact rates for the random weighted interval packing problem. Random Struct. Algorithms 15(2): 165-175 (1999) - 1996
- Wansoo T. Rhee, Michel Talagrand:
Convergence in Distribution for Best-Fit Decreasing. SIAM J. Comput. 25(4): 894-906 (1996) - 1994
- Wansoo T. Rhee:
Boundary effects in the traveling salesperson problem. Oper. Res. Lett. 16(1): 19-25 (1994) - Wansoo T. Rhee:
On the fluctuations of simple matching. Oper. Res. Lett. 16(1): 27-32 (1994) - 1993
- Wansoo T. Rhee:
On the Stochastic Euclidean Travelling Salesperson Problem for Distributions with Unbounded Support. Math. Oper. Res. 18(2): 292-299 (1993) - Wansoo T. Rhee:
Inequalities for Bin Packing - II. Math. Oper. Res. 18(3): 685-693 (1993) - Wansoo T. Rhee:
Optimal Bin Packing of Items of Sizes Uniformly Distributed over [0, 1]. Math. Oper. Res. 18(3): 694-704 (1993) - Wansoo T. Rhee, Michel Talagrand:
On Line Bin Packing with Items of Random Size. Math. Oper. Res. 18(2): 438-445 (1993) - Wansoo T. Rhee, Michel Talagrand:
Dual bin packing with items of random sizes. Math. Program. 58: 229-242 (1993) - Wansoo T. Rhee, Michel Talagrand:
On-Line Bin Packing of Items of Random Sizes, II. SIAM J. Comput. 22(6): 1251-1256 (1993) - 1992
- Wansoo T. Rhee, Michel Talagrand:
Packing random items of three colors. Comb. 12(3): 331-350 (1992) - Wansoo T. Rhee:
On the Travelling Salesperson Problem in Many Dimensions. Random Struct. Algorithms 3(3): 227-234 (1992) - 1991
- Wansoo T. Rhee:
Stochastic Analysis of a Modified First Fit Decreasing Packing. Math. Oper. Res. 16(1): 162-175 (1991) - Wansoo T. Rhee:
Stochastic Analysis of the Quadratic Assignment Problem. Math. Oper. Res. 16(2): 223-239 (1991) - Wansoo T. Rhee:
On the Fluctuations of the Stochastic Traveling Salesperson Problem. Math. Oper. Res. 16(3): 482-489 (1991) - Wansoo T. Rhee, Michel Talagrand:
Multidimensional Optimal Bin Packing with Items of Random Size. Math. Oper. Res. 16(3): 490-503 (1991) - 1990
- Wansoo T. Rhee:
A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size. SIAM J. Comput. 19(4): 705-710 (1990) - Wansoo T. Rhee, Michel Talagrand:
Packing Random Items of Three Colors. SODA 1990: 261-271 - 1989
- Wansoo T. Rhee, Michel Talagrand:
Martingale Inequalities, Interpolation and NP-Complete Problems. Math. Oper. Res. 14(1): 91-96 (1989) - Wansoo T. Rhee, Michel Talagrand:
A Concentration Inequality for the K-Median Problem. Math. Oper. Res. 14(2): 189-202 (1989) - Wansoo T. Rhee, Michel Talagrand:
Optimal Bin Packing with Items of Random Sizes II. SIAM J. Comput. 18(1): 139-151 (1989) - Wansoo T. Rhee, Michel Talagrand:
Optimal Bin Packing with Items of Random Sizes III. SIAM J. Comput. 18(3): 473-486 (1989) - Wansoo T. Rhee, Michel Talagrand:
Optimal Bin Covering with Items of Random Size. SIAM J. Comput. 18(3): 487-498 (1989) - Wansoo T. Rhee, Michel Talagrand:
The Complete Convergence of Best Fit Decreasing. SIAM J. Comput. 18(5): 909-918 (1989) - Wansoo T. Rhee, Michel Talagrand:
The Complete Convergence of First Fit Decreasing. SIAM J. Comput. 18(5): 919-938 (1989) - 1988
- Nicholas G. Hall, Soumen Ghosh, Roland D. Kankey, Sridhar Narasimhan, Wansoo T. Rhee:
Bin packing problems in one dimension: Heuristic solutions and confidence intervals. Comput. Oper. Res. 15(2): 171-177 (1988) - Wansoo T. Rhee, Michel Talagrand:
Some distributions that allow perfect packing. J. ACM 35(3): 564-578 (1988)
skipping 2 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-07-13 14:07 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint