default search action
Hann-Jang Ho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j10]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
- [j9]ChenKun Tsung
Detecting Overlapping Communities in Modularity Optimization by Reweighting Vertices. Entropy 22(8): 819 (2020)
2010 – 2019
- 2014
- [j8]ChenKun Tsung
A Game Theoretical Approach for Solving Winner Determination Problems. J. Appl. Math. 2014: 845071:1-845071:10 (2014) - [j7]ChenKun Tsung
Correcting vindictive bidding behaviors in sponsored search auctions. J. Supercomput. 69(3): 1166-1182 (2014) - [c9]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 - 2012
- [c8]ChenKun Tsung
Sponsored search auction without bias. ICEC 2012: 27-34 - [c7]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
- [c6]ChenKun Tsung
Analysis of Stable Prices in Non-Decreasing Sponsored Search Auction. AMEC/TADA 2011: 102-114 - [c5]ChenKun Tsung
An Equilibrium-Based Approach for Determining Winners in Combinatorial Auctions. ISPA 2011: 47-51 - 2010
- [j6]Hann-Jang Ho, Jung-Chun Liu:
Improvement of multi-hop packet transmission scheduling in WDM optical star networks. Comput. Commun. 33(6): 706-713 (2010) - [c4]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
- [c3]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 - [c2]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
- [j5]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) - [j4]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
- [j3]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) - 2004
- [j2]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
- [j1]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) - [c1]Sing-Ling Lee, Hann-Jang Ho, Yu-Tsang Chin:
Strategies for Multimedia Delivery on a Linear Multilevel Caching System. MMM 2003: 461-477
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:58 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: