Chen, Jianer individual record
Professor - Term Appointment

Dr. 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.

education and training
selected publications
Academic Articles201
  • Wu, G., Chen, J., & Wang, J. (2020). On scheduling multiple two-stage flowshops. Theoretical Computer Science. 818, 74-82.
    doi badge
  • Wu, G., Chen, J., & Wang, J. (2020). Improved approximation algorithms for two-stage flowshops scheduling problem. THEORETICAL COMPUTER SCIENCE. 806, 509-515.
    doi badge
  • Wu, G., Chen, J., & Wang, J. (2019). On scheduling inclined jobs on multiple two-stage flowshops. Theoretical Computer Science. 786, 67-77.
    doi badge
  • Xu, C., Chen, J., & Wang, J. (2019). Resolution and linear CNF formulas: Improved (n, 3)-MAxSAT algorithms. THEORETICAL COMPUTER SCIENCE. 774, 113-123.
    doi badge
  • Lin, M., Feng, Q., Wang, J., Chen, J., Fu, B., & Li, W. (2018). An improved FPT algorithm for Almost Forest Deletion problem. INFORMATION PROCESSING LETTERS. 136, 30-36.
    doi badge
  • Chen, J., Wang, J., & Zelikovsky, A. (2011). Bioinformatics Research and Applications. Springer Berlin Heidelberg.
    doi badge
  • Chen, J., & Fomin, F. (2009). Parameterized and Exact Computation: Preface.
  • Chen, J., & Xia, G. e. (2013). Complexity Issues on PTAS. Handbook of Combinatorial Optimization. 723-746. Springer New York.
    doi badge
  • Chen, J. (2009). Maximum Partition MatchingMaximum partition matching. Floudas, C. A., & Pardalos, P. M. (Eds.), Encyclopedia of Optimization. 2029-2035. Springer Nature.
    doi badge online source badge
Conference Papers192
  • Chen, J., & Wang, T. (2018). Probabilistic Analysis on Mesh Network Fault Tolerance.. International Conference on Parallel and Distributed Computing Systems, PDCS 2002, November 4-6, 2002, Cambridge, USA. 601-606.
  • Wu, G., Chen, J., & Wang, J. (2017). On Approximation Algorithms for Two-Stage Scheduling Problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Frontiers in Algorithmics - 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings. 10336, 241-253.
    doi badge
  • Li, W., Cao, Y., Chen, J., & Wang, J. (2017). Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree. INFORMATION AND COMPUTATION. 252, 187-200.
    doi badge
  • Huang, J., Wang, J., Zhang, T., Chen, J., & Pan, Y. i. (2016). Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Data Center. PROCEEDINGS 2016 IEEE 36TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS ICDCS 2016, 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS). 2016-August, 98-107.
    doi badge
chaired theses and dissertations
First Name
Last Name
mailing address
Texas A&M University; Computer Science & Engineering; 3112 TAMU
College Station, TX 77843-3112