Jianer Chen

About

Jianer Chen is a Professor in the Department of Computer Science & Engineering at Texas A&M University. His research interests include algorithms and complexity, computer graphics, bioinformatics, and computer networks. Dr. Chen has received numerous awards, including the AFS Distinguished Faculty Achievement Award at both the university and college levels, the E.D. Brockett Professorship Award, and the Eugene E. Webb '43 Faculty Fellow, among others. He holds a Ph.D. in Mathematics from Columbia University and a Ph.D. in Computer Science from New York University, along with multiple other degrees in Mathematics and Computer Science. His scholarly work involves developing algorithms and computational methods, contributing significantly to theoretical computer science and related fields.

Research topics

• Computer Security
• Computer Science
• Telecommunications
• Computer network
• Psychology
• Neuroscience
• Physics
• Distributed computing
• Medicine
• Physical medicine and rehabilitation

Selected publications

• Linear-time parameterized algorithms with limited local resources

  Information and Computation · 2022-08-28 · 7 citations

  article1st authorCorresponding
  PublisherDOI

• Space limited linear-time graph algorithms on big data

  Theoretical Computer Science · 2024-02-28 · 2 citations

  article1st authorCorresponding
  PublisherDOI

• On optimal streaming kernelization algorithms

  Science China Information Sciences · 2024-07-16 · 2 citations

  articleSenior author
  PublisherDOI

• Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data

  Algorithmica · 2024-05-09

  article1st authorCorresponding
  PublisherDOI

• Projective Holder-Minkowski Colors: A Generalized Set of Commutative & Associative Operations with Inverse Elements for Representing and Manipulating Colors

  arXiv (Cornell University) · 2024-02-03

  preprintOpen accessSenior author

  One of the key problems in dealing with color in rendering, shading, compositing, or image manipulation is that we do not have algebraic structures that support operations over colors. In this paper, we present an all-encompassing framework that can support a set of algebraic structures with associativity, commutativity, and inverse properties. To provide these three properties, we build our algebraic structures on an extension of projective space by allowing for negative and complex numbers. Th…

  PublisherOA PDFDOI

Recent grants

• Studies on New Algorithmic Techniques for Parameterized Computation

  NSF · $150k · 2008–2011

• AF: Small: Topological Graph Theory Revisited: With Applications in Computer Graphics

  NSF · $403k · 2009–2013

• Computational Upper and Lower Bounds via Parameterized Complexity

  NSF · $156k · 2004–2008

Frequent coauthors

• Jianxin Wang

  Central South University

  175 shared

• Iyad Kanj

  58 shared

• Qilong Feng

  47 shared

• Minzhu Xie

  Ministry of Education of the People's Republic of China

  38 shared

• Ergün Akleman

  38 shared

• Guojun Wang

  Taizhou Vocational and Technical College

  38 shared

• Ge Xia

  38 shared

• Chen Song-qiao

  Harbin Institute of Technology

  31 shared

Awards & honors

• AFS Distinguished Faculty Achievement Award (university leve…
• AFS Distinguished Faculty Achievement Award (college level),…
• E.D. Brockett Professorship Award, College of Engineering, T…
• Eugene E. Webb '43 Faculty Fellow, Texas A&M University (200…
• AFS Distinguished Faculty Achievement Award (college level),…

Similar researchers at Texas A&M University

• Thomas R. Ioergerh-60
• Shuiwang Jih-57
• Guofei Guh-47