JIANER CHENProfessor and Head of Graduate Admissions
Email: chen@cs.tamu.edu
Ph.D. Mathematics, Columbia University, 1990 RESEARCH INTERESTSJianer Chen's main research is centered on computer algorithms and their applications. His current research projects include exact and parameterized algorithms, computer graphics, computer networks, and computational biology. In his research in algorithms, Jianer Chen is most interested in efficient and effective algorithms for hard optimization problems and their intrinsic complexity. In computer graphics, he is working on topologically robust graphics modeling systems. In computer networks, his main interest is in routing algorithms and fault tolerance for computer networks and sensor networks. In computational biology, his focus is on biological sequence analysis and biological network analysis. Jianer Chen's research has been supported by the National Science Foundation. SELECTED RESEARCH SUPPORT"Secure Aggregation for Large-Scale Wireless Sensor Networks," Texas Higher Education Coordinating Board (Advanced Research Program), May 15, 2006 to May 14, 2008. "Computational Upper and Lower Bounds via Parameterized Complexity," National Science Foundation, Sept. 1 2004 to Aug. 31, 2007. "Exact Computational Biology Algorithms with Small Parameters," National Science Foundation, Sept. 1 2003 to Aug. 31, 2006. "Parameterized Computation and Applications," National Science Foundation, Sept. 1, 2000 to Aug. 31, 2003. "Computational Optimization in Collaboration with Mexican Researchers," National Science Foundation, Sept. 1, 1997 to Jan. 31, 2000. "Applications of Topology to Algorithm Design," Research Initiation Awards, National Science Foundation, Sept. 1991 to Feb. 1994. AWARDS
EXPERIENCE
PROFESSIONAL ACTIVITIES AND SERVICES
SELECTED PUBLICATIONSJ. Chen, A. Jiang, I. Kanj, G. Xia, and F. Zhang, "Separability and Topology Control of Quasi Unit Disk Graphs," 26th Annual IEEE Conference on Computer Communications (IEEE INFOCOM 2007), pp. 2225-2233, 2007 J. Chen, S. Lu, S.-H. Sze, and F. Zhang, "Improved Algorithms for Path, Matching, and Packing Problems," ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 298-307, 2007 J. Chen, H. Fernau, I. Kanj, G. Xia, "Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size," SIAM Journal on Computing 37, pp. 1077-1106, 2007. J. Chen, X. Huang, I.A. Kanj and G. Xia, "Strong Computational Lower Bounds via Parameterized Complexity," Journal of Computer and System Sciences 72, pp. 1346-1367, 2006 (a preliminary version appeared in Proc. 36th ACM Symposium on Theory of Computing (STOC'04), pp. 212-221, 2004). |
