HR job title
- Professor
- Contact Info
- 1 979 845 4259
- Websites
Chen, Jianer Professor - Term Appointment
Positions
- Professor - Term Appointment, Computer Science and Engineering, College of Engineering
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.
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.
- Overview
- Publications
- Teaching
- Works By Students
- Background
- Contact
- Other
- View All
Overview
Publications
selected publications
-
academic article
-
Wu, G., Chen, J., & Wang, J.
(2020).
On scheduling multiple two-stage flowshops. Theoretical Computer Science.
818, 74-82.
-
Wu, G., Chen, J., & Wang, J.
(2020).
Improved approximation algorithms for two-stage flowshops scheduling problem. Theoretical Computer Science.
806, 509-515.
-
Cao, Y., & Chen, J.
(2019).
Preface to the Special Issue on Computing and Combinatorics. Algorithmica: an international journal in computer science.
81(11-12), 4165-4166.
-
Wu, G., Chen, J., & Wang, J.
(2019).
On scheduling inclined jobs on multiple two-stage flowshops. Theoretical Computer Science.
786, 67-77.
-
Xu, C., Chen, J., & Wang, J.
(2019).
Resolution and linear CNF formulas: Improved (n, 3)-MAxSAT algorithms. Theoretical Computer Science.
774, 113-123.
-
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.
-
Akleman, E., Srinivasan, V., & Chen, J.
(2018).
Response to "On G(1) stitched bi-cubic Bezier patches with arbitrary topology". Computers and Graphics (UK).
71, 157-158.
-
Liu, H., Xia, J., Chen, J., & Wang, J.
(2018).
Detection of hierarchical intrinsic symmetry structure in 3D models. Computers and Graphics (UK).
70, 8-16.
-
Zhang, T., Wang, J., Huang, J., Chen, J., Pan, Y. i., & Min, G.
(2017).
Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Intra-Datacenter. IEEE ACM Transactions on Networking.
25(6), 3808-3822.
-
Akleman, E., Srinivasan, V., & Chen, J.
(2017).
Interactive modeling of smooth manifold meshes with arbitrary topology: G(1) stitched bi-cubic Bezier patches. Computers and Graphics (UK).
66, 64-73.
-
Bhuiyan, Z. A., Wu, J., Wang, G., Chen, Z., Chen, J., & Wang, T.
(2017).
Quality-Guaranteed Event-Sensitive Data Collection and Monitoring in Vibration Sensor Networks. IEEE Transactions on Industrial Informatics.
13(2), 572-583.
-
Chen, J., Xu, C., & Wang, J.
(2017).
Dealing with 4-variables by resolution: An improved MaxSAT algorithm. Theoretical Computer Science.
670, 33-44.
-
Li, W., Feng, Q., Chen, J., & Hu, S.
(2017).
Improved kernel results for some FPT problems based on simple observations. Theoretical Computer Science.
657, 20-27.
-
Lin, M., Feng, Q., Chen, J., & Li, W.
(2017).
Partition on trees with supply and demand: Kernelization and algorithms. Theoretical Computer Science.
657, 11-19.
-
Zhang, Y., Guo, K., Ren, J. u., Zhou, Y., Wang, J., & Chen, J.
(2017).
Transparent Computing: A Promising Network Computing Paradigm. Computing in Science and Engineering.
19(1), 7-20.
-
Chen, J., Shi, F., & Wang, J.
(2016).
Approximating Maximum Agreement Forest on Multiple Binary Trees. Algorithmica: an international journal in computer science.
76(4), 867-889.
-
Akleman, E., Ke, S., Wu, Y., Kalantar, N., Borhani, A., & Chen, J.
(2016).
Construction with physical version of quad-edge data structures. Computers and Graphics (UK).
58, 172-183.
-
Chen, J., & Hopcroft, J. E.
(2016).
Special Issue for FAW 2014. Journal of Combinatorial Optimization.
32(1), 1-2.
-
Ren, J. u., Zhang, Y., Zhang, K., Liu, A., Chen, J., & Shen, X. S.
(2016).
Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks. IEEE Transactions on Industrial Informatics.
12(2), 788-800.
-
Zhang, T., Wang, J., Huang, J., Huang, Y. i., Chen, J., & Pan, Y. i.
(2016).
Adaptive marking threshold method for delay-sensitive TCP in data center network. Journal of Network and Computer Applications.
61, 222-234.
-
Shi, F., Wang, J., Yang, Y., Feng, Q., Li, W., & Chen, J.
(2016).
A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees. Science China Information Sciences.
59(1), 1-14.
-
Chen, J., & Hopcroft, J. E.
(2015).
Frontiers of Algorithmics. Theoretical Computer Science.
607, 125-125.
-
Akleman, E., Chen, J., & Gross, J. L.
(2015).
Extended graph rotation systems as a model for cyclic weaving on orientable surfaces. DISCRETE APPLIED MATHEMATICS.
193, 61-79.
-
Cao, Y., Chen, J., & Liu, Y.
(2015).
On Feedback Vertex Set: New Measure and New Structures. Algorithmica: an international journal in computer science.
73(1), 63-86.
-
Wang, J., Su, W., Yang, M., Guo, J., Feng, Q., Shi, F., & Chen, J.
(2015).
Parameterized complexity of control and bribery for d-approval elections. Theoretical Computer Science.
595, 82-91.
-
Zhang, T., Wang, J., Huang, J., Huang, Y. i., Chen, J., & Pan, Y. i.
(2015).
Adaptive-Acceleration Data Center TCP. IEEE Transactions on Computers.
64(6), 1522-1533.
-
Liu, Y., Wang, J., You, J., Chen, J., & Cao, Y.
(2015).
Edge deletion problems: Branching facilitated by modular decomposition. Theoretical Computer Science.
573, 63-70.
-
Akleman, E., Chen, J., & Gross, J. L.
(2015).
Block meshes: Topologically robust shape modeling with graphs embedded on 3-manifolds. Computers and Graphics (UK).
46, 306-326.
-
Chen, J., Fan, J., & Sze, S.
(2015).
Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees. Theoretical Computer Science.
562(C), 496-512.
-
Liu, Y., Wang, J., Xu, C., Guo, J., & Chen, J.
(2015).
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs. Journal of Combinatorial Optimization.
29(1), 257-275.
-
Feng, Q., Wang, J., Li, S., & Chen, J.
(2015).
Randomized parameterized algorithms for P2-Packing and Co-Path Packing problems. Journal of Combinatorial Optimization.
29(1), 125-140.
-
Feng, Q., Wang, J., Xu, C., Yao, J., & Chen, J.
(2014).
Improved parameterized algorithms for minimum link-length rectilinear spanning path problem. Theoretical Computer Science.
560(P2), 158-171.
-
Wang, J., Tan, P., Yao, J., Feng, Q., & Chen, J.
(2014).
On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms. IEEE Transactions on Computers.
63(12), 3092-3100.
-
Shi, F., Wang, J., Chen, J., Feng, Q., & Guo, J.
(2014).
Algorithms for parameterized maximum agreement forest problem on multiple trees. Theoretical Computer Science.
554(C), 207-216.
-
Chen, J., & Feng, Q.
(2014).
On Unknown Small Subsets and Implicit Measures: New Techniques for Parameterized Algorithms. Journal of Computer Science and Technology.
29(5), 870-878.
-
Wang, J., Li, W., Li, S., & Chen, J.
(2014).
On the parameterized vertex cover problem for graphs with perfect matching. Science China Information Sciences.
57(7), 1-12.
-
Cao, Y., Chen, J., & Fan, J.
(2014).
An O(1.84k) parameterized algorithm for the multiterminal cut problem. Information Processing Letters.
114(4), 167-173.
-
LUO, W., FENG, Q., WANG, J., & CHEN, J.
(2014).
Parameterized Algorithms for Total p-Dominating Set. Jisuanji Xuebao.
36(9), 1868-1879.
-
Feng, Q., Wang, J., & Chen, J.
(2014).
Matching and Weighted P2-Packing: Algorithms and Kernels. Theoretical Computer Science.
522, 85-94.
-
Luo, W., Wang, J., Guo, J., & Chen, J.
(2014).
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks. Theoretical Computer Science.
518, 32-41.
-
Fei, Y. P., Chen, J. E., Chen, S. Q., & Li, M.
(2014).
Research on the complete operation set of modeling 2-manifold mesh. Hunan Daxue Xuebao/Journal of Hunan University Natural Sciences.
41(5), 118-124.
-
Luo, W., Wang, J., Feng, Q., Guo, J., & Chen, J.
(2013).
Improved linear problem kernel for planar connected dominating set. Theoretical Computer Science.
511, 2-12.
-
Shi, F., Feng, Q., Chen, J., Wang, L., & Wang, J.
(2013).
Distances between phylogenetic trees: A survey. Tsinghua Science & Technology.
18(5), 490-499.
-
Akleman, E., Xing, Q., Garigipati, P., Taubin, G., Chen, J., & Hu, S.
(2013).
Hamiltonian cycle art: Surface covering wire sculptures and duotone surfaces. Computers and Graphics (UK).
37(5), 316-332.
-
Wang, J., Yang, Y., Guo, J., & Chen, J.
(2013).
Planar graph vertex partition for linear problem kernels. Journal of Computer and System Sciences.
79(5), 609-621.
-
Sastry, S., Radeva, T., Chen, J., & Welch, J. L.
(2013).
Reliable networks with unreliable sensors. Pervasive and Mobile Computing.
9(2), 311-323.
-
Chen, J., Kanj, I. A., Meng, J., Xia, G. e., & Zhang, F.
(2013).
Parameterized top-K algorithms. Theoretical Computer Science.
470, 105-119.
-
Chen, J., Li, M., & Wang, J.
(2013).
Preface. International Journal of Bioinformatics Research and Applications.
9(1), 1-2.
-
Cao, Y., & Chen, J.
(2012).
Cluster Editing: Kernelization Based on Edge Cuts. Algorithmica: an international journal in computer science.
64(1), 152-169.
-
Chen, J., Fan, J., Kanj, I., Liu, Y., & Zhang, F.
(2012).
Multicut in trees viewed through the eyes of vertex cover. Journal of Computer and System Sciences.
78(5), 1637-1650.
-
Li, S., Feng, Q., Wang, J., & Chen, J.
(2012).
Kernelization for weighted 3-Set Packing problem. Jisuanji Yanjiu yu Fazhan/Computer Research and Development.
49(8), 1781-1786.
-
Hu, S., Xing, Q., Akleman, E., Chen, J., & Gross, J.
(2012).
Pattern mapping with quad-pattern-coverable quad-meshes. Computers and Graphics (UK).
36(5), 455-465.
-
Chen, J., & Zelikovsky, A.
(2012).
Guest editors introduction to the special section on bioinformatics research and applications. IEEE/ACM Transactions on Computational Biology and Bioinformatics.
9(4), 1002-1003.
-
Chen, J., Mndoiu, I., Sunderraman, R., Wang, J., & Zelikovsky, A.
(2012).
Guest editors' introduction. BMC Bioinformatics.
13 Suppl 10(Suppl 10), S1.
-
Li, W., Wang, J., & Chen, J.
(2012).
An improved parameterized algorithm for hyperplane-cover problem. Jisuanji Yanjiu yu Fazhan/Computer Research and Development.
49(4), 804-811.
-
Fan, J., Chen, J., & Sze, S.
(2012).
Identifying complexes from protein interaction networks according to different types of neighborhood density. Journal of Computational Biology.
19(12), 1284-1294.
-
Li, S., Wang, J., Chen, J., & Wang, Z.
(2011).
An Algorithm for Minimum Vertex Cover Based on Max-I Share Degree. Journal of Computers.
6(8), 1781-1788.
-
Zhang, F., Jiang, A. A., & Chen, J.
(2011).
On the Planarization of Wireless Sensor Networks. Algorithmica: an international journal in computer science.
60(3), 593-608.
-
Akleman, E., Chen, J., Chen, Y., Xing, Q., & Gross, J. L.
(2011).
Cyclic twill-woven objects. Computers and Graphics (UK).
35(3), 623-631.
-
Wang, J., Li, M., Chen, J., & Pan, Y. i.
(2011).
A fast hierarchical clustering algorithm for functional modules discovery in protein interaction networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics.
8(3), 607-620.
-
Chen, J., & Cooper, S. B.
(2011).
Algorithms, complexity and computational models Preface. Theoretical Computer Science.
412(23), 2457-2458.
-
Chen, J., Feng, Q., Liu, Y., Lu, S., & Wang, J.
(2011).
Improved deterministic algorithms for weighted matching and packing problems. Theoretical Computer Science.
412(23), 2503-2512.
-
Chen, J., Jiang, A. A., Kanj, I. A., Xia, G. e., & Zhang, F.
(2011).
Separability and topology control of quasi unit disk graphs. Wireless Networks: the journal of mobile communication, computation and information.
17(1), 53-67.
-
Wang, J., Li, W., & Chen, J.
(2010).
A parameterized algorithm for the hyperplane-cover problem. Theoretical Computer Science.
411(44-46), 4005-4009.
-
Wang, J., Wang, J. X., & Chen, J. E.
(2010).
Automated signature generation approach for polymorphic worm based on color coding. Ruanjian Xuebao.
21(10), 2599-2609.
-
Li, M., Wang, J. X., & Chen, J. E.
(2010).
Distance measure-based algorithm for identification of protein complexes. Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition).
40(5), 1318-1323.
-
Chen, J., Kanj, I. A., & Xia, G. e.
(2010).
Improved upper bounds for vertex cover. Theoretical Computer Science.
411(40-42), 3736-3756.
-
Liang, J. B., Wang, J. X., Li, T. S., & Chen, J. E.
(2010).
Maximum lifetime algorithm for precise data gathering based on tree in wireless sensor networks. Ruanjian Xuebao.
21(9), 2289-2303.
-
Wang, G., Chen, J., & Lin, C.
(2010).
NEW FAULT-TOLERANT BROADCAST ROUTING ALGORITHM ON MESH NETWORKS. Journal of Interconnection Networks.
11(3-4), 175-187.
-
WANG, J., YANG, Z., LIU, Y., & CHEN, J.
(2010).
An Improved Color Coding Algorithm Based on Hybrid Architecture. Jisuanji Xuebao.
33(6), 1024-1031.
-
WANG, J., JIANG, G., & CHEN, J.
(2010).
Fixed Parameter Enumeration Algorithm for Feedback Vertex Set in Weighted Undirected Graphs. Jisuanji Xuebao.
33(7), 1140-1152.
-
Liu, Y. L., Wang, J. X., & Chen, J. E.
(2010).
Improved parameterized algorithm for the multicut problem. Ruanjian Xuebao.
21(7), 1515-1523.
-
Feng, Q., WANG, J., & CHEN, J.
(2010).
Improved Algorithms for Weighted 3-Set Packing. Ruanjian Xuebao.
21(5), 886-898.
-
Li, M., Wang, J. X., Liu, B. B., & Chen, J. E.
(2010).
An algorithm for identifying protein complexes based on maximal clique extension. Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology).
41(2), 560-565.
-
Wang, J., Ning, D., Feng, Q., & Chen, J.
(2010).
An improved kernelization for P2-packing. Information Processing Letters.
110(5), 188-192.
-
Liang, J. B., Wang, J. X., & Chen, J. E.
(2010).
On the construction of a delay-constrained maximum lifetime tree in wireless sensor networks. Dianzi Xuebao.
38(2), 345-351.
-
Li, M., Wang, J., Chen, J., Cai, Z., & Chen, G.
(2010).
Identifying the overlapping complexes in protein interaction networks. International Journal of Data Mining and Bioinformatics.
4(1), 91-108.
-
LI, S., WANG, J., FENG, Q., & CHEN, J.
(2009).
Kernelization Techniques and Its Applications to Parameterized Computation. Ruanjian Xuebao.
20(9), 2307-2319.
-
Feng, Q., Wang, J., & Chen, J.
(2009).
Improved algorithms for weighted 3D-matching. Jisuanji Yanjiu yu Fazhan/Computer Research and Development.
46(11), 1877-1884.
-
Chen, J., Liu, Y., & Lu, S.
(2009).
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. Algorithmica: an international journal in computer science.
55(1), 1-13.
-
Chen, J., & Lu, S.
(2009).
Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach. Algorithmica: an international journal in computer science.
54(4), 472-489.
-
Liu, Y., Chen, J., & Wang, J.
(2009).
On Counting 3-D Matchings of Size k. Algorithmica: an international journal in computer science.
54(4), 530-543.
-
Xie, M. Z., Chen, J. E., & Wang, J. X.
(2009).
Research on parameterized algorithms of the individual Haplotyping problem. Jisuanji Xuebao.
32(8), 1637-1650.
-
Akleman, E., Chen, J., Xing, Q., & Gross, J. L.
(2009).
Cyclic Plain-Weaving on Polygonal Mesh Surfaces with Graph Rotation Systems. ACM TRANSACTIONS ON GRAPHICS.
28(3), 78-8.
-
Chen, J., Kanj, I. A., & Xia, G. e.
(2009).
On parameterized exponential time complexity. Theoretical Computer Science.
410(27-29), 2641-2648.
-
Wu, J., Wang, J., & Chen, J.
(2009).
A parthenogenetic algorithm for single individual SNP haplotyping. Engineering Applications of Artificial Intelligence.
22(3), 401-406.
-
WANG, J., NING, D., FENG, Q., & CHEN, J.
(2009).
Improved Parameterized Algorithm for P2-Packing Problem. Ruanjian Xuebao.
19(11), 2879-2886.
-
Chen, J., Kanj, I. A., Meng, J., Xia, G. e., & Zhang, F.
(2009).
On the pseudo-achromatic number problem. Theoretical Computer Science.
410(8-10), 818-829.
-
Cao, Y., Xu, D., Chen, J., & Guan, Q.
(2009).
Study of an epistemic description logic with transitive roles. Jisuanji Yanjiu yu Fazhan/Computer Research and Development.
46(3), 452-458.
-
Wu, J., Chen, J., & Wang, J.
(2009).
A particle swarm optimization algorithm for haplotype reconstruction based on minimum fragment removal model. Gaojishu tongxun.
19(2), 194-199.
-
Wu, J., Wang, J., & Chen, J.
(2009).
A practical algorithm based on particle swarm optimization for haplotype reconstruction. Applied Mathematics and Computation.
208(2), 363-372.
-
Wu, J., Wang, J., & Chen, J.
(2009).
A practical algorithm for multiplex PCR primer set selection. International Journal of Bioinformatics Research and Applications.
5(1), 38-49.
-
Li, M., Chen, J., & Wang, J.
(2009).
Shortest path-based analysis of protein-protein interaction networks. Gaojishu tongxun.
19(1), 89-94.
-
Zhang, T., Xu, D., & Chen, J.
(2008).
Application-oriented purely semantic precision and recall for ontology mapping evaluation. Knowledge-Based Systems.
21(8), 794-799.
-
Wu, Y., Wang, W., & Chen, J.
(2008).
An anonymous communication strategy with a new payment mechanism. Gaojishu tongxun.
18(11), 1117-1122.
-
Chen, J., Fomin, F. V., Liu, Y., Lu, S., & Villanger, Y.
(2008).
Improved algorithms for feedback vertex set problems. Journal of Computer and System Sciences.
74(7), 1188-1198.
-
Chen, J., Liu, Y., Lu, S., O'Sullivan, B., & Razgon, I.
(2008).
A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem. Journal of the ACM.
55(5), 21-19.
-
Chen, J., & Kanj, I. A.
(2008).
Parallel and Distribution Processing and Applicati - Foreword. Algorithmica: an international journal in computer science.
52(2), 113-113.
-
Wang, J., Xu, X., & Chen, J.
(2008).
Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. Journal of Computer Science and Technology.
23(5), 763-768.
-
Li, M., Chen, J., Wang, J., Hu, B., & Chen, G.
(2008).
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures. BMC Bioinformatics.
9(1), 398.
-
Xie, M., Wang, J., & Chen, J.
(2008).
A model of higher accuracy for the individual haplotyping problem based on weighted SNP fragments and genotype with errors. Bioinformatics.
24(13), i105-i113.
-
WANG, J.
(2008).
A Cooperant Congestion Control Protocol in High Bandwidth-Delay Product Networks. Ruanjian Xuebao.
19(1), 125-135.
-
Wang, J., Chen, J., & Huang, M.
(2008).
An improved lower bound on approximation algorithms for the Closest Substring problem. Information Processing Letters.
107(1), 24-28.
-
Xie, M., Wang, J., & Chen, J.
(2008).
Parameterized algorithm for the haplotype assembly MEC/GI model. Gaojishu tongxun.
18(4), 422-428.
-
Li, T., Chen, S., Chen, Y., & Chen, J.
(2008).
Research on anycast routing algorithm with multi-QoS requirements. Journal of Computational Information Systems.
4(2), 731-738.
-
Wang, J. X., Liu, Y. L., & Chen, J. E.
(2008).
Effective coloring algorithm for close relationship between the scales of element set and color set and its application. Jisuanji Xuebao.
31(1), 32-42.
-
Chen, J., & Meng, J.
(2008).
On parameterized intractability: Hardness and completeness. The Computer Journal.
51(1), 39-59.
-
Chen, J., Kanj, I. A., Perkovi, L., Sedgwick, E., & Xia, G. e.
(2007).
Genus characterizes the complexity of certain graph problems: Some tight results. Journal of Computer and System Sciences.
73(6), 892-907.
-
XIE, M.
(2007).
Parameterized Algorithm of the Individual Haplotyping MSR Problem with Mate-Pairs. Ruanjian Xuebao.
18(9), 2070-2070.
-
Lu, S., Zhang, F., Chen, J., & Sze, S.
(2007).
Finding pathway structures in protein interaction networks. Algorithmica: an international journal in computer science.
48(4), 363-374.
-
WANG, J.
(2007).
A Motif Finding Algorithm Based on Color Coding Technology. Ruanjian Xuebao.
18(4), 1298-1298.
-
Xie, M., Chen, J., & Wang, J.
(2007).
Research on parameterized algorithms of the individual haplotyping problem. Journal of Bioinformatics and Computational Biology.
5(3), 795-816.
-
Wang, J. X., Chen, D. L., & Chen, J. E.
(2007).
Prediction-based AQM algorithm for diffServ network. Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics.
29(5), 810-815.
-
Wang, J. X., Yang, X., & Chen, J. E.
(2007).
QL-CSFQ: A queue length embedded core-stateless fair queue algorithm. Dianzi Xuebao.
35(4), 736-742.
-
Huang, J., Chen, J., Chen, S., & Wang, J.
(2007).
A simple linear time approximation algorithm for multi-processor job scheduling on four processors. Journal of Combinatorial Optimization.
13(1), 33-45.
-
Chen, J., Fernau, H., Kanj, I. A., & Xia, G. e.
(2007).
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. SIAM Journal on Computing.
37(4), 1077-1106.
-
Chen, J., Huang, X., Kanj, I. A., & Xia, G. e.
(2007).
Polynomial time approximation schemes and parameterized complexity. DISCRETE APPLIED MATHEMATICS.
155(2), 180-193.
-
Chen, J., Wang, G., Lin, C., Wang, T., & Wang, G.
(2007).
Probabilistic analysis on mesh network fault tolerance. Journal of Parallel and Distributed Computing.
67(1), 100-110.
-
Chen, J., Huang, X., Kanj, I. A., & Xia, G. e.
(2006).
Strong computational lower bounds via parameterized complexity. Journal of Computer and System Sciences.
72(8), 1346-1367.
-
Gaocai, W., Chuang, L., & Jianer, C.
(2006).
Probabilistic analysis on connectivity for sensor grids with unreliable nodes. Wuhan University Journal of Natural Sciences.
11(6), 1757-1760.
-
Chen, J., & Zhang, F.
(2006).
On product covering in 3-tier supply chain models: Natural complete problems for W[3] and W[4]. Theoretical Computer Science.
363(3), 278-288.
-
Deng, X., Sun, L., Wang, J., Luo, Y., & Chen, J.
(2006).
On-demand multicast routing protocol based on node classification in MANET. Journal- Central South University.
13(2), 190-195.
-
Xiao, X., Wang, J., & Chen, J.
(2006).
Correlative parameters' analysis of auto-regressive prediction in traffic load's measurement. Jisuanji Gongcheng/Computer Engineering.
32(6), 130-133.
-
Huang, X., & Chen, J.
(2006).
On PTAS for Planar Graph Problems. IFIP Advances in Information and Communication Technology.
209, 299-313.
-
Chen, J., Kanj, I. A., & Xia, G. e.
(2005).
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. Algorithmica: an international journal in computer science.
43(4), 245-273.
-
Chen, J., Chor, B., Fellows, M., Huang, X. Z., Juedes, D., Kanj, I. A., & Xia, G.
(2005).
Tight lower bounds for certain parameterized NP-hard problems. Information and Computation.
201(2), 216-231.
-
Tang, S. X., Chen, J. E., & Zhang, T. S.
(2005).
Mamdani fuzzy system I/O relation representative and membership function optimization. Journal of Control Theory and Applications.
22(4), 520-526.
-
Chen, J., & Kanj, I. A.
(2005).
On approximating minimum vertex cover for graphs with perfect matching. Theoretical Computer Science.
337(1-3), 305-318.
-
Hu, Z. G., Tan, S. F., Gui, W. H., Chen, J. E., & Chen, S. Q.
(2005).
Resource-location method of grid based on chord. Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology).
36(3), 465-469.
-
CHEN, J., KANJ, I. A., & WANG, G.
(2005).
Hypercube Network Fault Tolerance: A Probabilistic Approach. Journal of Interconnection Networks.
6(01), 17-34.
-
Wang, W., Yang, J., Chen, S., & Chen, J.
(2005).
New anonymous protocol for multicast communication. Jisuanji Gongcheng/Computer Engineering.
31(3), 72-74.
-
Sui, H.
(2005).
Secret Sharing-Based Rerouting in Rerouting-Based Anonymous Communication Systems. Jisuanji Yanjiu yu Fazhan/Computer Research and Development.
42(10), 1660-1660.
-
Xiao, X., Wang, G., & Chen, J.
(2004).
Fault tolerant routing algorithm in hypercube networks with load balancing support. Lecture Notes in Computer Science.
3358, 698-704.
-
Sze, S. H., Lu, S. J., & Chen, J. E.
(2004).
Integrating sample-driven and pattern-driven approaches in motif finding. Lecture Notes in Computer Science.
3240, 438-449.
-
Chen, J., Huang, X., Kanj, I. A., & Xia, G.
(2004).
Polynomial Time Approximation Schemes and Parameterized Complexity. Lecture Notes in Computer Science.
3153, 500-512.
-
Liu, R., Chen, S., Chen, J., & Li, S.
(2004).
Some results on the minimal coverings of precomplete classes in partialk-valued logic functions. Journal of Computer Science and Technology.
19(6), 981-985.
-
Chen, J. N., Friesen, D. K., Jia, W. J., & Kanj, I. A.
(2004).
Using nondeterminism to design efficient deterministic algorithms. Algorithmica: an international journal in computer science.
40(2), 83-97.
-
Chen, J., & Kanj, I. A.
(2004).
Improved exact algorithms for MAX-SAT. DISCRETE APPLIED MATHEMATICS.
142(1-3), 17-27.
-
Huang, J. G., Chen, J. E., & Chen, S. Q.
(2004).
Parallel-job scheduling on cluster computing systems. Jisuanji Xuebao.
27(6), 765-771.
-
Deng, H., Chen, J., Li, Q., Li, R., & Gao, Q.
(2004).
On the construction of most reliable networks. DISCRETE APPLIED MATHEMATICS.
140(1-3), 19-33.
-
Wang, W. P., Chen, J. E., Chen, S. Q., & Wang, J. X.
(2004).
Research on a short distance-prior rerouting scheme in anonymous communication. Ruanjian Xuebao.
15(4), 561-570.
-
Sui, H., Wang, J., Chen, J., & Chen, S.
(2004).
The cost of becoming anonymous: on the participant payload in Crowds. Information Processing Letters.
90(2), 81-86.
-
Wang, G., Chen, J., & Wang, G.
(2004).
On fault tolerance of 3-dimensional mesh networks. Journal of Computer Science and Technology.
19(2), 183-190.
-
Wang, G. C., Chen, J. E., Chen, S. Q., & Li, T. S.
(2004).
Probabilistic analysis on fault tolerant routing algorithms on mesh networks. Jisuanji Xuebao.
27(3), 319-327.
-
Sui, H. F., Chen, S. Q., Chen, J. E., Wang, J. X., & Wang, W. P.
(2004).
Payload analysis of rerouting-based anonymous communication systems. Ruanjian Xuebao.
15(2), 278-285.
-
Chen, J., Liu, Y. P., Chen, S. W., & Chen, S. Q.
(2004).
Discrete Mathematics and Theoretical Computer Science (DMTCS) - Preface. DISCRETE APPLIED MATHEMATICS.
136(1), 1-1.
-
Jia, W., Zhang, C., & Chen, J.
(2004).
An efficient parameterized algorithm for m-set packing. Journal of Algorithms in Cognition, Informatics and Logic.
50(1), 106-117.
-
Chen, J., & Fellows, M. R.
(2003).
Foreword from the guest editors. Journal of Computer and System Sciences.
67(4), 653-653.
-
Chen, J., Kanj, I. A., Perkovi, L., Sedgwick, E., & Xia, G.
(2003).
Genus characterizes the complexity of graph problems: Some tight results. Lecture Notes in Computer Science.
2719, 845-856.
-
Chen, J., Kanj, I. A., & Xia, G.
(2003).
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems. Lecture Notes in Computer Science.
2906, 148-157.
-
Akleman, E., Chen, J. N., & Srinivasan, V.
(2003).
A minimal and complete set of operators for the development of robust manifold mesh modelers. 65(5), 286-304.
-
Wang, G., Chen, J., Wang, G., & Chen, S.
(2003).
Probabilistic analysis on fault tolerance of 3-Dimensional mesh networks. Journal- Central South University.
10(3), 255-259.
-
Oh, E., & Chen, J.
(2003).
On strong Menger-connectivity of star graphs. DISCRETE APPLIED MATHEMATICS.
129(2-3), 499-511.
-
Wang, J., Peng, G., Chen, S., & Chen, J.
(2003).
An efficient QoS routing algorithm for multi-constrained path selection. Journal- Central South University.
10(2), 151-154.
-
OH, E., & CHEN, J.
(2003).
STRONG FAULT-TOLERANCE: PARALLEL ROUTING IN STAR NETWORKS WITH FAULTS. Journal of Interconnection Networks.
4(01), 113-162.
-
Wang, G. J., Zhang, Z. P., Chen, J. E., & Chen, S. Q.
(2003).
Probabilistic analysis on fault tolerance of hypercube networks. Zhongnan Gongye Daxue Xuebao/Journal of Central South University of Technology.
34(1), 79.
-
Chen, S., Huang, J., & Chen, J.
(2002).
Approximation algorithm for multiprocessor parallel job scheduling. Journal- Central South University.
9(4), 267-272.
-
Malpani, N., & Chen, J.
(2002).
A note on practical construction of maximum bandwidth paths. Information Processing Letters.
83(3), 175-180.
-
Wang, G. J., Chen, S. Q., Chen, J. E., & Qi, F.
(2002).
Parallel fault tolerant routing algorithms in hypercube networks. Zhongnan Gongye Daxue Xuebao/Journal of Central South University of Technology.
33(4), 424.
-
Xie, J. G., Chen, J. E., & Chen, S. Q.
(2002).
Scheduling and admission control in video servers with multi-network I/O. Ruanjian Xuebao.
13(8), 1735-1740.
-
Xie, J. G., Chen, S. Q., & Chen, J. E.
(2002).
Smoothing retrieval algorithm for VBR video. Dianzi Xuebao.
30(8), 1235-1237+1241.
-
Wang, G. J., Chen, J. E., & Chen, S. Q.
(2002).
Broadcast fault tolerant routing algorithms in hypercube networks. Zhongnan Gongye Daxue Xuebao/Journal of Central South University of Technology.
33(3), 305.
-
Chen, J., Wang, G. J., & Chen, S. Q.
(2002).
Locally subcube-connected hypercube networks: Theoretical analysis and experimental results. IEEE Transactions on Computers.
51(5), 530-540.
-
Liu, L., Chen, J., Chen, S., & Jia, W.
(2002).
An new representation for interconnection network structures. Journal- Central South University.
9(1), 47-53.
-
Wang, J., Chen, J., & Chen, S.
(2002).
An effective randomized QoS routing algorithm on networks with inaccurate parameters. Journal of Computer Science and Technology.
17(1), 38-46.
-
AKLEMAN, E., CHEN, J., SRINIVASAN, V., & ERYOLDAS, F.
(2001).
A NEW CORNER CUTTING SCHEME WITH TENSION AND HANDLE-FACE RECONSTRUCTION. International Journal of Shape Modeling.
07(02), 111-128.
-
Wang, J., Huang, G., Chen, S., & Chen, J.
(2001).
An improved network layer protocol based on mobile IPv6. Journal- Central South University.
8(4), 263-267.
-
Chen, J., Kanj, I. A., & Jia, W. J.
(2001).
Vertex Cover: Further observations and further improvements. Journal of Algorithms in Cognition, Informatics and Logic.
41(2), 280-301.
-
CHEN, J., WANG, G., & CHEN, S.
(2001).
ROUTING IN HYPERCUBE NETWORKS WITH A CONSTANT FRACTION OF FAULTY NODES. Journal of Interconnection Networks.
2(03), 283-294.
-
Wang, J., Chen, S., & Chen, J.
(2001).
Anycast service model and its QoS routing algorithm. Journal- Central South University.
8(2), 135-139.
-
Chen, J., & Miranda, A.
(2001).
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling. SIAM Journal on Computing.
31(1), 1-17.
-
Chen, J., Liu, L., & Jia, W.
(2000).
Improvement on vertex cover for lowdegree graphs. Networks.
35(4), 253-259.
-
AKLEMAN, E., & CHEN, J.
(1999).
GUARANTEEING THE 2-MANIFOLD PROPERTY FOR MESHES WITH DOUBLY LINKED FACE LIST. International Journal of Shape Modeling.
05(02), 159-177.
-
Chen, J., Friesen, D. K., & Zheng, H.
(1999).
Tight bound on Johnson's algorithm for maximum satisfiability. Journal of Computer and System Sciences.
58(3), 622-640.
-
Chen, J., & Lee, C.
(1999).
General multiprocessor task scheduling. Naval Research Logistics.
46(1), 57-74.
-
Chen, J., & Kanchi, S. P.
(1999).
Graph ear decompositions and graph embeddings. SIAM Journal on Discrete Mathematics.
12(2), 229-242.
-
Cai, L., Chen, J., & Hstad, J.
(1998).
Circuit Bottom Fan-in and Computational Power. SIAM Journal on Computing.
27(2), 341-355.
-
Chen, C., & Chen, J.
(1998).
The Maximum Partition Matching Problem with Applications. SIAM Journal on Computing.
28(3), 935-954.
-
Cai, L., Chen, J., Downey, R. G., & Fellows, M. R.
(1997).
On the parameterized complexity of short computation and factorization. Archive for Mathematical Logic.
36(4-5), 321-337.
-
Chen, J.
(1997).
Algorithmic graph embeddings. Theoretical Computer Science.
181(2), 247-266.
-
Cai, L., & Chen, J.
(1997).
On Fixed-Parameter Tractability and Approximability of NP Optimization Problems. Journal of Computer and System Sciences.
54(3), 465-474.
-
Cai, L., & Chen, J.
(1997).
On the Amount of Nondeterminism and the Power of Verifying. SIAM Journal on Computing.
26(3), 733-750.
-
Chen, J., Kanchi, S. P., & Kanevsky, A.
(1997).
A note on approximating graph genus. Information Processing Letters.
61(6), 317-322.
-
Cai, L., Chen, J., Downey, R. G., & Fellows, M. R.
(1997).
Advice classes of parameterized tractability. Annals of Pure and Applied Logic.
84(1), 119-138.
-
Chen, C. C., & Chen, J.
(1997).
Nearly optimal one-to-many parallel routing in star networks. IEEE Transactions on Parallel and Distributed Systems.
8(12), 1196-1202.
-
Chen, C. C., & Chen, J.
(1997).
Optimal parallel routing in star networks. IEEE Transactions on Computers.
46(12), 1293-1303.
-
Gross, J. L., & Chen, J.
(1996).
Algebraic specification of interconnection network relationships by permutation voltage graph mappings. Mathematical Systems Theory.
29(5), 451-470.
-
Chen, J., Kanchi, S. P., & Gross, J. L.
(1996).
A tight lower bound on the maximum genus of a simplicial graph. Discrete Mathematics.
156(1-3), 83-102.
-
Chen, J., Archdeacon, D., & Gross, J. L.
(1996).
Maximum genus and connectivity. Discrete Mathematics.
149(1-3), 19-29.
-
CAI, L. M., CHEN, J., DOWNEY, R., & FELLOWS, M.
(1995).
ON THE STRUCTURE OF PARAMETERIZED PROBLEMS IN NP. Information and Computation.
123(1), 38-49.
-
Cai, L., & Chen, J.
(1995).
On input read-modes of alternating Turing machines. Theoretical Computer Science.
148(1), 33-55.
-
CHEN, J., GROSS, J. L., & RIEPER, R. G.
(1995).
LOWER BOUNDS FOR THE AVERAGE GENUS. Journal of Graph Theory.
19(3), 281-296.
-
Chen, J.
(1994).
A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. SIAM Journal on Discrete Mathematics.
7(4), 614-631.
-
Chen, J., Gross, J. L., & Rieper, R. G.
(1994).
Overlap matrices and total imbedding distributions. Discrete Mathematics.
128(1-3), 73-94.
-
CHEN, J., & GROSS, J. L.
(1993).
KURATOWSKI-TYPE THEOREMS FOR AVERAGE GENUS. Journal of Combinatorial Theory: Series B.
57(1), 100-121.
-
Chen, J., & Gross, J. L.
(1992).
Limit points for average genus II. 2-Connected non-simplicial graphs. Journal of Combinatorial Theory: Series B.
56(1), 108-129.
-
Chen, J., & Gross, J. L.
(1992).
Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs. Journal of Combinatorial Theory: Series B.
55(1), 83-103.
-
CHEN, J.
(1991).
CHARACTERIZING PARALLEL HIERARCHIES BY REDUCIBILITIES. Information Processing Letters.
39(6), 303-307.
-
Chen, J., & Yap, C.
(1991).
Reversal Complexity. SIAM Journal on Computing.
20(4), 622-638.
-
CHEN, J., COX, J., & MISHRA, B.
(1991).
AN NL HIERARCHY. Information Processing Letters.
39(1), 21-26.
-
Chen, J.
(1990).
The difference between one tape and two tapes: With respect to reversal complexity. Theoretical Computer Science.
73(3), 265-278.
-
Wang, J., Feng, Q., & Chen, J.
Color-Coding and its Applications: A Survey. 5(4), 595-606.
-
Wu, G., Chen, J., & Wang, J.
(2020).
On scheduling multiple two-stage flowshops. Theoretical Computer Science.
818, 74-82.
-
book
-
Chen, J., Hopcroft, J., & Wang, J.
(2014).
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface. Ed. 8497 LNCS.
-
Chen, J., Wang, J., & Zelikovsky, A.
(2011).
Bioinformatics Research and Applications. Ed. 6674 LNBI.
Springer Berlin Heidelberg.
-
Chen, J., & Fomin, F.
(2009).
Parameterized and Exact Computation: Preface. Ed. 5917 LNCS.
-
Stuckenschmidt, H., Parent, C., & Spaccapietra, S.
(2009).
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface. Ed. 5445 LNCS.
-
Chen, J., & Cooper, S. B.
(2009).
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface. Ed. 5532 LNCS.
-
Chen, J., Hopcroft, J., & Wang, J.
(2014).
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface. Ed. 8497 LNCS.
-
chapter
-
Chen, J., & Xia, G. e.
(2013).
Complexity Issues on PTAS. Handbook of Combinatorial Optimization.
(pp. 723-746).
Springer Nature.
-
Chen, J.
(2008).
Maximum Partition Matching. Floudas, C. A., & Pardalos, P. M. (Eds.),
Encyclopedia of Optimization.
(pp. 2029-2035).
Springer Nature.
-
Chen, J., & Xia, G. e.
(2013).
Complexity Issues on PTAS. Handbook of Combinatorial Optimization.
(pp. 723-746).
Springer Nature.
-
conference paper
-
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.
187-200.
-
Chen, J.
(2017).
Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings
-
Wu, G., Chen, J., & Wang, J.
(2017).
On Approximation Algorithms for Two-Stage Scheduling Problems. Lecture Notes in Computer Science.
241-253.
-
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. International Conference on Distributed Computing Systems.
98-107.
-
Li, W., Wang, J., Chen, J., & Cao, Y.
(2015).
A 2k-vertex Kernel for Maximum Internal Spanning Tree. 495-505.
-
Chen, J., Xu, C., & Wang, J.
(2015).
Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm. 178-188.
-
Xu, C., Chen, J., & Wang, J.
(2015).
Improved MaxSAT Algorithms for Instances of Degree 3. Lecture Notes in Computer Science.
20-30.
-
Wang, G., Liu, Q., Xiang, Y., & Chen, J.
(2014).
Security from the Transparent Computing Aspect. 216-220.
-
Chen, J.
(2014).
Frontiers in Algorithmics - 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014. Proceedings
-
Shi, F., Chen, J., Feng, Q., & Wang, J.
(2014).
Approximation Algorithms for Maximum Agreement Forest on Multiple Trees. Lecture Notes in Computer Science.
381-392.
-
Li, W., Chen, J., & Wang, J.
(2014).
Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees. Lecture Notes in Computer Science.
642-653.
-
Wang, J., Yang, M., Guo, J., Feng, Q., & Chen, J.
(2013).
Parameterized Complexity of Control and Bribery for d-Approval Elections. Lecture Notes in Computer Science.
260-271.
-
Chen, J., Wang, J., Lu, J. u., Greene, M., Pan, Y. i., & Wang, G.
(2013).
Message from the Workshop Chairs: HPTC 2013. xxxv-xxxv.
-
Chen, J., Wang, J., Lu, J. u., Greene, M., Pan, Y. i., & Wang, G.
(2013).
Message from the Workshop Chairs: HPTC 2013. lxxxvii-lxxxvii.
-
Liu, Y., Wang, J., Xu, C., Guo, J., & Chen, J.
(2013).
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs. Lecture Notes in Computer Science.
555-566.
-
Shi, F., Chen, J., Feng, Q., & Wang, J.
(2013).
Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees. Lecture Notes in Computer Science.
567-578.
-
Feng, Q., Wang, J., Li, S., & Chen, J.
(2013).
Random Methods for Parameterized Problems. Lecture Notes in Computer Science.
89-100.
-
Cao, Y., Chen, J., & Fan, J.
(2013).
An O*(1.84k) Parameterized Algorithm for the Multiterminal Cut Problem. 84-94.
-
Ren, J., Zhang, Y., & Chen, J.
(2013).
Analysis on the Scheduling Problem in Transparent Computing. 1832-1837.
-
Chen, J., Fan, J., & Sze, S.
(2013).
Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees. Lecture Notes in Computer Science.
152-164.
-
Chen, J.
(2013).
Sixth International Conference on Contemporary Computing, IC3 2013, Noida, India, August 8-10, 2013
-
Wu, J., Wang, J., & Chen, J.
(2013).
A heuristic algorithm for haplotype reconstruction from aligned weighted SNP fragments. International Journal of Bioinformatics Research and Applications.
13-24.
-
Cao, Y., & Chen, J.
(2013).
On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem. 319-330.
-
Liu, Y., Wang, J., Guo, J., & Chen, J.
(2012).
Complexity and parameterized algorithms for Cograph Editing. Theoretical Computer Science.
45-54.
-
Chen, J., & Kanj, I. A.
(2012).
Parameterized Complexity and Subexponential-Time Computability. Lecture Notes in Computer Science.
162-195.
-
Chen, J., Fernau, H., Shaw, P., Wang, J., & Yang, Z.
(2012).
Kernels for Packing and Covering Problems. Lecture Notes in Computer Science.
199-211.
-
Zheng, Y., Wang, J., Feng, Q., & Chen, J.
(2012).
FPT Results for Signed Domination. Lecture Notes in Computer Science.
572-583.
-
Wang, J., Yao, J., Feng, Q., & Chen, J.
(2012).
Improved FPT Algorithms for Rectilinear k-Links Spanning Path. Lecture Notes in Computer Science.
560-571.
-
Chen, J., Liu, Y., Lu, S., Sze, S., & Zhang, F.
(2012).
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching. ACM Transactions on Algorithms.
1-22.
-
Chen, J., Fernau, H., Shaw, P., Wang, J., & Yang, Z.
(2012).
Kernels for Packing and Covering Problems - (Extended Abstract). 199-211.
-
Xing, Q., Akleman, E., Taubin, G., & Chen, J.
(2012).
Surface Covering Curves. 107-114.
-
Chen, J., & Meng, J.
(2012).
A 2k kernel for the cluster editing problem. Journal of Computer and System Sciences.
211-220.
-
Chen, G., Wang, J., Pan, Y. i., & Chen, J.
(2011).
Identification of Breast Cancer Gene Signature in Protein Interaction Network using Graph Centrality. Proceedings. IEEE International Conference on Bioinformatics and Biomedicine.
402-405.
-
Hassanzadeh, A., Stoleru, R., & Chen, J.
(2011).
Efficient Flooding in Wireless Sensor Networks Secured with Neighborhood Keys. International Conference on Wireless and Mobile Computing, Networking and Communications.
119-126.
-
Wang, J., Yang, Y., Guo, J., & Chen, J.
(2011).
Linear Problem Kernels for Planar Graph Problems with Small Distance Property. Lecture Notes in Computer Science.
592-603.
-
Chen, J., Fan, J., Kanj, I. A., Liu, Y., & Zhang, F.
(2011).
Multicut in Trees Viewed through the Eyes of Vertex Cover. Lecture Notes in Computer Science.
219-+.
-
Liu, Y., Wang, J., Guo, J., & Chen, J.
(2011).
Cograph Editing: Complexity and Parameterized Algorithms. Lecture Notes in Computer Science.
110-121.
-
Feng, Q., Wang, J., & Chen, J.
(2011).
Matching and P2-Packing: Weighted Versions. Lecture Notes in Computer Science.
343-353.
-
Xing, Q., Esquivel, G., Akleman, E., Chen, J., & Gross, J.
(2011).
Band decomposition of 2-manifold meshes for physical construction of large structures. 58-58.
-
Xing, Q., Esquivel, G., Akleman, E., Chen, J., & Gross, J.
(2011).
Band decomposition of 2-manifold meshes for physical construction of large structures. 25-25.
-
Shi-Yu, .., Xing, Q., Akleman, E., Chen, J., & Gross, J.
(2011).
Pattern mapping with quad-pattern-coverable quad-meshes. 26-26.
-
Liang, J., Wang, J., Zhang, X. i., & Chen, J.
(2011).
An Adaptive Probability Broadcast-based Data Preservation Protocol in Wireless Sensor Networks. 2013 National Conference on Communications, NCC 2013.
1-5.
-
Luo, W., Wang, J., Feng, Q., Guo, J., & Chen, J.
(2011).
An Improved Kernel for Planar Connected Dominating Set. Lecture Notes in Computer Science.
70-81.
-
Wang, J., Feng, Q., & Chen, J.
(2011).
An O*(3.53(3k))-time parameterized algorithm for the 3-set packing problem. Theoretical Computer Science.
1745-1753.
-
Chen, J.
(2011).
Bioinformatics Research and Applications - 7th International Symposium, ISBRA 2011, Changsha, China, May 27-29, 2011. Proceedings
-
Sastry, S., Radeva, T., Chen, J., & Welch, J. L.
(2011).
Reliable Networks with Unreliable Sensors. Lecture Notes in Computer Science.
281-+.
-
Cao, Y., & Chen, J.
(2010).
Cluster Editing: Kernelization Based on Edge Cuts. Lecture Notes in Computer Science.
60-71.
-
Wang, G., Li, T., & Chen, J.
(2010).
Probabilistic Analysis on Mesh Network Fault Tolerance: Deterministic vs. Stochastic. 731-736.
-
XIE, M., WANG, J., & CHEN, J.
(2010).
A practical parameterised algorithm for the individual haplotyping problem MLF. Mathematical Structures in Computer Science.
851-863.
-
Chen, J., & Meng, J.
(2010).
A 2k Kernel for the Cluster Editing Problem. Lecture Notes in Computer Science.
459-468.
-
Akleman, E., Chen, J., Chen, Y., & Xing, Q.
(2010).
Cyclic twill-woven objects. 106-106:1.
-
Akleman, E., Chen, J., Chen, Y., & Xing, Q.
(2010).
Cyclic twill-woven objects. 7.
-
Cao, Y., Chen, J., & Liu, Y.
(2010).
On Feedback Vertex Set New Measure and New Structures. Lecture Notes in Computer Science.
93-+.
-
Akleman, E., Chen, J., & Gross, J. L.
(2010).
Paper-Strip Sculptures. 236-240.
-
Xing, Q., Aklcmar, E., Cherr, J., & Gross, J. L.
(2010).
Single-Cycle Plain-Woven Objects. 90-99.
-
Liang, J., Wang, J., & Chen, J.
(2010).
An Overhearing-based Scheme for Improving Data Persistence in Wireless Sensor Networks. IEEE International Conference on Communications.
1-5.
-
Wang, J., Xie, M., & Chen, J.
(2010).
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI. Algorithmica: an international journal in computer science.
283-296.
-
Liang, J., Wang, J., Cao, J., Chen, J., & Lu, M.
(2010).
An Efficient Algorithm for Constructing Maximum lifetime Tree for Data Gathering Without Aggregation in Wireless Sensor Networks. IEEE Infocom. Proceedings.
1-5.
-
Chen, J., & Meng, J.
(2010).
A 2k Kernel for the Cluster Editing Problem. 459-468.
-
Ren, J., Wang, J., Chen, J., Li, M., & Chen, G.
(2010).
An Agglomerate Algorithm for Mining Overlapping and Hierarchical Functional Modules in Protein Interaction Networks. 140-151.
-
Liang, J., Wang, J., & Chen, J.
(2009).
A Delay-Constrained and Maximum Lifetime Data Gathering Algorithm for Wireless Sensor Networks. 148-155.
-
Wang, J., Chen, B., Feng, Q., & Chen, J.
(2009).
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set. Lecture Notes in Computer Science.
237-250.
-
Chen, J., & Liu, Y.
(2009).
An Improved SAT Algorithm in Terms of Formula Length. Lecture Notes in Computer Science.
144-155.
-
Chen, J., Kanj, I. A., & Ge, X.
(2009).
On Parameterized Exponential Time Complexity. Lecture Notes in Computer Science.
168-+.
-
Li, M., Wang, J., Chen, J., & Pan, Y. i.
(2009).
Hierarchical Organization of Functional Modules in Weighted Protein Interaction Networks Using Clustering Coefficient. Lecture Notes in Computer Science.
75-86.
-
Sha, S., Jianer, C., & Sanding, L.
(2009).
A Fast Matching Algorithm Based on K-Degree Template. 1967-1971.
-
Sha, S., Jianer, C., Ling, Q., & Sanding, L.
(2009).
Evolutionary Mechanism and Implemention for Recognition of Objects in Dynamic Vision. 178-182.
-
Wang, J., Wang, J., Chen, J., & Zhang, X. i.
(2009).
An Automated Signature Generation Approach for Polymorphic Worm Based on Color Coding. 2013 National Conference on Communications, NCC 2013.
926-+.
-
Wang, J., Rong, L., Zhang, X., & Chen, J.
(2009).
ARROW-TCP: Accelerating Transmission toward Efficiency and Fairness for High-Speed Networks. 1-6.
-
Wang, J., Rong, L., Zhang, X. i., & Chen, J.
(2009).
ARROW-TCP: Accelerating Transmission toward Efficiency and Fairness for High-speed Networks. 838-843.
-
Wang, W., Duan, G., Wang, J., & Chen, J.
(2009).
An Anonymous Communication Mechanism without Key Infrastructure based on Multi-paths Network Coding. 1-6.
-
Wang, J., Wang, J., Chen, J., & Zhang, X.
(2009).
An Automated Signature Generation Approach for Polymorphic Worm Based on Color Coding. 1-6.
-
Chen, J.
(2009).
Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers
-
Wang, J., Wang, J., Sheng, Y. u., & Chen, J.
(2009).
Polymorphic Worm Detection Using Signatures Based on Neighborhood Relation. 347-353.
-
Chen, J.
(2009).
Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings
-
Chen, J., Liu, Y., Lu, S., O'Sullivan, B., & Razgon, I.
(2008).
A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem. Annual ACM Symposium on Theory of Computing.
177-186.
-
Xie, M., Wang, J., & Chen, J.
(2008).
A practical parameterized algorithm for the individual haplotyping problem MLF. Lecture Notes in Computer Science.
433-444.
-
Wang, J., Ning, D., Feng, Q., & Chen, J.
(2008).
An improved parameterized algorithm for a generalized matching problem. Lecture Notes in Computer Science.
212-222.
-
Chen, J., Kanj, I. A., Meng, J., Xia, G. e., & Zhang, F.
(2008).
On the Pseudo-achromatic Number Problem. Lecture Notes in Computer Science.
78-+.
-
Wu, J., Wang, J., & Chen, J.
(2008).
A Genetic Algorithm for Single Individual SNP Haplotype Assembly. 1012-1017.
-
Wu, Y., Wang, W., & Chen, J.
(2008).
A Novel Anonymous Communication Strategy With Respect to Payment Mechanism. 1527-1531.
-
Li, M., Wang, J., Chen, J., & Hu, B.
(2008).
Greedily Mining $l$-dense Subgraphs in Protein Interaction Networks. 1018-1023.
-
Chen, J., Fellows, M. R., & Ma, H.
(2008).
Welcome Message from the Program Chairs. xliv-xliv.
-
Sheng, Y. u., Wang, W., Wang, J., & Chen, J.
(2008).
A Virtual Laboratory Platform Based on Integration of Java and Matlab. 285-295.
-
Li, M., Wang, J., & Chen, J.
(2008).
A Graph-Theoretic Method for Mining Overlapping Functional Modules in Protein Interaction Networks. 208-219.
-
Xie, M., Wang, J., & Chen, J.
(2008).
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI. 342-351.
-
Xie, M., Wang, J., Zhou, W., & Chen, J.
(2008).
A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem. 16-27.
-
Chen, J.
(2008).
Randomized disposal of unknowns and implicitly enforced bounds on parameters. Lecture Notes in Computer Science.
1-8.
-
Li, M., Wang, J., & Chen, J.
(2008).
A Fast Agglomerate Algorithm for Mining Functional Modules in Protein Interaction Networks. 3-7.
-
Wu, J., Wang, J., & Chen, J.
(2008).
A Particle Swarm Optimization Algorithm Based on Optimal Result Set for Haplotyping a Single Individual. 395-399.
-
Xie, M., Wang, J., & Chen, J.
(2008).
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC* *This research was supported in part by the National Natural Science Foundation of China under Grant Nos.60433020and 60773111, the Program for New Century Excellent Talents in University No. NCET-050683, the Program for Changjiang Scholars and Innovative Research Team in University No. IRT0661, and the Scientific Research Fund of Hunan Provincial Education Department. 72-76.
-
Zhang, F., Jiang, A. A., & Chen, J.
(2008).
Robust planarization of unlocalized wireless sensor networks. IEEE Infocom. Proceedings.
1472-1480.
-
Zhang, F., Jiang, A., & Chen, J.
(2008).
Sorting Based Data Centric Storage. 283-286.
-
Zhang, F., Jiang, A., & Chen, J.
(2008).
Robust Planarization of Unlocalized Wireless Sensor Networks. 798-806.
-
Wang, J., Huang, M., & Chen, J.
(2007).
A lower bound on approximation algorithms for the closest substring problem. Lecture Notes in Computer Science.
291-+.
-
Liu, Y., Chen, J., & Wang, J.
(2007).
A randomized approximation algorithm for parameterized 3-D matching counting problem. Lecture Notes in Computer Science.
349-+.
-
Chen, I., Liu, Y., & Lu, S.
(2007).
An improved parameterized algorithm for the minimum node multiway cut problem. Lecture Notes in Computer Science.
495-+.
-
Chen, J., Fomin, F. V., Liu, Y., Lu, S., & Villanger, Y.
(2007).
Improved algorithms for the feedback vertex set problems. Lecture Notes in Computer Science.
422-+.
-
Chen, J., & Lu, S.
(2007).
Improved algorithms for weighted and unweighted set splitting problems. Lecture Notes in Computer Science.
537-+.
-
Jianxin, W., Hao, G., & Jianer, C.
(2007).
C3P: A Cooperant Congestion Control Protocol in High Bandwidth-Delay Product Networks. Proceedings - International Conference on Computer Communications and Networks, ICCCN.
687-692.
-
Zhang, F., Li, H., Jiang, A. A., Chen, J., & Luo, P.
(2007).
Face Tracing Based Geographic Routing in Nonplanar Wireless Networks. IEEE Infocom. Proceedings.
2243-+.
-
Chen, J., Jiang, A. A., Kanj, I. A., Xia, G. e., & Zhang, F.
(2007).
Separability and Topology Control of Quasi Unit Disk Graphs. IEEE Infocom. Proceedings.
2225-+.
-
Wang, J., Xu, X., & Chen, J.
(2007).
An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. 760-769.
-
Liu, Y., Chen, J., & Wang, J.
(2007).
Parameterized Algorithms for Weighted Matching and Packing Problems. 692-702.
-
Chen, J., Lu, S., Sze, S., & Zhang, F.
(2007).
Improved Algorithms for Path, Matching, and Packing Problems. 298-307.
-
Chen, J., Huang, X. Z., Kanj, I. A., & Xia, G.
(2006).
On the computational hardness based on linear FPT-reductions. Journal of Combinatorial Optimization.
231-247.
-
Wang, J., Chen, D., & Chen, J.
(2006).
A Prediction-Based AQM Algorithm for DiffServ Networks. 379-384.
-
Wang, J., Chen, D., & Chen, J.
(2006).
A Prediction-Based AQM Algorithm for Diffserv Networks. 1-6.
-
Liu, Y., Lu, S., Chen, J., & Sze, S.
(2006).
Greedy localization and color-coding: Improved matching and packing algorithms. Lecture Notes in Computer Science.
84-95.
-
Chen, J., Kanj, I. A., & Xia, G. e.
(2006).
Improved parameterized upper bounds for vertex cover. Lecture Notes in Computer Science.
238-249.
-
Akleman, E., & Chen, J.
(2006).
Insight for practical subdivision modeling with discrete Gauss-Bonnet theorem. Lecture Notes in Computer Science.
287-298.
-
Wang, J., Zhu, X., & Chen, J.
(2006).
Link availability at any time in MANET. Lecture Notes in Computer Science.
184-196.
-
Chen, J., Kanj, I. A., Meng, J., Xia, G. e., & Zhang, F.
(2006).
On the effective enumerability of NP problems. Lecture Notes in Computer Science.
215-226.
-
Akleman, E., & Chen, J.
(2006).
Regular Mesh Construction Algorithms using Regular Handles. 1-11.
-
Li, H., Zhao, R., Chen, J., & Xiang, Y.
(2006).
Research on multi-valued and multi-labeled decision trees. Lecture Notes in Computer Science.
247-254.
-
Zhang, N., Zhao, W., & Chen, J.
(2005).
Performance measurements for privacy preserving data mining. Lecture Notes in Computer Science.
43-49.
-
Xu, H. Y., Fu, X. W., Zhu, Y., Bettati, R., Chen, J. N., & Zhao, W.
(2005).
SAS: A scalar anonymous communication system. Lecture Notes in Computer Science.
452-461.
-
Chen, J., Huang, X. Z., Kanj, I. A., & Xia, G.
(2005).
W-hardness under linear FPT-reductions: Structural properties and further applications. Lecture Notes in Computer Science.
975-984.
-
Chen, J., & Zhang, F.
(2005).
On product covering in supply chain models: Natural complete problems for W[3] and W [4]. Lecture Notes in Computer Science.
400-410.
-
Chen, J., Fernau, H., Kanj, I. A., & Xia, G.
(2005).
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. Lecture Notes in Computer Science.
269-280.
-
Akleman, E., & Chen, J.
(2005).
Regular meshes. ACM Symposium on Solid Modeling and Applications, SM.
213-219.
-
Chen, J., Huang, X., Kanj, I. A., & Xia, G.
(2005).
W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. 975-984.
-
Luo, Y., Wang, J., Chen, J., & Chen, S.
(2005).
A Distributed Algorithm Based on Probability for Refining Energy-Efficiency of Multicast Trees in Ad Hoc Networks. 482-483.
-
Gao, W., Wang, J., Chen, J., & Chen, S.
(2005).
PFED: A Prediction-based Fair Active Queue Management Algorithm. Proceedings of the International Conference on Parallel Processing.
485-491.
-
Zhang, N., Zhao, W., & Chen, J.
(2004).
Cardinality-based inference control in OLAP systems: An information theoretic approach. 59-64.
-
Wang, G., Li, T., & Chen, J.
(2004).
Performance analysis of distributed adaptive routing algorithm. 1394-1399.
-
Chen, J., Chor, B., Fellows, M., Huang, X. Z., Juedes, D., Kanj, I., & Xia, G.
(2004).
Tight lower bounds for certain parameterized NP-hard problems. Proceedings of the Annual IEEE Conference on Computational Complexity.
150-160.
-
Wang, G., Li, T., & Chen, J.
(2004).
A probabilistic approach to fault-tolerant routing algorithm on mesh networks. 577-584.
-
Chen, J., Huang, X., Kanj, I. A., & Xia, G.
(2004).
Linear FPT reductions and computational lower bounds. Conference Proceedings of the Annual ACM Symposium on Theory of Computing.
212-221.
-
Wang, G. C., Chen, J., & Wang, G. J.
(2004).
On fault tolerance of 3-dimensional mesh networks. 149-154.
-
Liu, R., Wang, T., Chen, J., & Chen, S.
(2004).
Some results on the simply separable function sets in partial k-valued logic. 1238-1242.
-
Wang, G., & Chen, J.
(2003).
A New Fault-Tolerant Routing Scheme for 2-Dimesnsioal Mesh Networks. 95-98.
-
Wang, G. C., & Chen, J.
(2003).
A new fault-tolerant multicast communication in multicomputers. 1251-1254.
-
Chen, H., & Kanj, I. A.
(2003).
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. Journal of Computer and System Sciences.
833-847.
-
Sui, H., Wang, J., Chen, J., & Chen, S.
(2003).
An analysis of forwarding mechanism in crowds. IEEE International Conference on Communications.
261-265.
-
Wang, G., Chen, J., Wang, G., & Chen, S.
(2003).
Probability Model for Faults in Large-Scale Multicomputer Systems**This research is supported in part by the Major Research Plan of National Natural Science Foundation of China, Grant No. 90104028, and by the National Science Foundation of USA under grant CCR-0000206. Proceedings of the Asian Test Symposium.
452-457.
-
Liu, R., Chen, J., & Chen, S.
(2003).
Some results on the minimal coverings of precomplete classes in partial K-valued logic functions. 2645-2650.
-
Zhang, Z., Chen, H., & Chen, J.
(2003).
A New Control Topology of Information Reliable Spread**This research is supported in part by the Major Research Plan of National Natural Science Foundation of China, Grant No. 90104028. 789-793.
-
Wang, G., Chen, J., & Wang, G.
(2003).
A Probabilistic Approach to Fault Tolerant Broadcast Routing Algorithms on Mesh Networks. 1-7.
-
Akleman, E., Srinivasan, V., & Chen, J. E.
(2003).
Interactive rind modeling. 23-32.
-
Sui, H., Chen, J., Chen, S., & Wang, J.
(2003).
Payload Analysis of Anonymous Communication System with Host-Based Rerouting Mechanism. Proceedings / IEEE Symposium on Computers and Communications ; sponsored by the IEEE Computer Society Technical Committee on Simulation, the IEEE Communication Society in cooperation with ... [et al.]. IEEE Symposium on Computers and Co....
1259-1264.
-
Wang, G., Chen, J., & Wang, G.
(2003).
Probabilistic Analysis of Connectivity on Mesh Networks. 362-366.
-
Miranda, A., Torres, L., & Chen, J.
(2002).
On the approximability of multiprocessor task scheduling problems. Lecture Notes in Computer Science.
403-415.
-
Akleman, E., Jianer, C., & Srinivasan, V.
(2002).
A prototype system for robust, interactive and user-friendly modeling of orientable 2-manifold meshes. 43-50.
-
Wang, T., & Chen, J. E.
(2002).
Bandwidth tree - A data structure for routing in networks with advanced reservations. IEEE International Performance, Computing and Communications Conference, Proceedings.
37-44.
-
Chen, J., Kanj, I. A., & Wang, G. J.
(2002).
Hypercube network fault tolerance: A probabilistic approach. Proceedings of the International Conference on Parallel Processing.
65-72.
-
Chen, J., & Kanj, I. A.
(2002).
Improved exact algorithms for MAX-SAT. Lecture Notes in Computer Science.
341-355.
-
Srinivasan, V., Akleman, E., & Chen, J. E.
(2002).
Interactive construction of multi-segment curved handles. Proceedings / Pacific Conference on Computer Graphics and Applications. Pacific Conference on Computer Graphics and Applications.
429-430.
-
Chan, C., Akleman, E., & Chen, J. E.
(2002).
Two methods for creating Chinese painting. Proceedings / Pacific Conference on Computer Graphics and Applications. Pacific Conference on Computer Graphics and Applications.
403-412.
-
Chen, J., & Huang, J. G.
(2001).
Semi-normal schedulings: Improvement on Goemans' algorithm. Lecture Notes in Computer Science.
48-60.
-
Akleman, E., Chen, J., Eryoldas, F., & Srinivasan, V.
(2001).
Handle and hole improvement by using new corner cutting subdivision scheme with tension. 32-41.
-
Chen, J., & Kanj, I. A.
(2001).
On constrained minimum vertex covers of bipartite graphs: Improved algorithms. Lecture Notes in Computer Science.
55-65.
-
Oh, E., & Chen, J.
(2001).
On strong menger-connectivity of star graphs. Lecture Notes in Computer Science.
272-283.
-
Oh, E., & Chen, J.
(2001).
Parallel routing in hypercube networks with faulty nodes. 338-345.
-
Chen, J., & Oh, E.
(2001).
Strong Fault-Tolerance: Parallel Routing in Networks with Faults. 609-618.
-
Chen, J., Friesen, D. K., Jia, W., & Kanj, I. A.
(2001).
Using nondeterminism to design efficient deterministic algorithms. Lecture Notes in Computer Science.
120-131.
-
Akleman, E., Chen, J., & Meric, B.
(2000).
Web-based intuitive and effective design of symmetric tiles. 1-4.
-
Akleman, E., Chen, J. N., & Srinivasan, V.
(2000).
A new paradigm for changing topology during subdivision modeling. Proceedings / Pacific Conference on Computer Graphics and Applications. Pacific Conference on Computer Graphics and Applications.
192-+.
-
Huang, J., Chen, J., & Chen, S.
(2000).
A simple linear-time approximation algorithm for multi-processor job scheduling on four processors. Lecture Notes in Computer Science.
60-71.
-
Chen, J., Liu, L., Jia, W., & Chen, S.
(2000).
An intuitive and effective new representation for interconnection network structures. Lecture Notes in Computer Science.
350-361.
-
Chen, J., & Kanj, I. A.
(2000).
On approximating minimum vertex cover for graphs with perfect matching. Lecture Notes in Computer Science.
132-143.
-
Xuan, D., Li, C. Z., Bettati, R., Chen, J. N., & Zhao, W.
(2000).
Utilization-based admission control for real-time applications. Proceedings of the International Conference on Parallel Processing.
251-260.
-
Akleman, E., & Chen, J. N.
(1999).
Generalized distance functions. 72-79.
-
Akleman, E., & Chen, J. N.
(1999).
Guaranteeing 2-manifold property for meshes. 18-25.
-
Chen, J., & Miranda, A.
(1999).
Polynomial time approximation scheme for general multiprocessor job scheduling. Conference Proceedings of the Annual ACM Symposium on Theory of Computing.
418-427.
-
Chen, J., Kanj, I. A., & Jia, W.
(1999).
Vertex cover: Further observations and further improvements. Lecture Notes in Computer Science.
313-324.
-
Chen, C., & Chen, J.
(1997).
Optimal parallel routing in star graphs. Lecture Notes in Computer Science.
73-84.
-
Cai, L., Chen, J., & Hastad, J.
(1997).
Circuit bottom fan-in and computational power. Proceedings of the Annual IEEE Conference on Computational Complexity.
158-164.
-
Chen, C. C., & Chen, J.
(1997).
Nearly optimal one-to-many parallel routing in star networks. Proceedings of the International Parallel Processing Symposium, IPPS.
728-733.
-
Chen, J. E., Friesen, D. K., & Zheng, H.
(1997).
Tight bound on Johnson's Algorithm for Max-SAT. Proceedings of the Annual IEEE Conference on Computational Complexity.
274-281.
-
Chen, J.
(1995).
Algorithmic Graph Embeddings (Extended Abstract). 151-160.
-
Cai, L. M., & Chen, J.
(1995).
On log-time alternating turing machines of alternation depth k (extended abstract). Lecture Notes in Computer Science.
282-291.
-
Chen, J.
(1995).
Algorithmic graph embeddings. Lecture Notes in Computer Science.
151-160.
-
Chen, C. C., & Chen, J.
(1995).
Homomorphism of the de Bruijn graphs and its applications. 465-470.
-
Cai, L., & Chen, J.
(1995).
On log-time alternating Turing machines of alternation depth k. Lecture Notes in Computer Science.
282-291.
-
Chen, C. C., & Chen, J.
(1995).
Vertex-disjoint routings in star graphs. 460-464.
-
Cai, L., Chen, J., Downey, R. G., & Fellows, M. R.
(1994).
On the Structure of Parameterized Problems in NP (Extended Abstract). 509-520.
-
Chen, J., & Kanchi, S. P.
(1994).
Graph ear decompositions and graph embeddings. Lecture Notes in Computer Science.
376-387.
-
Cai, L., Chen, J., Downey, R., & Fellows, M.
(1994).
On the structure of parameterized problems in NP. Lecture Notes in Computer Science.
500-520.
-
Chen, J., & Kanchi, S. P.
(1993).
Graph Ear Decompositions and Graph Embeddings (Extended Abstract). 376-387.
-
Cai, L., & Chen, J.
(1993).
On Fixed-Parameter Tractability and Approximability of NP-Hard Optimization Problems. 118-126.
-
Cai, L., & Chen, J.
(1993).
On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract). 311-320.
-
Chen, J., Kanchi, S. P., & Kanevsky, A.
(1993).
On the Complexity of Graph Embeddings (Extended Abstract). 234-245.
-
Chen, J.
(1993).
A linear time algorithm for isomorphism of graphs of bounded average genus. Lecture Notes in Computer Science.
103-113.
-
Chen, J., & Kanevsky, A.
(1993).
On assembly of four-connected graphs. Lecture Notes in Computer Science.
158-169.
-
Cai, L., & Chen, J.
(1993).
On the amount of nondeterminism and the power of verifying. Lecture Notes in Computer Science.
311-320.
-
Chen, J., Kanchi, S. P., & Kanevsky, A.
(1993).
On the complexity of graph embeddings. Lecture Notes in Computer Science.
234-245.
-
Chen, J., & Kanevsky, A.
(1992).
On Assembly of Four-Connected Graphs (Extended Abstract). 158-169.
-
Kanevsky, A., Tamassia, R., Di Battista, G., & Chen, J.
(1991).
On-line maintenance of the four-connected components of a graph. Annual Symposium on Foundations of Computer Science.
793-801.
-
Kanevsky, A., Tamassia, R., Battista, G. D., & Chen, J.
(1991).
On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract). 793-801.
-
Chen, J., & Yap, C.
(1987).
Reversal complexity
-
Chen, J., & Wang, T.
Probabilistic Analysis on Mesh Network Fault Tolerance. 601-606.
-
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.
187-200.
Teaching
teaching activities
- CSCE222 Discrete Struc Computing Instructor
- CSCE310 Database Systems Instructor
- CSCE411 Design Analy Algorithms Instructor
- CSCE433 Formal Languages Autom Instructor
- CSCE491 Hnr-research Instructor
- CSCE608 Database Systems Instructor
- CSCE620 Computational Geometry Instructor
- CSCE627 Th Of Computability Instructor
- CSCE629 Analysis Of Algorithms Instructor
- CSCE637 Complexity Theory Instructor
- CSCE669 Computational Optimiza Instructor
- CSCE684 Professional Internship Instructor
- CSCE685 Directed Studies Instructor
- CSCE689 Sptp: Algorith Techn Big Data Instructor
- CSCE691 Research Instructor
Works By Students
chaired theses and dissertations
-
Cao, Cheng (2012-07). Study on Two Optimization Problems: Line Cover and Maximum Genus Embedding.
-
Cao, Yixin (2012-07). Clustering and Inconsistent Information: A Kernelization Approach.
-
Fan, Jia-Hao (2013-07). Cuts and Partitions in Graphs/Trees with Applications.
-
Garigipati, Pradeep (2013-04). Duotone Surfaces: Division of a Closed Surface into Exactly Two Regions.
-
Gu, Jiacheng (2015-11). On Dependent Data Fetching in Cloud Environment.
-
Hu, Shiyu (2013-07). A Topological Theory of Weaving and Its Applications in Computer Graphics.
-
Huang, Xiuzhen (2005-02). Parameterized complexity and polynomial-time approximation schemes.
-
Liu, Yang (2010-10). Measure-Driven Algorithm Design and Analysis: A New Approach for Solving NP-hard Problems.
-
Lu, Songjian (2010-07). Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics.
-
Luo, Ping (2010-01). Design and Implementation of High Performance Algorithms for the (n,k)-Universal Set Problem.
-
Meng, Jie (2011-08). Kernelization and Enumeration: New Approaches to Solving Hard Problems.
-
Pandey, Nikhil (2012-07). Critical Cliques and Their Application to Influence Maximization in Online Social Networks.
-
Tiwari, Praveen 1985- (2012-12). On Covering Points with Conics and Strips in the Plane.
-
Xia, Ge (2006-10). Parameterized algorithms and computational lower bounds: a structural approach.
-
Zhang, Fenghui (2008-10). Effective algorithms and protocols for wireless networking: a topological approach.
-
Zhang, Nan (2009-05). Privacy-preserving data mining.
Background
education and training
- Ph.D. in Mathematics, Columbia University - (New York, New York, United States) 1990
- Ph.D. in Computer Science, New York University - (New York, New York, United States) 1987
awards and honors
Contact
first name
- Jianer
has last name
- Chen
mailing address
-
Texas A&M University
Computer Science & Engineering
3112 TAMU
College Station, TX 77843-3112
USA
Other
- j-chen3@tamu.edu