Xiaojun Shen

Orcid: 0000-0001-6950-3974

Affiliations:
  • University of Missouri, School of Computing and Engineering, Kansas City, MO, USA
  • University of Illinois at Urbana-Champaign, IL, USA (PhD 1989)


According to our database1, Xiaojun Shen authored at least 43 papers between 1989 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Asymptotically Optimal Online Scheduling With Arbitrary Hard Deadlines in Multi-Hop Communication Networks.
IEEE/ACM Trans. Netw., 2021

A Near-Optimal Protocol for the Grouping Problem in RFID Systems.
IEEE Trans. Mob. Comput., 2021

2020
Reliability-Aware Virtualized Network Function Services Provisioning in Mobile Edge Computing.
IEEE Trans. Mob. Comput., 2020

2019
Delay Minimization for Data Transmission in Wireless Power Transfer Systems.
IEEE J. Sel. Areas Commun., 2019

2018
Throughput Maximization for the Wireless Powered Communication in Green Cities.
IEEE Trans. Ind. Informatics, 2018

Who Am I? Personality Detection Based on Deep Learning for Texts.
Proceedings of the 2018 IEEE International Conference on Communications, 2018

2016
Optimal wireless power transfer scheduling for delay minimization.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015
Maximal Lifetime Scheduling for Roadside Sensor Networks With Survivability k.
IEEE Trans. Veh. Technol., 2015

A Nearly Optimal Packet Scheduling Algorithm for Input Queued Switches with Deadline Guarantees.
IEEE Trans. Computers, 2015

Discrete Rate Scheduling for Packets With Individual Deadlines in Energy Harvesting Systems.
IEEE J. Sel. Areas Commun., 2015

2014
Maximum Capacity Overlapping Channel Assignment Based on Max-Cut in 802.11 Wireless Mesh Networks.
J. Univers. Comput. Sci., 2014

On Finding Maximum Disjoint Paths for Many-to-One Routing in Wireless Multi-Hop Network.
IEICE Trans. Inf. Syst., 2014

Optimal energy efficient packet scheduling with arbitrary individual deadline guarantee.
Comput. Networks, 2014

2013
Network lifetime maximization for time-sensitive data gathering in wireless sensor networks.
Comput. Networks, 2013

An Optimal Algorithm for Time-Slot Assignment in SS/TDMA Satellite Systems.
Proceedings of the 22nd International Conference on Computer Communication and Networks, 2013

Max-Cut based overlapping channel assignment for 802.11 multi-radio wireless mesh networks.
Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD), 2013

2010
Cross-Layer Design for QoS Support in Wireless Multimedia Sensor Networks.
Proceedings of the Global Communications Conference, 2010

2009
Frame-Based Packet-Mode Scheduling for Input-Queued Switches.
IEEE Trans. Computers, 2009

2008
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches.
Theor. Comput. Sci., 2008

2007
An efficient packet scheduling algorithm with deadline guarantees for input-queued switches.
IEEE/ACM Trans. Netw., 2007

2006
A general approach for all-to-all routing in multihop WDM optical networks.
IEEE/ACM Trans. Netw., 2006

2005
Finding multiple routing paths in wide-area WDM networks.
Comput. Commun., 2005

2001
Very fast parallel algorithms for approximate edge coloring.
Discret. Appl. Math., 2001

2000
Improved lightpath (wavelength) routing in large WDM networks.
IEEE Trans. Commun., 2000

1999
Rearrangeable Graphs.
Inf. Process. Lett., 1999

Permutation Routing in All-Optical Product Networks.
Proceedings of the Parallel and Distributed Processing, 1999

1998
Improved Lightpath (Wavelength) Routing in Large WDM Networks.
Proceedings of the 18th International Conference on Distributed Computing Systems, 1998

1997
On Embedding Between 2D Meshes of the Same Size.
IEEE Trans. Computers, 1997

Topologies of Combined (2logN - 1)-Stage Interconnection Networks.
IEEE Trans. Computers, 1997

Finding the k Most Vital Edges in the Minimum Spanning Tree Problem.
Parallel Comput., 1997

1996
Optimally Routing LC Permutations on k-Extra-Stage Cube-Type Networks.
IEEE Trans. Computers, 1996

Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems.
J. Parallel Distributed Comput., 1996

1995
An automatic seal imprint verification approach.
Pattern Recognit., 1995

Embedding K-ary Complete Trees into Hypercubes.
J. Parallel Distributed Comput., 1995

1994
Realization of an Arbitrary Permutation on a Hypercube.
Inf. Process. Lett., 1994

Optimal Routing of Permutations on Rings.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Efficient Embedding K-ary Complete Trees into Hypercubes.
Proceedings of the 8th International Symposium on Parallel Processing, 1994

1993
The 4-Star Graph is not a Subgraph of Any Hypercube.
Inf. Process. Lett., 1993

A Note on Minimal Visibility Graphs.
Inf. Process. Lett., 1993

Embedding Between 2-D Meshes of the Same Size.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

A Parallel Algorithm for Multiple Edge Updates of Minimum Spanning Trees.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

1992
Approximate submatrix matching problems.
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992

1989
Topics in combinatorics and algorithms
PhD thesis, 1989


  Loading...