default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoung-Cheol Bang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j7]Md. Obaidur Rahman, Choong Seon Hong
, Sungwon Lee, Young-Cheol Bang:
ATLAS: A Traffic Load Aware Sensor MAC Design for Collaborative Body Area Sensor Networks. Sensors 11(12): 11560-11580 (2011)- [c33]Mildred M. Caballeros Morales, Choong Seon Hong, Young-Cheol Bang:
An Adaptable Mobility-Aware Clustering Algorithm in vehicular networks. APNOMS 2011: 1-6 - [c32]Euihoon Jeong, YunJae Won, SunHee Kim, Seung-ok Lim, Young-Cheol Bang:
A Multi-hop based Media Access Control Protocol using Magnetic Fields in Wireless Sensor Networks. ICCSA (4) 2011: 209-224 - 2010
- [c31]Muhammad Shoaib Siddiqui, Choong Seon Hong, Young-Cheol Bang:
Virtual platform support for QoS management in IMS based multiple provider networks. CNSM 2010: 350-353 - [c30]Cao Trong Hieu, Young-Cheol Bang, Jin Ho Kim, Young An Kim, Choong Seon Hong:
A multi-rate routing protocol with connection entropy for mobile ad hoc networks. ICUIMC 2010: 67 - [c29]Sooyeon Park, Moonseong Kim, Euihoon Jeong, Young-Cheol Bang:
RESS: A Data Dissemination Protocol Using Residual Energy and Signal Strength for Wireless Sensor Networks. UIC 2010: 205-214
2000 – 2009
- 2009
- [c28]Cao Trong Hieu, Dae Sun Kim, Choong Seon Hong, Young-Cheol Bang:
On-demand Multi-Path Balancing in Wireless Mesh Networks. ICOIN 2009: 1-4 - 2008
- [j6]Moonseong Kim, Euihoon Jeong, Young-Cheol Bang, Soyoung Hwang, Changsub Shin, Gwang-Ja Jin, Bongsoo Kim:
An Energy-Aware Multipath Routing Algorithm in Wireless Sensor Networks. IEICE Trans. Inf. Syst. 91-D(10): 2419-2427 (2008) - 2007
- [c27]Moonseong Kim, Minseok Kang, Hyunseung Choo, Jong S. Yang, Young-Cheol Bang:
On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees. International Conference on Computational Science (3) 2007: 432-439 - [c26]Sooyeon Park, Jong S. Yang, Moonseong Kim, Young-Cheol Bang:
RWA Algorithm for Scheduled Lightpath Demands in WDM Networks. ISPA 2007: 113-124 - 2006
- [j5]Moonseong Kim, Young-Cheol Bang, Hyung-Jin Lim, Hyunseung Choo:
On Efficient Core Selection for Reducing Multicast Delay Variation under Delay Constraints. IEICE Trans. Commun. 89-B(9): 2385-2393 (2006) - [c25]Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
On Multicasting Steiner Trees for Delay and Delay Variation Constraints. HPCC 2006: 447-456 - [c24]Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
Multicast omega-Trees Based on Statistical Analysis. ICCSA (3) 2006: 1090-1099 - [c23]Moonseong Kim, Young-Cheol Bang, Jong S. Yang, Hyunseung Choo:
An Efficient Multicast Tree with Delay and Delay Variation Constraints. ICCSA (3) 2006: 1129-1136 - [c22]Seong-Soon Joo, Moonseong Kim, Yoo-Kyoung Lee, Young-Cheol Bang:
On Recovery Algorithm for Fault-Tolerance in Multicast Trees. ISPA Workshops 2006: 358-367 - 2005
- [j4]Young-Cheol Bang, Hyunseung Choo:
On Bandwidth Adjusted Multicast Communications in Pipeline Router Architecture. J. Supercomput. 33(1-2): 7-18 (2005) - [c21]Young-Cheol Bang, Sung-Taek Chung, Moonseong Kim, Seong-Soon Joo:
On Multicast Communications with Minimum Resources. HPCC 2005: 4-13 - [c20]Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
On Estimation for Reducing Multicast Delay Variation. HPCC 2005: 117-122 - [c19]Youngjin Ahn, Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
On Algorithm for the Delay- and Delay Variation-Bounded Multicast Trees Based on Estimation. HPCC 2005: 277-282 - [c18]Youngjin Ahn, Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
On Algorithm for Estimation of Selecting Core. International Conference on Computational Science (3) 2005: 796-800 - [c17]Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
On Algorithm for Efficiently Combining Two Independent Measures in Routing Paths. ICCSA (4) 2005: 989-998 - [c16]Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
Estimated Path Selection for the Delay Constrained Least Cost Path. Panhellenic Conference on Informatics 2005: 112-122 - 2004
- [j3]Vladimir V. Shakhov, Hyunseung Choo, Young-Cheol Bang:
Discord model for detecting unexpected demands in mobile networks. Future Gener. Comput. Syst. 20(2): 181-188 (2004) - [c15]Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
Estimated link selection for DCLC problem. ICC 2004: 1937-1941 - [c14]Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
Advanced Multicasting for DVBMT Solution. International Conference on Computational Science 2004: 582-585 - [c13]Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
On Balancing Delay and Cost for Routing Paths. International Conference on Computational Science 2004: 602-606 - [c12]Young-Cheol Bang, Inki Hong, Hyunseung Choo:
On Algorithm for All-Pairs Most Reliable Quickest Paths. International Conference on Computational Science 2004: 611-614 - [c11]Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
New Parameter for Balancing Two Independent Measures in Routing Path. ICCSA (4) 2004: 56-65 - [c10]Eunhee Choi, Woochun Jun, Suk-Ki Hong, Young-Cheol Bang:
An Interaction Model for Web-Based Learning: Cooperative Project. ICCSA (2) 2004: 913-921 - [c9]Young-Cheol Bang, Inki Hong, Sungchang Lee, ByungJun Ahn:
On Algorithms for Minimum-Cost Quickest Paths with Multiple Delay-Bounds. ICCSA (1) 2004: 1125-1133 - [c8]Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
Efficient Algorithm for Reducing Delay Variation on Bounded Multicast Trees. ICOIN 2004: 440-450 - [c7]Moonseong Kim, Young-Cheol Bang, Hyunseung Choo:
On Core Selection Algorithm for Reducing Delay Variation of Many-to-Many Multicasts with Delay-Bounds. NETWORKING 2004: 200-210 - 2003
- [j2]Nageswara S. V. Rao, Young-Cheol Bang, Sridhar Radhakrishnan, Qishi Wu, S. Sitharama Iyengar, Hyunseung Choo:
NetLets: measurement-based routing daemons for low end-to-end delays over networks. Comput. Commun. 26(8): 834-844 (2003) - [c6]Young-Cheol Bang, W. B. Lee, Hyunseung Choo, Nageswara S. V. Rao:
Architecture for Internal Communication in Multi-gigabit IP Routers. International Conference on Computational Science 2003: 495-503 - [c5]Young-Cheol Bang, Hyunseung Choo, Youngsong Mun:
Reliability Problem on All Pairs Quickest Paths. International Conference on Computational Science 2003: 518-523 - [c4]Young-Cheol Bang, Nageswara S. V. Rao, Sridhar Radhakrishnan:
Algorithms for All-Pairs Reliable Quickest Paths. International Conference on Computational Science 2003: 678-684 - [c3]Young-Cheol Bang, Won-Seok Jang, ByungJun Ahn, Jin-Ho Hahm:
On Bandwidth Adjusted Multicast in Pipelined Routing Architecture for Mobile Environment. ICCSA (2) 2003: 135-143 - 2002
- [c2]Young-Cheol Bang, Hyunseung Choo:
On Multicasting with Minimum Costs for the Internet Topology. Euro-Par 2002: 736-744 - 2000
- [j1]Young-Cheol Bang, Sridhar Radhakrishnan, Nageswara S. V. Rao, Stephen Gordon Batsell:
On update algorithms for quickest paths. Comput. Commun. 23(11): 1064-1068 (2000)
1990 – 1999
- 1999
- [c1]Young-Cheol Bang, Sridhar Radhakrishnan, Nageswara S. V. Rao, Stephen Gordon Batsell:
On multicasting with minimum end-to-end delay. ICCCN 1999: 604-609
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:41 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:
