Tape Reversal and Parallel Time. - Jianer Chen (1987)

The Difference Between one Tape and two Tapes: with Respect to Reversal Complexity. - Jianer Chen (Theor. Comput. Sci., 1990)

On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract) - Arkady Kanevsky; Roberto Tamassia; Giuseppe Di Battista; Jianer Chen (FOCS, 1991)

Characterizing Parallel Hierarchies by Reducibilities. - Jianer Chen (Inf. Process. Lett., 1991)

An NL Hierarchy. - Jianer Chen; Jim Cox; Bud Mishra (Inf. Process. Lett., 1991)

Reversal Complexity. - Jianer Chen; Chee-Keng Yap (SIAM J. Comput., 1991)

On Assembly of Four-Connected Graphs (Extended Abstract). - Jianer Chen; Arkady Kanevsky (WG, 1992)

Limit points for average genus II. 2-Connected non-simplicial graphs. - Jianer Chen; Jonathan L. Gross (J. Comb. Theory B, 1992)

Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs. - Jianer Chen; Jonathan L. Gross (J. Comb. Theory B, 1992)

On Fixed-Parameter Tractability and Approximability of NP-Hard Optimization Problems. - Liming Cai; Jianer Chen (ISTCS, 1993)

On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract). - Liming Cai; Jianer Chen (MFCS, 1993)

On the Complexity of Graph Embeddings (Extended Abstract). - Jianer Chen; Saroja P. Kanchi; Arkady Kanevsky (WADS, 1993)

Graph Ear Decompositions and Graph Embeddings (Extended Abstract). - Jianer Chen; Saroja P. Kanchi (WG, 1993)

Kuratowski-Type Theorems for Average Genus. - Jianer Chen; Jonathan L. Gross (J. Comb. Theory B, 1993)

On the Structure of Parameterized Problems in NP (Extended Abstract). - Liming Cai; Jianer Chen; Rodney G. Downey; Michael R. Fellows (STACS, 1994)

Overlap matrices and total imbedding distributions. - Jianer Chen; Jonathan L. Gross; Robert G. Rieper (Discret. Math., 1994)

A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. - Jianer Chen (SIAM J. Discret. Math., 1994)

On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract). - Liming Cai; Jianer Chen (COCOON, 1995)

Algorithmic Graph Embeddings (Extended Abstract). - Jianer Chen (COCOON, 1995)

On the Structure of Parameterized Problems in NP. - Liming Cai; Jianer Chen; Rodney G. Downey; Michael R. Fellows (Inf. Comput., 1995)

Lower bounds for the average genus. - Jianer Chen; Jonathan L. Gross; Robert G. Rieper (J. Graph Theory, 1995)

On Input Read-Modes of Alternating Turing Machines. - Liming Cai; Jianer Chen (Theor. Comput. Sci., 1995)

Optimal Parallel Routing in Star Graphs. - Chi-Chang Chen; Jianer Chen (WG, 1996)

Maximum genus and connectivity. - Jianer Chen; Dan Archdeacon; Jonathan L. Gross (Discret. Math., 1996)

A tight lower bound on the maximum genus of a simplicial graph. - Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross (Discret. Math., 1996)

Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings. - Jonathan L. Gross; Jianer Chen (Math. Syst. Theory, 1996)

Tight Bound on Johnson's Algoritihm for Max-SAT. - Jianer Chen; Donald K. Friesen; Hao Zheng (CCC, 1997)

On the parameterized complexity of short computation and factorization. - Liming Cai; Jianer Chen; Rodney G. Downey; Michael R. Fellows (Arch. Math. Log., 1997)

Advice Classes of Parameterized Tractability. - Liming Cai; Jianer Chen; Rodney G. Downey; Michael R. Fellows (Ann. Pure Appl. Log., 1997)

A Note on Approximating Graph Genus. - Jianer Chen; Saroja P. Kanchi; Arkady Kanevsky (Inf. Process. Lett., 1997)

On Fixed-Parameter Tractability and Approximability of NP Optimization Problems. - Liming Cai; Jianer Chen (J. Comput. Syst. Sci., 1997)

On the Amount of Nondeterminism and the Power of Verifying. - Liming Cai; Jianer Chen (SIAM J. Comput., 1997)

Optimal Parallel Routing in Star Networks. - Chi-Chang Chen; Jianer Chen (IEEE Trans. Computers, 1997)

Algorithmic Graph Embeddings. - Jianer Chen (Theor. Comput. Sci., 1997)

Nearly Optimal One-to-Many Parallel Routing in Star Networks. - Chi-Chang Chen; Jianer Chen (IEEE Trans. Parallel Distributed Syst., 1997)

Circuit Bottom Fan-In and Computational Power. - Liming Cai; Jianer Chen; Johan Håstad (SIAM J. Comput., 1998)

Guaranteeing 2-Manifold Property for Meshes. - Ergun Akleman; Jianer Chen (Shape Modeling International, 1999)

Generalized Distance Functions. - Ergun Akleman; Jianer Chen (Shape Modeling International, 1999)

A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (Extended Abstract). - Jianer Chen; Antonio Miranda (STOC, 1999)

Guaranteeing the 2-Manifold Property for Meshes with doubly Linked Face List. - Ergun Akleman; Jianer Chen (Int. J. Shape Model., 1999)

Tight Bound on Johnson's Algorithm for Maximum Satisfiability. - Jianer Chen; Donald K. Friesen; Hao Zheng (J. Comput. Syst. Sci., 1999)

The Maximum Partition Matching Problem with Applications. - Chi-Chang Chen; Jianer Chen (SIAM J. Comput., 1999)

Graph Ear Decompositions and Graph Embeddings. - Jianer Chen; Saroja P. Kanchi (SIAM J. Discret. Math., 1999)

Information Structures. - Charles H. Goldberg; Jianer Chen; Viera Krnanová Proulx; Joan Feigenbaum; Sampath Kannan (Handbook of Discrete and Combinatorial Mathematics, 1999)

Discrete And Computational Geometry. - Ileana Streinu; Károly Bezdek; János Pach; Tamal K. Dey; Jianer Chen; Dina Kravets; Nancy M. Amato; W. Randolph Franklin (Handbook of Discrete and Combinatorial Mathematics, 1999)

Utilization-Based Admission Control for Real-Time Applications. - Dong Xuan; Chengzhi Li; Riccardo Bettati; Jianer Chen; Wei Zhao 001 (ICPP, 2000)

An Intuitive and Effective New Representation for Interconnection Network Structures. - Jianer Chen; Lihua Liu; Songqiao Chen; Weijia Jia 001 (ISAAC, 2000)

A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors. - Jingui Huang; Jianer Chen; Songqiao Chen (ISAAC, 2000)

Web-based intuitive and effective design of symmetric tiles. - Ergun Akleman; Jianer Chen; Burak Meric (ACM Multimedia Workshops, 2000)

A New Paradigm for Changing Topology during Subdivision Modeling. - Ergun Akleman; Vinod Srinivasan; Jianer Chen (PG, 2000)

Improvement on vertex cover for low-degree graphs. - Jianer Chen; Lihua Liu; Weijia Jia 001 (Networks, 2000)

Using Nondeterminism to Design Deterministic Algorithms. - Jianer Chen; Donald K. Friesen; Weijia Jia 001; Iyad A. Kanj (FSTTCS, 2001)

Strong Fault-Tolerance: Parallel Routing in Networks with Faults. - Jianer Chen; Eunseuk Oh (International Conference on Computational Science (2), 2001)

Parallel Routing in Hypercube Networks with Faulty Nodes. - Eunseuk Oh; Jianer Chen (ICPADS, 2001)

Semi-normal Schedulings: Improvement on Goemans' Algorithm. - Jianer Chen; Jingui Huang (ISAAC, 2001)

Handle and Hole Improvement by Using New Corner Cutting Subdivision Scheme with Tension. - Ergun Akleman; Jianer Chen; Fusun Eryoldas; Vinod Srinivasan (Shape Modeling International, 2001)

On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. - Jianer Chen; Iyad A. Kanj (WG, 2001)

A New Corner cutting Scheme with tension and Handle-Face Reconstruction. - Ergun Akleman; Jianer Chen; Vinod Srinivasan; Fusun Eryoldas (Int. J. Shape Model., 2001)

Vertex Cover: Further Observations and Further Improvements. - Jianer Chen; Iyad A. Kanj; Weijia Jia 001 (J. Algorithms, 2001)

Routing in Hypercube Networks with a Constant Fraction of Faulty Nodes. - Jianer Chen; Guojun Wang 001; Songqiao Chen (J. Interconnect. Networks, 2001)

A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling. - Jianer Chen; Antonio Miranda (SIAM J. Comput., 2001)

On the Approximability of Multiprocessor Task Scheduling Problems. - Antonio Miranda; Luz Torres; Jianer Chen (ISAAC, 2002)

Improved Exact Algorithms for MAX-SAT. - Jianer Chen; Iyad A. Kanj (LATIN, 2002)

Probabilistic Analysis on Mesh Network Fault Tolerance. - Jianer Chen; Tao Wang (IASTED PDCS, 2002)

Two Methods for Creating Chinese Painting. - Ching (Clara) Chan; Ergun Akleman; Jianer Chen (PG, 2002)

Interactive Construction of Multi-Segment Curved Handles . - Vinod Srinivasan; Ergun Akleman; Jianer Chen (PG, 2002)

A Prototype System for Robust, Interactive and User-Friendly Modeling of Orientable 2-Manifold Meshes. - Ergun Akleman; Jianer Chen; Vinod Srinivasan (Shape Modeling International, 2002)

A note on practical construction of maximum bandwidth paths. - Navneet Malpani; Jianer Chen (Inf. Process. Lett., 2002)

An Effective Randomized QoS Routing Algorithm on Networks with Inaccurate Parameters. - Jianxin Wang 001; Jianer Chen; Songqiao Chen (J. Comput. Sci. Technol., 2002)

Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results. - Jianer Chen; Guojun Wang 001; Songqiao Chen (IEEE Trans. Computers, 2002)

Topological Graph Theory. - Tomaz Pisanski; Primoz Potocnik; Jianer Chen; Jonathan L. Gross; Thomas W. Tucker; Andrew Vince; Dan Archdeacon; Seiya Negami; Arthur T. White (Handbook of Graph Theory, 2003)

Probability Model for Faults in Large-Scale Multicomputer Systems. - Gaocai Wang; Jianer Chen; Guojun Wang 001; Songqiao Chen (Asian Test Symposium, 2003)

Genus Characterizes the Complexity of Graph Problems: Some Tight Results. - Jianer Chen; Iyad A. Kanj; Ljubomir Perkovic; Eric Sedgwick; Ge Xia (ICALP, 2003)

An analysis of forwarding mechanism in crowds. - Hongfei Sui; Jianxin Wang 001; Jianer Chen; Songqiao Chen (ICC, 2003)

A Probabilistic Approach to Fault Tolerant Broadcast Routing Algorithms on Mesh Networks. - GaoCai Wang; Jianer Chen; Guojun Wang 001 (IPDPS, 2003)

Payload analysis of anonymous communication system with host-based rerouting mechanism. - Hongfei Sui; Jianer Chen; Songqiao Chen; Jianxin Wang 001 (ISCC, 2003)

Probabilistic Analysis of Connectivity on Mesh Networks. - GaoCai Wang; Jianer Chen; Guojun Wang 001 (ITCC, 2003)

A New Fault-Tolerant Multicast Communication in Multicomputers. - Gaocai Wang; Jianer Chen (PDPTA, 2003)

Some results on the minimal coverings of precomplete classes in partial K-valued logic functions. - Robin Liu; Jianer Chen; Songqiao Chen (SMC, 2003)

Interactive Rind Modeling. - Ergun Akleman; Vinod Srinivasan; Jianer Chen (Shape Modeling International, 2003)

A minimal and complete set of operators for the development of robust manifold mesh modelers. - Ergun Akleman; Jianer Chen; Vinod Srinivasan (Graph. Model., 2003)

On strong Menger-connectivity of star graphs. - Eunseuk Oh; Jianer Chen (Discret. Appl. Math., 2003)

Foreword from the guest editors. - Jianer Chen; Michael R. Fellows (J. Comput. Syst. Sci., 2003)

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. - Jianer Chen; Iyad A. Kanj (J. Comput. Syst. Sci., 2003)

Strong Fault-Tolerance: Parallel Routing in Star Networks with Faults. - Eunseuk Oh; Jianer Chen (J. Interconnect. Networks, 2003)

Cardinality-based inference control in OLAP systems: an information theoretic approach. - Nan Zhang 004; Wei Zhao 001; Jianer Chen (DOLAP, 2004)

Performance analysis of distributed adaptive routing algorithm. - Gaocai Wang; Taoshen Li; Jianer Chen (ICARCV, 2004)

A Probabilistic Approach to Fault-Tolerant Routing Algorithm on Mesh Networks. - Gaocai Wang; Taoshen Li; Jianer Chen (ICPADS, 2004)

Fault Tolerant Routing Algorithm in Hypercube Networks with Load Balancing Support. - Xiaolin Xiao; Guojun Wang 001; Jianer Chen (ISPA, 2004)

Some results on the simply separable function sets in partial k-valued logic. - Renren Liu; Ting Wang; Jianer Chen; Songqiao Chen (SMC (2), 2004)

Linear FPT reductions and computational lower bounds. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (STOC, 2004)

Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding. - Sing-Hoi Sze; Songjian Lu; Jianer Chen (WABI, 2004)

Using Nondeterminism to Design Efficient Deterministic Algorithms. - Jianer Chen; Donald K. Friesen; Weijia Jia 001; Iyad A. Kanj (Algorithmica, 2004)

Improved exact algorithms for MAX-SAT. - Jianer Chen; Iyad A. Kanj (Discret. Appl. Math., 2004)

Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS). - Jianer Chen; Yanpei Liu; Suowang Chen; Songqiao Chen (Discret. Appl. Math., 2004)

On the construction of most reliable networks. - Hanyuan Deng; Jianer Chen; Qiaoliang Li; Rongheng Li; Qiju Gao (Discret. Appl. Math., 2004)

The cost of becoming anonymous: on the participant payload in Crowds. - Hongfei Sui; Jianxin Wang 001; Jianer Chen; Songqiao Chen (Inf. Process. Lett., 2004)

An efficient parameterized algorithm for m-set packing. - Weijia Jia 001; Chuanlin Zhang; Jianer Chen (J. Algorithms, 2004)

On Fault Tolerance of 3-Dimensional Mesh Networks. - Gao-Cai Wang; Jianer Chen; Guo-Jun Wang 001 (J. Comput. Sci. Technol., 2004)

On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4]. - Jianer Chen; Fenghui Zhang (AAIM, 2005)

W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (COCOON, 2005)

SAS: A Scalar Anonymous Communication System. - Hongyun Xu; Xinwen Fu; Ye Zhu 001; Riccardo Bettati; Jianer Chen; Wei Zhao 001 (ICCNMC, 2005)

PFED: A Prediction-Based Fair Active Queue Management Algorithm. - Wenyu Gao; Jianxin Wang 001; Jianer Chen; Songqiao Chen (ICPP, 2005)

A Distributed Algorithm based on Probability for Refining Energy-Efficiency of Multicast Trees in Ad Hoc Networks. - Yuhong Luo; Jianxin Wang 001; Jianer Chen; Songqiao Chen (LCN, 2005)

Performance Measurements for Privacy Preserving Data Mining. - Nan Zhang 004; Wei Zhao 001; Jianer Chen (PAKDD, 2005)

Regular meshes. - Ergun Akleman; Jianer Chen (Symposium on Solid and Physical Modeling, 2005)

Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. - Jianer Chen; Iyad A. Kanj; Ge Xia (Algorithmica, 2005)

Tight lower bounds for certain parameterized NP-hard problems. - Jianer Chen; Benny Chor; Mike Fellows; Xiuzhen Huang; David W. Juedes; Iyad A. Kanj; Ge Xia (Inf. Comput., 2005)

Hypercube Network Fault Tolerance: A Probabilistic Approach. - Jianer Chen; Iyad A. Kanj; Guojun Wang 001 (J. Interconnect. Networks, 2005)

On approximating minimum vertex cover for graphs with perfect matching. - Jianer Chen; Iyad A. Kanj (Theor. Comput. Sci., 2005)

Link Availability at Any Time in MANET. - Jianxin Wang 001; Xianman Zhu; Jianer Chen (ADHOC-NOW, 2006)

Research on Multi-valued and Multi-labeled Decision Trees. - Hong Li; Rui Zhao; Jianer Chen; Yao Xiang (ADMA, 2006)

Insight for Practical Subdivision Modeling with Discrete Gauss-Bonnet Theorem. - Ergun Akleman; Jianer Chen (GMP, 2006)

A Prediction-Based AQM Algorithm for DiffServ Networks. - Jianxin Wang 001; Donglei Chen; Jianer Chen (ICON, 2006)

On PTAS for Planar Graph Problems. - Xiuzhen Huang; Jianer Chen (IFIP TCS, 2006)

On the Effective Enumerability of NP Problems. - Jianer Chen; Iyad A. Kanj; Jie Meng; Ge Xia; Fenghui Zhang (IWPEC, 2006)

Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms. - Yang Liu 002; Songjian Lu; Jianer Chen; Sing-Hoi Sze (IWPEC, 2006)

Improved Parameterized Upper Bounds for Vertex Cover. - Jianer Chen; Iyad A. Kanj; Ge Xia (MFCS, 2006)

Regular Mesh Construction Algorithms using Regular Handles. - Ergun Akleman; Jianer Chen (SMI, 2006)

On the computational hardness based on linear FPT-reductions. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (J. Comb. Optim., 2006)

Strong computational lower bounds via parameterized complexity. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (J. Comput. Syst. Sci., 2006)

On product covering in 3-tier supply chain models: Natural complete problems for W[3] and W[4]. - Jianer Chen; Fenghui Zhang (Theor. Comput. Sci., 2006)

A Lower Bound on Approximation Algorithms for the Closest Substring Problem. - Jianxin Wang 001; Min Huang; Jianer Chen (COCOA, 2007)

Improved Algorithms for Weighted and Unweighted Set Splitting Problems. - Jianer Chen; Songjian Lu (COCOON, 2007)

A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem. - Yunlong Liu 001; Jianer Chen; Jianxin Wang 001 (COCOON, 2007)

Directed Feedback Vertex Set Problem is FPT. - Jianer Chen; Yang Liu 002; Songjian Lu (Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 2007)

C3P: A Cooperant Congestion Control Protocol in High Bandwidth-Delay Product Networks. - Jianxin Wang 001; Hao Gong; Jianer Chen (ICCCN, 2007)

Face Tracing Based Geographic Routing in Nonplanar Wireless Networks. - Fenghui Zhang; Hao Li; Anxiao Jiang; Jianer Chen; Ping Luo (INFOCOM, 2007)

Improved algorithms for path, matching, and packing problems. - Jianer Chen; Songjian Lu; Sing-Hoi Sze; Fenghui Zhang (SODA, 2007)

Parameterized Algorithms for Weighted Matching and Packing Problems. - Yunlong Liu 001; Jianer Chen; Jianxin Wang 001 (TAMC, 2007)

An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. - Jianxin Wang 001; Xiaoshuang Xu; Jianer Chen (TAMC, 2007)

Finding Pathway Structures in Protein Interaction Networks. - Songjian Lu; Fenghui Zhang; Jianer Chen; Sing-Hoi Sze (Algorithmica, 2007)

Polynomial time approximation schemes and parameterized complexity. - Jianer Chen; Xiuzhen Huang; Iyad A. Kanj; Ge Xia (Discret. Appl. Math., 2007)

Research on Parameterized Algorithms of the Individual Haplotyping Problem. - Minzhu Xie; Jianer Chen; Jianxin Wang 001 (J. Bioinform. Comput. Biol., 2007)

A simple linear time approximation algorithm for multi-processor job scheduling on four processors. - Jingui Huang; Jianer Chen; Songqiao Chen; Jianxin Wang 001 (J. Comb. Optim., 2007)

Genus characterizes the complexity of certain graph problems: Some tight results. - Jianer Chen; Iyad A. Kanj; Ljubomir Perkovic; Eric Sedgwick; Ge Xia (J. Comput. Syst. Sci., 2007)

Probabilistic analysis on mesh network fault tolerance. - Jianer Chen; GaoCai Wang; Chuang Lin 002; Tao Wang; Guojun Wang 001 (J. Parallel Distributed Comput., 2007)

Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. - Jianer Chen; Henning Fernau; Iyad A. Kanj; Ge Xia (SIAM J. Comput., 2007)

A Fast Agglomerate Algorithm for Mining Functional Modules in Protein Interaction Networks. - Min Li 007; Jianxin Wang 001; Jianer Chen (BMEI (1), 2008)

A Particle Swarm Optimization Algorithm Based on Optimal Result Set for Haplotyping a Single Individual. - Jingli Wu; Jianxin Wang 001; Jianer Chen (BMEI (1), 2008)

A Practical Exact Algorithm for the Individual Haplotyping Problem MEC. - Minzhu Xie; Jianxin Wang 001; Jianer Chen (BMEI (1), 2008)

A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem. - Minzhu Xie; Jianxin Wang 001; Wei Zhou; Jianer Chen (FAW, 2008)

A Virtual Laboratory Platform Based on Integration of Java and Matlab. - Yu Sheng; Weiping Wang 003; Jianxin Wang 001; Jianer Chen (ICWL, 2008)

Greedily Mining l-dense Subgraphs in Protein Interaction Networks. - Min Li 007; Jianxin Wang 001; Jianer Chen; Bin Hu 001 (ICYCS, 2008)

A Genetic Algorithm for Single Individual SNP Haplotype Assembly. - Jingli Wu; Jianxin Wang 001; Jianer Chen (ICYCS, 2008)

A Novel Anonymous Communication Strategy with Respect to Payment Mechanism. - Yanhui Wu; Weiping Wang 003; Jianer Chen (ICYCS, 2008)

Robust Planarization of Unlocalized Wireless Sensor Networks. - Fenghui Zhang; Anxiao Jiang; Jianer Chen (INFOCOM, 2008)

A Graph-Theoretic Method for Mining Overlapping Functional Modules in Protein Interaction Networks. - Min Li 007; Jianxin Wang 001; Jianer Chen (ISBRA, 2008)

A model of higher accuracy for the individual haplotyping problem based on weighted SNP fragments and genotype with errors. - Minzhu Xie; Jianxin Wang 001; Jianer Chen (ISMB, 2008)

Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters. - Jianer Chen (IWPEC, 2008)

Sorting Based Data Centric Storage. - Fenghui Zhang; Anxiao Jiang; Jianer Chen (NCA, 2008)

An Improved Parameterized Algorithm for a Generalized Matching Problem. - Jianxin Wang 001; Dan Ning; Qilong Feng; Jianer Chen (TAMC, 2008)

A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF. - Minzhu Xie; Jianxin Wang 001; Jianer Chen (TAMC, 2008)

Foreword from the Guest Editors. - Jianer Chen; Iyad A. Kanj (Algorithmica, 2008)

Modifying the DPClus algorithm for identifying protein complexes based on new topological structures. - Min Li 007; Jianer Chen; Jianxin Wang 001; Bin Hu 001; Gang Chen 010 (BMC Bioinform., 2008)

On Parameterized Intractability: Hardness and Completeness. - Jianer Chen; Jie Meng (Comput. J., 2008)

A Parameterized Perspective on P2-Packings - Jianer Chen; Henning Fernau; Dan Ning; Daniel Raible 001; Jianxin Wang 001 (CoRR, 2008)

An improved lower bound on approximation algorithms for the Closest Substring problem. - Jianxin Wang 001; Jianer Chen; Min Huang (Inf. Process. Lett., 2008)

A fixed-parameter algorithm for the directed feedback vertex set problem. - Jianer Chen; Yang Liu 002; Songjian Lu; Barry O'Sullivan; Igor Razgon (J. ACM, 2008)

Improved algorithms for feedback vertex set problems. - Jianer Chen; Fedor V. Fomin; Yang Liu 002; Songjian Lu; Yngve Villanger (J. Comput. Syst. Sci., 2008)

Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. - Jianxin Wang 001; Xiaoshuang Xu; Jianer Chen (J. Comput. Sci. Technol., 2008)

Application-oriented purely semantic precision and recall for ontology mapping evaluation. - Tian Zhang; Dezhi Xu; Jianer Chen (Knowl. Based Syst., 2008)

Vertex Cover Kernelization. - Jianer Chen (Encyclopedia of Algorithms, 2008)

Vertex Cover Search Trees. - Jianer Chen (Encyclopedia of Algorithms, 2008)

An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set. - Jianxin Wang 001; Beiwei Chen; Qilong Feng; Jianer Chen (FAW, 2009)

An Anonymous Communication Mechanism without Key Infrastructure Based on Multi-Paths Network Coding. - Weiping Wang 003; Guihua Duan; Jianxin Wang 001; Jianer Chen (GLOBECOM, 2009)

ARROW-TCP: Accelerating Transmission toward Efficiency and Fairness for High-Speed Networks. - Jianxin Wang 001; Liang Rong; Xi Zhang 005; Jianer Chen (GLOBECOM, 2009)

Polymorphic Worm Detection Using Signatures Based on Neighborhood Relation. - Jie Wang 067; Jianxin Wang 001; Yu Sheng; Jianer Chen (HPCC, 2009)

An Automated Signature Generation Approach for Polymorphic Worm Based on Color Coding. - Jie Wang 067; Jianxin Wang 001; Jianer Chen; Xi Zhang 005 (ICC, 2009)

Hierarchical Organization of Functional Modules in Weighted Protein Interaction Networks Using Clustering Coefficient. - Min Li 007; Jianxin Wang 001; Jianer Chen; Yi Pan 001 (ISBRA, 2009)

A Delay-Constrained and Maximum Lifetime Data Gathering Algorithm for Wireless Sensor Networks. - Junbin Liang; Jianxin Wang 001; Jianer Chen (MSN, 2009)

An Improved SAT Algorithm in Terms of Formula Length. - Jianer Chen; Yang Liu 002 (WADS, 2009)

Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach. - Jianer Chen; Songjian Lu (Algorithmica, 2009)

An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. - Jianer Chen; Yang Liu 002; Songjian Lu (Algorithmica, 2009)

On Counting 3-D Matchings of Size k. - Yunlong Liu 001; Jianer Chen; Jianxin Wang 001 (Algorithmica, 2009)

A practical algorithm based on particle swarm optimization for haplotype reconstruction. - Jingli Wu; Jianxin Wang 001; Jianer Chen (Appl. Math. Comput., 2009)

A parthenogenetic algorithm for single individual SNP haplotyping. - Jingli Wu; Jianxin Wang 001; Jianer Chen (Eng. Appl. Artif. Intell., 2009)

A practical algorithm for multiplex PCR primer set selection. - Jingli Wu; Jianxin Wang 001; Jianer Chen (Int. J. Bioinform. Res. Appl., 2009)

On the pseudo-achromatic number problem. - Jianer Chen; Iyad A. Kanj; Jie Meng; Ge Xia; Fenghui Zhang (Theor. Comput. Sci., 2009)

On parameterized exponential time complexity. - Jianer Chen; Iyad A. Kanj; Ge Xia (Theor. Comput. Sci., 2009)

Cyclic plain-weaving on polygonal mesh surfaces with graph rotation systems. - Ergun Akleman; Jianer Chen; Qing Xing; Jonathan L. Gross (ACM Trans. Graph., 2009)

Maximum Partition Matching. - Jianer Chen (Encyclopedia of Optimization, 2009)

A 2k Kernel for the Cluster Editing Problem. - Jianer Chen; Jie Meng (COCOON, 2010)

Probabilistic Analysis on Mesh Network Fault Tolerance: Deterministic vs. Stochastic. - Gaocai Wang; Taoshen Li; Jianer Chen (EUC, 2010)

An Overhearing-Based Scheme for Improving Data Persistence in Wireless Sensor Networks. - Junbin Liang; Jianxin Wang 001; Jianer Chen (ICC, 2010)

An Efficient Algorithm for Constructing Maximum lifetime Tree for Data Gathering Without Aggregation in Wireless Sensor Networks. - Junbin Liang; Jianxin Wang 001; Jiannong Cao 001; Jianer Chen; Mingming Lu (INFOCOM, 2010)

An Agglomerate Algorithm for Mining Overlapping and Hierarchical Functional Modules in Protein Interaction Networks. - Jun Ren; Jianxin Wang 001; Jianer Chen; Min Li 007; Gang Chen 010 (ISBRA, 2010)

Cyclic twill-woven objects. - Ergun Akleman; Jianer Chen; Yen-Lin Chen; Qing Xing (SIGGRAPH Posters, 2010)

Paper-Strip Sculptures. - Ergun Akleman; Jianer Chen; Jonathan L. Gross (Shape Modeling International, 2010)

Single-Cycle Plain-Woven Objects. - Qing Xing; Ergun Akleman; Jianer Chen; Jonathan L. Gross (Shape Modeling International, 2010)

A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI. - Jianxin Wang 001; Minzhu Xie; Jianer Chen (Algorithmica, 2010)

Weighted Cluster Editing: Kernelization based on Edge Cuts - Yixin Cao 001; Jianer Chen (CoRR, 2010)

Identifying the overlapping complexes in protein interaction networks. - Min Li 007; Jianxin Wang 001; Jianer Chen; Zhao Cai; Gang Chen 010 (Int. J. Data Min. Bioinform., 2010)

An improved kernelization for P2-packing. - Jianxin Wang 001; Dan Ning; Qilong Feng; Jianer Chen (Inf. Process. Lett., 2010)

A New Fault-Tolerant Broadcast Routing Algorithm on Mesh Networks. - Gaocai Wang; Jianer Chen; Chuang Lin 002 (J. Interconnect. Networks, 2010)

A practical parameterised algorithm for the individual haplotyping problem MLF. - Minzhu Xie; Jianxin Wang 001; Jianer Chen (Math. Struct. Comput. Sci., 2010)

Improved upper bounds for vertex cover. - Jianer Chen; Iyad A. Kanj; Ge Xia (Theor. Comput. Sci., 2010)

A parameterized algorithm for the hyperplane-cover problem. - Jianxin Wang 001; Wenjun Li 001; Jianer Chen (Theor. Comput. Sci., 2010)

Identification of Breast Cancer Gene Signature in Protein Interaction Network Using Graph Centrality. - Gang Chen 010; Jianxin Wang 001; Yi Pan 001; Jianer Chen (BIBM, 2011)

Matching and P 2-Packing: Weighted Versions. - Qilong Feng; Jianxin Wang 001; Jianer Chen (COCOON, 2011)

Cograph Editing: Complexity and Parameterized Algorithms. - Yunlong Liu 001; Jianxin Wang 001; Jiong Guo; Jianer Chen (COCOON, 2011)

An Adaptive Probability Broadcast-Based Data Preservation Protocol in Wireless Sensor Networks. - Junbin Liang; Jianxin Wang 001; Xi Zhang 005; Jianer Chen (ICC, 2011)

Linear Problem Kernels for Planar Graph Problems with Small Distance Property. - Jianxin Wang 001; Yongjie Yang 001; Jiong Guo; Jianer Chen (MFCS, 2011)

Band decomposition of 2-manifold meshes for physical construction of large structures. - Qing Xing; Gabriel Esquivel; Ergun Akleman; Jianer Chen; Jonathan L. Gross (SIGGRAPH Posters, 2011)

An Improved Kernel for Planar Connected Dominating Set. - Weizhong Luo; Jianxin Wang 001; Qilong Feng; Jiong Guo; Jianer Chen (TAMC, 2011)

Efficient flooding in Wireless Sensor Networks secured with neighborhood keys. - Amin Hassanzadeh; Radu Stoleru; Jianer Chen (WiMob, 2011)

On the Planarization of Wireless Sensor Networks. - Fenghui Zhang; Anxiao Jiang; Jianer Chen (Algorithmica, 2011)

Cyclic twill-woven objects. - Ergun Akleman; Jianer Chen; Yen-Lin Chen; Qing Xing; Jonathan L. Gross (Comput. Graph., 2011)

Color-Coding and its Applications: A Survey. - Jianxin Wang 001; Qilong Feng; Jianer Chen (Int. J. Softw. Informatics, 2011)

An Algorithm for Minimum Vertex Cover Based on Max-I Share Degree. - Shaohua Li 006; Jianxin Wang 001; Jianer Chen; Zhijian Wang (J. Comput., 2011)

A Fast Hierarchical Clustering Algorithm for Functional Modules Discovery in Protein Interaction Networks. - Jianxin Wang 001; Min Li 007; Jianer Chen; Yi Pan 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

Algorithms, complexity and computational models. - Jianer Chen; S. Barry Cooper (Theor. Comput. Sci., 2011)

Improved deterministic algorithms for weighted matching and packing problems. - Jianer Chen; Qilong Feng; Yang Liu 002; Songjian Lu; Jianxin Wang 001 (Theor. Comput. Sci., 2011)

An O*(3.533k)-time parameterized algorithm for the 3-set packing problem. - Jianxin Wang 001; Qilong Feng; Jianer Chen (Theor. Comput. Sci., 2011)

Separability and topology control of quasi unit disk graphs. - Jianer Chen; Anxiao Jiang; Iyad A. Kanj; Ge Xia; Fenghui Zhang (Wirel. Networks, 2011)

Kernels for Packing and Covering Problems - (Extended Abstract). - Jianer Chen; Henning Fernau; Peter Shaw 001; Jianxin Wang 001; Zhibiao Yang (FAW-AAIM, 2012)

Parameterized Complexity and Subexponential-Time Computability. - Jianer Chen; Iyad A. Kanj (The Multivariate Algorithmic Revolution and Beyond, 2012)

Surface Covering Curves. - Qing Xing; Ergun Akleman; Gabriel Taubin; Jianer Chen (CAe@Expressive, 2012)

Improved FPT Algorithms for Rectilinear k-Links Spanning Path. - Jianxin Wang 001; Jinyi Yao; Qilong Feng; Jianer Chen (TAMC, 2012)

FPT Results for Signed Domination. - Ying Zheng; Jianxin Wang 001; Qilong Feng; Jianer Chen (TAMC, 2012)

Cluster Editing: Kernelization Based on Edge Cuts. - Yixin Cao 001; Jianer Chen (Algorithmica, 2012)

Guest Editors' Introduction. - Jianer Chen; Ion I. Mandoiu; Raj Sunderraman; Jianxin Wang 001; Alexander Zelikovsky (BMC Bioinform., 2012)

Pattern mapping with quad-pattern-coverable quad-meshes. - Shiyu Hu; Qing Xing; Ergun Akleman; Jianer Chen; Jonathan L. Gross (Comput. Graph., 2012)

Identifying Complexes from Protein Interaction Networks According to Different Types of Neighborhood Density. - Jia-Hao Fan; Jianer Chen; Sing-Hoi Sze (J. Comput. Biol., 2012)

Multicut in trees viewed through the eyes of vertex cover. - Jianer Chen; Jia-Hao Fan; Iyad A. Kanj; Yang Liu 002; Fenghui Zhang (J. Comput. Syst. Sci., 2012)

A 2k kernel for the cluster editing problem. - Jianer Chen; Jie Meng (J. Comput. Syst. Sci., 2012)

Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching. - Jianer Chen; Yang Liu 002; Songjian Lu; Sing-Hoi Sze; Fenghui Zhang (ACM Trans. Algorithms, 2012)

Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications. - Jianer Chen; Alexander Zelikovsky (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

Complexity and parameterized algorithms for Cograph Editing. - Yunlong Liu 001; Jianxin Wang 001; Jiong Guo; Jianer Chen (Theor. Comput. Sci., 2012)

Parameterized Complexity of Control and Bribery for d-Approval Elections. - Jianxin Wang 001; Min Yang; Jiong Guo; Qilong Feng; Jianer Chen (COCOA, 2013)

Random Methods for Parameterized Problems. - Qilong Feng; Jianxin Wang 001; Shaohua Li 006; Jianer Chen (COCOON, 2013)

An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs. - Yunlong Liu 001; Jianxin Wang 001; Chao Xu 010; Jiong Guo; Jianer Chen (COCOON, 2013)

Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Jianxin Wang 001 (COCOON, 2013)

An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem. - Yixin Cao 001; Jianer Chen; Jia-Hao Fan (FCT, 2013)

Analysis on the Scheduling Problem in Transparent Computing. - Ju Ren 001; Yaoxue Zhang; Jianer Chen (HPCC/EUC, 2013)

On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem. - Yixin Cao 001; Jianer Chen (TAMC, 2013)

Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees. - Jianer Chen; Jia-Hao Fan; Sing-Hoi Sze (WG, 2013)

Hamiltonian cycle art: Surface covering wire sculptures and duotone surfaces. - Ergun Akleman; Qing Xing; Pradeep Garigipati; Gabriel Taubin; Jianer Chen; Shiyu Hu (Comput. Graph., 2013)

A heuristic algorithm for haplotype reconstruction from aligned weighted SNP fragments. - Jingli Wu; Jianxin Wang 001; Jianer Chen (Int. J. Bioinform. Res. Appl., 2013)

Planar graph vertex partition for linear problem kernels. - Jianxin Wang 001; Yongjie Yang 001; Jiong Guo; Jianer Chen (J. Comput. Syst. Sci., 2013)

Reliable networks with unreliable sensors. - Srikanth Sastry; Tsvetomira Radeva; Jianer Chen; Jennifer L. Welch (Pervasive Mob. Comput., 2013)

Parameterized top-K algorithms. - Jianer Chen; Iyad A. Kanj; Jie Meng; Ge Xia; Fenghui Zhang (Theor. Comput. Sci., 2013)

Improved linear problem kernel for planar connected dominating set. - Weizhong Luo; Jianxin Wang 001; Qilong Feng; Jiong Guo; Jianer Chen (Theor. Comput. Sci., 2013)

Approximation Algorithms for Maximum Agreement Forest on Multiple Trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Jianxin Wang 001 (COCOON, 2014)

Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees. - Wenjun Li 001; Jianer Chen; Jianxin Wang 001 (ESA, 2014)

Security from the transparent computing aspect. - Guojun Wang 001; Qin Liu 001; Yang Xiang 001; Jianer Chen (ICNC, 2014)

On the parameterized vertex cover problem for graphs with perfect matching. - Jianxin Wang 001; Wenjun Li 001; Shaohua Li 006; Jianer Chen (Sci. China Inf. Sci., 2014)

Algorithms for Maximum Agreement Forest of Multiple General Trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Xiaojun Ding; Jianxin Wang 001 (CoRR, 2014)

An O(1.84k) parameterized algorithm for the multiterminal cut problem. - Yixin Cao 001; Jianer Chen; Jia-Hao Fan (Inf. Process. Lett., 2014)

On Unknown Small Subsets and Implicit Measures: New Techniques for Parameterized Algorithms. - Jianer Chen; Qilong Feng (J. Comput. Sci. Technol., 2014)

On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms. - Jianxin Wang 001; Peiqiang Tan; Jinyi Yao; Qilong Feng; Jianer Chen (IEEE Trans. Computers, 2014)

Matching and Weighted P2-Packing: Algorithms and Kernels. - Qilong Feng; Jianxin Wang 001; Jianer Chen (Theor. Comput. Sci., 2014)

Improved parameterized algorithms for minimum link-length rectilinear spanning path problem. - Qilong Feng; Jianxin Wang 001; Chao Xu 010; Jinyi Yao; Jianer Chen (Theor. Comput. Sci., 2014)

Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks. - Weizhong Luo; Jianxin Wang 001; Jiong Guo; Jianer Chen (Theor. Comput. Sci., 2014)

Algorithms for parameterized maximum agreement forest problem on multiple trees. - Feng Shi 003; Jianxin Wang 001; Jianer Chen; Qilong Feng; Jiong Guo (Theor. Comput. Sci., 2014)

Improved MaxSAT Algorithms for Instances of Degree 3. - Chao Xu 010; Jianer Chen; Jianxin Wang 001 (COCOA, 2015)

A 2k-vertex Kernel for Maximum Internal Spanning Tree. - Wenjun Li 001; Jianxin Wang 001; Jianer Chen; Yixin Cao 001 (WADS, 2015)

On Feedback Vertex Set: New Measure and New Structures. - Yixin Cao 001; Jianer Chen; Yang Liu 002 (Algorithmica, 2015)

Block meshes: Topologically robust shape modeling with graphs embedded on 3-manifolds. - Ergun Akleman; Jianer Chen; Jonathan L. Gross (Comput. Graph., 2015)

Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm. - Jianer Chen; Chao Xu 010 (CoRR, 2015)

Extended graph rotation systems as a model for cyclic weaving on orientable surfaces. - Ergun Akleman; Jianer Chen; Jonathan L. Gross (Discret. Appl. Math., 2015)

Randomized parameterized algorithms for P2-Packing and Co-Path Packing problems. - Qilong Feng; Jianxin Wang 001; Shaohua Li 006; Jianer Chen (J. Comb. Optim., 2015)

An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs. - Yunlong Liu 001; Jianxin Wang 001; Chao Xu 010; Jiong Guo; Jianer Chen (J. Comb. Optim., 2015)

Adaptive-Acceleration Data Center TCP. - Tao Zhang 019; Jianxin Wang 001; Jiawei Huang 001; Yi Huang 005; Jianer Chen; Yi Pan 001 (IEEE Trans. Computers, 2015)

Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees. - Jianer Chen; Jia-Hao Fan; Sing-Hoi Sze (Theor. Comput. Sci., 2015)

Frontiers of Algorithmics. - Jianer Chen; John E. Hopcroft (Theor. Comput. Sci., 2015)

Edge deletion problems: Branching facilitated by modular decomposition. - Yunlong Liu 001; Jianxin Wang 001; Jie You; Jianer Chen; Yixin Cao 001 (Theor. Comput. Sci., 2015)

Parameterized complexity of control and bribery for d-approval elections. - Jianxin Wang 001; Weimin Su; Min Yang; Jiong Guo; Qilong Feng; Feng Shi 003; Jianer Chen (Theor. Comput. Sci., 2015)

Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Data Center. - Jiawei Huang 001; Jianxin Wang 001; Tao Zhang 019; Jianer Chen; Yi Pan 001 (ICDCS, 2016)

Approximating Maximum Agreement Forest on Multiple Binary Trees. - Jianer Chen; Feng Shi 003; Jianxin Wang 001 (Algorithmica, 2016)

Construction with physical version of quad-edge data structures. - Ergun Akleman; Shenyao Ke; You Wu 004; Negar Kalantar; Alireza Borhani; Jianer Chen (Comput. Graph., 2016)

A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees. - Feng Shi 003; Jianxin Wang 001; Yufei Yang; Qilong Feng; Weilong Li; Jianer Chen (Sci. China Inf. Sci., 2016)

Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Jianxin Wang 001 (CoRR, 2016)

Special Issue for FAW 2014. - Jianer Chen; John E. Hopcroft (J. Comb. Optim., 2016)

Adaptive marking threshold method for delay-sensitive TCP in data center network. - Tao Zhang 019; Jianxin Wang 001; Jiawei Huang 001; Yi Huang 005; Jianer Chen; Yi Pan 001 (J. Netw. Comput. Appl., 2016)

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks. - Ju Ren 001; Yaoxue Zhang; Kuan Zhang 001; Anfeng Liu; Jianer Chen; Xuemin Sherman Shen (IEEE Trans. Ind. Informatics, 2016)

Vertex Cover Kernelization. - Jianer Chen (Encyclopedia of Algorithms, 2016)

Vertex Cover Search Trees. - Jianer Chen (Encyclopedia of Algorithms, 2016)

On Approximation Algorithms for Two-Stage Scheduling Problems. - Guangwei Wu; Jianer Chen; Jianxin Wang 001 (FAW, 2017)

A Lightweight Privacy Aware Friend Locator in Mobile Social Networks. - Tao Peng 011; Qin Liu 001; Guojun Wang 001; Jianer Chen (ISPA/IUCC, 2017)

Interactive modeling of smooth manifold meshes with arbitrary topology: G1 stitched bi-cubic Bézier patches. - Ergun Akleman; Vinod Srinivasan; Jianer Chen (Comput. Graph., 2017)

An O*(1.84sk) Parameterized Algorithm for the Multiterminal Cut Problem. - Yixin Cao 001; Jianer Chen; Jia-Hao Fan (CoRR, 2017)

Transparent Computing: A Promising Network Computing Paradigm. - Yaoxue Zhang; Kehua Guo; Ju Ren 001; Yuezhi Zhou; Jianxin Wang 001; Jianer Chen (Comput. Sci. Eng., 2017)

Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree. - Wenjun Li 001; Yixin Cao 001; Jianer Chen; Jianxin Wang 001 (Inf. Comput., 2017)

Dealing with 4-variables by resolution: An improved MaxSAT algorithm. - Jianer Chen; Chao Xu 010; Jianxin Wang 001 (Theor. Comput. Sci., 2017)

Improved kernel results for some FPT problems based on simple observations. - Wenjun Li 001; Qilong Feng; Jianer Chen; Shuai Hu (Theor. Comput. Sci., 2017)

Partition on trees with supply and demand: Kernelization and algorithms. - Mugang Lin; Qilong Feng; Jianer Chen; Wenjun Li 001 (Theor. Comput. Sci., 2017)

Quality-Guaranteed Event-Sensitive Data Collection and Monitoring in Vibration Sensor Networks. - Md. Zakirul Alam Bhuiyan; Jie Wu 001; Guojun Wang 001; Zhigang Chen 001; Jianer Chen; Tian Wang 001 (IEEE Trans. Ind. Informatics, 2017)

Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Intra-Datacenter. - Tao Zhang 019; Jianxin Wang 001; Jiawei Huang 001; Jianer Chen; Yi Pan 001; Geyong Min (IEEE/ACM Trans. Netw., 2017)

Approximation Algorithms on Multiple Two-Stage Flowshops. - Guangwei Wu; Jianer Chen (COCOON, 2018)

Designing Fast and Friendly TCP to Fit High Speed Data Center Networks. - Tao Zhang 019; Jiawei Huang 001; Jianxin Wang 001; Jianer Chen; Yi Pan 001; Geyong Min (ICDCS, 2018)

A Survey of Modern Gene Expression Based Techniques for Cancer Detection and Diagnosis. - Hafiz ur Rahman; Muhammad Arif 009; Sadam Al-Azani; Emad Y. Ramadan; Guojun Wang 001; Jianer Chen; Teodora Olariu; Iustin Olariu (SOFA (2), 2018)

A Service Oriented Healthcare Architecture (SOHA-CC) Based on Cloud Computing. - Syed Qasim Afser Rizvi; Guojun Wang 001; Jianer Chen (SpaCCS, 2018)

Performance Evaluation of Hypervisors and the Effect of Virtual CPU on Performance. - Hafiz ur Rahman; Guojun Wang 001; Jianer Chen; Hai Jiang 003 (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI, 2018)

Response to "On G1 stitched bi-cubic Bézier patches with arbitrary topology". - Ergun Akleman; Vinod Srinivasan; Jianer Chen (Comput. Graph., 2018)

Detection of hierarchical intrinsic symmetry structure in 3D models. - Hui Liu; Jiazhi Xia; Jianer Chen; Jianxin Wang 001 (Comput. Graph., 2018)

On Scheduling Two-Stage Jobs on Multiple Two-Stage Flowshops. - Guangwei Wu; Jianer Chen; Jianxin Wang 001 (CoRR, 2018)

An improved FPT algorithm for Almost Forest Deletion problem. - Mugang Lin; Qilong Feng; Jianxin Wang 001; Jianer Chen; Bin Fu; Wenjun Li 001 (Inf. Process. Lett., 2018)

A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Jianxin Wang 001 (J. Comput. Syst. Sci., 2018)

Meta-metric for saliency detection evaluation metrics based on application preference. - Yuzhen Niu; Jianer Chen; Wenzhong Guo (Multim. Tools Appl., 2018)

Approximating Closest Vector Problem in ℓ∞ Norm Revisited. - Wenbin Chen 003; Jianer Chen (AAIM, 2019)

Medical Image Segmentation by Combining Adaptive Artificial Bee Colony and Wavelet Packet Decomposition. - Muhammad Arif 009; Guojun Wang 001; Oana Geman; Jianer Chen (DependSys, 2019)

AI and Its Risks in Android Smartphones: A Case of Google Smart Assistant. - Haroon Elahi; Guojun Wang 001; Tao Peng 011; Jianer Chen (DependSys, 2019)

Towards In-Network Generalized Trustworthy Data Collection for Trustworthy Cyber-Physical Systems. - Hafiz ur Rahman; Guojun Wang 001; Md. Zakirul Alam Bhuiyan; Jianer Chen (DependSys, 2019)

Resolution and Domination: An Improved Exact MaxSAT Algorithm. - Chao Xu 010; Wenjun Li 001; Yongjie Yang 001; Jianer Chen; Jianxin Wang 001 (IJCAI, 2019)

Trustworthy Data Collection for Cyber Systems: A Taxonomy and Future Directions. - Hafiz ur Rahman; Guojun Wang 001; Md. Zakirul Alam Bhuiyan; Jianer Chen (iSCI, 2019)

Stereoscopic Image Saliency Detection Optimization: A Multi-Cue-Driven Approach. - Yuzhen Niu; Jianer Chen; Xiao Ke; Junhao Chen (IEEE Access, 2019)

Preface to the Special Issue on Computing and Combinatorics. - Yixin Cao 001; Jianer Chen (Algorithmica, 2019)

EATCS-IPEC Nerode Prize 2019 - Call for Nominations. - Jianer Chen; Hans L. Bodlaender; Virginia Vassilevska Williams (Bull. EATCS, 2019)

Kernels for packing and covering problems. - Jianer Chen; Henning Fernau; Peter Shaw 001; Jianxin Wang 001; Zhibiao Yang (Theor. Comput. Sci., 2019)

Scheduling two-stage jobs on multiple flowshops. - Guangwei Wu; Jianer Chen; Jianxin Wang 001 (Theor. Comput. Sci., 2019)

On scheduling inclined jobs on multiple two-stage flowshops. - Guangwei Wu; Jianer Chen; Jianxin Wang 001 (Theor. Comput. Sci., 2019)

Resolution and linear CNF formulas: Improved (n, 3)-MaxSAT algorithms. - Chao Xu 010; Jianer Chen; Jianxin Wang 001 (Theor. Comput. Sci., 2019)

A survey on security attacks in VANETs: Communication, applications and challenges. - Muhammad Arif 009; Guojun Wang 001; Md. Zakirul Alam Bhuiyan; Tian Wang 001; Jianer Chen (Veh. Commun., 2019)

Trustworthy Data Acquisition and Faulty Sensor Detection using Gray Code in Cyber-Physical System. - Hafiz ur Rahman; Guihua Duan; Guojun Wang 001; Md. Zakirul Alam Bhuiyan; Jianer Chen (CSE, 2020)

Location Based Communication Privacy in Internet of Vehicles Using Fog Computing. - Muhammad Arif 009; Jianer Chen; Pin Liu; Guojun Wang 001 (SpaCCS Workshops, 2020)

A Privacy-Preserving Crowdsensing System with Muti-Blockchain. - Tao Peng 011; Jierong Liu; Jianer Chen; Guojun Wang 001 (TrustCom, 2020)

Optimization of communication in VANETs using fuzzy logic and artificial Bee colony. - Muhammad Arif 009; Guojun Wang 001; Tao Peng 011; Valentina Emilia Balas; Oana Geman; Jianer Chen (J. Intell. Fuzzy Syst., 2020)

Pleasure or pain? An evaluation of the costs and utilities of bloatware applications in android smartphones. - Haroon Elahi; Guojun Wang 001; Jianer Chen (J. Netw. Comput. Appl., 2020)

A Topologically Complete Theory of Weaving. - Ergun Akleman; Jianer Chen; Jonathan L. Gross; Shiyu Hu (SIAM J. Discret. Math., 2020)

A User-Defined Location-Sharing Scheme with Efficiency and Privacy in Mobile Social Networks. - Tao Peng 011; Jierong Liu; Guojun Wang 001; Qin Liu 001; Jianer Chen; Jiawei Zhu; Chenxi Huang (Sci. Program., 2020)

Improved approximation algorithms for two-stage flowshops scheduling problem. - Guangwei Wu; Jianer Chen; Jianxin Wang 001 (Theor. Comput. Sci., 2020)

On scheduling multiple two-stage flowshops. - Guangwei Wu; Jianer Chen; Jianxin Wang 001 (Theor. Comput. Sci., 2020)

Rethinking Fast and Friendly Transport in Data Center Networks. - Tao Zhang 019; Jiawei Huang 001; Kai Chen 005; Jianxin Wang 001; Jianer Chen; Yi Pan 001; Geyong Min (IEEE/ACM Trans. Netw., 2020)

SDN based communications privacy-preserving architecture for VANETs using fog computing. - Muhammad Arif 009; Guojun Wang 001; Valentina Emilia Balas; Oana Geman; Aniello Castiglione; Jianer Chen (Veh. Commun., 2020)

Manifold Trial Selection to Reduce Negative Transfer in Motor Imagery-based Brain-Computer Interface. - Zilin Liang; Zheng Zheng 001; Weihai Chen; Jianhua Wang; Jianbin Zhang; Jianer Chen; Zuobing Chen (IROS, 2021)

Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. - Jianer Chen; Qin Huang 008; Iyad Kanj; Qian Li 012; Ge Xia (ISAAC, 2021)

Boosting-LDA algriothm with multi-domain feature fusion for motor imagery EEG decoding. - Yue Zhang; Weihai Chen; Chun-Liang Lin; Zhongcai Pei; Jianer Chen; Zuobing Chen (Biomed. Signal Process. Control., 2021)

Optimal Streaming Algorithms for Graph Matching. - Jianer Chen; Qin Huang 008; Iyad Kanj; Ge Xia (CoRR, 2021)

AAC: Adaptively Adjusting Concurrency by Exploiting Path Diversity in Datacenter Networks. - Weimin Gao; Jiawei Huang 001; Shaojun Zou; Weihe Li; Jianxin Wang 001; Jianer Chen (J. Netw. Syst. Manag., 2021)

In-network generalized trustworthy data collection for event detection in cyber-physical systems. - Hafiz ur Rahman; Guojun Wang 001; Md. Zakirul Alam Bhuiyan; Jianer Chen (PeerJ Comput. Sci., 2021)

Space Limited Graph Algorithms on Big Data. - Jianer Chen; Zirui Chu; Ying Guo; Wei Yang (COCOON, 2022)

Near-Optimal Algorithms for Point-Line Covering Problems. - Jianer Chen; Qin Huang 008; Iyad Kanj; Ge Xia (STACS, 2022)

A Refined Branching Algorithm for the Maximum Satisfiability Problem. - Wenjun Li 001; Chao Xu 010; Yongjie Yang 001; Jianer Chen; Jianxin Wang 001 (Algorithmica, 2022)

Approximating Closest Vector Problem in ℓ∞-Norm Revisited. - Wenbin Chen 003; Jianer Chen (Comput. J., 2022)

Linear-time parameterized algorithms with limited local resources. - Jianer Chen; Ying Guo; Qin Huang 008 (Inf. Comput., 2022)

AI bot to detect fake COVID-19 vaccine certificate. - Muhammad Arif 009; Shermin Shamsudheen; F. Ajesh; Guojun Wang 001; Jianer Chen (IET Inf. Secur., 2022)

Cognitive population initialization for swarm intelligence and evolutionary computing. - Muhammad Arif 009; Jianer Chen; Guojun Wang 001; Hafiz Tayyab Rauf (J. Ambient Intell. Humaniz. Comput., 2022)

Near-optimal algorithms for point-line fitting problems. - Jianer Chen; Qin Huang 008; Iyad Kanj; Ge Xia (J. Comput. Geom., 2022)

Preface. - Angsheng Li; Jianer Chen; Qilong Feng; Jinhui Xu 001 (Math. Struct. Comput. Sci., 2022)

Scheduling multiple two-stage flowshops with a deadline. - Jianer Chen; Minjie Huang; Yin Guo (Theor. Comput. Sci., 2022)

Simultaneous Gait Event Intention Detection Using Single sEMG Sensor for Lower Limb Exoskeleton. - Cheng Shen; Zhongcai Pei; Weihai Chen; Wen Duan; Jianhua Wang; Jianer Chen (IECON, 2023)

A blockchain-based mobile crowdsensing scheme with enhanced privacy. - Tao Peng 011; Kejian Guan; Jierong Liu; Jianer Chen; Guojun Wang 001; Jiawei Zhu (Concurr. Comput. Pract. Exp., 2023)

Novel neuromuscular controller application method to improve the balance recovery ability of lower limb exoskeletons. - Wen Duan; Weihai Chen; Jianhua Wang; Zhongcai Pei; Jianer Chen; Hongfei Shi (J. Frankl. Inst., 2023)

STMI: Stiffness Estimation Method Based on sEMG-Driven Model for Elbow Joint. - Cheng Shen; Zhongcai Pei; Weihai Chen; Zhongyi Li; Jianhua Wang; Jianbin Zhang; Jianer Chen (IEEE Trans. Instrum. Meas., 2023)

A novel deep transfer learning framework integrating general and domain-specific features for EEG-based brain-computer interface. - Zilin Liang; Zheng Zheng 001; Weihai Chen; Zhongcai Pei; Jianhua Wang; Jianer Chen (Biomed. Signal Process. Control., 2024)

Attention-based convolutional neural network with multi-modal temporal information fusion for motor imagery EEG decoding. - Xinzhi Ma; Weihai Chen; Zhongcai Pei; Yue Zhang; Jianer Chen (Comput. Biol. Medicine, 2024)

On optimal streaming kernelization algorithms. - Hao Feng; Wei Yang; Jianer Chen (Sci. China Inf. Sci., 2024)

A Modified de Casteljau Subdivision that Supports Smooth Stitching with Hierarchically Organized Bicubic Bezier Patches. - Saied Zarrinmehr; Ergun Akleman; Jianer Chen (CoRR, 2024)

Projective Holder-Minkowski Colors: A Generalized Set of Commutative & Associative Operations with Inverse Elements for Representing and Manipulating Colors. - Ergun Akleman; Somyung Oh; Youyou Wang; Bekir Tevfik Akgün; Jianer Chen (CoRR, 2024)

A wearable knee rehabilitation system based on graphene textile composite sensor: Implementation and validation. - Cheng Shen; Zhongcai Pei; Weihai Chen; Yi Zhou; Jianhua Wang; Xingming Wu; Jianer Chen (Eng. Appl. Artif. Intell., 2024)

Efficient task offloading with swarm intelligence evolution for edge-cloud collaboration in vehicular edge computing. - Mingfeng Su; Guojun Wang 001; Jianer Chen (Softw. Pract. Exp., 2024)

Space limited linear-time graph algorithms on big data. - Jianer Chen; Zirui Chu; Ying Guo; Wei Yang (Theor. Comput. Sci., 2024)

Manifold embedded instance selection to suppress negative transfer in motor imagery-based brain-computer interface. - Zilin Liang; Zheng Zheng 001; Weihai Chen; Zhongcai Pei; Jianhua Wang; Jianer Chen (Biomed. Signal Process. Control., 2024)

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. - Jianer Chen; Qin Huang 008; Iyad Kanj; Ge Xia (Algorithmica, 2024)