Qu, Xiaoying
Release time: 2014-01-10     Viewed:
 




Name: Xiaoying Qu

Current position: Lecturer

Contact Information:

School of Mathematical Sciences,

Ocean University of China,

238 Songling Road,

Qingdao, China, 266100

Email: ellenqu@163.com

Office Phone: (86)0532-66787153


Education:


Ph.D. in Combinatorics July 2009

Center for Combinatorics, Nankai University,
M. Sc. in Graph Theory and Combinatorial Optimizations
July 2006

School of Mathematical Science, Shandong Normal University, P. R. China,
B. Sc. in Mathematics and Applied Mathematics
July 2003
School of Mathematical Science, Shandong Normal University, P. R. China


Professional Experience:

2009present: in School of Mathematical Science at Ocean University of China
Current position: Lecturer
Teaching Courses: Linear Algebra, College Mathematics, Advanced Combinatorics, Graph Theory

Research Interests:

Enumeration Combinatorics

Graph Theory and its Applications

Grants:

1.National Natural Science Foundation of China (Tianyuan fund for Mathematics, No.11126088), Some studies about the uniform distribution and the enumeration of lattice paths. 2012.1-2012.12

2.The Fundamental Research Funds for the Central Universities(No.201013044), Some research on the uniform distribution of several lattice paths. 2010.7-2012.10

Selected Publications:

1. William Y.C. Chen,Sabrina X.M.Pang,and Ellen X.Y. Qu, Partially 2-colored permutations and the Boros-Moll polynomials, the Ramanujan Journal, Vol.27(2012), pp. 297-304.

2. William Y.C. Chen,Sabrina X.M.Pang,and Ellen X.Y. Qu, On the combinatorics of the Boros-Moll polynomials, the Ramanujan Journal, Vol.21(2010)pp. 41-51.

3. William Y.C. Chen, Sabrina X.M. Pang, Ellen X.Y. Qu, and Richard P. Stanley,Pairs of noncrossing free Dyck paths and noncrossing partitions, Discrete Mathematics, Vol. 309(2009), pp. 2834-2838.

4.Ellen X.Y. Qu and Jianglu Wang, Vertex pancyclicity in Quasi-claw-free graphs, Discrete Mathematics, Vol. 309(2009), pp. 1135-1141.

5.Ellen X.Y. Qu and Houyuan Lin, Quasilocally connected, almost locally connected or triangularly connected claw-free graphs,  Lecture Notes in Computer Science, Vol. 4381(2007), pp.162-165.