My Webpage
JIANER CHEN, Professor
Texas A&M University
Texas A&M University
Department of Computer Science & Engineering
Room 102 Peterson Building
College Station, Texas 77843-3112
Contact
Office: Room 428 Peterson Building
Phone: (979) 845-4259
Fax: (979) 847-8578
Email: chen AT cse DOT tamu DOT edu
RESEARCH SUMMARY
Jianer Chen's main research is centered on computer algorithms and their applications. His
current research projects include algorithms and complexity theory, big data, and computer
graphics.
In his research in algorithms and complexity theory, Jianer Chen is most interested in
efficient and effective algorithms for hard optimization problems and their intrinsic
complexity. In big data, he is interested in models and new algorithmic techniques that
handle data sets of extremely large size. In computer graphics, he is working on
topologically robust graphics modeling systems.
Jianer Chen's research has been mainly supported by the National Science Foundation.
EDUCATION
- Ph.D. Mathematics, Columbia University, 1990
- Ph.D. Computer Science, Courant Institute,
New York University, 1987
EXPERIENCE
- Professor, Computer Science and Engineering,
Texas A&M University, 2002-present
- Associate Professor, Computer Science,
Texas A&M University, 1996-2002
- Assistant Professor, Computer Science,
Texas A&M University, 1990-1996
SELECTED HONORS AND AWARDS
- The EATCS-IPEC Nerode Prize,
The European Association for Theoretical Computer Science (EATCS), 2020;
- Graduate Faculty Teaching Excellence Award,
Dept. Computer Science, Texas A&M University, 2002, 2003, 2005, 2006, 2017;
- 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;
- 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.
SELECTED RESEARCH FUNDING
- Topological Graph Theory Revisited: With Applications in
Computer Graphics, NSF, 2009-2012
- Studies on New Algorithmic Techniques for Paramterized Comptuation,
NSF, 2008-2010
- 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
SELECTED PROFESSIONAL ACTIVITIES
- Associate Editor,
Journal of Computer and System Sciences, 2011 - .
- Editorial Board,
Frontiers of Computer Science, 2019 - .
- Associate Editor, IEEE Transactions on Computers, 2009 - 2015.
- Award Committee Chair,
IPEC Nerode Prize, The European Association for Theoretical
Computer Science, 2018
- Deputy Chair of Steering Committee,
The International Frontiers of Algorithmics Workshop (FAW),
2016 - 2021.
- Steering Committee Member,
The International Symposium on Parameterized and Exact Computation
(IPEC), 2003-2012.
- Program Committee co-Chair,
The 16th Annual Conference on Theory and Applications
of Models of Computation (TAMC 2020), 2020.
- Program Committee co-Chair,
The 23rd International Computing and Combinatorics Conference
(COCOON 2017), 2017.
STUDENTS SUPERVISED
PUBLICATIONS
SELECTED RECENT PUBLICATIONS
- "Nearly time-optimal kernelization algorithms for the line-cover problem with big data"
Algorithmica 86, pp. 2448-2478, 2024 (with Q. Huang, I. Kanj, and G. Xia).
- "Space limited linear-time graph algorithms on big data,"
Theoretical Computer Science, 114468, 2024 (with Z. Chu, Y. Guo and W. Yang).
- "Linear-time parameterized algorithms with limited local resources,"
Information and Computation, 104952, 2022 (with Y. Guo and Q. Huang).
- "Near-optimal algorithms for point-line fitting problems,"
Journal of Computational Geometry 13-1, pp. 226-243, 2022 (with Q. Huang, I. Kanj, and G. Xia).
- "Scheduling multiple two-stage flowshops with a deadline,"
Theoretical Computer Science 921, pp. 100-111, 2022
(with M. Huang and Y. Guo).
- "A refined branching algorithm for the maximum satisfiability problem,"
Algorithmica 84-4, pp. 982-1006, 2022
(with W. Li, C. Xu, Y. Yang, and J. Wang).
- "A topologically complete theory of weaving,"
SIAM Journal on Discrete Mathematics 34-4, pp. 2457-2480, 2020
(with E. Akleman, J. Gross, and S. Hu).
- "Cyclic plain-weaving on polygonal mesh surfaces with
graph rotation system,"
ACM Transactions on Graphics 28-3 (SIGGRAPH 2009), 2009,
(with E. Akleman, Q. Xing, and J. Gross).
- "A fixed-parameter algorithm for the directed feedback vertex set problem,"
Journal of the ACM 55(5), 2008
(with Y. Liu, S. Lu, B. O'Sullivan, and I. Razgon).
LINKS IN THEORETICAL COMPUTER SCIENCE