Curriculum Vitae

J IANER CHEN
PROFESSOR of COMPUTER SCIENCE

EDUCATION

EXPERIENCE:

SELECTED HONORS AND AWARDS:

AFS Distinguished Faculty Achievement Award (university level), Texas A&M University, 2007;
AFS Distinguished Faculty Achievement Award (college level), Texas A&M University, 2006;
E.D. Brockett Professorship Award, College of Engineering, Texas A&M University, 2005;
Eugene E. Webb'43 Faculty Fellow, College of Engineering, Texas A&M University, 2003;
Graduate Teaching Excellence Awards, Department of Computer Science, Texas A&M University, 2002, 2003, 2005, 2006;
AFS Distinguished Faculty Achievement Award (college level), Texas A&M University, 1998;
Amoco Faculty Award for Teaching Excellence, Texas A&M University, 1998;
TEES Select Young Faculty Award, Texas A&M University, 1993;
Research Initiation Award, The National Science Foundation, 1991;
Janet Fabri Award, for the Best Ph.D. Dissertation, New York University, 1988;
First Place, in Province-Wide Mathematics Competition, Hunan, P.R. China, 1980.

RESEARCH INTERESTS:

SELECTED RESEARCH FUNDING:

Computational Upper and Lower Bounds via Parameterized Complexity, NSF, 2004-2007
Exact Computational Biology Algorithms with Small Parameters, NSF, 2003-2006
Parameterized Computation and Applications, NSF, 2000--2003
Computational Optimization in Collaboration with Mexican Researchers, NSF, 1997--2000
Applications of Topology to Algorithm Design, Research Initiation Awards, NSF, 1991--1994

RECENT PROFESSIONAL ACTIVITIES:

Guest Editor, Special Issue on Exact and Parameterized Computation, Algorithmica, to appear.
Guest Editor, Special Issue on Discrete Mathematics and Theoretical Computer Science, Discrete Applied Mathematics, 2004.
Guest Editor, Special Issue on Parameterized Computation and Complexity, Journal of Computer and System Sciences, 2003.
Program Committee Member, The 7th IEEE International Conference on Algorithms and Architecture for Parallel Processing (ICA3PP'2007).
Program Committee Member, The 32nd International Workshop on Graph-Theoretical Concepts in Computer Science (WG 2006).
Program Committee Member, The 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM 2006).
Program Committee Member, The 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005).
Steering Committee Member, The International Workshop on Parameterized and Exact Computation (IWPEC), 2003 to present
Member: ACM and SIAM

STUDENTS SUPERVISED:

NUMBER OF PUBLICATIONS:

SELECTED RECENT PUBLICATIONS

Computational Complexity and Optimization

"Improved algorithms for path, matching, and packing problems," Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 298-307, 2007 (with S. Lu, S.-H. Sze, and F. Zhang).
"Strong computational lower bounds via parameterized complexity," Journal of Computer and System Sciences 72, pp. 1346-1367, 2006 (preliminary version appeared in Proc. 36th STOC) (with X. Huang, I. A.Kanj, and G. Xia).
"Tight lower bounds for certain parameterized NP-hard problems," Information and Computation 201, pp. 216-231, 2005 (with B. Chor, M. Fellows, X. Huang, D. Juedes, I. Kanj, and G. Xia).
"Using nondeterminism to design efficient deterministic algorithms," Algorithmica 40, pp. 83-97, 2004 (with D. Friesen, W. Jia, and I. Kanj).
"A polynomial time approximation scheme for general multiprocessor job scheduling," SIAM Journal on Computing 31, pp. 1-17, 2001 (preliminary version appeared in Proc. 31st STOC) (with A. Miranda).
"Tight bound on Johnson's algorithm for MAXSAT," Journal of Computer and System Sciences 58, pp. 622-640, 1999 (with D. Friesen and H. Zheng).
"The maximum partition matching problem with applications," SIAM Journal on Computing 28, pp. 935-954, 1999 (with C. C. Chen).

Graph Theory and Algorithms

"A fixed-parameter algorithm for the directed feedback vertex set problem," Proc. 40th ACM Symp. on Theory of Computing (STOC 2008), accepted (with Y. Liu, S. Lu, B. O'Sullivan, and I. Razgon).
"Parametric duality and kernelization: lower bounds and upper bounds on kernel size," SIAM Journal on Computing 37, pp. 1077-1106, 2007 (preliminary version appeared in Proc. 22nd STACS) (with H. Fernau, I. Kanj, and G. Xia).
"Genus characterizes the complexity of certain graph problems: some tight results," Journal of Computer and System Sciences 73, pp. 892-907, 2007 (preliminary version appeard in Proc. 30th ICALP) (with I. Kanj, L., Perkovic, E., Sedgwick, and G. Xia)
"Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms," Journal of Computer and System Sciences 67, pp. 833-847, 2003 (with I. Kanj).
"On strong Menger-connectivity of star graphs," Discrete Applied Mathematics 129, pp. 499-511, 2003 (with E. Oh).
"Vertex cover: further observations and further improvements," Journal of Algorithms 41, pp. 280-301, 2001 (with I. Kanj and W. Jia).

Computer Networks

"Robust planarization of unlocalized wireless sensor networks," Proc. IEEE INFOCOM 2008, to appear (with F. Zhang and A. Jiang).
"Separability and topology control of quasi unit disk graphs," Proc. IEEE INFOCOM 2007, pp. 2225-2233, 2007 (with A. Jiang, I. Kanj, G. Xia, and F. Zhang).
"Face tracing based geographic routing in nonplanar wireless networks," Proc. IEEE INFOCOM 2007, pp. 2243-2251, 2007 (with F. Zhang, H. Li, A. Jiang, and P. Luo).
"Probabilistic analysis on mesh network fault tolerance," Journal of Parallel and Distributed Computing, pp. 100-110, 2006 (with G. Wang, G., C. Lin, T. Wang, and G. Wang).
"The cost of becoming anonymous: on the participant payload in Crowds," Information Processing Letters 90, pp. 81-86, 2004 (with H. Sui, J. Wang, and S. Chen).
"Locally subcube-connected hypercube networks: theoretical analysis and experimental results," The IEEE Transactions on Computers 51, pp. 530-540, 2002 (with G. Wang and S. Chen).

Computer Graphics

"Regular mesh construction algorithms using regular handles," Proc. IEEE International Conference on Shape Modeling and Applications (SMI'06), pp. 171-181, 2006 (with E. Akleman).
"Regular meshes," Proc. of the 2005 ACM Symposium on Solid and Physical Modeling (SPM 2005), pp. 213-219, 2005 (with E. Akleman).
A minimal and complete set of operators for the development of robust manifold mesh modelers," Graphical Models 65, pp. 286-304, 2003 (with E. Akleman and V. Srinivasan).
A prototype system for robust, interactive, and user-friendly modeling of orientable 2-manifold meshes," Proc. of International Conference on Shape Modeling and Applications (SM'02), pp. 43-50, 2002 (with E. Akleman and V. Srinivasan).
A new corner cutting scheme with tension and handle-face reconstruction," The International Journal of Shape Modeling 7, pp. 111-128, 2001 (with E. Akleman, F. Eryoldas, and V. Srinivasan).
Guaranteeing the 2-manifold property for meshes with doubly linked face list," The International Journal of Shape Modeling 5, pp. 159-177, 2000 (with E. Akleman).

Publication Details