Jianer Chen

Jianer Chen
Name	Jianer Chen
Birth place	China
Fields	Computer science, Bioinformatics, Algorithms
Workplaces	University of Nebraska–Lincoln, University of North Carolina at Charlotte
Alma mater	Peking University, University of Minnesota
Doctoral advisor	Seymour Ginsburg
Known for	Graph algorithms; computational biology; network analysis

Jianer Chen is a computer scientist known for contributions to algorithms, parameterized complexity, and computational biology. His work spans theoretical foundations in graph theory and practical methods applied to genomics and biomedical data analysis. Chen has held faculty positions in American research universities and collaborated across institutions in China and the United States.

Early life and education

Chen was born in China and completed undergraduate studies at Peking University, engaging with communities linked to Tsinghua University and research groups that intersect with national laboratories. He pursued graduate study at the University of Minnesota, where he worked under advisors connected to the broader computational complexity community and the history of theoretical computer science. His doctoral training placed him in networks that included researchers from Stanford University, Massachusetts Institute of Technology, and other leading computer science departments.

Academic career

Chen began his academic appointments at research universities in the United States, including faculty roles at the University of North Carolina at Charlotte and later at the University of Nebraska–Lincoln. During his tenure he taught courses that interfaced with curricula from departments such as Electrical Engineering and Computer Science at MIT and graduate programs associated with Columbia University and Princeton University. He has served on program committees for conferences organized by ACM and IEEE, contributing to venues frequented by scholars from Carnegie Mellon University, California Institute of Technology, and Bell Labs. Chen has supervised doctoral students who later joined faculties at institutions including Purdue University, University of California, Los Angeles, and University of Texas at Austin.

Research contributions

Chen’s research portfolio bridges theoretical computer science and computational biology. In parameterized complexity, his work advanced algorithmic techniques tied to classic problems such as Vertex Cover, Feedback Vertex Set, and variants of Set Cover studied across conferences like STOC and FOCS. He developed fixed-parameter tractable algorithms and kernelization techniques that influenced follow-up work at institutions such as University of Oxford and ETH Zurich.

In graph algorithms, Chen contributed to improved exponential-time algorithms for problems related to Hamiltonian path and network design, aligning with research communities from University of Cambridge and Technion – Israel Institute of Technology. His methods often employed combinatorial bounds and branching strategies connected to results produced at University of Warsaw and TU Munich.

Chen extended algorithmic insights to computational biology and bioinformatics, applying network analysis to problems in genomics and protein–protein interaction networks. Collaborations with researchers affiliated with National Institutes of Health, Broad Institute, and Cold Spring Harbor Laboratory helped translate theoretical techniques into tools for analyzing high-throughput sequencing data and metabolic networks. His interdisciplinary projects intersected with faculty in departments at Harvard University, Yale University, and Johns Hopkins University.

Chen’s work also touched on data mining and machine learning applications for biomedical data, engaging with methods discussed at conferences like NeurIPS and ICML where researchers from Google Research, Facebook AI Research, and Microsoft Research participate. His publications show connections to algorithmic game theory and network science explored by scholars at University of Chicago and New York University.

Awards and honors

Chen’s contributions have been recognized by awards and invited talks at major international conferences. He delivered keynote and invited presentations at meetings organized by SIAM and the American Mathematical Society, and participated in workshops co-sponsored by National Science Foundation and regional academies such as the Chinese Academy of Sciences. His papers received best-paper nominations at venues frequented by researchers from University of British Columbia and McGill University. He has held visiting appointments and fellowships associated with institutes like Microsoft Research and collaborative centers linked to European Research Council grants.

Selected publications

- Chen, J.; coauthors. Algorithms for parameterized problems on graphs and applications to bioinformatics. Proceedings of STOC / FOCS / SODA. - Chen, J.; coauthors. Kernelization results for vertex cover and feedback vertex set with improved bounds. Journal articles and conference proceedings with contributors from INRIA and University of Copenhagen. - Chen, J.; coauthors. Network-based approaches to genomic data integration and analysis. Publications in venues associated with RECOMB and ISMB. - Chen, J.; coauthors. Exact and exponential-time algorithms for combinatorial optimization problems. Articles appearing in collaborations including researchers from University of Illinois Urbana–Champaign and Rice University. - Chen, J.; coauthors. Machine learning pipelines for biomedical network inference. Papers coauthored with groups from Stanford University and UC San Diego.

Category:Chinese computer scientists Category:University of Nebraska–Lincoln faculty Category:Peking University alumni Category:University of Minnesota alumni