default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSing-Ling Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j17]ChenKun Tsung
, Sing-Ling Lee, Hann-Jang Ho, ShengKai Chou:
A modularity-maximization-based approach for detecting multi-communities in social networks. Ann. Oper. Res. 303(1): 381-411 (2021)- 2020
- [j16]ChenKun Tsung, Hann-Jang Ho, Chien-Yu Chen, Tien-Wei Chang, Sing-Ling Lee:
Detecting Overlapping Communities in Modularity Optimization by Reweighting Vertices. Entropy 22(8): 819 (2020)
2010 – 2019
- 2014
- [j15]ChenKun Tsung, Hann-Jang Ho, Sing-Ling Lee:
A Game Theoretical Approach for Solving Winner Determination Problems. J. Appl. Math. 2014: 845071:1-845071:10 (2014) - [j14]ChenKun Tsung, Hann-Jang Ho, Sing-Ling Lee:
Correcting vindictive bidding behaviors in sponsored search auctions. J. Supercomput. 69(3): 1166-1182 (2014) - [c16]Chien-Yu Wu, Hann-Jang Ho, Sing-Ling Lee:
Optimization of Downlink Bandwidth Allocation for Energy Efficiency over OFDMA Wireless Networks. ICS 2014: 345-354 - [c15]JuiHsi Fu, Jui-Hung Chang, Chun-Yu Ke, Sing-Ling Lee:
Confidence-based Link/Attribute Inference based on Friendship Circles. MoMM 2014: 330-335 - 2012
- [c14]ChenKun Tsung, Hann-Jang Ho, Sing-Ling Lee:
Sponsored search auction without bias. ICEC 2012: 27-34 - [c13]Chien-Yu Wu, Hann-Jang Ho, Sing-Ling Lee, Shu-Jye Chang:
Energy-Aware Link Scheduling Algorithms to Maximize Life Cycle of Relay Nodes on IEEE 802.16e Mesh Networks. AINA 2012: 51-58 - 2011
- [c12]ChenKun Tsung, Hann-Jang Ho, Sing-Ling Lee:
Analysis of Stable Prices in Non-Decreasing Sponsored Search Auction. AMEC/TADA 2011: 102-114 - [c11]ChenKun Tsung, Hann-Jang Ho, Sing-Ling Lee:
An Equilibrium-Based Approach for Determining Winners in Combinatorial Auctions. ISPA 2011: 47-51 - [c10]Yuh-Shyan Chen, Yun-Wei Lin, Sing-Ling Lee:
A mobicast routing protocol in underwater sensor networks. WCNC 2011: 510-515 - 2010
- [j13]Yun-Wei Lin, Yuh-Shyan Chen, Sing-Ling Lee:
Routing Protocols in Vehicular Ad Hoc Networks: A Survey and Future Perspectives. J. Inf. Sci. Eng. 26(3): 913-932 (2010) - [j12]Yuh-Shyan Chen, Yun-Wei Lin, Sing-Ling Lee:
A Mobicast Routing Protocol in Vehicular Ad-Hoc Networks. Mob. Networks Appl. 15(1): 20-35 (2010) - [c9]Chien-Yu Wu, Hann-Jang Ho, Sing-Ling Lee:
Cross-Layer Subchannel Assignment with Multicast over WiMAX Networks. AINA Workshops 2010: 329-334
2000 – 2009
- 2009
- [c8]Yuh-Shyan Chen, Yun-Wei Lin, Sing-Ling Lee:
A Mobicast Routing Protocol in Vehicular Ad-Hoc Networks. GLOBECOM 2009: 1-6 - [c7]Hann-Jang Ho, Jung-Chun Liu, Sing-Ling Lee:
Improvement of Multi-hop Packet Transmission Scheduling in WDM Optical Star Networks. ISPAN 2009: 284-289 - [c6]Sing-Ling Lee, Jung-Chun Liu, Hann-Jang Ho:
Scalable Multi-Hop Scheduling with Overlapping the Tuning Latency in WDM Optical Star Networks. PDCAT 2009: 167-174 - 2008
- [j11]Jung-Chun Liu, Hann-Jang Ho, Sing-Ling Lee:
Optimization of logical rings for multi-hop transmissions in WDM optical star networks. Comput. Commun. 31(10): 2030-2038 (2008) - [j10]Hann-Jang Ho, Sing-Ling Lee:
Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle. SIAM J. Optim. 18(4): 1490-1500 (2008) - 2007
- [r1]Sing-Ling Lee, RongJou Yang, Hann-Jang Ho:
Multicast Congestion in Ring Networks. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2005
- [j9]Sing-Ling Lee, Hann-Jang Ho:
A 1.5 Approximation Algorithm for Embedding Hyperedges in a Cycle. IEEE Trans. Parallel Distributed Syst. 16(6): 481-488 (2005) - [c5]Sing-Ling Lee, Jung-Chun Liu, YuChing Chen:
An Ear-Decomposition Based Approach for Survivable Routing in WDM Networks. AINA 2005: 459-464 - 2004
- [j8]Sing-Ling Lee, Hwa-Chuan Lin, Pei-Xian Kou:
A Lazy Caching Location Strategy with Bypass Pointers in PCS. J. Inf. Sci. Eng. 20(4): 617-641 (2004) - [j7]Sing-Ling Lee, Hann-Jang Ho, Wen-wei Mai:
An Efficient Scheduling Algorithm for Information Delivery on VoD System. J. Supercomput. 28(1): 27-41 (2004) - 2003
- [j6]Hwa-Chuan Lin, Sing-Ling Lee, Wei-Yan Lin:
Dynamic location strategy for hot mobile subscribers in personal communications. Comput. Commun. 26(12): 1353-1364 (2003) - [j5]Sing-Ling Lee, Hann-Jang Ho:
On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle. Inf. Process. Lett. 87(5): 271-275 (2003) - [c4]Sing-Ling Lee, Hann-Jang Ho, Yu-Tsang Chin:
Strategies for Multimedia Delivery on a Linear Multilevel Caching System. MMM 2003: 461-477 - 2002
- [j4]Hwa-Chuan Lin, Sing-Ling Lee:
A Track-Presetting strategy in PCS using hierarchical location databases. Comput. Commun. 25(18): 1727-1735 (2002) - 2000
- [c3]Hwa-Chuan Lin, Sing-Ling Lee:
A presetting location strategy for personal communication using hierarchical location database. ICPADS Workshops 2000: 349-354
1990 – 1999
- 1997
- [c2]June-Wei Chen, Ren-Hung Hwang, Sing-Ling Lee:
QoS allocation of multicast connections in ATM. RTCSA 1997: 215-222 - 1993
- [p1]Teofilo F. Gonzalez, Sing-Ling Lee:
Routing around two Rectangles to minimize the Layout Area. Algorithmic Aspects of VLSI Layout 1993: 365-397 - 1992
- [c1]Maw-Hwa Chen, Sing-Ling Lee:
Linear Time Algorithms for k-cutwidth Problem. ISAAC 1992: 21-30
1980 – 1989
- 1988
- [j3]Teofilo F. Gonzalez, Sing-Ling Lee:
A linear time algorithm for optimal routing around a rectangle. J. ACM 35(4): 810-831 (1988) - 1987
- [j2]Teofilo F. Gonzalez, Sing-Ling Lee:
A 1.6 Approximation Algorithm for Routing Multiterminal Nets. SIAM J. Comput. 16(4): 669-704 (1987) - 1986
- [j1]Teofilo F. Gonzalez, Sing-Ling Lee:
Routing Multiterminal Nets Around a Rectangle. IEEE Trans. Computers 35(6): 543-549 (1986)
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-04-25 05:56 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:
