default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMira Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
[j13]Mikyoung Kim, Mira Lee:
Brand-related user-generated content on social media: the roles of source and sponsorship. Internet Res. 27(5): 1085-1103 (2017)- 2014
- [j12]Hye-Jin Paek, Elizabeth Taylor Quilliam, Sookyong Kim, Lorraine J. Weatherspoon, Nora J. Rifon, Mira Lee:
Characteristics of food advergames that reach children and the nutrient quality of the foods they advertise. Internet Res. 24(1) (2014) - [j11]Seok Kim, Youngkyun Jeong, Mira Lee, Kee-Won Kwon, Jung-Hoon Chun:
A 5.2-Gb/s Low-Swing Voltage-Mode Transmitter With an AC-/DC-Coupled Equalizer and a Voltage Offset Generator. IEEE Trans. Circuits Syst. I Regul. Pap. 61-I(1): 213-225 (2014) - 2013
- [j10]Hee-Kap Ahn
, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron:
Realistic roofs over a rectilinear polygon. Comput. Geom. 46(9): 1042-1055 (2013) - [j9]Mira Lee, Mikyoung Kim, Wei Peng:
Consumer reviews: reviewer avatar facial expression and review valence. Internet Res. 23(2): 116-132 (2013) - 2012
- [j8]Jieun Lee, Mira Lee, In Hyok Choi:
Social Network Games Uncovered: Motivations and Their Attitudinal and Behavioral Outcomes. Cyberpsychology Behav. Soc. Netw. 15(12): 643-648 (2012) - [j7]Sariel Har-Peled, Mira Lee:
Weighted geometric set cover problems revisited. J. Comput. Geom. 3(1): 65-85 (2012) - 2011
- [j6]Joonghwa Lee, Mira Lee:
Factors Influencing the Intention to Watch Online Video Advertising. Cyberpsychology Behav. Soc. Netw. 14(10): 619-624 (2011) - [j5]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4): 234-247 (2011) - 2009
- [j4]Mikyoung Kim, Kyoung-Nan Kwon, Mira Lee:
Psychological Characteristics of Internet Dating Service Users: The Effect of Self-Esteem, Involvement, and Sociability on the Use of Internet Dating Services. Cyberpsychology Behav. Soc. Netw. 12(4): 445-449 (2009) - 2008
- [j3]Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a minimum-dilation spanning tree is NP-hard. Comput. Geom. 41(3): 188-205 (2008) - 2007
- [j2]Otfried Cheong, Mira Lee:
The Hadwiger Number of Jordan Regions Is Unbounded. Discret. Comput. Geom. 37(4): 497-501 (2007) - 2006
- [j1]Véronique Cortier, Xavier Goaoc, Mira Lee, Hyeon-Suk Na:
A note on maximally repeated sub-patterns of a point set. Discret. Math. 306(16): 1965-1968 (2006)
Conference and Workshop Papers
- 2011
- [c3]Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron:
Generating Realistic Roofs over a Rectilinear Polygon. ISAAC 2011: 60-69 - 2007
- [c2]Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a Minimum-Dilation Spanning Tree is NP-hard. CATS 2007: 15-24 - [c1]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. ESA 2007: 407-418
Informal and Other Publications
- 2010
- [i3]Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na:
Farthest-Polygon Voronoi Diagrams. CoRR abs/1001.3593 (2010) - 2007
- [i2]Otfried Cheong, Mira Lee:
The Hadwiger Number of Jordan Regions is Unbounded. CoRR abs/cs/0702079 (2007) - [i1]Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a Minimum-Dilation Spanning Tree is NP-hard. CoRR abs/cs/0703023 (2007)
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-06-04 21:29 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
