default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiaojun Shen 0002
Person information
- affiliation: University of Missouri, School of Computing and Engineering, Kansas City, MO, USA
- affiliation (PhD 1989): University of Illinois at Urbana-Champaign, IL, USA
Other persons with the same name
- Xiaojun Shen — disambiguation page
- Xiaojun Shen 0001
![[0000-0002-5971-1259]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5971-1259")
— Tongji University, Department of Electrical Engineering, Shanghai, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j30]Xiujun Wang, Zhi Liu, Yan Gao, Xiao Zheng, Zhe Dang, Xiaojun Shen:
A Near-Optimal Protocol for the Grouping Problem in RFID Systems. IEEE Trans. Mob. Comput. 20(4): 1257-1272 (2021)- [j29]Yan Gu, Bo Liu, Xiaojun Shen:
Asymptotically Optimal Online Scheduling With Arbitrary Hard Deadlines in Multi-Hop Communication Networks. IEEE/ACM Trans. Netw. 29(4): 1452-1466 (2021) - 2020
- [j28]Meitian Huang, Weifa Liang, Xiaojun Shen, Yu Ma, Haibin Kan:
Reliability-Aware Virtualized Network Function Services Provisioning in Mobile Edge Computing. IEEE Trans. Mob. Comput. 19(11): 2699-2713 (2020)
2010 – 2019
- 2019
- [j27]Feng Shan, Junzhou Luo, Weiwei Wu, Xiaojun Shen:
Delay Minimization for Data Transmission in Wireless Power Transfer Systems. IEEE J. Sel. Areas Commun. 37(2): 298-312 (2019) - 2018
- [j26]Feng Shan, Junzhou Luo, Weiwei Wu, Fang Dong, Xiaojun Shen:
Throughput Maximization for the Wireless Powered Communication in Green Cities. IEEE Trans. Ind. Informatics 14(6): 2560-2569 (2018) - [c14]Xiangguo Sun, Bo Liu, Jiuxin Cao, Junzhou Luo, Xiaojun Shen:
Who Am I? Personality Detection Based on Deep Learning for Texts. ICC 2018: 1-6 - 2016
- [c13]Feng Shan, Junzhou Luo, Weiwei Wu, Xiaojun Shen:
Optimal wireless power transfer scheduling for delay minimization. INFOCOM 2016: 1-9 - 2015
- [j25]Feng Shan, Junzhou Luo, Weiwei Wu, Minming Li, Xiaojun Shen:
Discrete Rate Scheduling for Packets With Individual Deadlines in Energy Harvesting Systems. IEEE J. Sel. Areas Commun. 33(3): 438-451 (2015) - [j24]Baoxian Zhang, Xili Wan, Junzhou Luo, Xiaojun Shen:
A Nearly Optimal Packet Scheduling Algorithm for Input Queued Switches with Deadline Guarantees. IEEE Trans. Computers 64(6): 1548-1563 (2015) - [j23]Xili Wan, Jun Wu, Xiaojun Shen:
Maximal Lifetime Scheduling for Roadside Sensor Networks With Survivability k. IEEE Trans. Veh. Technol. 64(11): 5300-5313 (2015) - 2014
- [j22]Feng Shan, Junzhou Luo, Xiaojun Shen:
Optimal energy efficient packet scheduling with arbitrary individual deadline guarantee. Comput. Networks 75: 351-366 (2014) - [j21]Bo Liu, Junzhou Luo, Feng Shan, Wei Li, Jiahui Jin, Xiaojun Shen:
On Finding Maximum Disjoint Paths for Many-to-One Routing in Wireless Multi-Hop Network. IEICE Trans. Inf. Syst. 97-D(10): 2632-2640 (2014) - [j20]Ming Yang, Bo Liu, Wei Wang, Junzhou Luo, Xiaojun Shen:
Maximum Capacity Overlapping Channel Assignment Based on Max-Cut in 802.11 Wireless Mesh Networks. J. Univers. Comput. Sci. 20(13): 1855-1874 (2014) - 2013
- [j19]Feng Shan, Weifa Liang, Jun Luo, Xiaojun Shen:
Network lifetime maximization for time-sensitive data gathering in wireless sensor networks. Comput. Networks 57(5): 1063-1077 (2013) - [c12]Wei Wang, Bo Liu, Ming Yang, Junzhou Luo, Xiaojun Shen:
Max-Cut based overlapping channel assignment for 802.11 multi-radio wireless mesh networks. CSCWD 2013: 662-667 - [c11]Xili Wan, Feng Shan, Xiaojun Shen:
An Optimal Algorithm for Time-Slot Assignment in SS/TDMA Satellite Systems. ICCCN 2013: 1-6 - 2010
- [c10]Ghalib A. Shah, Weifa Liang, Xiaojun Shen:
Cross-Layer Design for QoS Support in Wireless Multimedia Sensor Networks. GLOBECOM 2010: 1-5
2000 – 2009
- 2009
- [j18]Jianyu Lou, Xiaojun Shen:
Frame-Based Packet-Mode Scheduling for Input-Queued Switches. IEEE Trans. Computers 58(7): 956-969 (2009) - 2008
- [j17]Xiaojun Shen, Jianyu Lou, Weifa Liang, Junzhou Luo:
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches. Theor. Comput. Sci. 409(3): 477-485 (2008) - 2007
- [j16]Yong Lee, Jianyu Lou, Junzhou Luo, Xiaojun Shen:
An efficient packet scheduling algorithm with deadline guarantees for input-queued switches. IEEE/ACM Trans. Netw. 15(1): 212-225 (2007) - 2006
- [j15]Weifa Liang, Xiaojun Shen:
A general approach for all-to-all routing in multihop WDM optical networks. IEEE/ACM Trans. Netw. 14(4): 914-923 (2006) - 2005
- [j14]Weifa Liang, Xiaojun Shen:
Finding multiple routing paths in wide-area WDM networks. Comput. Commun. 28(7): 811-818 (2005) - 2002
- [c9]Weifa Liang, Xiaojun Shen:
Finding Multiple Routing Paths in Wide-Area WDM Networks. ICPP Workshops 2002: 199-206 - 2001
- [j13]Yijie Han, Weifa Liang, Xiaojun Shen:
Very fast parallel algorithms for approximate edge coloring. Discret. Appl. Math. 108(3): 227-238 (2001) - 2000
- [j12]Weifa Liang, Xiaojun Shen:
Improved lightpath (wavelength) routing in large WDM networks. IEEE Trans. Commun. 48(9): 1571-1579 (2000)
1990 – 1999
- 1999
- [j11]Qing Hu, Yixin Zhang, Xiaojun Shen:
Rearrangeable Graphs. Inf. Process. Lett. 71(1): 23-27 (1999) - [c8]Weifa Liang, Xiaojun Shen:
Permutation Routing in All-Optical Product Networks. IPPS/SPDP Workshops 1999: 831-844 - 1998
- [c7]Weifa Liang, George Havas, Xiaojun Shen:
Improved Lightpath (Wavelength) Routing in Large WDM Networks. ICDCS 1998: 516-523 - 1997
- [j10]Weifa Liang, Xiaojun Shen:
Finding the k Most Vital Edges in the Minimum Spanning Tree Problem. Parallel Comput. 23(13): 1889-1907 (1997) - [j9]Qing Hu, Xiaojun Shen, Jing-Yu Yang:
Topologies of Combined (2logN - 1)-Stage Interconnection Networks. IEEE Trans. Computers 46(1): 118-124 (1997) - [j8]Xiaojun Shen, Weifa Liang, Qing Hu:
On Embedding Between 2D Meshes of the Same Size. IEEE Trans. Computers 46(8): 880-889 (1997) - [c6]Qing Hu, Yixin Zhang, Xiaojun Shen:
Rearrangeable Graphs. COCOON 1997: 441-450 - 1996
- [j7]Weifa Liang, Xiaojun Shen, Qing Hu:
Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems. J. Parallel Distributed Comput. 32(1): 66-73 (1996) - [j6]Qing Hu, Xiaojun Shen, Weifa Liang:
Optimally Routing LC Permutations on k-Extra-Stage Cube-Type Networks. IEEE Trans. Computers 45(1): 97-103 (1996) - 1995
- [j5]Xiaojun Shen, Qing Hu, Weifa Liang:
Embedding K-ary Complete Trees into Hypercubes. J. Parallel Distributed Comput. 24(1): 100-106 (1995) - [j4]Qing Hu, Jing-Yu Yang, Qian Zhang, Ke Liu, Xiaojun Shen:
An automatic seal imprint verification approach. Pattern Recognit. 28(8): 1251-1266 (1995) - 1994
- [j3]Xiaojun Shen, Qing Hu, Weifa Liang:
Realization of an Arbitrary Permutation on a Hypercube. Inf. Process. Lett. 51(5): 237-243 (1994) - [c5]Xiaojun Shen, Qing Hu, Weifa Liang:
Efficient Embedding K-ary Complete Trees into Hypercubes. IPPS 1994: 710-714 - [c4]Xiaojun Shen, Qing Hu, Hao Dai, Xiangzu Wang:
Optimal Routing of Permutations on Rings. ISAAC 1994: 360-368 - 1993
- [j2]Xiaojun Shen, Qing Hu, Bin Cong, Ivan Hal Sudborough, Mike Girou, Saïd Bettayeb:
The 4-Star Graph is not a Subgraph of Any Hypercube. Inf. Process. Lett. 45(4): 199-203 (1993) - [j1]Xiaojun Shen, Qing Hu:
A Note on Minimal Visibility Graphs. Inf. Process. Lett. 46(2): 101 (1993) - [c3]Xiaojun Shen, Weifa Liang:
A Parallel Algorithm for Multiple Edge Updates of Minimum Spanning Trees. IPPS 1993: 310-317 - [c2]Weifa Liang, Qing Hu, Xiaojun Shen:
Embedding Between 2-D Meshes of the Same Size. SPDP 1993: 712-719 - 1992
- [c1]Xiaojun Shen, Qing Hu:
Approximate submatrix matching problems. SAC 1992: 993-999
1980 – 1989
- 1989
- [b1]Xiaojun Shen:
Topics in combinatorics and algorithms. University of Illinois Urbana-Champaign, USA, 1989
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-10-07 22:24 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:
