2014 - ACM Distinguished Member
His primary areas of investigation include Combinatorics, Discrete mathematics, Vertex cover, Parameterized complexity and Algorithm. His work in Combinatorics addresses issues such as Upper and lower bounds, which are connected to fields such as Amortized analysis. His Discrete mathematics research incorporates elements of Optimization problem, Exact algorithm and Set packing.
His Vertex cover research integrates issues from Edge cover and Vertex. His Parameterized complexity research incorporates themes from Computational complexity theory, Complexity class and Minimum cut. His Algorithm research is multidisciplinary, incorporating elements of Interaction network, Cluster analysis and Identification.
Jianer Chen mainly investigates Combinatorics, Discrete mathematics, Algorithm, Parameterized complexity and Vertex cover. His Combinatorics research focuses on Feedback vertex set, Approximation algorithm, Parameterized algorithms, Time complexity and Graph. His work carried out in the field of Discrete mathematics brings together such families of science as Computational complexity theory, Upper and lower bounds and Bounded function.
The concepts of his Algorithm study are interwoven with issues in Set and Degree. His Parameterized complexity research incorporates elements of Randomized algorithm, Theoretical computer science and Packing problems. His study focuses on the intersection of Vertex cover and fields such as Independent set with connections in the field of Dominating set.
His main research concerns Combinatorics, Discrete mathematics, Algorithm, Parameterized complexity and Approximation algorithm. His research integrates issues of Binary number and Phylogenetic tree in his study of Combinatorics. Discrete mathematics is closely attributed to Matching in his research.
Jianer Chen combines subjects such as Degree and Resolution with his study of Algorithm. His Parameterized complexity study combines topics in areas such as Open problem, Set, Bounded function, Theory of computation and Tree rearrangement. The various areas that Jianer Chen examines in his Vertex cover study include Feedback vertex set and Neighbourhood.
Jianer Chen mainly investigates Combinatorics, Discrete mathematics, Algorithm, Parameterized complexity and Parameterized algorithms. His biological study spans a wide range of topics, including k-minimum spanning tree, Bounded function and Theory of computation. His Algorithm research is multidisciplinary, relying on both Graph and Graph algorithms.
His research in Parameterized complexity intersects with topics in Wireless sensor network and Computational geometry. His Parameterized algorithms study combines topics from a wide range of disciplines, such as Perspective, Binary number and Phylogenetic tree. His Spanning tree research includes themes of Mathematical optimization and Approximation algorithm.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Privacy-preserving data mining
Wei Zhao;Jianer Chen;Nan Zhang.
(2006)
Vertex Cover
Jianer Chen;Iyad A. Kanj;Weijia Jia.
Journal of Algorithms (2001)
Vertex Cover
Jianer Chen;Iyad A. Kanj;Weijia Jia.
Journal of Algorithms (2001)
Improved upper bounds for vertex cover
Jianer Chen;Iyad A. Kanj;Ge Xia.
Theoretical Computer Science (2010)
Improved upper bounds for vertex cover
Jianer Chen;Iyad A. Kanj;Ge Xia.
Theoretical Computer Science (2010)
A fixed-parameter algorithm for the directed feedback vertex set problem
Jianer Chen;Yang Liu;Songjian Lu;Barry O'Sullivan.
symposium on the theory of computing (2008)
A fixed-parameter algorithm for the directed feedback vertex set problem
Jianer Chen;Yang Liu;Songjian Lu;Barry O'sullivan.
Journal of the ACM (2008)
A fixed-parameter algorithm for the directed feedback vertex set problem
Jianer Chen;Yang Liu;Songjian Lu;Barry O'sullivan.
Journal of the ACM (2008)
Strong computational lower bounds via parameterized complexity
Jianer Chen;Xiuzhen Huang;Iyad A. Kanj;Ge Xia.
Journal of Computer and System Sciences (2006)
Strong computational lower bounds via parameterized complexity
Jianer Chen;Xiuzhen Huang;Iyad A. Kanj;Ge Xia.
Journal of Computer and System Sciences (2006)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Central South University
Guangzhou University
Shandong University
Beijing Normal University
Central South University
University of Bergen
Shenzhen Institutes of Advanced Technology
University of Bergen
Victoria University of Wellington
University of Exeter
Simon Fraser University
Arizona State University
University of Memphis
Beijing University of Posts and Telecommunications
Complutense University of Madrid
Federal University of Rio Grande do Sul
Buck Institute for Research on Aging
Louisiana State University Agricultural Center
Technical University of Kaiserslautern
Colorado College
University of Georgia
Institute of Arctic and Alpine Research
University of Washington
Pontifical Catholic University of Rio Grande do Sul
University of Rochester Medical Center
Deakin University