School of Science and Engineering

Xiaojun Shen has taught nine different courses since he came to UMKC.  These courses include:

CS 101: Problem Solving and Programming
CS 191: Discrete Structures I
CS 291: Discrete Structures II
CS 421: Foundations of Data Networks
CS 481: Advanced Computer Architecture
CS 520: Network Architecture I
CS 581: Parallel Computer Architecture
CS 5592: Design and Analysis of Algorithms
CS 590D: Distributed Algorithms

He has also guided 6 PhD students and 17 master students.

1. NSF Proposal ( with Drs. Medhi, Agrawal, Place, Sohraby) ” CISE Research Instrumentation,” July 1994, $55,000, plus $47,000 matching fund from UMKC.

2. NSF proposal “Routing with Minimal Number of Stages,” Nov.25, 1997, $35,900 (CCR-9810692).

3. NSF supplemental funding to “routing with Minimal Number of Stages, ” $29,998 (CCR-9810692), 07/99

4. UMKC FRG, UMKC Research Board proposal, “New Protocol Test Generation Methods”, Mar.8, 1993, $4,000 (K-2-11134).

5. UMKC Research Board proposal, “Routing Permutations with Minimal Edge Capacity on Interconnection Networks”, Mar. 10, 1994, $3,150 (K-2-11191).

6. UMKC Research Board proposal, “Self-routing and Fault-tolerant Routing on Multistage Interconnection Networks”, Mar. 10, 1995, $4,982 (K-2-11265).

7. UMRB proposal, “topological Equivalent Relations of MINs,” March 1995, $17,500 (K-3-40627).

8. UMRB proposal (with J. Agrawal), “Design of Cost Effective Nonblocking MINs,” Oct. 1996, $12,960 (K-3-40758-3000).

9. UMKC FRG, ” Rearrangeability of (2n-1)-stage Shuffle-connected networks,” Mar.1999. $2,500 (K-2-11678).

10. UMRB proposal, “Scheduling Packets with Minimum Packet Loss Ratio,” 07/01/2004 – 05/31/2006, $26,800 (K3706020).

11. A total of $23,000 personal gifts received for his research and students support.

Book

1. Shen, X., “Essentials of Computer Algorithms” (in Chinese), China Machine Press, ISBN 978-7-111-42595-3, 2014.

Journal Publications
1. Shen, X. and Edelsbrunner, H., “A Tight Lower bound on The Size of Visibility Graphs,” Information Processing Letters, 26 (1987/88) p61-64.

2. Edelsbrunner, H., Hasan, N.,Seidel, R., and Shen, X., ” Circles Through Two Points That Always Enclose Many Points,” Geometriae Dedicata, 32 (1989) p1-12.

3. Shen, X., Cai, Y.Z., Liu, C.L., and Kruskal, C.P., “Generalized Latin Squares I”, Discrete Applied Mathematics, 25 (1989) p155-178.

4. Edelsbrunner, H., Robison, A.D., and Shen, X., “Covering Convex Sets with Non-overlapping Polygons,” Discrete Mathematics, 81 (1990) p153-164.

5. Reingold, E.M. and Shen, X., “More Nearly Optimal Algorithms for Unbounded Searching, Part I: the finite case”, SIAM Journal on Computing, vol. 20, No. 1 (1991) p156-183.

6. Reingold, E.M. and Shen, X., “More Nearly Optimal Algorithms for Unbounded Searching, Part II: the transfinite case”, SIAM Journal on Computing, vol. 20, No. 1, (1991) p184-208.

7. Shen, X, and E.M. Reingold, “Scheduling on a Hypercube”, Information Processing Letters, 40(1991) p323-328.

8. Shen, X., Hu. Q., Cong, B., Sudborough, H., Girou, M. and Bettayeb, S., “The 4- Star graph is not a Subgraph of any Hypercube”, Information Processing Letters, 45 (1993) p199-203.

9. Shen, X., and Hu, Q., “A Note on the Minimal Visibility Graphs,” Information Processing Letters, 46(1993) p101.

10. Shen, X., Hu, Q., Liang, W., “Realization of an Arbitrary Permutation on a Hypercube,” Information Processing Letters, 51 (1994) p237-243.

11. Shen, X., “Generalized Latin Squares II,” Discrete Mathematics, 143 (1995) p221-242.

12. Shen, X., Xu, M. and Wang, X., “An Optimal Algorithm for Permutation Admissibility to Multistage interconnection Networks,” IEEE Transactions on Computers, Vol. 44, No.4, April 1995, p604-608.

13. Shen, X., Hu, Q. and Liang, W., “Embedding k-ary Complete Trees into Hypercubes,” J. Parallel and Distributed Computing, 24 (1995), p100-106.

14. Shen, X.,” Optimal Realization of Any BPC Permutation on K-Extra-Stage Omega Networks,” IEEE Transactions on Computers, Vol. 44, No.5, May, 1995, p714-719.

15. Shen, X., “An Optimal O(NlgN) Algorithm for Permutation Admissibility to Extra-Stage Cube-Type Networks,” IEEE Transactions on Computers, Vol. 44, No. 9, Sept. 1995, p1144-1149.

16. Hu, Q., Yang, J., Zhang, Q., Liu, K., Shen, X., “An Automatic Seal Imprint Verification Approach,” Pattern Recognition, Vol. 28, No.4, 1995, p1251-1266.

17. Hu, Q., Shen, X., Liang, W., “Optimally Routing LC Permutations on k-extra- stage Cube-type Networks,” IEEE Transactions on Computers, Vol. 45, No. 1, Jan. 1996, p97-103.

18. Liang, W., Shen, X. and Hu, Q., “Parallel Algorithm for the Edge-coloring and Edge-coloring Update Problems,” Journal of Parallel and Distributed Computing, 32 (1996), p66-73.

19. Hu, Q., Shen, X. and Yang J., “Topologies of Combined (2n-1)-Stage Interconnection Networks,” IEEE Transactions on Computers, Vol. 46, No. 1, 1997, p118-124.

20. Shen, X., Liang, W. and Hu, Q., “On Embedding Between 2-D Meshes of the Same Size,” IEEE Transactions on Computers, Vol. 46, No. 8, 1997, p880-889.

21. Liang, W., and Shen, X., “Finding the k Most Vital Edges in the Minimum Spanning Tree Problem,” Parallel Computing, Vol. 23, No. 13, 1997, p1889-1907.

22. Shen, X., Agrawal, J., Hu, Q. and Xiong, Y., “Topological Equivalent Classes for Regular MINs of Arbitrary Stages”, International Journal of Parallel and Distributed Systems and Networks, Vol. 1, No. 3, 1998, p136-142.

23. Hu, Q., Zhang, Y. and Shen, X., “Rearrangeable Graphs”, Information Processing Letters, 71 (1999), p23-27.

24. Agrawal, J.P., Shen, X., Reddy, S.V. and Halker, R., “Efficient Multicasting in ATM Switches by Integrating Copying and Broadcasting,” International Journal of Parallel and Distributed Systems and Networks, Vol. 2, No. 4, 1999, p255-264.

25. Shen, X. and Zhang, Y., “Partitionability of k-Extra-Stage Omega Networks and an Optimal Task Migration Algorithm,” Journal of Parallel and distributed Computing, 60 (2000), p334-348.

26. Liang, W. and Shen, X., “Improved Lightpath (Wavelength) Routing in Large WDM Networks,” IEEE Transactions on communications, Vol. 48, No. 9, Sept. 2000, p1571-1579.

27. Han, Y.J., Liang, W. and Shen, X., “Very Fast Parallel algorithm for Approximate Edge Coloring”, Discrete Applied Mathematics, 108 (2001) p227-238.

28. Liang, W., Shen, X. and Hu, Q., “Finding the Most Vital Edge for Graph Minimization Problems on Meshes and hypercubes,” International journal of Parallel and Distributed Systems and Networks, Vol. 3, No. 4, 2000, p197-205.

29. Shen, X., Yang, F. and Pan, Y., “Equivalent Permutation Capabilities between Time Division Optical Omega Networks and Non-optical Extra-Stage Omega Networks,” IEEE/ACM Transactions on Networking, Vol. 9, No.4, Aug. 2001, p518-524.

30. Liang, W. and Shen, X., “Permutation Routing in All-Optical Product Networks,” IEEE Transactions on Circuits and Systems, Vol. 49, No. 4, April 2002, p533-542.

31. Han, Y.J. and Shen, X., “Parallel Integer Sorting Is More Efficient than Parallel Comparison Sorting on Exclusive Write PRAMS,” SIAM J. Computing, Vol. 31, No. 6, 2002, p1852-1878.

32. Liang, W. and Shen, X., “Finding Multiple Routing Paths in Wide-Area WDM Networks,” ELSEVIER Computer Communications, Vol. 28, 2005, p811-818.

33. Liang, W. and Shen, X., “A General Approach for All-to-All Routing in Multihop WDM Optical Networks,” IEEE/ACM Transactions on Networking, Vol. 14, No. 4, Aug. 2006, p914-923.

34. Lee, Y., Lou, J., Luo, J. and Shen, X., “An Efficient Packet Scheduling Algorithm with Deadline Guarantees for Input-Queued Switches,” IEEE/ACM Transactions on Networking, Vol. 15, No. 1, 2007, p212-225.

35. Dai, H. and Shen, X., “Rearrangeability of the 7-Stage 16×16 Shuffle Exchange Network,” Acta Electronica Sinica (in Chinese), Vol. 35, No. 10, 2007, p1875-1885.

36. Dai, H. and Shen, X., “Rearrangeability of the 7-Stage 16×16 Shuffle Exchange Network,” Frontiers of Electrical and Electronic Engineering in China, (in English, translated from 35.), Aug. 2008, 14:22:40, DOI: 10.1007/s11460-008-0071-x.

37. Shen, X., Lou, J., Liang, W. and Luo, J., “Deadline Guaranteed Packet Scheduling for Overloaded Traffic in Input-Queued Switches,” Theoretical Computer Science, Vol. 409 (2008), p477-485.

38. Lou, J. and Shen, X., “Frame-Based Packet-Mode Scheduling for Input-Queued Switches,” IEEE Transactions on Computers, Vol. 58, No. 7, July 2009, p956-969.

39. Liu, H., Zhang, B., Mouftah, H.T., Shen, X. and Ma, J., “Opportunistic Routing for Wireless Ad Hoc and Sensor Networks: Present and Future Directions,” IEEE Communications Magazine, Dec. 2009, p103-109.

40. Han, Y.J., Saxena, S. and Shen, X., “An Efficient Parallel Algorithm for Building the Separating Tree,” ELSEVIER J. Parallel and Distributed Computing, Vol. 70 (2010), p625-629.

41. Li, Lei, Zhang, B., Shen, X., Zheng, J., Yao, Z., “A Study on the Weak Barrier Coverage Problem in Wireless Sensor Networks,” ELSEVIER Computer Networks, Vol. 55 (2011), p711-721.

42. Shan, F., Liang, W., Luo, J. and Shen, X., “Network Lifetime Maximization for Time-Sensitive Data Gathering in Wireless Sensor Networks,” ELSEVIER Computer Networks, Vol. 57 (2013), p1063-1077.

43. Zhang, B., Wan, X., Luo, J. and Shen, X., “A Nearly Optimal Packet Scheduling Algorithm for Input-Queued Switches with Deadline Guarantees,” IEEE Transactions on Computers, Vol. 64, No. 6, June 2015, p1548-1563.

44. Shan, F. Luo, J. and Shen, X., “Optimal energy Effficient Packet Scheduling with Arbitrary Individual Deadline Guarantee,” ELSEVIER Computer Networks, Vol. 75 (2014), p351-366.

45. Shan, F., Luo, J., Wu, W., Li, M. and Shen, X., “Discrete Rate Scheduling for Packets with Individual Deadlines in Energy Harvesting Systems,” IEEE Journal on Selected Areas in Communications, Vol. 33, No. 3, March 2015, p438-451.

46. Wan, X., Wu, J., Shen, X., “Maximal Lifetime Scheduling for Roadside Sensor Networks with Survivabillity k,” IEEE Transactions on Veheclular Technology, Vol. 64, No. 11, November 2015, p5300-5313.

47. Yang, M., Liu, B., Wang, W., Luo, J., Shen, X., “Maximum Capacity Overlapping Channel Assignment Based on Max-Cut in 802.11 Wireless Mesh Networks,” J. Universal Computer Science, Vol. 20, No. 13 (2014), 1855-1874.

Conference Publications 
The stared papers occurred as journal papers in later dates.
1. Shen, X., Scoggins, S. and Tang, A., “An Improved RCP-method for Protocol Test Generation Using Backward UIO sequences,” Proc. ACM Symposium on Applied Computing (SAC 1991), Kansas City, 1991, p284-293.

2. Shen, X. and Li, G., “A New Protocol Conformance Test Generation Method and Experimental Results” , Proc. ACM Symposium on Applied Computing ( SAC 1992), Kansas City, 1992, p75-84.

3. Shen, X. and Hu, Q., “Approximate Submatrix Matching Problems”. Proc. ACM Symposium on Applied Computing ( SAC 1992), Kansas City, 1992, p993-999.

4. Shen, X. and Tang, A., “On the quality of Protocol Test Sequences by Multiple UIO Methods,” Proc. ISMM First International Conference on Computer Communications and Networks, (ICCCN 1992), San Diego, June 8-10, 1992, p20-24.

5. Liang, W. and Shen, X., “A Distributed Algorithm for Topological Sorting” , Proc. ISMM First International Conference on Computer Communications and Network (ICCCN 1992) San Diego, June 8-10, 1992, p261-264

6. Liang, W. and Shen, X., “The Linked List Prefix Computation on Mesh Array”, Proc. International Computer Science Conference (ICSC 1992), Hong Kong, Dec.13-16, 1992, p183-188.

7. Xu, M. and Shen, X., “A New Fault-Tolerant Generalized Cube with an Extra Stage”, Proc. International Computer Science Conference (ICSC 1992), Hong Kong, Dec. 13-16, 1992, p99-105.

8. Shen, X. and Li, G., “Protocol Conformance Test Generation Using Circular UIO with Overlapping”, Proc. International Computer Science Conference (ICSC 1992), Hong Kong, Dec. 13-16, 1992, 30-36.

9. Shen, X., and Liang, W., “A Parallel Algorithm for Multiple Edge Updates of Minimum Spanning Trees,” Proc. of 7th International Parallel Processing Symposium (IPPS 1993), April 13-16, 1993, Newport Beach, California, p310-317.

*10. Shen, X., Liang, W. and Hu, Q., “Embedding Between 2-D Meshes of the Same Size,” Proc.  5th IEEE Symposium on Parallel and Distributed Processing (SPDP 1993), Dec. 1-4, 1993, Dallas, Texas, p712-719.

*11. Shen, X., Hu, Q. and Liang, W., “Efficient Embedding K-ary Complete Trees into Hypercubes,” Proc. 8th International Parallel Processing Symposium (IPPS 1994) , April 26-29, 1994, Cancun, Mexico, p710-714.

12. Shen, X. Hu, Q., Dai, H. and Wang, X., “Optimal Routing of Permutations on Rings,” Lecture Notes in Computer Science, Vol. 834, Beijing, China, Aug. 1994, p360-368.

13. Liang, W., Shen, X. and Hu, Q., “Parallel Algorithms for Verification and Sensitivity Analysis of Minimum Spanning Trees,” Proc. 1994 International conference on Parallel and distributed Systems, Dec. 19-21, 1994, Taiwan, China, p310-315.

14. Liu, L.J., Shen, X., Yang, J.Y., Liu, K., Hu, Q. and Wu, Y.G., “Image Processing System To Auto-Analyze Particle Distributions for In- line Particle Holograms,” SPIE’s International Symposium, Los Angeles California, Jan. 22-29, 1994, Vol. 2122, #24.

15. Liang, W. and Shen, X., ” Fast Sequential and Parallel Algorithms for Finding the Longest Subsequence or the Maximum Weighted Subsequence,” Proc. Fourth International conference for Young Computer scientists, July 19-21, 1995, Beijing, China, p656-661.

16. Han, Y.J. and Shen, X., “Conservative Algorithms for Parallel and Sequential Integer Sorting,” Lecture Notes in Computer Science, Vol. 959, 1995, p324-333.

*17. Shen, X. and Zhang, Y., “Partition and Migration of k-extra-stage Omega Networks,” Proc. 1996 International conference on Parallel Processing (ICPP 1996), Bloomingdale, Illinois, Aug. 12-16, 1996, pI-97-I-100.

18. Shen, X. and Zhang, Y., “Two Task Migration on Omega Networks,” Proc. 9th IASTED International Conference on Parallel and Distribute Computing and Systems (PDCS 1997), Oct. 13-16, 1997, Washington D. C., USA, p489-492.

*19. Shen, X., Agrawal, J., Hu, J. and Xiong, Y., “Topological Equivalent Classes for Regular MINs of Arbitrary Stages,” Proc. 9th IASTED International Conference on Parallel and Distribute Computing and Systems (PDCS 1997), Oct. 13-16, 1997, Washington D. C., USA, p133-138.

*20. Hu, Q., Zhang, Y. and Shen, X., “Rearrangable Graphs,” Lecture Notes in Computer Science(COCOON 1997), Vol. 1276, 1997, p441-449.

*21. Liang, W., Havas, G and Shen, X., ” Improved lightpath (Wavelength) Routing in Large WDM Networks,” Proc. IEEE International Conference in Distributed Computing Systems, (ICDCS 1998) Amsterdam, May 26-29, 1998, p516-523.

22. Agrawal, J., Shen, X. and Irigi, S.R., “A Low cost Permutation Network Using Pipelined Architecture for Time-Space Tradeoff”, Proc. 10th IASTED International conference on Parallel and Distribute Computing and Systems (PDCS 1998), Las Vegas, Nevada, USA, Oct. 28-31, 1998, p408-413.

*23. Liang, W., Hu, Q. and Shen, X., “Finding the Most vital Edge on Meshes and Hypercubes,” Proc. 10th IASTED International conference on Parallel and Distribute Computing and Systems (PDCS 1998), Las Vegas, Nevada, USA, Oct. 28-31, 1998, p14-19.

*24. Han, Y.J., Liang, W. and Shen, X., ” Very Fast Parallel Algorithm for Approximate Edge Coloring,” Proc. 10th IASTED International conference on Parallel and Distribute Computing and Systems(PDCS 1998), Las Vegas, Nevada, USA, Oct. 28-31, 1998, p244-249.

25. Han Y.J. and Shen, X., “Parallel Integer Sorting Is More Efficient than Parallel Comparison sorting on Exclusive Write PRAMs,” Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA 1999), Baltimore, Maryland, Jan..17-19, 1999, p419-428.

*26. Shen, X., Yang, F. and Pan, Y., ” Equivalent Permutation Capabilities between Time Division Optical Omega Network and Non-optical Extra Stage Omega Network,” Proc. IEEE International Performance, Computing , and Communications Conference (IPCCC 1999), Scottsdale, Arizona, Feb. 10-12, 1999, p356-362.

27. Shen, X., Liu, Z., Harn, L. and Lou, Y., ” A Batch-Verifying Algorithm for Multiple Digital Signatures,” Proc. 11th IASTED International Conference on Parallel and Distribute Computing and Systems (PDCS 1999) MIT, Boston, USA, Nov. 3-6, 1999, p507-510

28. Liang W. and Shen, X., ” Permutation Routing in All-Optical Product Networks,” Proc. 11th IPPS/SPDP’99 Workshop, Lecture Notes in Computer Science, Vol. 1586, p831-844.

29. Wang, Q., Xu, M. and Shen, X., “An Efficient Scheme to Transfer VoATM Trunk Traffic,” Proc.  IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2000) Nov.6-9, 2000, Las Vegas, Nevada, USA, p69-74.

*30. Liang W. and Shen, X., “Finding Multiple Paths in Wide Area WDM Networks,” Proc. the 2002ICPP workshops on Optical Networks, August 18-21, 2002, Vancouver, B.C., Canada, p99-206.

31. Wang, H., Lou, J., Chen, Y., Sun, Y. and Shen, X., “Achieving Maximum Throughput with a Minimum Number of Label Switched Paths,” Proc. 14th IEEE ICCCN 2005 conference, Oct. 17-19, 2005, San Diego, CA, USA, p187-19.

32. Li, X., Shen, X., Jing, Y. and Zhang, S., “Simulated Annealing-Reinforcement Learning Algorithm for ABR Traffic Control of ATM Networks,” Proc. 46th IEEE Conference on Decision and Control, New Oleans, LA, USA, Dec. 12-14, 2007, p5716-5721.

33. Yan, Y., Zhang, B., Zhao Z., Shen, X. and Ma, J., “Mechanism for Maximizing Area-Centric Coding Gains in Wireless Multihop Networks,” Proc. IEEE International Conference on Communications (ICC2009), Dresden, Germany, June 14-18, 2009.

34. Shah, G.A., Liang, W. and Shen, X., “Cross-Layer Design for QoS Support in Wireless Multimedia Sensor Networks,” Proc. IEEE Globecom 2010, Dec. 6-10, 2010, Miami, FL, USA.

35. Wan, X., Shan, F. and Shen, X., “An Optimal Algorithm for Time-Slot Assignment in SS/TDMA Satellite systems,” Proc. IEEE ICCCN 2013, July 30–Aug. 2, 2013, p1-6.

36. Wang, W., Liu, B., Yang, M., Luo, J. and Shen, X, “Max-Cut Based Overlapping Channel Assignment for 802.11 Multi-Radio Wireless Mesh Networks,” Proc. IEEE 17th International Conference on Computer Supported Cooperative Work in Design, (ICCSCWD 2013) June 27-19, 2013, Whistler, BC, p662-667.

Xiaojun Shen’s research areas include:
1. Computer algorithms
2. Parallel processing with focus on interconnection networks
3. Telecommunications and computer networking with focus on optical switching, optical routing, wavelength assignment problems, and packet scheduling.