default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames Chang Wu Yu
Person information
- affiliation: Chung Hua University, Department of Computer Science and Information Engineering, Taiwan
Other persons with the same name
- Chang Wu Yu (aka: Chang-Wu Yu) — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j39]Rei-Heng Cheng, James Chang Wu Yu
, Zuo-Li Zhang:
Optimizing Charging Pad Deployment by Applying a Quad-Tree Scheme. Algorithms 17(6): 264 (2024)- [j38]Chi Lin, Chang Wu Yu, Ning Wang:
Current challenges in design, modelling, control and applications of unmanned surface and underwater vehicles. J. Control. Decis. 11(3): 329-330 (2024) - [j37]Chi Lin, Chang Wu Yu, Ning Wang, Syed Hassan Ahmed:
Guest Editorial: Special Issue on Recent Technologies in IoT for E-Health Applications. IEEE J. Biomed. Health Informatics 28(9): 5023-5024 (2024) - 2022
- [j36]Jingjing Chen, Hongwei Chen, Wen Ouyang, Chang-Wu Yu:
A Temporal and Spatial Priority With Global Cost Recharging Scheduling in Wireless Rechargeable Sensor Networks. Int. J. Grid High Perform. Comput. 14(1): 1-31 (2022) - [j35]Jingjing Chen, Chang Wu Yu, Rei-Heng Cheng:
Collaborative Hybrid Charging Scheduling in Wireless Rechargeable Sensor Networks. IEEE Trans. Veh. Technol. 71(8): 8994-9010 (2022) - 2020
- [j34]Jingjing Chen, Chang Wu Yu, Wen Ouyang:
Efficient Wireless Charging Pad Deployment in Wireless Rechargeable Sensor Networks. IEEE Access 8: 39056-39077 (2020) - [j33]Rei-Heng Cheng, Chang-Wu Yu, Chengjie Xu, Tung-Kuang Wu:
A Distance-Based Scheduling Algorithm With a Proactive Bottleneck Removal Mechanism for Wireless Rechargeable Sensor Networks. IEEE Access 8: 148906-148925 (2020)
2010 – 2019
- 2019
- [j32]Qinghai Li, Chang-Wu Yu:
New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling. Algorithms 12(7): 142 (2019) - 2018
- [j31]Chi Lin, Yanhong Zhou, Houbing Song, Chang Wu Yu, Guowei Wu:
OPPC: An Optimal Path Planning Charging Scheme Based on Schedulability Evaluation for WRSNs. ACM Trans. Embed. Comput. Syst. 17(1): 7:1-7:25 (2018) - 2017
- [c23]Wen Ouyang, Chang-Wu Yu, Pei-Ju Huang, Huai-Tse Chang:
Non-commutative path planning for tours with diversified attractions. FGCT 2017: 1-5 - 2016
- [j30]Chi Lin, Zhiyuan Wang, Ding Han, Youkun Wu, Chang-Wu Yu, Guowei Wu:
TADP: Enabling temporal and distantial priority scheduling for on-demand charging architecture in wireless rechargeable sensor Networks. J. Syst. Archit. 70: 26-38 (2016) - [j29]Chi Lin, Guowei Wu, Mohammad S. Obaidat, Chang-Wu Yu:
Clustering and splitting charging algorithms for large scaled wireless rechargeable sensor networks. J. Syst. Softw. 113: 381-394 (2016) - [j28]Chi Lin, Youkun Wu, Zhicheng Liu, Mohammad S. Obaidat, Chang-Wu Yu, Guowei Wu:
GTCharge: A game theoretical collaborative charging scheme for wireless rechargeable sensor networks. J. Syst. Softw. 121: 88-104 (2016) - [j27]Qihua Wang, Chang Wu Yu, Fagen Li, Huaqun Wang, Lijie Cao:
A group key-policy attribute-based encryption with partial outsourcing decryption in wireless sensor networks. Secur. Commun. Networks 9(17): 4138-4150 (2016) - [j26]Chi Lin, Tie Qiu, Mohammad S. Obaidat, Chang-Wu Yu, Lin Yao, Guowei Wu:
MREA: a minimum resource expenditure node capture attack in wireless sensor networks. Secur. Commun. Networks 9(18): 5502-5517 (2016) - 2015
- [j25]Chi Lin, Guowei Wu, Chang-Wu Yu:
Protecting location privacy and query privacy: a combined clustering approach. Concurr. Comput. Pract. Exp. 27(12): 3021-3043 (2015) - [j24]Chang-Wu Yu, Qin Xin, Naveen K. Chilamkurti, Shengming Jiang, S. Kami Makki, Guowei Wu:
Algorithm and Theory for Robust Wireless Sensor Networks 2014. Int. J. Distributed Sens. Networks 11: 489718:1 (2015) - [j23]Chi Lin, Guowei Wu, Chang-Wu Yu, Lin Yao:
Maximizing destructiveness of node capture attack in wireless sensor networks. J. Supercomput. 71(8): 3181-3212 (2015) - [c22]Chi Lin, Kun Liu, Bo Xu, Jing Deng, Chang-Wu Yu, Guowei Wu:
VCLT: An Accurate Trajectory Tracking Attack Based on Crowdsourcing in VANETs. ICA3PP (3) 2015: 297-310 - 2014
- [j22]Wen Ouyang, Chang-Wu Yu, Kun-Ming Yu, Ko-Jui Lin, Hsin-Wen Chang, Hung-Nien Hsieh, Lin-Li Tai, Chung-Han Lin:
Solving station decision problem in bicycle ad hoc networks. Int. J. Ad Hoc Ubiquitous Comput. 16(2): 93-102 (2014) - [j21]Chang-Wu Yu, Qin Xin, Naveen K. Chilamkurti, Shengming Jiang:
Algorithm and Theory for Robust Wireless Sensor Networks. Int. J. Distributed Sens. Networks 10 (2014) - [j20]Hyuk Lim, James Chang Wu Yu, Binod Vaidya:
Advances in multimedia services over emerging wireless networks. J. Netw. Comput. Appl. 37: 1 (2014) - [j19]Wen Ouyang, Chang-Wu Yu, Kun-Ming Yu, Ko-Jui Lin, Huai-Tse Chang:
Safe Path Planning Strategy for Bike Net. Wirel. Pers. Commun. 78(4): 1995-2007 (2014) - [c21]Chun-Yi Wu, Chang Wu Yu:
Computing the Probability of Specific Random Sector Graphs with Applications in Wireless Networks with Directional Antennas. IIH-MSP 2014: 678-681 - 2013
- [j18]Rei-Heng Cheng, Chang-Wu Yu, Tung-Kuang Wu, Fang-Wei Jin:
A Small-World Routing Protocol and the Effect of Pass-Over for Wireless Sensor Networks. Wirel. Pers. Commun. 68(4): 1493-1523 (2013) - 2012
- [j17]Wen Ouyang, Chang-Wu Yu, Meng-Ti Liu, Yu-Wei Chang:
Graph model for optimal OVSF code placement strategies. Int. J. Ad Hoc Ubiquitous Comput. 9(3): 133-141 (2012) - [c20]Wen Ouyang, Chang-Wu Yu, Kun-Ming Yu, Ko-Jui Lin, Jo-Heng Yu, Hsin-Wen Chang, Lin-Li Tai, Chung-Han Lin:
Station Decision Problem in Bicycle Ad Hoc Networks. UIC/ATC 2012: 876-881 - 2011
- [j16]Kun-Ming Yu, Chang-Wu Yu, Shi-Feng Yan:
An Ad Hoc Routing Protocol with Multiple Backup Routes. Wirel. Pers. Commun. 57(4): 533-551 (2011) - [c19]Chang-Wu Yu, Kun-Ming Yu, Wei-Ting So, Chin-Tsai Lin, Chen Yi Lin:
Target Coverage in Wireless Sensor Networks. MSN 2011: 408-412 - [c18]Wen Ouyang, Chang-Wu Yu, Chiming Huang, Tung Hsien Peng:
Optimum Partition for Distant Charging in Wireless Sensor Networks. MSN 2011: 413-417 - 2010
- [j15]Rei-Heng Cheng, Tung-Kuang Wu, Chang-Wu Yu:
A highly topology adaptable ad hoc routing protocol with complementary preemptive link breaking avoidance and path shortening mechanisms. Wirel. Networks 16(5): 1289-1311 (2010) - [c17]Kun-Ming Yu, Jian-Yuan Liu, Bo-Han Yeh, Chang-Wu Yu, Ching-Cheng Tien, Chi-Hu Wang, Ping-Yu Wang:
CALE: A Context-Aware Living Environment Based on Zigbee Sensor Network. MSN 2010: 243-246
2000 – 2009
- 2009
- [j14]Chang-Wu Yu, Tung-Kuang Wu, Rei-Heng Cheng, Kun-Ming Yu, Shun Chao Chang:
A Distributed and Cooperative Algorithm for the Detection and Elimination of Multiple Black Hole Nodes in Ad Hoc Networks. IEICE Trans. Commun. 92-B(2): 483-490 (2009) - [j13]Chang Wu Yu:
Computing Subgraph Probability of Random Geometric Graphs with Applications in Quantitative Analysis of Ad Hoc Networks. IEEE J. Sel. Areas Commun. 27(7): 1056-1065 (2009) - [j12]Chang-Wu Yu, Kun-Ming Yu, Shu Ling Lin:
Efficient Scheduling Algorithms for Bluetooth Scatternets. Wirel. Pers. Commun. 48(2): 291-309 (2009) - [c16]Chang Wu Yu, Shan Shiung Wei, Bing Jiun Shie:
Activating the Hot Spot Problem by Switching Multiple Sinks in Wireless Sensor Networks. MSN 2009: 204-211 - 2008
- [j11]Tung-Kuang Wu, Chang-Wu Yu, Rei-Heng Cheng, Chia Hu Wu:
A Highly Reusable Code Assignment Approach with Modified Busy Tone Signaling for CDMA-Based Ad Hoc Networks. Wirel. Pers. Commun. 44(2): 119-138 (2008) - [c15]Kun-Ming Yu, Chang-Wu Yu, Zheng-Yi Lin:
A Density-Based Algorithm for Redundant Reader Elimination in a RFID Network. FGCN (1) 2008: 89-92 - [c14]Chang-Wu Yu, Chun-Hsin Wang, Li Chun Hsu, Kai Jen Cheng:
Coverage algorithms in GPS-less wireless mobile sensor networks. Mobility Conference 2008: 79 - 2007
- [j10]Chang-Wu Yu, Tung-Kuang Wu, Rei-Heng Cheng:
A low overhead dynamic route repairing mechanism for mobile ad hoc networks. Comput. Commun. 30(5): 1152-1163 (2007) - [c13]Chang-Wu Yu:
On the Complexity of the Max-Edge-Coloring Problem with Its Variants. ESCAPE 2007: 350-361 - [c12]Chang-Wu Yu:
Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm. ESCAPE 2007: 362-374 - [c11]Chang-Wu Yu, Tung-Kuang Wu, Rei-Heng Cheng, Shun Chao Chang:
A Distributed and Cooperative Black Hole Node Detection and Elimination Mechanism for Ad Hoc Networks. PAKDD Workshops 2007: 538-549 - [c10]Chang-Wu Yu, Kun-Ming Yu, Shu Ling Lin:
Reducing Inter-piconet Delay for Large-Scale Bluetooth Scatternets. PAKDD Workshops 2007: 562-573 - 2006
- [j9]Li-Hsing Yen, Chang-Wu Yu, Yang-Min Cheng:
Expected k-coverage in wireless sensor networks. Ad Hoc Networks 4(5): 636-650 (2006) - [c9]Chang Wu Yu, Cheng Yao Tseng:
Formulas and Protocols for Broadcasting in Mobile Ad Hoc Networks. EUC 2006: 854-863 - [c8]Chun-Hsin Wang, Chang-Wu Yu, Chiu-Kuo Liang, Kun-Ming Yu, Wen Ouyang, Ching-Hsien Hsu, Yu-Guang Chen:
Tracers placement for IP traceback against DDoS attacks. IWCMC 2006: 355-360 - [c7]Chang-Wu Yu, Tung-Kuang Wu, Rei-Heng Cheng, Chia Hu Wu:
A Distributed Code Assignment Algorithm with High Code Reusability for CDMA-Based Ad Hoc Networks. WASA 2006: 329-340 - [c6]Rei-Heng Cheng, Tung-Kuang Wu, Chang-Wu Yu, Chun-Hung Kuo:
An Altitude Based Dynamic Routing Scheme for Ad Hoc Networks. WASA 2006: 609-619 - 2005
- [j8]Rei-Heng Cheng, Chang-Wu Yu, Tung-Kuang Wu:
A Novel Approach to the Fixed Channel Assignment Problem. J. Inf. Sci. Eng. 21(1): 39-58 (2005) - [c5]Chang Wu Yu, Ching-Hsien Hsu, Kun-Ming Yu, Chiu-Kuo Liang, Chun-I Chen:
Irregular Redistribution Scheduling by Partitioning Messages. Asia-Pacific Computer Systems Architecture Conference 2005: 295-309 - [c4]Chang Wu Yu, Li-Hsing Yen:
Computing Subgraph Probability of Random Geometric Graphs: Quantitative Analyses of Wireless Ad Hoc Networks. FORTE 2005: 458-472 - [c3]Chang-Wu Yu, Tung-Kuang Wu, Rei-Heng Cheng, Po Tsang Chen:
A Low Overhead Ad Hoc Routing Protocol with Route Recovery. MSN 2005: 666-675 - 2004
- [c2]Chang-Wu Yu, Rong Qiang Huang:
OVSF code management schemes on ad hoc networks. ICC 2004: 4152-4156 - [c1]Ching-Hsien Hsu, Kun-Ming Yu, Chi-Hsiu Chen, Chang-Wu Yu, Chiu-Kuo Liang:
Optimal Processor Mapping Scheme for Efficient Communication of Data Realignment. ISPA 2004: 268-273 - 2000
- [j7]Chang-Wu Yu:
On the complexity of the maximum biplanar subgraph problem. Inf. Sci. 129(1-4): 239-250 (2000)
1990 – 1999
- 1998
- [j6]Chang-Wu Yu, Gen-Huey Chen, Tze-Heng Ma:
On the Complexity of the k-Chain Subgraph Cover Problem. Theor. Comput. Sci. 205(1-2): 85-98 (1998) - 1996
- [j5]Chang-Wu Yu, Gen-Huey Chen:
An Efficient Parallel Recognition Algorithm For Bipartite-Permutation Graphs. IEEE Trans. Parallel Distributed Syst. 7(1): 3-10 (1996) - 1995
- [j4]Chang-Wu Yu, Gen-Huey Chen:
Efficient Parallel Algorithms for Doubly Convex-Bipartite Graphs. Theor. Comput. Sci. 147(1&2): 249-265 (1995) - 1994
- [j3]Chang-Wu Yu, Gen-Huey Chen:
A Theeorem on Permutation Graphs with Applications. Inf. Sci. 77(3-4): 179-193 (1994) - 1993
- [j2]Chang-Wu Yu, Gen-Huey Chen:
Parallel Algorithms for Permutation Graphs. BIT 33(3): 413-419 (1993) - 1992
- [j1]Chang-Wu Yu, Gen-Huey Chen:
The Weighted Maximum Independent Set Problem in Permutation Graphs. BIT 32(4): 609-618 (1992)
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-12-13 19:15 CET 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:
