Curriculum Vitae

Eddie Cheng

Department of Mathematics and Statistics

Oakland University

Rochester MI 48309

Tel: 248-370-4024 Fax: 248-370-4184

Email: echeng@oakland.edu

Webpage: http://www.oakland.edu/~echeng

Major Professional and Administrative Experience 

Distinguished Professor Oakland University 2011–Present

Professor Oakland University 2007–2011

Associate Professor Oakland University 2001–2007

Assistant Professor Oakland University 1997–2001

Part-time Lecturer Rice University 1995–1997

Postdoctoral Research Fellow NSERC 1995–1997

Research and Teaching Assistant  University of Waterloo (Canada) 1988–1995

Research Assistant National Defence, Canada May–Sept 1988

Acting Chair Department of Mathematics & Statistics, Oakland University January 2016–April 2016

Chair Department of Mathematics & Statistics, Oakland University May 2010–April 2013

Areas of Interest 

• Combinatorial Optimization 

• Integer and Linear Programming 

• Network Analysis 

• Member of the editorial board and associate editor of Networks, published by Wiley (2002–Present). 

• Associate editor of International Journal of Machine Learning and Cybernetics, published by Springer (2011–Present). 

• Editor-in-Chief of Journal of Interconnection Networks, published by World Scientific (2021–Present, and served as a managing editor 2017–2019 and an editor 2011–2017). 

• Editor-in-Chief of International Journal of Computer Mathematics: Computer Systems Theory (formerly IJCM, Section A), published by Taylor & Francis (2019–Present and served as associate editor 2013–2019). 

• Editor of Journal of Algebra, Combinatorics, Discrete Structures and Applications, published by Jacodesmath Institute (2014–Present). 

• Editor of Discrete Applied Mathematics, published by Elsevier (2015–Present). 

• Editor of International Journal of Parallel, Emergent and Distributed Systems, published by Taylor & Francis (2015–Present). 

• Editor of Parallel Processing Letters, published by World Scientific (2018–Present). 

• Member of the editorial board of ISRN Discrete Mathematics, published by Hindawi (2011–2013). 

• Minimally involved: Member of the editorial board of International Journal of Computer, Mathematical Sciences and Applications (2006–Present); member of the editorial board of The Open Operational Research Journal (2007–2014). 

Guest Editorship (Special Issue)

• Guest editor of Journal of Coupled Systems and Multiscale Dynamics (A Special Issue in Honor of Professor Meir Shillor), published by American Scientific Publishers, Volume 3, Number 3, September 2015 (with Libin Rong and Anna Spagnuolo).

• Guest editor of Journal of Interconnection Networks (Special Issue on Matching Preclusion), published by World Scientific, Volume 19, Issue 3, 2019 (with Yaping Mao).

• Guest editor of International Journal of Parallel, Emergent and Distributed Systems (Diagnosability of Interconnection Networks), published by Taylor & Francis, Volume 35, Issue 1, 2020 (with Ke Qiu and Zhizhang Shen).

• Director of Oakland University Summer Mathematics Institute (2002–Present).

• Director of the Michigan Mathematics Prize Competition (2005–2008).

• Honors College Colloquium Award, 2003 (with undergraduate student Dan Steffy). 

• 2007 Mathematical Association of America (Michigan Section) Distinguished Teaching Award. 

• 2009 Presidents Council State Universities of Michigan Distinguished Professor of the Year Award. 

• Michigan Mathematics Prize Competition Service Award (2011). 

• Frederick Emmons Terman Engineering Scholastic Award (Stanford Engineering) (2016). 

• 2018 University of Waterloo Faculty of Mathematics Alumni Achievement Medal. 

Grants and External Support 

• Natural Sciences and Engineering Research Council of Canada Postdoctoral Research Fellowship, 1995–1997, $58,000 (Canadian). 

• Oakland University Research Fellowship, 1998, $7,500. 

• Research Contract with Caterpillar, 1998, $1,700. 

• Research Contract with General Motors, 2005–2006, $73,700 (with Serge G. Kruk).

• Oakland University Summer Mathematics Institute (2002–Present), approximately $2,000,000. 

• Yaping Mao, Qinghai Normal University (Aug 2017) 

• Jing Li, Taiyuan University of Science and Technology (Sept 2017–Aug 2018) 

• Mohamad Abdallah, American University of Kuwait (Aug 2018, Aug 2019) 

Membership in Professional Organizations and Research Centers 

• Fellow of the Institute of Combinatorics and its Applications 

• Center for Mathematics and Interdisciplinary Sciences of Qinghai Province, Xining, Qinghai 810008, China (advisory, not compensated) 

Courses Taught 

• 1. At Oakland University 

     1. APM 257: Introduction to Differential Equations (Fall 1997, Winter 1998).

     2. APM 263/2663: Discrete Mathematics (Winter 1999, Summer 2000—reading course, Winter 2002, Winter 2009, Fall 2012, Fall 2013, Fall 2014, Fall 2015, Summer 2016, Fall 2016, Summer 2017, Fall 2017, Summer 2018, Fall 2018, Summer 2019, Summer 2020, Fall 2020, Winter 2021, Summer 2021, Fall 2021, Summer 2022, Fall 2022, Fall 2023).

     3. APM 367 / CSE 361 / CSE 507: Design and Analysis of Algorithms (Winter 2008). 

     4. APM 405: Linear Programming (1999 OUSMI) .

     5. APM 405: Combinatorics: Enumeration (2000 OUSMI, 2004 OUSMI, 2008 OUSMI, 2012 OUSMI, 2016 OUSMI).

     6. APM 405: Introduction to Graph Theory (2001 OUSMI, 2005 OUSMI, 2009 OUSMI, 2013 OUSMI, 2017 OUSMI). 

     7. APM 463 / APM 563 / MTS 663: Applied Mathematics: Discrete Methods I (Fall 1997, Fall 1998, Fall 1999, Fall 2001, Fall 2002, Fall 2009).

     8. APM 4664 / APM 5664: Applied Mathematics: Discrete Methods II (Fall 2017—reading course).

     9. APM 568: Mathematical Modeling in Industry: Discrete Models (Winter 2000—reading course, Fall 2003, Winter 2012—reading course). 

     10. APM 569 Graph Theory and Applications (Fall 1998—reading course and co-conducted, Winter 2016). 

     11. APM 664/6664: Combinatorial Optimization (Winter 1999, Fall 2002, Fall 2007, Winter 2011, Winter 2013, Winter 2018). 

     12. APM 673: Coding Theory (Fall 1999—reading course and co-conducted). 

     13. CSE 504: Discrete Structures and Foundation of Computer Science (Fall 2000). 

     14. CSE 511 / APM 567: Design and Analysis of Algorithms (Winter 2000, Winter 2001, Summer 2004—reading course). 

     15. MOR 342: Introduction to Operations Research (2003 OUSMI). 

     16. MOR 454/4554 /554/5554: Linear and Integer Optimization (Winter 2007, 2007 OUSMI, 2011 OUSMI, 2015 OUSMI, Winter 2009, Fall 2010, 2019 OUSMI). 

     17. MOR 558: Mathematical Modeling: Operations Research Models (Winter 2005).

     18. MTH 1441: Precalculus (Summer 2020).

     19. MTE 210/2110: Numerical Structures (Fall 2002, Fall 2004, Summer 2023). 

     20. MTE 211/2111: Structures of Geometry (Winter 2003, Fall 2008, Fall 2013, Fall 2014, Winter 2015, Winter 2019, Winter 2020, Winter 2021). 

     21. MTE 3118: Advanced Topics in Mathematics for Elementary School Education (Fall 2022).

     22. MTH 155: Calculus II (Winter 1998, Fall 1998, Fall 1999, Winter 2000, Fall 2000, Winter 2001, Fall 2001, Winter 2002, Winter 2003, Fall 2003, Winter 2005, Summer 2011, Fall 2011, Summer 2012, Summer 2013, Summer 2014, Summer 2015). 

     23. MTH 256: Introduction to Linear Algebra (Winter 2003). 

     24. MTH 275/2775: Linear Algebra (Fall 2006, Winter 2014, Winter 2015, Summer 2021, Summer 2022). 

     25. MTH 302/3002: Introduction to Advanced Mathematical Thinking (Fall 2004, Fall 2005, Fall 2008, Fall 2009, Winter 2019, Winter 2020, Winter 2022). 

     26. MTH 372 MTS 672: Number Theory with Cryptography (2002 OUSMI, Winter 2006, 2006 OUSMI). 

     27. MTH 472/4772 / MTS 572/5072: Number Theory with Cryptography (Winter 2014, 2014 OUSMI, Winter 2018, 2018 OUSMI). 

  2. At Rice University 

• • 1. CAAM 310: Linear Algebra (Spring 1996) at the Department of Computational and Applied Mathematics, Rice University. 

    2. CAAM 378: Operations Research (Spring 1997) at the Department of Computational and Applied Mathematics, Rice University. 

    3. CAAM 512: Graph Theory (Fall 1995) at the Department of Computational and Applied Mathematics, Rice University. 

1. A faster algorithm for computing the strength of a network, Information Processing Letters 49 (1994), 209–212, (with William H. Cunningham). 

2. Separation problems for the stable set polytope, The 4th Integer Programming and Combinatorial Optimization Conference Proceedings, edited by Egon Balas and Jens Clausen, Lecture Notes in Computer Science 920 (1995), Springer-Verlag, 65–79 (with William H. Cunningham) (unrefereed, committee selected).

3. Wheel inequalities for stable set polytopes, Mathematical Programming 77(3) (1997), 389–421 (with William H. Cunningham). 

4. Separating subdivision of bicycle wheel inequalities over cut polytopes, Operations Research Letters 23 (1998), 13–19.

5. Edge augmentation for hypergraphs, Mathematical Programming Series B 84(3) (1999) 443–465. 

6. Successive edge augmentation problems, Mathematical Programming Series B 84(3) (1999), 577–593 (with Tibor Jordan). 

7. Disjoint paths in split-stars, Congressus Numerantium 137 (1999), 47–63 (with Marc J. Lipman). 

8. Fault tolerant routing in split-stars and alternating group graphs, Congressus Numerantium 139 (1999), 21–32 (with Marc J. Lipman).

9. Orienting split-stars and alternating group graphs, Networks 35(2) (2000), 139–144 (with Marc J. Lipman).

10. On the Day-Tripathi orientation of the star graphs: connectivity, Information Processing Letters 73 (2000), 5–10 (with Marc J. Lipman).

11. Orienting the arrangement graphs, Congressus Numerantium 142 (2000), 97–112 (with Marc J. Lipman). 

12. Increasing the connectivity of split-stars, Congressus Numerantium 146 (2000), 97–111 (with Marc J. Lipman).

13. Super connectivity of star graphs, alternating group graphs and split-stars, Ars Combinatoria 59 (2001), 107–116 (with Marc J. Lipman and Alan Park). 

14. Connectivity properties of unidirectional star graphs, Congressus Numerantium 150 (2001), 33–42 (with Marc J. Lipman).

15. Antiweb inequalities: strength and intractability, Congressus Numerantium 152 (2001), 5–19 (with Sven de Vries).

16. Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness, Discrete Applied Mathematics 118(3) (2002), 163–179 (with Marc J. Lipman). 

17. The second version supercedes the first invited, unrefereed, abridged conference proceedings version.

    1. 1. Separation of antiweb-wheel inequalities over stable set polytopes, Electronic Notes in Discrete Mathematics 11 (2002), 15 pages (with Sven de Vries). 

       2. Antiweb-wheel inequalities and their separation problems over the stable set polytopes, Mathematical Programming 92(1) (2002), 153–175 (with Sven de Vries). 

18. Basic structures of some interconnection networks, Electronic Notes in Discrete Mathematics 11 (2002), Proceedings of the Ninth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications, 17 pages (with Marc J. Lipman) (unrefereed, invited). 

19. Unidirectional (n,k)-star graphs, Journal of Interconnection Networks 3(1–2) (2002), 19–34 (with Marc J. Lipman). 

20. Increasing the connectivity of the star graphs, Networks 40(3) (2002), 165–169 (with Marc J. Lipman).

21. On the facet-inducing antiweb-wheel inequalities for stable set polytopes, SIAM Journal on Discrete Mathematics 15(4) (2002), 470–487 (with Sven de Vries). 

22. On fault-tolerant routing in (n,k)-star graphs, Congressus Numerantium 155 (2002), 25–31 (with Marc J. Lipman).

23. An optimization formulation for the existence of complete Sphere-of-Influence graphs, Congressus Numerantium 158 (2002), 109–117 (with Serge G. Kruk and Marc J. Lipman).

24. The second version supercedes the first unrefereed, abridged conference proceedings version.

• 1. 1. Influence digraphs induced by time-stamped graphs (extended abstract), Electronic Notes in Discrete Mathematics 11 (2002), 12 pages (with Jerrold W. Grossman and Marc J. Lipman). 

     2. Time-stamped graphs and their associated influence digraphs, Discrete Applied Mathematics 128(2–3) (2003), 317–335 (with Jerrold W. Grossman and Marc J. Lipman).

25. The second version supercedes the first version.

• • 1. Flow formulations for the student scheduling problem, Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling, edited by Burke and De Causmaecker (2002), 298–308 (with Serge G. Kruk and Marc J. Lipman) (refereed). 

    2. Flow formulations for the student scheduling problem, Practice and Theory of Automated Timetabling IV, edited by Burke and De Causmaecker, Lecture Notes in Computer Science 2740 (2003), Springer-Verlag, 299–309 (with Serge G. Kruk and Marc J. Lipman) (refereed). 

26. On the multicommodity flow formulation of the student scheduling problem, Congressus Numerantium 160 (2003), 177–181 (with Serge G. Kruk and Marc J. Lipman). 

27. A note on the diameter of unidirectional split-stars, Congressus Numerantium 163 (2003), 49–56 (with Yuyin Chen, Serge G. Kruk and Marc J. Lipman). 

28. Separating multi-oddity constrained shortest circuits over the polytope of stable multisets, Operations Research Letters 32 (2004), 181–184 (with Sven de Vries). 

29. A strictly combinatorial approach to a university exam scheduling problem, Congressus Numerantium 167 (2004), 121–132 (with Raymond P. Kleinberg, Serge G. Kruk, William A. Lindsey, and Daniel E. Steffy). 

30. Extended fault-diameter of star graph, Congressus Numerantium 170 (2004), 75–83 (with Raymond P. Kleinberg, William A. Lindsey, Marc J. Lipman and Daniel E. Steffy). 

31. Maximal vertex-connectivity of $\overrightarrow{S_{n,k}}$, Networks 46(3) (2005), 154–162 (with William A. Lindsey and Daniel E. Steffy). 

32. A disjoint path problem in the alternating group graphs, Congressus Numerantium 175 (2005), 117–159 (with Lazaros Kikas and Serge G. Kruk). 

33. Structural properties of hyper-stars, Ars Combinatoria 80 (2006), 65–73 (with Laszlo Liptak). 

34. A strong structural theorem for hyper-stars, Congressus Numerantium 179 (2006), 181–191 (with Meelap Shah). 

35. Structural properties of Cayley graphs generated by transposition trees, Congressus Numerantium 180 (2006), 81–96 (with Laszlo Liptak). 

36. Matching preclusion for some interconnection networks, Networks 50 (2007), 173–180 (with Laszlo Liptak). An addendum of this paper is available. 

37. Linearly many faults in Cayley graphs generated by transposition trees, Information Sciences, 177 (2007), 4877–4882 (with Laszlo Liptak). 

38. A case study of an integer programming model for instructor assignments and scheduling problem, Proceedings of the 3rd Multidisciplinary International Scheduling Conference: Theory and Applications, edited by P. Baptiste G. Kendall, A. Munier-Kordon and F. Sound (2007), 267–275 (with Serge G. Kruk) (refereed). 

39. Fault resiliency of Cayley graphs generated by transpositions, International Journal of Foundations of Computer Science 18 (2007), 1005–1022 (with Laszlo Liptak). 

40. A new decomposition scheme for generalized star graphs $S_{n,k}$ and $A_{n,k}$, Congressus Numerantium, 186 (2007), 145–159 (with Nart Shawash). 

41. Orienting Cayley graphs generated by transposition trees, Computers and Mathematics with Applications 55 (2008), 2662–2672 (with Laszlo Liptak and Nart Shawash). 

42. Hamiltonian connectivity of 2-tree-generated networks, Mathematical and Computer Modelling 48 (2008), 787–804 (with Laszlo Liptak, Marc J. Lipman and David Stiebel). 

43. Clinching and elimination of playoff berth in the NHL, International Journal of Operations Research 5 (2008), 187–192 (with Daniel E. Steffy). 

44. The second version supercedes the first abridged conference proceedings version.

• 1. 1. Conditional diagnosability of Cayley graphs generated by transposition trees under the comparison diagnosis model, National Computer Symposium (2007), 627–637 (with Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu and Laszlo Liptak). 

     2. Conditional diagnosability of Cayley graphs generated by transposition trees under the comparison diagnosis model, Journal of Interconnection Networks 9 (2008), 83–97 (with Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu and Laszlo Liptak). 

45. Strong structural properties of unidirectional star graphs, Discrete Applied Mathematics 156 (2008), 2939–2949 (with Laszlo Liptak and Marc J. Lipman). 

46. A tree labelling problem, Congressus Numerantium 190 (2008), 13–19 (with Lih-Hsing Hsu, Cheng-Kuan Lin, Laszlo Liptak and Jimmy J.M. Tan). 

47. The (n,k)-bubble sort graphs, Congressus Numerantium 193 (2008), 97–117 (with Nart Shawash). 

48. Matching preclusion for alternating group graphs and their generalizations, International Journal of Foundations of Computer Science 19 (2008), 1413–1437 (with Linda Lesniak, Marc J. Lipman and Laszlo Liptak). 

49. The second version supercedes the first version.

• 1. 1. On the surface area of the (n,k)-star graph, Conference Proceedings to the 2nd Annual International Conference on Combinatorial Optimization and Applications, edited by B. Yang, D.-Z. Du and C.A. Wang, Lecture Notes in Computer Science 5165 (2008), Springer-Verlag, 393–404 (with Zhizhang Shen and Ke Qiu) (refereed). 

     2. On the surface area of the (n,k)-star graph, Theoretical Computer Science 410(52) (2009), 5481–5490 (with Zhizhang Shen and Ke Qiu). 

50. A short note on the surface area of star graphs, Parallel Processing Letters 19 (2009), 19–22 (with Zhizhang Shen and Ke Qiu). 

51. Embedding hypercubes, rings and odd graphs into hyper-stars, International Journal of Computer Mathematics 86 (2009), 771–778 (with Laszlo Liptak, Jong-Seok Kim and Hyeong-Ok Lee). 

52. Conditional matching preclusion sets, Information Sciences 179 (2009), 1092–1101 (with Linda Lesniak, Marc J. Lipman and Laszlo Liptak). 

53. On disjoint shortest paths routing on the hypercube, Conference Proceedings to the 3rd Annual International Conference on Combinatorial Optimization and Applications, edited by D.-Z. Du, X. Hu and P.M. Pardalos, Lecture Notes in Computer Science 5573 (2009), Springer-Verlag, 375–383 (with Shuhong Gao, Ke Qiu and Zhizhang Shen) (refereed). 

54. A generating function approach to the surface area of some interconnection networks, Journal of Interconnection Networks 10(3) (2009), 189–204 (with Ke Qiu and Zhizhang Shen). 

55. On the surface area of the alternating group networks, Proceedings to The 21st IASTED Parallel and Distributed Computing and Systems, 2009, 85–90 (with Ke Qiu and Zhizhang Shen) (refereed). 

56. On the unidirectional hyper-stars, Congressus Numerantium 196 (2009), 41–51 (with Sarah Anderson, Kelly Christensen, Jennifer Diemunsch and Laszlo Liptak). 

57. A kind of conditional vertex connectivity of Cayley graphs generated by transposition trees, Congressus Numerantium 199 (2009), 167–173 (with Laszlo Liptak). 

58. The second version supercedes the first version.

• 1. 1. The number of shortest paths in the (n,k)-star graphs Conference Proceedings to the 4th Annual International Conference on Combinatorial Optimization and Applications, edited by W. Wu and O. Daescu, Lecture Notes in Computer Science 6508 (2010), Springer-Verlag, 222–236 (with Ke Qiu and Zhizhang Shen) (refereed). 

     2. The number of shortest paths in the (n,k)-star graphs, Discrete Mathematics, Algorithms and Applications 6 (2014) 1450051 (17 pages) (with Ke Qiu and Zhizhang Shen). 

59. Distance formula and shortest paths of the (n,k)-star graphs, Information Sciences 180 (2010) 1671–1680 (with Jerrold W. Grossman, Laszlo Liptak, Ke Qiu and Zhizhang Shen).

60. Linearly many faults in 2-tree-generated networks, Networks 55 (2010) 90–98 (with Laszlo Liptak and Fred Sala). 

61. Matching preclusion for the (n,k)-bubble-sort graphs, International Journal of Computer Mathematics 87 (2010) 2408–2418 (with Laszlo Liptak and David Sherman). An addendum of this paper is available. 

62. On the existence of disjoint spanning paths in faulty hypercubes, Journal of Interconnection Networks 11 (2010) 71–96 (with Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu and Laszlo Liptak). 

63. Matching preclusion and conditional matching preclusion for augmented cubes, Journal of Interconnection Networks 11 (2010) 35–60 (with Randy Jia and David Lu). 

64. A note on the surface area of the Cartesian product graphs, Congressus Numerantium 203 (2010) 131–137 (with Ke Qiu and Zhizhang Shen). 

65. Matching preclusion and conditional matching preclusion for wrapped-around butterfly graphs, Congressus Numerantium 204 (2010) 45–64 (with Laszlo Liptak, Brian Scholten and James Voss). 

66. Matching preclusion and conditional matching preclusion problems for twisted cubes, Congressus Numerantium 205 (2010) 175–185 (with Ram Bhaskar, Mason Liang, Saurabh Pandey and Kevin Wang). 

67. 4-ordered Hamiltonicity for some chordal ring graphs, Journal of Interconnection Networks 11 (2010) 157–174. (with David Sherman, Ming Tsai, Cheng-Kuan Lin, Laszlo Liptak, Jimmy J.M. Tan and Lih-Hsing Hsu). 

68. On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs, International Journal of Computer Mathematics 87 (2010) 2903–2914 (with Ke Qiu and Zhizhang Shen). 

69. A note on embeddings among folded hypercubes, even graphs and odd graphs, International Journal of Computer Mathematics 88 (2011) 882–891 (with Jong-Seok Kim, Hyeong-Ok Lee and Laszlo Liptak). 

70. Conditional matching preclusion for the alternating group graphs and split-stars, International Journal of Computer Mathematics 88 (2011) 1120–1136 (with Marc J. Lipman, Laszlo Liptak and Matthew Toeniskoetter). 

71. On the surface area and average distances of meshes and tori, Parallel Processing Letters, 21 (2011) 61–75 (with Ke Qiu and Zhizhang Shen). 

72. Independent spanning trees on even networks, Information Sciences 181 (2011) 2892–2905 (with Laszlo Liptak, Jong-Seok Kim and Hyeong-Ok Lee). 

73. Optimal independent spanning trees on odd graphs, Journal of Supercomputing 56 (2011) 212–225 (with Jong-Seok Kim, Hyeong-Ok Lee and Laszlo Liptak). 

74. On the edge connectivity of graphs with two orbits of the same size, Discrete Mathematics 311 (2011) 1768–1777 (with Weihua Yang, Zhao Zhang, Xiafeng Guo and Laszlo Liptak). 

75. On the surface area of asymmetric twisted cube, Conference Proceedings to the 5th Annual International Conference on Combinatorial Optimization and Applications, edited by Wang, Zhu and Du, Springer Lecture Notes in Computer Science 6831 (2011), 411–423 (with Ke Qiu and Zhizhang Shen) (refereed). 

76. A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees, Information Sciences 181 (2011) 4300–4308 (with Laszlo Liptak, Weihua Yang, Zhao Zhang and Xiafeng Guo). 

77. Minimum steiner tree for automatic SQL query generation applied on a medical record database, Proceedings of the Seventh IEEE 2011 World Congress on Services, (2011) 443–450 (with Christopher Gillies, Nilesh Patel, Gautam Singh, George Wilson and Serge Kruk) (refereed). 

78. Conditional matching preclusion for the arrangement graph, Theoretical Computer Science 412 (2011) 6279–6289 (with Marc J. Lipman, Laszlo Liptak, David Sherman). 

79. Linearly many faults in (n,k)-star graphs, International Journal of Foundations of Computer Science, 22(7) (2011) 1729–1745 (with Allen Yuan and Laszlo Liptak). 

80. Hamiltonian connectedness of the generalized Petersen graph GP(n,4), Congressus Numerantium 209 (2011) 5–15 (with David Lu, Randy Jia, Ming Tsai, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu and Laszlo Liptak). 

81. A note on the optimal conditional matching preclusion sets for twisted cubes, Congressus Numerantium 210 (2011) 33–39 (with Allen Chen, Rolland He, Mason Liang and Kevin Wang). 

82. Matching preclusion and conditional matching preclusion problems for the generalized Petersen graph P(n,3), Congressus Numerantium 210 (2011) 61–72 (with Laszlo Liptak, Nathaniel Prince and Krinstine Stanton). 

83. Strong matching preclusion for the alternating group graphs, Journal of Interconnection Networks 12 (2011) 277–298 (with Philip Bonneville and Joseph Renzi). 

84. A note on the alternating group network, Journal of Supercomputing 59 (2012) 246–248 (with Ke Qiu and Zhizhang Shen). 

85. Component connectivity of the hypercubes, International Journal of Computer Mathematics 89 (2012) 137–145 (with Lih-Hsing Hsu, Laszlo Liptak, Jimmy J. M. Tan, Cheng-Kuan Lin and Tung-Tang Ho). 

86. Topological properties of folded hyper-star networks, Journal of Supercomputing 59 (2012) 1336–1347 (with Laszlo Liptak, Jong-Seok Kim and Sung–Won Kim).

87. Matching preclusion and conditional matching preclusion for crossed cubes, Parallel Processing Letters 22 (2012) 1250005 (13 pages) (with Sachin Padmanabhan). 

88. Matching preclusion and conditional matching preclusion problems for tori and related Cartersian products, Discrete Applied Mathematics 160 (2012) 1699–1716 (with Laszlo Liptak). 

89. Solution to an open problem on 4–ordered Hamiltonian graphs, Discrete Mathematics 312 (2012) 2356–2370 (with Lih-Hsing Hsu, Jimmy J. M. Tan, Laszlo Liptak, Cheng-Kuan Lin and Ming Tsai). 

90. The second version supercedes the first version.

• 1. 1. The edge centered surface area of the arrangement graph, Conference Proceedings to the 6th Annual International Conference on Combinatorial Optimization and Applications, edited by Lin, Springer Lecture Notes in Computer Science 7402 (2012) 49–60 (with Ke Qiu and Zhizhang Shen) (refereed). 

     2. The edge centered surface area of the arrangement graph, Journal of Combinatorial Optimization 27 (2014) 49–64 (with Ke Qiu and Zhizhang Shen). 

91. Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: sufficient conditions, Networks 59 (2012) 349–356 (with Laszlo Liptak, Roger Jia and Philip Hu).

92. Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars, Networks 59 (2012) 357–364 (with Laszlo Liptak, Roger Jia and Philip Hu).

93. Matching preclusion and conditional matching preclusion for regular interconnection networks, Discrete Applied Mathematics 160 (2012) 1936–1954 (with Marc J. Lipman and Laszlo Liptak). 

94. One-to-many node disjoint paths of hyper-star networks, Discrete Applied Mathematics 160 (2012) 2006–2014 (with Laszlo Liptak and Sung W. Kim and Jong-Seok Kim). 

95. On deriving conditional diagnosability of interconnection networks, Information Processing Letters 112 (2012) 674–677 (with Laszlo Liptak, Ke Qiu and Zhizhang Shen). 

96. On the surface area of the augmented cubes, Journal of Supercomputing 61 (2012) 856–868 (with Ke Qiu and Zhizhang Shen). 

97. The second version supercedes the first abridged conference proceedings version.

1. 1. 1. On the conditional diagnosability of Cayley graphs generated by 2-trees and related networks, Proceedings to the Twelfth International Symposium on Pervasive, Algorithms, and Networks, IEEE Conference Publishing Services (2012) 58–64 (with Laszlo Liptak, Ke Qiu and Zhizhang Shen) (refereed). 

      2. A unified approach to the conditional diagnosability of interconnection networks, Journal of Interconnection Networks 13 (2012) 1250007 (19 pages) (with Laszlo Liptak, Ke Qiu and Zhizhang Shen). 

98. The second version supercedes the first abridged conference proceedings version.

• • 1. Successive generalizations of star graphs, Proceedings to the Twelfth International Symposium on Pervasive, Algorithms, and Networks, IEEE Conference Publishing Services (2012) 65–69 (with Nart Shawash) (refereed). 

    2. The Q_{n,k,m} graph: A common generalization of various popular interconnection networks, Parallel Processing Letters 23, 1350011 (2013) (11 pages) (with Nart Shawash). 

99. The second version supercedes the first abridged conference proceedings version.

1. • 1. A faster algorithm for finding disjoint ordering of sets, Proceedings to the Third International Conference on Networking and Computing, IEEE Conference Publishing Services (2012) 119–124 (with Ke Qiu and Zhizhang Shen) (refereed). 

     2. A faster algorithm for finding disjoint ordering of sets, International Journal of Networking and Computing 3(2) (2013) 182–191 (with Ke Qiu and Zhizhang Shen). ).

100. Edge centered surface areas of bipartite graphs, Congressus Numernatium 211 (2012) 185–196 (with Ke Qiu and Zhizhang Shen). 

101. Cohesive labelings of graphs, Congressus Numernatium 212 (2012) 5–14 (with Jerrold W. Grossman). 

102. Conditional matching preclusion for Cayley graphs generated by transposition trees, Congressus Numernatium 213 (2012) 143–154 (with Laszlo Liptak). 

103. Linearly many faults in dual-cube-like networks, Theoretical Computer Science 472 (2013) 1–8 (with Arjana Angjeli and Laszlo Liptak). 

104. 4-ordered Hamiltonian problems for the generalized Petersen graph GP(n,4), Mathematical and Computer Modelling 57 (2013) 595–601 (with Chung-Nan Hung, David Lu, Randy Jia, Cheng-Kuan Lin, Laszlo Liptak, Jimmy J. M. Tan and Lih-Hsing Hsu). 

105. Conditional matching preclusion for (n,k)-star graphs, Parallel Processing Letters 23 (2013) 135004 (13 pages) (with Laszlo Liptak). 

106. Strong local diagnosability of (n,k)-star graphs and Cayley graphs generated by 2-trees with missing edges, Information Processing Letters 113 (2013) 452–456 (with Laszlo Liptak and Daniel E. Steffy). 

107. Diagnosability of Cayley graphs generated by transposition trees with missing edges, Information Sciences 238 (2013) 250–252 (with Laszlo Liptak). 

108. Strong matching preclusion for augmented cubes, Theoretical Computer Science 491 (2013) 71–77 (with Shalin Shah, Vyom Shah and Daniel E. Steffy). 

109. Linearly many faults in arrangement graphs, Networks 61(4) (2013), 281–289. (with Laszlo Liptak and Allen Yuan). 

110. The number of shortest paths in the arrangement graphs, Information Sciences 240 (2013) 191–204 (with Jerrold W. Grossman, Ke Qiu and Zhizhang Shen). 

111. Cyclic vertex–connectivity of Cayley graphs generated by transposition trees, Graphs and Combinatorics, 29 (2013) 835–841 (with Laszlo Liptak, Ke Qiu and Zhizhang Shen). 

112. A generating function approach to the edge surface area of the arrangement graphs, The Computer Journal 56 (2013) 871–881 (with Ke Qiu and Zhizhang Shen). 

113. Linearly many faults in augmented cubes, International Journal of Parallel, Emergent and Distributed Systems 28(5) (2013) 475–483 (with Arjana Angjeli and Laszlo Liptak). 

114. Matching preclusion and conditional matching preclusion for dual-cubes, Congressus Numernatium 215 (2013) 33–46 (with Akhil Nistala). 

115. A study of Kuramoto model synchronization in some popular interconnection networks, Congressus Numernatium 215 (2013) 163–180 (with Nart Shawash). 

116. On disjoint shortest paths routing in interconnection networks: A case study in the star graphs, Congressus Numernatium 216 (2013) 157–180 (with Ke Qiu and Zhizhang Shen). 

117. Strong matching preclusion of pancake graphs, Journal of Interconnection Networks 14 (2013) 1350007 (14 pages) (with David Lu and Brian Xu). 

118. Conditional fault Hamiltonicity of the star graph, Ars Combinatoria 113 (2014) 111–127 (with Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu and Laszlo Liptak). 

119. Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs, International Journal of Parallel, Emergent and Distributed Systems 29 (2014) 499–512 (with Laszlo Liptak, Philip Hu, Roger Jia, Brian Scholten and James Voss). 

120. Deriving length two path centered surface area for the arrangement graph: A generating function approach, Journal of Supercomputing 68 (2014) 1241–1264 (with Ke Qiu and Zhizhang Shen). 

121. On the surface areas of the alternating group graph and the split-star graph, Ars Combinatoria 115 (2014) 239–260 (with Ke Qiu and Zhizhang Shen). 

122. Length two path centered surface area for the arrangement graph, International Journal of Computer Mathematics 91 (2014) 1170–1189 (with Ke Qiu and Zhizhang Shen). 

123. Length two path centered surface area for bipartite graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 90 (2014) 223–239 (with Ke Qiu and Zhizhang Shen). 

124. On the conditional diagnosability of matching composition networks, Theoretical Computer Science 557 (2014) 101–114 (with Ke Qiu and Zhizhang Shen). 

125. Hamiltonian edge-connectivity of 2-tree-generated networks, Congressus Numerantium 220 (2014) 63–96 (with Mohamad Abdallah). 

126. Structural properties of 2-bijective connection networks and 2-matching composition networks, Congressus Numerantium 221 (2014) 5–19 (with Steven Cheng, Dhruv Medarametla and Lawrence Wu). 

127. Finding edge-centered surface areas for the (n,k)-star graph via first principle, Congressus Numerantium 221 (2014) 163–188 (with Ke Qiu and Zhizhang Shen). 

128. A computer-aided examination of some classes of hypercube-like super fault-tolerant Hamiltonian networks, Congressus Numerantium 222 (2014) 161–167 (with Aaron Zeng and Dan Steffy). 

129. Infinitely many equivalent versions of the graceful tree conjecture, Applicable Analysis and Discrete Mathematics 9 (2015) 1–12 (with Tao-Ming Wang, Cheng-Chang Yang and Lih-Hsing Hsu). 

130. Conditional diagnosability of Cayley graphs generated by transposition trees under the PMC model, ACM Transactions on Design Automation and Electronic Systems 20 (2015) Article 20 (16 pages) (with Nai-Wen Chang and Sun-Yuan Hsieh). 

131. On Hamiltonian properties of unidirectional hypercubes, Information Processing Letters 115 (2015) 551–555 (with Chun-Nan Hung, Tao-Ming Wang and Lih-Hsing Hsu). 

132. Matching preclusion and conditional matching preclusion problems for the folded Petersen cube, Theoretical Computer Science 576 (2015) 30–44 (with Robert Connolly and Christopher Melekian). 

133. Connectivity results of hierarchical cubic networks as associated with linearly many faults, Proceedings to 2014 IEEE 17th International Conference on Computational Science and Engineering, (2015) 1213–1220 (with Ke Qiu and Zhizhang Shen) (refereed). 

134. Conditional matching preclusion for the star graphs, Ars Combinatoria 120 (2015) 369–382 (with Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu and Laszlo Liptak). 

135. Edge-centered surface area for the (n,k)-star graph, Journal of Combinatorial Mathematics and Combinatorial Computing 94 (2015) 237–260 (with Ke Qiu and Zhizhang Shen). 

136. On the cyclability of graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 95 (2015) 33–46 (with Cheng-Kuan Lin, Lih-Hsing Hsu and Laszlo Liptak). (An errata is available.) 

137. Connectivity results of complete cubic networks as associated with linearly many faults, Journal of Interconnection Networks 15:1&2 (2015) 1550007 (23 pages) (with Ke Qiu and Zhizhang Shen). This generalizes the result in 133.

138. Linearly many edge-faults in 2-bijective connection networks, Parallel Processing Letters 25:4 (2015) 1550006 (with Dhruv Medarametla, Steven Chang and Lawrence Wu). 

139. Strong matching preclusion of 2-matching composition networks, Congressus Numerantium 224 (2015) 91–104 (with William Chang). 

140. Length two path centered surface area of the (n,k)-star graph, Information Sciences 332 (2016) 115–130 (with Ke Qiu and Zhizhang Shen). 

141. Strong matching preclusion of (n,k)-star graphs, Theoretical Computer Science 615 (2016) 91–101 (with Justin Kelm and Joseph Renzi).

142. On the conditional diagnosability of hyper-butterfly graphs and related networks, Parallel Processing Letters 216 (2016) 1650005 (18 pages) (with Ke Qiu and Zhizhang Shen). 

143. Strong matching preclusion of burnt pancake graphs, International Journal of Parallel, Emergent and Distributed Systems 31 (2016) 220–232 (with Justin Kelm, Roi Orzach and Brian Xu). 

144. Strong matching preclusion of arrangement graphs, Journal of Interconnection Networks 16 (2016) 1650004 (14 pages) (with Omer Siddiqui).

145. A note on the conditional matching preclusion problem of the folded Petersen cube, Congressus Numerantium 226 (2016) 261–271 (with Robert Connolly and Christopher Melekian).

146. Structural properties of the generalized exchanged hypercube, Emergent Computation, Springer, Edited by Andrew Adamatzky, (2017) 215–232 (with Ke Qiu and Zhizhang Shen).

147. A strong connectivity property of the generalized exchanged hypercube, Discrete Applied Mathematics 216 (2017) 529–537 (with Ke Qiu and Zhizhang Shen).

148. On the problem of determining which (n,k)-star graphs are Cayley graphs, Graphs and Combinatorics 33 (2017) 85–102 (with Li Li, Laszlo Liptak, Sang-Ho Shim and Dan Steffy).

149. On the restricted connectivity of the arrangement graph, Journal of Supercomputing 73 (2017) 3669–3682 (with Ke Qiu and Zhizhang Shen).

150. A study of the decycling problem for the general exchanged hypercube, Proceedings to the Fourteenth International Symposium on Pervasive, Algorithms, and Networks (2017) 93–99 (with Ke Qiu and Zhizhang Shen) (refereed).

151. Steiner distance in join, corona, and threshold graphs, Proceedings to the Fourteenth International Symposium on Pervasive, Algorithms, and Networks (2017) 100–104 (with Zhao Wang, Yaping Mao and Christopher Melekian) (refereed).

152. Strong fault-Hamiltonicity for the crossed cube and its extensions, Parallel Processing Letters 27 (2017) 1750025 (25 pages) (with Chun-Nan Hung, Cheng-Kuan Lin, Lih-Hsing Hsu and Laszlo Liptak). 

153. Proper distance in edge-colored hypercubes, Applied Mathematics and Computation 313 (2017) 384–391 (with Colton Magnant and Dhruv Medarametla). 

154. On diagnosability of interconnection networks, International Journal of Unconventional Computing 13 (2017) 245–251 (with Ke Qiu and Zhizhang Shen).

155. Diagnosability problems of the exchanged hypercube and its generalization, International Journal of Computer Mathematics: Computer Systems Theory 2 (2017) 39–52 (with Ke Qiu and Zhizhang Shen).

156. Routing on the hypercubes with blocking/faulty nodes, Congressus Numernatium 229 (2017) 75–85 (with Keivan Noroozi, Ke Qiu and Zhizhang Shen).

157. Strong matching preclusion of the generalized Petersen graph, Congressus Numernatium 229 (2017) 261–274 (with Ajay Arora).

158. The k-independence number of graph products, The Art of Discrete and Applied Mathematics 1 (2018) #P01 (19 pages) (with Yaping Mao, Zhao Wang and Zhiwei Guo).

159. Generalized matching preclusion in bipartite graphs, Theory and Applications of Graphs 5 (2018) Article 1 (18 pages) (with Zachary Wheeler, Dana Ferranti, Laszlo Liptak and Karthik Nataraj).

160. A complete classification of which (n,k)-star graphs are Cayley graphs, Graphs and Combinatorics 34 (2018) 241–260 (with Karimah Sweet, Laszlo Liptak, Li Li and Daniel Steffy).

161. Strong matching preclusion number of graphs, Theoretical Computer Science 713 (2018) 11–20 (with Zhao Wang, Yaping Mao, and Christopher Melekian).

162. Fault-Hamiltonicity of Cartesian products of directed cycles, The Art of Discrete and Applied Mathematics 1 (2018) #P06 (17 pages) (with Chun-Nan Hung, Tao-Ming Wang and Lih-Hsing Hsu).

163. A note on the Steiner (n-k)-diameter of a graph, International Journal of Computer Mathematics: Computer Systems Theory 3 (2018) 41–46 (with Yaping Mao and Christopher Melekian).

164. Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks, Theoretical Computer Science 731 (2018) 50–67 (with Shengjie He and Rong-Xia Hao).

165. Matching preclusion for the shuffle-cubes, Parallel Processing Letters 28 (2018) 1850012 (9 pages) (with Sai Anantapantula and Christopher Melekian). 

166. Steiner distance in product networks, Discrete Mathematics and Theoretical Computer Science 23 (2018) #8 (25 pages) (with Yaping Mao and Zhao Wang). 

167. Fractional matching preclusion for (burnt) pancake graphs, Proceedings to the Fifteen International Symposium on Pervasive, Algorithms, and Networks (2018) 133–141 (with Tianlong Ma, Yaping Mao and Christopher Melekian) (refereed).

168. Fractional matching preclusion for (n,k)-star graphs, Parallel Processing Letters 28 (2018) 1850017 (15 pages) (with Tianlong Ma, Yaping Mao and Jinling Wang). 

169. Panconnectivity of 2-tree generated networks, Congressus Numerantium 230 (2018) 89–103 (with Mohamad Abdallah). 

170. Matching preclusion of boxdot products, Congressus Numerantium 230 (2018) 105–124 (with Omer Siddiqui and Stephanie Budzisz). 

171. On coloring complete binary trees, Congressus Numerantium 230 (2018) 125–134 (with Maryam Khosravi, Ke Qiu and Zhizhang Shen). 

172. A proposed scheme of finding closed form solutions to surface areas of graphs, Congressus Numerantium 230 (2018) 135–149 (with Ke Qiu and Zhizhang Shen). 

173. Matching preclusion in product graphs, Theoretical Computer Science 755 (2019) 38–47 (with Zhao Wang, Christopher Melekian and Yaping Mao).

174. A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks, Theoretical Computer Science 757 (2019) 56–67 (with Ke Qiu and Zhizhang Shen).

175. Matching preclusion number of graphs, Theoretical Computer Science 759 (2019) 61–71 (with Zhao Wang, Yaping Mao and Jinyu Zou).

176. Minimum degree and size conditions for the proper connection number of graphs, Applied Mathematics and Computation 352 (2019) 205–210 (with Xiaxia Guan, Lina Xue and Weihua Yang). 

177. Structural properties and fault resiliency of interconnection networks, From Parallel to Emergent Computing, CRC Press (2019), Edited by Andrew Adamatzky, Selim Akl and Georgios Sirakoulis, 77–101 (with Rong-Xia Hao, Ke Qiu and Zhizhang Shen).

178. Strong matching preclusion problem of the folded Petersen cube, International Journal of Computer Mathematics: Computer Systems Theory 4 (2019) 1–15 (with Spencer Liu, Chris Melekian, Karimah Sweet, Chittesh Thavamani and Freddie Zhao). 

179. Matching preclusion of the generalized Petersen graph, Theory and Applications of Graphs 6:1 (2019) Article 5 (8 pages) (with Chris Melekian and Ajay Arora). 

180. Two kinds of generalized connectivity of dual cubes, Discrete Applied Mathematics 257 (2019) 306–316 (with Shu-Li Zhao and Rong-Xia Hao). 

181. Steiner distance in join, corona, cluster, and threshold graphs, Journal of Information Science and Engineering 35 (2019) 721–735 (with Zhao Wang, Yaping Mao and Christopher Melekian). This includes results given in 151.

182. A note on the Steiner k-diameter of tensor product networks, Parallel Processing Letters 29 (2019) 1950008 (7 pages) (with Pranav Arinandhi and Chris Melekian).

183. Fractional matching preclusion for generalized augmented cubes, Discrete Mathematics and Theoretical Computer Science 21 (2019) #6 (21 pages) (with Tianlong Ma, Yaping Mao and Chris Melekian).

184. A note on generalized matching preclusion in bipartite graphs, Theoretical Computer Science 791 (2019) 132–140 (with Chris Melekian).

185. A concise survey of matching preclusion in interconnection networks, Journal of Interconnection Networks, 19 (2019) 1902006 (13 pages) (with Yaping Mao).

186. Fractional matching preclusion for arrangement graphs, Discrete Applied Mathematics 270 (2019) 181–189 (with Tianlong Ma, Yaping Mao and Jinling Wang).

187. Strongly Menger connectedness of data center networks and (n,k)-star graph, Theoretical Computer Science 799 (2019) 94–103 (with Mei-Mei Gu, Shengjie He and Rong-Xia Hao).

188. Conditional strong matching preclusion of the alternating group graph, Theory and Applications of Graphs 6:2 Article 5 (16 pages) (2019)  (with Mohamad Abdallah).

189. Diagnosability of interconnection networks: Past, Present and Future, International Journal of Parallel, Emergent and Distributed Systems 35 (2020) 2–8 (with Ke Qiu and Zhizhang Shen).

190. Proper coloring distance in edge-colored Cartesian products of complete graphs and cycles, Parallel Processing Letters 29 (2019) 1950016 (9 pages) (with Ajay Arora and Colton Magnant).

191. Faulty node modeling and diagnosis in interconnection networks (extended abstract), 2019 International Conference on Modeling, Simulation, Optimization and Algorithm, Journal of Physics: Conference Series, 1419 (2019) 012014 (7 pages) (with Ke Qiu, Yaping Mao and Zhizhang Shen).

192. Disjoint and shortest paths routing in hypercubes, Congressus Numerantium 233 (2019) 175–188 (with Ke Qiu and Zhizhang Shen).

193. A short note on the large Steiner k-diameter of graphs, Congressus Numerantium 234 (2019) 161–165 (with Timothy Wu and Chris Melekian).

194. Reliability and conditional diagnosability of hyper bijective networks, International Journal of Computer Mathematics: Computer Systems Theory 5 (2020) 25–47 (with Guanqin Lian, Shuming Zhou, Jiafei Liu and Gaolin Chen).

195. 2-spanning cyclability problems of some generalized Petersen graphs, Discussiones Mathematicae Graph Theory 40 (2020) 713–731 (with Meng-Chien Yang, Chun-Nan Hung and Lih-Hsing Hsu).

196. The g-extra diagnosability of the generalized exchanged hypercube, International Journal of Computer Mathematics: Computer Systems Theory 5 (2020) 112–123 (with Ke Qiu and Zhizhang Shen).

197. Unpaired many-to-many disjoint path covers on bipartite k-ary n-cube networks with faulty elements, International Journal of Foundations of Computer Science 31 (2020) 371–383 (with Jing Li, Chris Melekian and Shurong Zou).

198. Note on applications of linearly many faults, The Computer Journal 63 (2020) 1406–1416 (with Mei-Mei Gu and Rong-Xia Hao).

199. A note on the strong matching preclusion problem for data center networks, Information Processing Letters 164 (2020) 106007 (6 pages) (with Tianlong Ma, Yaping Mao and Ping Han).

200. Two algorithms for constructing independent spanning trees in (n,k)-star graphs, IEEE Access 8 (2020) 175932–175947 (with Jie-Fu Huang and Sun-Yuan Hsieh).

201. A brief account on the development and future research directions of connectivity properties of interconnection networks, Parallel Processing Letters 30 (2020) 2040009 (14 pages) (with Ke Qiu, Zhizhang Shen and Weihua Yang).

202. Structure and substructure connectivity of hypercube-like networks, Parallel Processing Letters 30 (2020) 2040007 (23 pages) (with Laszlo Liptak and Cheng-Kuan Lin).

203. Fault diagnosability of regular graphs, Theory and Applications of Graphs 7 (2020) 4 (18 pages) (with Mei-Mei Gu and Rong-Xia Hao).

204. The super spanning connectivity of split-star networks, Information Processing Letters 166 (2021) 106037 (6 pages) (with Jing Li and Xujing Li).

205. The conditional strong matching preclusion of augmented cubes, Theory and Applications of Graphs, 8 (2021) 5 (22 pages) (with Mohamad Abdallah).

206. Linear k-arboricity of Cayley graphs on Abelian groups with given degree, Mathematics in Computer Science 15 (2021) 743–755 (with Nan Jia, Yaping Mao and Zhao Wang).

207. Persistence of hybrid diagnosability of regular networks under testing diagnostic model, The Computer Journal 64 (2021) 1401–1411 (with Guanqin Lian, Shuming Zhou, Jiafei Liu and Gaolin Chen).

208. The second version supercedes the first abridged conference proceedings version.

1. Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract), The 27th International Computing and Combinatorics Conference Proceedings, Lecture Notes in Computer Science 13025, Edited by C.-Y. Chen et al. (2021) 425–435 (with Sambhav Gupta and Laszlo Liptak). (refereed).

2.  Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs, International Journal of Computer Mathematics: Computer Systems Theory 7 (2022) 207–222  (with Sambhav Gupta and Laszlo Liptak).

209. Reliability analysis of the cactus-based networks, Theoretical Computer Science 888 (2021) 95–107 (with Jiafei Liu, Shuming Zhou, Qianru Zhou and Xiaoqing Liu).

210. Reliability evaluation of bicube-based multiprocessor system under the g-good-neighbor restriction, Parallel Processing Letters 31 (2021) 2150018 (17 pages) (with Jiafei Liu, Shuming Zhou, Qianru Zhou and Ming Li).

211. A note on the maximum fractional matchings of graphs Journal of Combinatorial Optimization, 43 (2022) 253–264 (with Tianlong Ma and Yaping Mao).

212. Fractional matching preclusion number of graphs Discrete Applied Mathematics, 311 (2022) 142–153 (with Jinyu Zou, Yaping Mao and Zhao Wang).

213. A note on linearly many faults of interconnection networks, Journal of Interconnection Networks 22 (2022) 2142017 (6 pages) (with Laszlo Liptak, Ke Qiu and Zhizhang Shen).

214. Fault-tolerant Hamiltonian connectivity of 2-tree generated networks, Theoretical Computer Science 907 (2022) 62–81 (with Mohamad Abdallah).

215. On the g-extra diagnosability of the enhanced hypercube, Theoretical Computer Science 921 (2022) 6–19 (with Ke Qiu and Zhizhang Shen).

216. On the extraconnectivity of arrangement graphs, Springer Proceedings in Mathematics and Statistics 388 (2022), 275–285 (with Laszlo Liptak and Daniel Tian).

217. A general approach to deriving diagnosability results of interconnection networks, International Journal of Parallel, Emergent and Distributed Systems 37 (2022) 369–397 (with Ke Qiu, Yaping Mao and Zhizhang Shen). An extended abstract of this appeared as 191.

218. Characterization of component diagnosability of regular networks, Discrete Applied Mathematics 322 (2022), 253–267 (with Hong Zhang, Shuming Zhou and Sun-Yuan Hsieh).

219. Reliability analysis of the generalized balanced hypercube, Theoretical Computer Science 921 (2023) 297–311 (with Xiaoqing Liu, Shuming Zhou and Hong Zhang).

220. Restricted connectivity of Cayley graph generated by transposition trees, Discrete Applied Mathematics 327 (2023), 87–95 (with Hong Zhang and Shuming Zhou).

221. Conditional strong matching preclusion of the pancake graph, International Journal of Parallel, Emergent and Distributed Systems, 38 (2023) 1–13 (with Mohamad Abdallah).

222. A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs, Czechoslovak Mathematical Journal, 73 (2023) 237–244 (with Chris Melekian and Yaping Mao).

223. Component connectivity of augmented cubes, Theoretical Computer Science, 952 (2023) 113784 (13 pages) (with Qifan Zhang and Shuming Zhou).

224. Component fault diagnosis and fault tolerance of alternating group graphs, The Computer Journal, 66 (2023) 1184–1194 (with Yanze Huang, Limei Lin and Li Xu).

225. On the g-extra connectivity of augmented cubes, Theoretical Computer Science, 970 (2023) 114059 (18 pages) (with Zhizhang Shen, Laszlo Liptak, Ke Qiu and Abhishek Vangipuram).

226. Forward difference properties of the (n,k)-star graph and some other interconnection networks, Proceedings to the 29th IEEE International Conference on Parallel and Distributed Systems, 138–145 (with Ethan Gibbons, Ke Qiu and Zhizhang Shen).

227. Ascending Ramsey sequences in graphs, Bulletin of the Institiute of Combinatorics and its Applications, 100 (2024) 73–92 (with Gary Chartrand and Ping Zhang).

228. The cyclic diagnosability of hypercubes under the PMC model and the MM* model, The Computer Journal, 100 (2024) 709–718 (with Hong Zhang and Shuming Zhou).

229. A commentary on the progress of big data in combinatorial optimization, Parallel Processing Letters, 34 (2024) 7475001 (6 pages) (with Longkun Guo, Yaping Mao ad Xiaoyan Zhang).

230. A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs, Discrete Applied Mathematics 348 (2024), 152–158 (with Pingshan Li and Min Xu).

231. Structural properties of m-ary n-dimensional hypercubes, Springer Proceedings in Mathematics and Statistics, to appear (with Laszlo Liptak and Saranya Anantapantula).

232. Characterization of cyclic diagnosability of regular diagnosable networks, IEEE Transactions on Reliability, to appear (with Hong Zhang, Shuming Zhou and Sun-Yuan Hsieh).

Technical Reports and Work in Progress 

1. "A home health care routing and scheduling problem," Tech Report Tr. 98-04 Rice University, 1998 (with Jennifer R. Rich). 

2. "Orientation and partial orientation of star graphs: connectivity, augmentation and subgraph problems," in progress (with Marc J. Lipman). 

3. "Separation problem of wheel inequalities for stable multiset polytopes," in progress (with Sven de Vries). 

Miscellaneous Publications 

Solutions to mathematical problems published in Crux Mathematicorum, Mathematical Spectrum and Mathematics Magazine.

Ph.D. Students 

1. Lazaros Kikas (2004). Thesis: Interconnection networks and the k-disjoint path problems. Present position: Associate Professor, Department of Mathematics and Computer Science, University of Detroit Mercy. 

2. Nart Shawash (2008). Thesis: Relationships among popular interconnection networks and their common generalization. Present position: Associate Professor, Department of Mathematics and Computer Science, University of Detroit Mercy. 

3. Robert Connolly (2013). Thesis: Matching preclusion and conditional matching preclusion problems for the folded Petersen cube.

4. Mohamad Abdallah (2015). Thesis: Fault-Tolerant Hamiltonian-connectivity of 2-tree generated networks. Present position: Assistant Professor, Department of Mathematics and Natural Sciences, American University of Kuwait. 

5. Chris Melekian (2019). Thesis: Matching Preclusion and Generalizations. Present position: Senior Analyst, GM Financial.

Masters and Undergraduate Students Directed

1. William Lindsey, Ray Kleinberg and Daniel Steffy, Examimation Scheduling Problem, part of Provost's Undergraduate Student Research Scholar Program (2003) (with Serge G. Kruk). 

2. Daniel Steffy, Honor Thesis (2003). 

3. Daniel Steffy, Hockey Playoff Problem (2004). 

4. Timothy Ross, Induced Influence Digraphs, Provost's Undergraduate Student Research Scholar Program (2005) (with Jerrold W. Grossman). 

5. David Stiebel, student visiting from MIT (2006) (with Laszlo Liptak). 

6. Fred Sala, student visiting from University of Michigan (2007) (with Laszlo Liptak). 

7. Saurabh Pandey, student visiting from CalTech (2009). 

8. Matthew Toeniskoetter 2009–2010 (with Laszlo Liptak). 

9. Chris Melekian 2010–2011. 

10. Justin Kelm 2014–2016. 

High School Students Mentored 

1. Yuyin Chen 2002–2003, refereed publication. 

2. Meelap Shah 2005–2006, refereed publication, 2005 Intel STS Semifinalist, 2005 Detroit Science Fair Grand Award, Intel International Science and Engineering Fair 2006 Mathematical Sciences Third Award, Intel ISEF 2006 Special Awards: American Mathematical Society Honorable Mention Award and United States Air Force Second Award. 

3. Roger Jia 2006–2007. 

4. Philip Hu 2006–2008. 

5. David Sherman 2008–2009, refereed publication, 2008 Siemens Competition Semifinalist, 2009 Detroit Science Fair Grand Award, 2009 Intel STS Semifinalist, Intel International Science and Engineering Fair 2009 Mathematical Sciences Third Award.

6. Ram Bashkar 2008–2010, refereed publication. 

7. Chris Melekian 2009–2010, refereed publication. 

8. Kevin Wang 2009–2010, refereed publication, 2009 Siemens Competition Regional Finalist, 2010 Detroit Science Grand Award, 2010 Intel International Science Fair Finalist (with Serge G. Kruk). 

9. Mason Liang 2009–2011, refereed publication, 2010 Detroit Science Fair Team Third Place. 

10. David Lu 2009–2012, refereed publication, 2009 Siemens Competition Regional Winner (Team), 2009 Siemens Competition National $30,000 Award (Team), 2010 Siemens Competition Regional Finalist, 2011 Detroit Science Fair Team Second Place, 2011 Siemens Competition Semifinalist, 2012 Intel STS Semifinalist.

11. Randy Jia 2009–2011, refereed publication, 2009 Siemens Competition Regional Winner (Team), 2009 Siemens Competition National $30,000 Award (Team), 2010 Siemens Competition Finalist, 2011 Detroit Science Fair Team Second Place. 

12. Allen Chen 2010–2011, refereed publication, 2011 Detroit Science Fair Team First Place. 

13. Rolland He 2010–2011, refereed publication, 2011 Detroit Science Fair Team First Place. 

14. Allen Yuan 2010–2011, refereed publication, 2010 Siemens Competition Regional Winner, 2010 Siemens Competition Natonal $30,000 Award, 2011 Intel STS Semifinalist, 2011 Detroit Science Fair Grand Award, Intel International Science and Engineering Fair 2011 Mathematical Sciences First Award, Intel ISEF 2011 Special Awards: United States Air Force First Award, United States Army Award and United Technologies Corporation Award.

15. Sachin Padmanabhan 2009–2012, refereed publication. 

16. Philip Bonneville 2010–2012, refereed publication. 

17. Joseph Renzi 2010–2012, refereed publication. 

18. Shalin Shah 2010–2012, refereed publication, 2012 Detroit Science Fair Blue Ribbons Award, Mu Alpha Theta Award, United States Army Award, United States Air Force Certificate of Achievement. 

19. Vyom Shah 2010–2012, refereed publication, 2012 Detroit Science Fair Blue Ribbons Award, Mu Alpha Theta Award, United States Army Award, United States Air Force Certificate of Achievement. 

20. Andrew Werner, Summer 2012, Intern from Utica Center of Mathematics, Science and Technology. 

21. Matthew Jagielski 2012–2013, 2013 Intel STS Research Report Badge. 

22. Alan Xu 2012–2013, 2013 Southeast Michigan Science Fair 2nd place Grand Award, United States Army Award, United States Air Force Certificate of Achievement, 2nd place in Computer Science and Mathematics (with Jerrold W. Grossman). 

23. Akhil Nistala 2012–2013, refereed publication, 2013 Detroit Science Fair Grand Award, Intel Award Certificate, Mu Alpha Theta Award, 2013 Intel ISEF Science Fair Second Place Award in Mathematical Sciences and an Honorable Mention Special Award from the American Mathematical Society. 

24. Aaron Zeng 2012–2014, refereed publication, 2013 Detroit Science First Place Award, Mu Alpha Theta Award (with Jerrold W. Grossman). 

25. Bogart Lipe, Summer 2013, Intern from Utica Center of Mathematics, Science and Technology. 

26. Cody McKay, Summer 2013, Intern from Utica Center of Mathematics, Science and Technology. 

27. Brian Xu 2013–2014, refereed publication, 2014 Detroit Science Fair First Place Award. 

28. Eric Ryu 2013–2014, 2014 Detroit Science Fair First Place Award. 

29. Lawrence Wu 2013–2014, refereed publication, 2013 Siemens Competition Semifinalist, 2014 Detroit Science Fair Second Place Award. 

30. Steven Cheng 2013–2014, refereed publication, 2013 Siemens Competition Semifinalist, 2014 Detroit Science Fair Second Place Award. 

31. Dhruv Medarametla 2013–2016, refereed publication, 2013 Siemens Competition Semifinalist, 2014 Detroit Science Fair Second Place Award, 2014 Siemens Competition Regional Finalist, 2015 Detroit Science Fair First Place in Mathematics, Grand Prize Team Award and Mu Alpha Theta Certificate. 

32. Justin Xu 2014–2016, 2014 Siemens Competition Regional Finalist, 2015 Detroit Science Fair First Place in Mathematics, Grand Prize Team Award and Mu Alpha Theta Certificate. 

33. Justin Kelm 2014, refereed publication. 

34. Roi Orzach 2014–2016, refereed publication. 

35. William Chang 2014–2015, refereed publication. 

36. Omer Siddiqui 2015–2018, 2016 Michigan State Science Fair Grand Award in mathematics, 2016 Intel International Science and Engineering Fair Second Award in mathematics and a Mu Alpha Theta First Award, 2016 Siemens Competition Semifinalist, 2017 Regeneron Science Talent Search Semifinalist, refereed publication. 

37. Freddie Zhao 2016–2018, 2017 Detroit Science Fair Second Place in Mathematics and Mu Alpha Theta Certificate, 2017 Siemens Competition Regional Finalist, refereed publication. 

38. Spencer Liu 2016–2018, 2017 Detroit Science Fair Second Place in Mathematics and Mu Alpha Theta Certificate, 2017 Siemens Competition Regional Finalist, refereed publication. 

39. Chittesh Thavamani 2016–2018, 2017 Detroit Science Fair Second Place in Mathematics and Mu Alpha Theta Certificate, 2017 Siemens Competition Regional Finalist, refereed publication. 

40. Ajay Arora 2016–2019, 2017 Detroit Science Fair First Place in Mathematics and a Mu Alpha Theta Certificate, refereed publication. 

41. Ethan Davis June 2017, Intern from Cranbrook Kingswood High School. 

42. Arav Agarwal 2017–2019, 2017 Siemens Competition Regional Finalist. 

43. Sai Anantapantula 2017–2019, 2017 Siemens Competition Regional Finalist, refereed publication. 

44. Pranav Arunandhi 2018–2020, 2019 Detroit Science Fair First Place in Mathematics and a Naval Scholar Award, refereed publication.

45. Timothy Wu 2018–2020, refereed publication.

46. Daniel Tian 2019–2021, refereed publication. 

47. Sambhav Gupta 2020–2022, refereed publication.

48. Razzi Masroor 2020–2022, 2022 Detroit Science Fair Third Place in Mathematics and a certificate of Recognition from ASA, Michigan Section.

49. Saranya Anantapantula 2019–2022, refereed publication.

50. Abhishek Vangipuram 202o–2023, refereed publication.

Research Experiences for Undergraduates (REU) Students Supervised 

(with Laszlo Liptak)

1. Sarah Anderson (2008) 

2. Kelly Christensen (2008) 

3. Jennifer Diemunsch (2008) 

4. Roger Jia (2009,2010) 

5. Philip Hu (2009) 

6. James Voss (2009) 

7. Brian Scholten (2009) 

8. Matthew Toeniskoetter (2009) 

9. David Sherman (2010) 

10. Kristine Stanton (2010) 

11. Nathaniel Prince (2010) 

12. Stacey Abshire (2013) 

13. Aimee Maltby (2013) 

14. Erica Gilliland (2013) 

15. Khartik Nataraj (2013) 

16. Dana Ferranti (2013) 

17. Zach Wheeler (2013) 

External Examiner 

1. C.M. Sushama, Ph.D. Thesis, Operations Research, National Institute of Technology Calicut, India (2008).

2. Fan Zhang, M.Sc. Thesis, Computer Science, Brock University, Canada (2009).

3. Yifeng Li, M.Sc. Thesis, Computer Science, Brock University, Canada (2009).

4. Nafiseh Motevallibasi, M.Sc. Thesis, Computer Science, Brock University, Canada (2017).

5. Fatemeh Salahi, M.Sc. Thesis, Computer Science, Brock University, Canada (2019).

6. Bernd Perscheid, Ph.D. Dissertation, Mathematics, Universität Trier, Germany (2020).

7. Amruta Shinde, Ph.D. Thesis, Mathematics, Savitribai Phule Pune University, India (2022).

Scholarly Presentations 

1. The 15th International Symposium on Mathematical Programming, University of Michigan, Ann Arbor, Michigan, 1994. 

2. Workshop on Graph Augmentation Problems, Eötvös Loránd University, Budapest, Hungary, 1994. 

3. The 4th Integer Programming and Combinatorial Optimization Conference, Technical University of Denmark, Copenhagen, Denmark, 1995. 

4. Mathematics Colloquium, Memorial University of Newfoundland, St. John's, Newfoundland, Canada, May 1997. 

5. Combinatorial Optimization Seminar, University of Waterloo, Waterloo, Ontario, Canada, March 1998. 

6. The 30th Midwest Graph Theory Conference, Ball State University, Muncie, Indiana, October 1998. 

7. The 31st Midwest Graph Theory Conference, Oakland University, Rochester, Michigan, April 1999. 

8. The 30th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, Florida, March 1999. 

9. The 32nd Midwest Graph Theory Conference, Indiana University-Purdue University at Fort Wayne, Fort Wayne, Indiana, October 1999. 

10. The 31st Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, Florida, March 2000. 

11. The 9th Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, Western Michigan University, Kalamazoo, Michigan, June 2000. 

12. The 33rd Midwest Graph Theory Conference, Wright State University, Dayton, Ohio, October 2000. 

13. The 32nd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Louisiana State University, Baton Rouge, Louisiana, March 2001. 

14. Mathematics Colloquium, Memorial University of Newfoundland, St. John's, Newfoundland, Canada, November 2001. 

15. The 33rd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, Florida, March 2002. 

16. Mathematics Colloquium, University of South Alabama, Mobile, Alabama, April 2002. 

17. Mathematics Colloquium, Memorial University of Newfoundland, St. John's, Newfoundland, Canada, October 2002. 

18. Sigma Xi Seminar, Oakland University, Rochester, Michigan, November, 2002

19. The 34th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, Florida, March 2003. 

20. Mathematics Colloquium, Memorial University of Newfoundland, St. John's, Newfoundland, Canada, October 2003. 

21. The 35th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, Florida, March 2004. 

22. Graph Theory Seminar, University of Waterloo, Waterloo, Ontario, Canada, April 2004. 

23. The 2004 SIAM Conference on Discrete Mathematics, Nashville, TN, June 2004. 

24. INFORMS SEMI Organization Meeting, Rochester, MI, November 2004. 

25. The 36th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, Florida, March 2005. 

26. The 37th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, Florida, March 2006. 

27. Mathematics Colloquium, Saginaw Valley State University, Saginaw, MI, April 2008. 

28. Local Invited Session, 2008 Joint Annual Meeting Michign Section-MAA & MichMATYC, Grand Valley State University, Grand Rapids, MI, May 2008. 

29. The 47th Midwest Graph Theory Conference, Illinois Institute of Technology, Chicago, Illinois, November 2008. 

30. The 40th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, Florida, March 2009. 

31. The 11th CombinaTexas, San Marcos, Texas, April 2010 (plenary speaker). 

32. The 2010 American Mathematical Society Spring Eastern Sectional Meeting, Newark, New Jersey 2010 (Special Session). 

33. The 2011 American Mathematical Society Meeting, New Orleans, Louisiana 2011. 

34. Matching, Matroids, and Extensions A Conference in Honour of Bill Cunningham's 65th Birthday, Waterloo, Ontario 2012. 

35. The Twelfth International Symposium on Pervasive, Algorithms, and Networks, San Marcos, Texas 2012. 

36. The 45th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2014. 

37. The 28th Midwest Conference on Combinatorics and Combinatorial Computing, Las Vegas, NV, 2014. 

38. The 2015 Michigan Mathematics Meetings, Holland, MI, 2015. 

39. The 47th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2016. 

40. The 2017 American Mathematical Society Spring Southeastern Sectional Meeting, Charleston, South Carolina, 2017 (Special Session). 

41. The 7th Cross-Strait Conference on Network Fault-Tolerance and Fault-Diagnosis, Fujian, China, 2021 (Invited) (Online).

42. Seminar, International University of La Rioja,  La Rioja, Spain, 2024 (Online).

Departmental Seminars and Colloquia at Oakland University 

1. Mathematics Colloquium: Mar 1997, Nov 1998, Oct 2000, Sept 2002, Sept 2006, February 2009, October 2010, October 2011, October 2012. 

2. Discrete Math Seminar: 1997–Present (irregular). 

Professional Meetings Attended 

1. The 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, 1992. 

2. Special Workshop at DIMAC, New Jersey, 1993. 

3. Maastricht Summer School on Combinatorial Optimization, Maastricht, The Netherlands, 1993. 

4. The 15th International Symposium on Mathematical Programming, Ann Arbor, MI, 1994. 

5. Workshop on Graph Augmentation Problem, Budapest, Hungary, 1994. 

6. The 4th Integer Programming and Combinatorial Optimization Conference, Copenhagan, Demark, 1995. 

7. Workshop on Submodular Functions, Grenoble, France, 1995. 

8. Tutte Conference, Waterloo, Ontario, 1997. 

9. Conference on Algebraic Combinatorics and Applications, Rochester, MI, 1998. 

10. The 6th integer Programming and Combinatorial Optimization Conference, Houston, TX, 1998. 

11. The 30th Midwest Graph Theory Conference, Muncie, IN, 1998. 

12. The 31st Midwest Graph Theory Conference, Rochester, MI, 1999. 

13. The 30th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 1999. 

14. The 32nd Midwest Graph Theory Conference, Fort Wayne, IN, 1999. 

15. The 31st Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2000. 

16. The 9th Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, Kalamazoo, MI, 2000. 

17. The 33rd Midwest Graph Theory Conference, Dayton, OH, October 2000. 

18. The 32nd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, LA, 2001. 

19. The 34th Midwest Graph Theory Conference, Rochester, MI, October 2001. 

20. The 33rd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2002. 

21. The 34th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2003. 

22. The 37th Midwest Graph Theory Conference, Valparaiso, IN, September 2003. 

23. The 5th Annual Midwest Optimization Seminar, Rochester, MI, October 2003. 

24. The 35th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2004. 

25. The 2004 SIAM Conference on Discrete Mathematics, Nashville, TN, 2004.

26. The 6th Annual Midwest Optimization Seminar, Detroit, MI, 2004. 

27. ILOG Optimization Technologies Workshop, Southfield, MI, 2004. 

28. INFORMS SEMI Organization Meeting, Rochester, MI, 2004. 

29. The 39th Midwest Graph Theory Conference, Muncie, IN, November 2004. 

30. The 2004 Mathematical Association of America Michigan Section Meeting, Rochester, MI, 2004. 

31. The 36th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2005. 

32. The 37th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2006. 

33. INFORMS SEMI Organization Meeting, Warren, MI, October 2006. 

34. The 38th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2007. 

35. The 2007 Mathematical Association of America Michigan Section Meeting, Dearborn, MI, 2007. 

36. The C&O@40 Meeting, Waterloo, ON, 2007. 

37. The 45th Midwest Graph Theory Conference, Detroit, MI, October 2007. 

38. The 39th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2008. 

39. 2008 Joint Annual Meeting Michign Section-MAA & MichMATYC, Grand Valley State University, Grand Rapids, MI, May 2008. 

40. The 47th Midwest Graph Theory Conference, Illinois Institute of Technology, Chicago, Illinois, November 2008. 

41. The 40th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2009. 

42. The 41st Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2010. 

43. The 11th CombinaTexas, San Marcos, Texas, 2010. 

44. The 2010 American Mathematical Society Spring Eastern Sectional Meeting, Newark, New Jersey 2010. 

45. Bixby Workshop, Erlangen, Germany, 2010. 

46. The 2011 American Mathematical Society Meeting, New Orleans, Louisiana 2011. 

47. The 42nd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2011. 

48. The 43rd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2012. 

49. The Sixth Annual Conference on Teaching and Learning, Rochester, MI, 2012. 

50. Matching, Matroids, and Extensions A Conference in Honour of Bill Cunningham's 65th Birthday, Waterloo, Ontario 2012. 

51. The Twelfth International Symposium on Pervasive, Algorithms, and Networks, San Marcos, Texas 2012. 

52. The 44th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2013. 

53. The 45th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2014. 

54. Algebraic Combinatorics: Spectral Graph Theory, Erdos-Ko-Rado Theorems and Quantum Information Theory, Waterloo, Ontario June 2014. 

55. Applied Mathematics Conference, Rochester, MI, 2014. 

56. The 28th Midwest Conference on Combinatorics and Combinatorial Computing, Las Vegas, NV, 2014. 

57. The 46th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2015. 

58. The 2015 American Mathematical Society Spring Eastern Sectional Meeting, Washington, DC, 2015. 

59. The 2015 Michigan Mathematics Meetings, Holland, MI, 2015. 

60. The 47th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2016. 

61. The 48th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2017. 

62. The 2017 American Mathematical Society Spring Southeastern Sectional Meeting, Charleston, South Carolina 2017. 

63. The 2017 Mixed Integer Programming Workshop, Montreal, Quebec, 2017.

64. The 49th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2018. 

65. American Mathematical Society Spring Eastern Sectional Meeting, Boston, MA, 2018. 

66. First Year University Mathematics Across Canada: Facts, Community and Vision, Toronto, ON, Canada, 2018. 

67. The 50th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2019. 

68. The 2019 Mathematical Association of America Pacific Northwest Section Meeting, Portland, OR, 2019.

69. The 51st Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2020. 

70. The 2nd Joint SIAM/CAIMS Annual Meeting, July 2020 (Online).

71. The 52nd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2021 (Online). 

72. The 7th Cross-Strait Conference on Network Fault-Tolerance and Fault-Diagnosis, Fujian, China, 2021 (Online).

73. The 53rd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2022 (Online). 

Departmental Service (current) 

Administrative and Services Activities: 

1. Member of the Steering Committee (2013–Present).

2. Member of Personnel Committee (2017–Present). 

3. Member of Salary Advisory Committee (2021–Present).

4. Chair of the Instructional Supervision Committee (2021–Present).

Other Activities 

1. Undergraduate Advisor (2013–Present). 

2. Graduate Advisor (2017–Present). 

Departmental Service (past) 

Scholarly Activities: 

1. Chair of the Ph.D. committee for Lazaros Kikas (2000–2003). 

2. Chair of the Ph.D. committee for Nart Schwash (2005–2007). 

3. Chair of the Ph.D. committee for Robert Connolly (2010–2013). 

4. Chair of the Ph.D. committee for Mohamad Abdallah (2012–2015). 

5. Chair of the Ph.D. committee for Chris Melekian (2015–2019). 

Conference Organization: 

1. Member of the organizing committee for the Conference on Algebraic Combinatorics and Applications held at Oakland University, Rochester, MI, 1998. 

2. Member of the organizing committee for the 31st Midwest Graph Theory Conference held at Oakland University, Rochester, MI, 1999. 

3. Co-chair of the organizing committee for the 34th Midwest Graph Theory Conference held at Oakland University, Rochester, MI, 2001. 

4. Member of the Local Arrangement Committee of MAA 2004.

5. Co-chair of Applied Mathematics Conference held at Oakland University, Rochester, MI, 2014.

OUSMI: 

1. Associate Director of Oakland University Summer Mathematics Institute (2000–2002). 

Graduate Examinations: 

1. Member of the examination committee for the Ph.D. general examination in discrete mathematics (1998, 2000, 2001, 2002, 2003, 2004, 2005, 2008, 2009, 2011, 2013, 2015, 2016, 2017, 2018, 2019 and 2020). 

2. Member of comprehensive examination committees for 8 masters candidates. Recent candidates include Mr. Grzegorz Koscik and Mr. Mohamad Abdallah. 

3. Member of the Master Committee for Yaling Li (2002), Kaitlin Brown (2018), Abir Aldabbagh (2019), Radhakrishnan Swaminthan (2024). 

Administrative and Service Committees: 

1. Member of Applied Continuous Search Committee (1999–2000). 

2. Member of Undergraduate Committee (1999–2000, 2013–2016). 

3. Putnam Exam Coach (2000–2001). 

4. Member of the Applied Discrete Search Committee (2001–2002). 

5. Co-chair of the Colloquium Committee (2001–2003). 

6. Member of the Committee on Scholarly Activities (2001–2003). 

7. Department Publicity Officer (2001–2003). 

8. Undergraduate Advisor (2002–2003, 2005–2009). 

9. Member of the Ad-hoc Committee on Math Emporium (2002–2003). 

10. Member of the Ad-hoc Committee on Outreach (2002–2003). 

11. Member of calculus textbook subcommittee (2002–2003). 

12. Member of the Applied Discrete Search Committee (2004–2005). 

13. Chair of Computer Committee (2002–2009). 

14. Faculty Advisor of Math Club (2004–2009). 

15. Member of the Applied Discrete Search Committee (2009–2010). 

16. Grader Coordinator (2000–2010, 2021–Present). 

17. Member of the Computer Committee (1997–2010). 

18. Member of the Applied Discrete Search Committee (2010–2011). 

19. Member of the Applied Continuous Search Committee (2011–2012). 

20. Member of the Committee on Graduate Programs (2002–2013). 

21. Chair of the Steering Committee (2010–2013, Winter 2016). 

22. Chair of the Personnel Committee (2010–2013, Winter 2016). 

23. Member of Web Committee (2008–2013). 

24. Member of Applied Continuous Search Committee (2013–2014). 

25. Member of Applied Continuous Search Committee (2015–2016).

26. Chair of Salary Advisory Committee (2010–2013, Winter 2016). 

27. Member of Salary Advisory Committee (2006–2007, 2017–2019). 

28. Chair of Discrete Visiting Assistant Professor Search Committee (Summer 2020).

29. Chair of Discrete Assistant Professor Search Committee (2020–2021).

30. Chair of Discrete Visiting Assistant Professor Search Committee (Summer 2021).

Ph.D. Committees: 

1. Member of the Ph.D. committee for Anuradha Roy (graduated 2002), Thesis Title: Some Contributions to Discrimination and Classification with Repeated Measures Data with Special Emphasis on Biomedical Applications. 

2. Member of the Ph.D. committee for Galbodayage Sujeeva Wijesiri (graduated 2008), Thesis Title: Theta Functions of Algebraic Curves with Automorphisms. 

3. Member of the Ph.D. committee for Jayantha Lanel Gan Hewage (graduated 2009), Thesis Title: Complex Root Isolation. 

4. Member of the Ph.D. committee for Daniel J. Coffield (graduated 2009), Thesis Title: A Model for Single Phase Flow in Horizontally Fractured Porous Media Using Homogemization Techniques. 

5. Member of the Ph.D. committee for Rakinawasan Sanjeeva (graduated 2009), Thesis Title: Automorphism Groups of Algebraic Curves over Finite Fields. 

6. Member of the Ph.D. committee for Susan Toma (graduated 2009), Thesis Title: Facet-Inducing Inequalities of the Convex Hull of Integer Solutions Satisfying the Comb Structure of the Multiple-Alldifferent Predicate. 

7. Member of the Ph.D. committee for Tom Hayman (graduated 2014), Thesis Title: Facet-Inducing Inequalities of the Convex Hull of Integer Solutions of Application-Driven Structures of Multiple All-Different Predicates. 

8. Member of the Ph.D. committee for Kevin Pate (graduated 2016), Thesis Title: Quadratic Homogeneous Keller Maps. 

9. Member of the Ph.D. committee for Amera Almusharrf (graduated 2016), Thesis Title: Delay Differential Equations and the Logistic Model with Two Delays. 

10. Member of the Ph.D. committee for Ryan Nierman (graduated 2017), Thesis Title: Combinatorial Approaches to Continuous Problems. 

11. Member of the Ph.D. committee for Alex Wiggins (graduated 2017), Thesis Title: On the Properties and Behavior of the Condition Number for Linear Programming. 

12. Member of the Ph.D. committee for Nofe Al-asuoad (graduated 2017), Thesis Title: Mathematical Models, Analysis and Simulations in Epidemiology, Population Dynamics, and Heart Tissue. 

13. Member of the Ph.D. committee for Karimah Sweet (graduated 2018), Thesis Title: Small Categories of Homological Dimension One. 

14. Member of the Ph.D. committee for Stephanie Ashburn (graduated 2019), Thesis Title: The Complexity of Building Optimal Expression Directed Acyclic Graphs. 

15. Member of the Ph.D. committee for Josua Illian (graduated 2020), Thesis Title: Grobner Basis for the Double Determinantal Ideal. 

16. Member of the Ph.D. committee for Trinh Tran (graduated 2021), Thesis Title: Unique Solutions to Convex l_1-Optimization Problems via Second-Order Analysis. 

17. Member of the Ph.D. committee for Dinh Dong Pham (graduated 2022), Thesis Title: A Hybridized Discontinuous Galerkin  Scheme for the Coupled Stokes-Darcy Flow and Transport. 

University Service (current) 

1. Member of the Honors College Council Committee (2014–Present).

2. Member of Center of Cybersecurity (2016–Present). 

University Service (past) 

University Committees: 

1. Member of University Academic Computing Committee (1998–2000). 

2. Member of the University Admissions and Financial Aid Committee (2000–2002). 

3. Chair of the University Admissions and Financial Aid Committee (2001–2002). 

4. Member of the Admissions Criteria and Procedures Task Force (2001). 

5. Member of the College of Arts and Sciences Ad-hoc Committee on Information Technology and chair of the software subcommittee (2003). 

6. Member of the Honorary Degree Committee (2002–2005). 

7. Member of the Graduate Studies Committee, CAS (2004–2006). 

8. Chair of the Graduate Studies Committee, CAS (2005–2006). 

9. Member of the Learning Dimension Subcommittee in the Foundations of Excellence (2005–2006). 

10. Member of Faculty Re-employment and Promotion Committee (2008–2011). 

11. Member of Distinguished Professor Advisory Committee (2010). 

12. Member of Kenny Fellowship Committee (2011). 

13. Member of the Advisory Board of The Center for Excellence in Teaching and Learning (2011–2013). 

14. Member of College of Arts and Sciences Dean Search Committee (2013). 

15. Member of Distinguished Professor Advisory Committee (2013). 

16. Member of the Academic Standing and Honors Committee (2005–2009,2011–2015). 

17. Chair of the Academic Standing and Honors Committee (2006–2009, Fall 2011,2012–2015). 

18. Member of Distinguished Professor Advisory Committee (2015). 

19. Member of University Committee on Undergraduate Instruction (Winter 2016). 

20. Member of Camp Issues and Standards Committee (2015–2016). 

21. Member of Strategic Planning Goal 3 Committee (2015–2016). 

22. Member of the College of Arts and Sciences Executive Committee (2013–2017). 

23. Member of Distinguished Professor Advisory Committee (2017). 

24. Member of the Early Alert/Mid-Semester Committee (2014–2017).

25. Member of the College of Arts and Sciences Assembly (2013–2019).

26. Member of University Research Committee (2016–2019).

27. Member of the University Senate (2013–2021).

Ph.D. Committees: 

1. Member of the Engineering Ph.D. committee for Satwant Kaur (graduated 2001), Thesis Title: Enhanced Internet Protocols for Enabling Efficient Mobile Communications. 

2. Member of the Engineering Ph.D. committee for Scott D. James (graduated 2001), Thesis Title: On the Reusability of Basic Data Structures and Algorithms in Commonly Used Modern Programming Languages. 

3. Member of the Engineering Ph.D. committee for Victor Kulesh (graduated 2002), Thesis Title: Event Tracking in Multimedia Environments. 

4. Member of the Engineering Ph.D. committee for Daniela Stan (graduated 2002), Thesis Title: eID: A System for Exploration of Image Databases. 

5. Member of the Engineering Ph.D. committee for Donglin Liu (graduated 2003), Thesis Title: Applied Information-Theoretical Algorithms for Retrieval from Genomic Databases. 

6. Member of the Engineering Ph.D. committee for Jun Tan (graduated 2006), Thesis Title: Applications of Structural Hidden Markov Models. 

7. Member of the Engineering Ph.D. committee for Suryakala Majeti (graduated 2006), Thesis Title: A New Micro Electromechanical Capactive Syrain Sensor. 

8. Member of the Engineering Ph.D. committee for Alex George (graduated 2006), Thesis Title: Analysis of a Highly Available Fault Tolerant Cluster Architecture. 

9. Member of the Engineering Ph.D. committee for Xuan Li (graduated 2007), Thesis Title: Efficient Sharing Analysis for Logic Programs. 

10. Member of the Engineering Ph.D. committee for Donald Kijek (graduated 2007), Thesis Title: Cognitive Inspired Unsupervised Methods to Acquire Linguistic Knowledge from Unlabeled Text. 

11. Member of the Engineering Ph.D. committee for Christopher Gillies (graduated 2013), Thesis Title: Investigating the Efficacy of Incorporating Gene Semantic Similarity into Gene Expression Analysis.

12. Member of the Engineering Ph.D. committee for Mohamed Khalifa (graduated 2022), Thesis Title: Cellular 5G and V2X Antennas Design for Automotive Applications.

Others: 

1. Office hours at the Academic Skill Center (1997–2003). 

2. Panelist at AAUP Promotion Workshop for Tenured Faculty (September 24, 2022).

Professional and Public Service 

• Member of the examination committee of the Michigan Mathematics Prize Competition (2001–2005, 2008–2012, 2013–2017), chair of the committee: 2004–2005, 2011–2012, 2016–2017. 

• Member of the organizing committee of XXXI Midwest Graph Theory Conference 1999. 

• Member of the organizing committee of XXXIV Midwest Graph Theory Conference 2001. 

• Invited minisymposium organizer at 2004 SIAM Conference on Discrete Mathematics, Nashville, TN, 2004. 

• Member of the 2012 International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN) Graphs and Networks Program Area Committee. 

• Member of the Local Arrangement Committee of MAA Michigan 2015. 

• Member of the 2015 Program Committee of the Annual Meeting of the Mathematical Association of America (Michigan Section). 

• Member of The Right Math at the Right Time Task Force 2016–2018. 

• Co-chair of the track Graphs and Interconnection Networks for The 14th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN), 2017. 

• Co-chair of the track Graphs and Interconnection Networks for The 15th International Symposium on Pervasive Systems, Algorithms, and Networks (ISPAN), 2018. 

• Member of the Program Committee of the 27th International Computing and  Combinatorics Conference, 2021.

• Member of the Program Committee of the IEEE International Workshop on Reliability and Security for Multiprocessor Interconnection Networks 2021.

• Member of the Program Committee of the 28th International Computing and  Combinatorics Conference, 2022.

• Member of the Program Committee of the ICS 2022 Workshop on Algorithms, Bioinformatics, and Computation Theory.

• Member of the Program Committee of International Workshop on Combinatorial Algorithms 2023.

• Refereed papers for:

1. Journal of Combinatorial Theory (B) 

2. Networks 

3. Mathematical Programming 

4. Mathematical Programming (B) 

5. SIAM Journal on Optimization 

6. SIAM Journal on Discrete Mathematics 

7. Mathematics of Operations Research 

8. Health Care Management Science 

9. Information Processing Letters 

10. IEEE Transactions on Computers 

11. Computers and Mathematics with Applications 

12. Ars Combinatoria 

13. International Journal of Operations Research 

14. Discrete Mathematics 

15. Discrete Applied Mathematics 

16. Discrete Optimization 

17. Mathematical and Computer Modelling 

18. International Journal of Computer Mathematics 

19. The Open Operational Research Journal 

20. Graphs and Combinatorics 

21. Utilitas Mathematica 

22. Information Sciences 

23. College Mathematics Journal 

24. Discussiones Mathematicae Graph Theory 

25. Rocky Mountain Journal of Mathematics 

26. Bulletin of the Institute of Combinatorics and its Applications 

27. European Journal of Operational Research 

28. Theoretical Computer Science 

29. IEEE Transactions on Parallel and Distributed Systems 

30. International Journal of Parallel, Emergent and Distributed Systems 

31. The Computer Journal 

32. Journal of Computer and System Sciences 

33. Discrete Mathematics & Theoretical Computer Science 

34. Applied Mathematics & Information Sciences 

35. ACM Transactions on Design Automation of Electronic Systems 

36. 2014 International Workshop On Combinatorial Algorithms 

37. Expert Systems with Applications 

38. IEEE Transactions on Cybernetics 

39. Applied Mathematics and Computation 

40. IEEE Transactions on Emerging Topics in Computing 

41. Linear Algebra and its Applications 

42. Journal of Computational Methods in Science and Engineering 

43. International Journal of Foundations of Computer Science 

44. Emergent Computation 

45. IEEE Transactions on Reliability 

46. IEEE Transactions on Dependable and Secure Computing 

47. 2016 IEEE Symposium on Foundations of Computer Science 

48. Engineering Science and Technology, an International Journal 

49. Future Generation Computer Systems 

50. Journal of Combinatorial Optimization 

51. IEEE/ACM Transactions on Computational Biology and Bioinformatics 

52. Journal of Computer Science and Technology 

53. Fundamenta Informaticae 

54. IEEE Access 

55. Optik - International Journal for Light and Electron Optics 

56. International Journal of Computer Mathematics: Computer Systems Theory 

57. Missouri Journal of Mathematics 

58. Journal of Graph Theory 

59. Theory and Applications of Graphs 

60. Microelectronics Journal

61. Discrete Mathematics, Algorithms and Applications

62. Systems Science and Control Engineering

63. Engineering Science and Technology, an International Journal

64. Neurocomputing

65. ISA Transactions

66. Mathematical Methods in the Applied Sciences

67. RAIRO - Operations Research

68. IETE Journal of Research

69. Journal of Parallel and Distributed Computing

70. Mathematical Methods in Applied Sciences

71. Advances in Computational Intelligence

72. Journal of Manufacturing Systems

73. TWMS Journal of Applied and Engineering Mathematics

74. ACM Computing Surveys

75. Aequationes Mathematicae

76. Journal of Mathematical Research with Applications 

77. Algorithmica

78. International Journal of Machine Learning and Cybernetics

79. Knowledge and Information System

80. Journal of Mathematical Research with Applications

81. Acta Informatica

• Reviewed grant proposals for:

1. National Security Agency 

2. The Netherlands Organisation for Scientific Research 

3. Natural Sciences and Engineering Research Council (Canada)

• Reviewed books/book proposals for:

1. John Wiley 

2. Addison Wesley 

3. Prentice Hall 

4. Key College Publishing 

5. McGraw Hill 

6. Cambridge University Press 

7. Jones & Bartlett 

8. Taylor & Francis 

9. Springer 

10. Elsevier

• Reviewed faculty promotion/hiring for:

1. Rice University 

2. Brock University (Canada) 

3. Marshall University 

4. College of William and Mary 

5. Texas State University

6. University of Detroit Mercy

• Reviewer for Mathematical Reviews (over 100 reviews). 

• Grand Awards Judge for Mathematics, 2000 Intel International Science and Engineering Fair. 

• Invited speaker at Dansville High School, Dansville MI (2001). 

• Invited speaker at the Utica Center for Mathematics, Science, and Technology, Sterling Heights, MI (2002). 

• Keynote Speaker of the Initiation Banquet of Kettering University Michigan Epsilon Chapter of Kappa Mu Epsilon National Mathematics Honor Society (2002). 

• Invited speaker the Mobile Mathematics Circle Lectures for high school students, Mobile Alabama (2002). 

• Presenter of awards at the 46th Michigan Mathematics Prize Competition Awards Ceremony (2003). 

• Judge and grader at Math Field Day 2003 at University of Michigan-Flint.

• Presenter of awards at the 47th Michigan Mathematics Prize Competition Awards Ceremony (2004). 

• Judge and grader at Math Field Day 2004 at University of Michigan-Flint.

• Invited speaker at Indus Center for Academic Excellence (2004). 

• Presenter of awards at the 48th Michigan Mathematics Prize Competition Awards Ceremony (2005). 

• Judge and grader at Math Field Day 2005 at University of Michigan-Flint.

• Invited speaker at Renaissance High School, Detroit MI (2005). 

• Keynote Speaker of the Initiation Banquet of Kettering University Michigan Epsilon Chapter of Kappa Mu Epsilon National Mathematics Honor Society (2005). 

• Gave Welcome Address to the 2005 Indus Center for Academic Excellence Awards Ceremony (2005). 

• Judge and grader at Math Field Day 2006 at University of Michigan-Flint.

• Judge and grader at Math Field Day 2007 at University of Michigan-Flint.

• Judge and grader at Math Field Day 2008 at University of Michigan-Flint.

• Chaired a session at The 39th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2008. 

• Chaired a session at The 47th Midwest Graph Theory Conference, Illinois Institute of Technology, Chicago, Illinois, November 2008. 

• Chaired a session at The 40th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2009. 

• Keynote Speaker of the Initiation Banquet of University of Detroit Mercy Chapter of Pi Mu Epsilon National Mathematics Honor Society (2009). 

• Invited speaker at Romeo Engineering & Technology Center, Washington, MI (2009). 

• Judge and grader at Math Field Day 2010 at University of Michigan-Flint.

• Chaired a session at The 41st Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2010. 

• Gave talks to high school students visiting OU (pre-college program), May 2010. 

• Gave welcoming address at Indus Center for Academic Excellence Award Ceremony (2010). 

• Invited speaker at Utica High School, Utica MI (2010). 

• Presenter of Awards at the 54th Michigan Mathematics Prize Competition Award Banquet, 2011. 

• Chaired a session at The 42nd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2011. 

• Chaired a session at The 43rd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2012. 

• Chaired a session at Matching, Matroids, and Extensions A Conference in Honour of Bill Cunningham's 65th Birthday, Waterloo, Ontario 2012. 

• Chaired a session at The 44th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2013. 

• Chaired a session at The 46th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2015. 

• Gave Welcome Address to the 2016 Indus Center for Academic Excellence Awards Ceremony (2016). 

• Chaired a session at The 48th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2017. 

• Judge and grader at Math Field Day 2018 at University of Michigan-Flint.

• Chaired a session at The 50th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2019.

• Judge and grader at Math Field Day 2019 at University of Michigan-Flint.

• Chaired a session at The 51st Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2020. 

• Chaired a session at The 53rd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2022. 

• Other services include

1. conducted Engineer-In-Training review lectures (1998), 

2. volunteer for the Michigan High School Visiting Lecture Program, and

3. participated in Michigan Mathematics Prize Competition grading (1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020).