A Comprehensive List of Publciations by Jianer Chen

Refereed Journal Publications

115. Xu, C., Chen, J., and Wang, J., ``Resolution and linear CNF formulas: improved (n,3)-MaxSAT algorithms,'' Theoretical Computer Science, in press.
114. Zhang, T., Wang, J., Huang, J., Chen, J., Pan, Y., and Min, G., ``Tuning the aggressive TCP behavior for highly concurrent HTTP connections in intra-datacenter,'' IEEE/ACM Transactions on Networking, accepted.
113. Akleman, E., Srinivasan, V., and Chen, J., ``Interactive modeling of smooth manifold meshes with arbitrary topolgy: G^1 stitched bi-cubic Bezier patches,'' Computers & Graphics 66, pp. 64-73, 2017.
112. Bhuiyan, A., Wu, J., Wang, G., Chen, Z., Chen, J., Wang, T., ``Quality-guaranteed event-sensitive data collection and monitoring in vibration sensor networks,'' IEEE Transactions on Industrial Informatics 13-2, pp. 572-583, 2017.
111. Chen, J., Xu, C., and Wang, J., ``Dealing with 4-variables by resolution: an improved MaxSAT algorithm,'' Theoretical Computer Science 670, pp. 33-44, 2017.
110. Li, W., Cao, Y., Chen, J., and Wang, J., ``Deeper local search for parameterized and approximation algorithms on maximum internal spanning tree,'' Information & Computation 252, pp. 187-200, 2017.
109.Li, W., Feng, Q., Chen, J., and Hu, S., ``Improved kernel results for some FPT problems based on simple observations,'' Theoretical Computer Science 657, pp. 20-27, 2017.
108. Chen, J., Shi, F., and Wang, J., ``Approximating maximum agreement forest on multiple binary trees,'' Algorithmica 76-4, pp. 867-889, 2016.
107. Akleman, E., Chen, J., and Gross, J. L., ``Extended graph rotation systems as a model for cyclic weaving on orientable surfaces,'' Discrete Applied Mathematics 193, pp. 61-79, 2015.
106. Zhang, T., Wang, J., Huang J., Huang, Y., Chen, J., and Pan, Y., ``Adaptive-acceleration data center TCP,'' IEEE Transactions on Computers 64, pp. 1522-1533, 2015.
105. Cao, Y., Chen, J., and Liu, Y., ``On feedback vertex set: new measure and new structures,'' Algorithmica 73, pp. 63-86, 2015.
104. Akleman, E., Chen, J., and Gross, J., ``Block meshes: topologically robust shape modeling with graphs embedded on 3-manifolds,'' Computer & Graphics 46, pp. 306-326, 2015.
103. Liu, Y., Wang, J., You, J., Chen, J., and Cao, Y., ``Edge deltion problems: branching facilitated by modular decomposition,'' Theoretical Computer Science 573, pp. 63-70, 2015.
102. Chen, J., Fan, J.-H., and Sze, S.-H., ``Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees,'' Theoretical Computer Science 562, pp. 496-512, 2015.
101. Wang, J., Tan, P., Yao, J., Feng, Q., and Chen, J., ``On the minimum link-length rectilinear spanning path problem: complexity and algorithms,'' IEEE Transactions on Computers 63-12, pp. 3092-3100, 2014.
100. Shi, F., Wang, J., Chen, J., Feng, Q., Guo, J., ``Algorithms for parameterized maximum agreement forest problem on multiple trees,'' Theoretical Computer Science 554, pp. 207-216, 2014.
99. Feng, Q., Wang, J., and Chen, J., ``Matching and weighted P2-packing: algorithms and kernels,'' Theoretical Computer Science 522, pp. 85-94, 2014.
98. Luo, W., Wang, J., Guo, J., and Chen, J., ``Parameterized complexity of max-lifetime target coverage in wireless sensor networks,'' Theoretical Computer Science 518, pp. 32-41, 2014.
97. Cao, Y., Chen, J., and Fan, J.-H., ``An O*(1.84^k) parameterized algorithm for the multiterminal cut problem,'' Information Processing Letters 114, pp. 167-173, 2014.
96. Luo, W., Wang, J., Feng, Q., Guo, J., and Chen, J., ``Improved linear problem kernel for planar connected dominating set,'' Theoretical Computer Science 511, pp. 2-12, 2013.
95. Akleman, E., Xing, Q., Garigipati, P., Taubin, G., Chen, J., and Hu, S., ``Hamiltonian cycle art: surface covering wire sculptures and duotone surfaces,'' Computer & Graphics 37-5, pp. 316-332, 2013.
94. Wang, J., Yang, Y., Guo, J., and Chen, J., ``Planar graph vertex partition for linear problem kernels,'' Journal of Computer and System Sciences 79, pp. 609-621, 2013.
93. Sastry, S., Radeva, T., Chen, J., and Welch, J., ``Reliable networks with unreliable sensors,'' Pervasive and Mobile Computing 9, pp. 311-323, 2013.
92. Chen, J., Kanj, I., Meng, J., Xia, G., and Zhang, F., ``Parameterized top-K algorithms,'' Theoretical Computer Science 470, pp. 105-119, 2013.
91. Fan, J.-H., Chen, J., and Sze, H.-S., ``Identifying complexes from protein interaction networks according to different types of neighborhood density,'' Journal of Computational Biology 19, pp. 1284-1294, 2012.
90. Liu, Y., Wang, J., Guo, J., and Chen, J., ``Complexity and parameterized algorithms for cograph editing,'' Theoretical Computer Science 461, pp. 45-54, 2012.
89. Chen, J., Fan, J.-H., Kanj, I., Liu, Y., and Zhang, F., ``Multicut in trees viewed through the eyes of vertex cover,'' Journal of Computer and System Sciences 78-5, pp. 1637-1650, 2012.
88. Hu, S., Xing, Q., Akleman, E., Chen, J., and Gross, J., ``Pattern mapping with quad-pattern-coverable quad-meshes,'' Computer & Graphics 36-5, pp. 455-465, 2012.
87. Cao, Y. and Chen, J., ``Cluster editing: kernelization based on edge cuts,'' Algorithmica 64, pp. 152-169, 2012.
86. Chen, J., Liu, Y., Lu, S., Sze, S.-H., Zhang, F., ``Iterative expansion and color coding: an improved algorithm for 3D-matching,'' ACM Transactions on Algorithms 8, Article 6, 2012.
85. Chen, J. and Meng, J., ``A 2k kernel for the cluster editing problem,'' Journal of Computer and System Sciences 78, pp. 211-220, 2012.
84. Chen, J., Feng, Q., Liu, Y., Lu, S., and Wang, J., ``Improved deterministic algorithms for weighted matching and packing problems,'' Theoretical Computer Science 412, pp. 2503-2512, 2011.
83. Akleman, E., Chen, J., Chen, Y., Xing, Q., and Gross, J., ``Cyclic twill-woven objects,'' Computers & Graphics 35, pp. 623-631, 2011.
82. Zhang, F., Jiang, A., and Chen, J., ``On planarization of wireless sensor networks,'' Algorithmica 60, pp. 593-608, 2011.
81. Wang, J., Li, M., Chen, J., Pan, Y., ``A fast hierarchical clustering algorithm for function modules discovery in protein interaction networks,'' IEEE/ACM Transactions on Computational Biology and Bioinformatics 8, pp. 607-620, 2011.
80. Wang, J., Feng, Q., and Chen, J., ``An O*(3.53^{3k}-time parameterized algorithm for the 3-set packing problem,'' Theoretical Computer Science 412, pp. 1745-1753, 2011.
79. Chen, J., Jiang, A., Kanj, I., Xia, G, and Zhang, F., ``Separability and topology control of quasi unit disk graphs,'' Wireless Networks 17, pp. 53-67, 2011.
78. Xie, M., Wang, J., and Chen, J., ``A practical parameterized algorithm for the individual haplotyping problem MLF,'' Mathematical Structures in Computer Science 20, pp. 851-863, 2010.
77. Wang, J., Li, W., and Chen, J., ``A parameterized algorithm for the hyperplane-cover problem,'' Theoretical Computer Science 411, pp. 4005-4009, 2010.
76. Chen, J., Kanj, I., Xia, G., ``Improved upper bounds for vertex cover,'' Theoretical Computer Science 411, pp. 3736-3756, 2010.
75. Wang, J., Ning, D., Feng, Q., and Chen, J., ``An improved kernelization for P2-packing,'' Information Processing Letters 110-5, pp. 188-192, 2010.
74. Wang, J., Xie, M., and Chen, J., ``A practical exact algorithm for the individual haplotying problem MEC/GI,'' Algorithmica 56(3), pp. 283-296, 2010.
73. Akleman, E., Chen, J., Xing, Q., and Gross, J., ``Cyclic plain-weaving on polygonal mesh surfaces with graph rotation systems,'' ACM Transactions on Graphics 28-3, Article No. 78, 2009.
72. Chen, J., Kneis, J., Lu, S., Molle, D., Richter, S., Rossmanith, P., Sze, S.-H., and Zhang, F., ``Randomized divide-and-conquer: improved path, matching, and packing algorithms,'' SIAM Journal on Computingt 38(6), pp. 2526-2547, 2009.
71. Chen, J. and Lu, S., ``Improved parameterized set splitting algorithms: a probabilistic approach,'' Algorithmica 54, pp. 472-489, 2009
70. Liu, Y., Chen, J., and Wang, J., ``On counting 3-D matchings of size k,'' Algorithmica 54, pp. 530-543, 2009.
69. Chen, J., Liu, Y., and Lu, S., ``An improved parameterized algorithm for the minimum node multiway cut problem,'' Algorithmica 55, pp. 1-13, 2009.
68. Chen, J., Kanj, I., and Xia, G., ``On parameterized exponential time complexity,'' Theoretical Computer Science 410, pp. 2641-2648, 2009.
67. Chen, J., Kanj, I., Meng, J., Xia, G., and Zhang, F., ``On the pesudo-achromatic number problem,'' Theoretical Computer Science 410, pp. 818-829, 2009.
66. Chen, J., Liu, Y., Lu, S., O'Sullivan, B., and Razgon, I., ``A fixed-parameter algorithm for the directed feedback vertex set problem,'' Journal of the ACM 55(5), 2008.
65. Li, M., Chen, J., Wang, J., Hu, B., Chen, G., ``Modifying the DPClus algorithm for identifying protein complexes based on new topological structures,'' BMC Bioinformatics 9:398, pp. 1-16, 2008.
64. Chen, J., Fomin, F., Liu, Y., Lu, S., and Villanger, Y., ``Improved algorithms for feedback vertex set problems,'' Journal of Computer and System Sciences 74, pp. 1188-1198, 2008.
63. Xie, M., Wang, J., and Chen, J., ``A model of higher accuracy for the individual haplotyping problem based on weighted SNP fragments and genotype with errors,'' Bioinformatics 24, pp. i105-i113, 2008.
62. Wang, J., Chen, J., and Huang, M., ``An improved lower bound on approximation algorithms for the closest substring problem,'' Information Processing Letters 107, pp. 24-28, 2008.
61. Chen, J. and Meng, J., ``On parameterized intractability: hardness and completeness,'' The Computer Journal 51, pp. 39-59, 2008.
60. Chen, J., Fernau, H., Kanj, I., and Xia, G., ``Paramettric duality and kernelization: lower bounds and upper bounds on kernel size,'' SIAM Journal on Computing 37, pp. 1077-1106, 2007.
59. Chen, J., Kanj, I., Perkovic, L., Sedgwick, E., and Xia, G., ``Genus characterizes the complexity of certain graph problems: some tight results,'' Journal of Computer and System Sciences 73, pp. 892-907, 2007.
58. Xie, M., Chen, J., and Wang, J., ``Research on parameterized algorithms of the individual haplotyping problem,'' Journal of Bioinformatics and Computational Biology 5, pp. 795-816, 2007.
57. Lu, S., Zhang, F., Chen, J., and Sze, S.-H., ``Finding pathway structures in protein interaction networks,'' Algorithmica 48, pp. 363-374, 2007.
56. Chen, J., Wang, G., Lin, C., Wang, T., and Wang, G., ``Probabilistic analysis on mesh network fault tolerance,'' Journal of Parallel and Distributed Computing 67, pp. 100-110, 2007.
55. Chen, J., Huang, X., Kanj, I., and Xia, G., ``Polynomial time approximation schemes and parameterized complexity,'' Discrete Applied Mathematics 155, pp. 180-193, 2007.
54. Huang, J., Chen, J., Chen, S., and Wang, J., ``A simple linear time approximation algorithm for multi-processor job scheduling on four processors,'' Journal of Combinatorial Optimization 13, pp. 33-45, 2007.
53. Chen, J., Huang, X., Kanj, I., and Xia, G., ``Strong computational lower bounds via parameterized complexity,'' Journal of Computer and System Sciences 72, pp. 1346-1367, 2006.
52. Chen, J. and Zhang, F., ``On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4],'' Theoretical Computer Science 363, pp. 278-288, 2006.
51. Chen, J., Huang, X., Kanj, I., and Xia, G., ``On the computational hardness based on linear FPT-reductions,'' Journal of Combinatorial Optimization 11, pp. 231-247, 2006.
50. Chen, J., Kanj, I., and Xia, G., ``Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems,'' Algorithmica 43, pp. 245-273, 2005.
49. Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D., Kanj, I., and Xia, G., ``Tight lower bounds for certain parameterized NP-hard problems,'' Information and Computation 201, pp. 216-231, 2005.
48. Chen, J., Kanj, I., and Wang, G., ``Hypercube network fault tolerance: a probabilistic approach,'' Journal of Interconnection Networks 6, pp. 17-34, 2005.
47. Chen, J. and Kanj, I., ``On approximating minimum vertex cover for graphs with perfect matching,'' Theoretical Computer Science 337, pp. 305-318, 2005.
46. Chen, J. and Kanj, I., ``Improved exact algorithms for Max-SAT,'' Discrete Applied Mathematics 142, pp. 17-27, 2004.
45. Chen, J., D. Friesen, Kanj, I., and Jia, W., ``Using nondeterminism to design efficient deterministic algorithms,'' Algorithmica 40, pp. 83-97, 2004.
44. Deng, H., Chen, J., Li, Q., Li, R., and Gao, Q., ``On the construction of most reliable networks,'' Discrete Applied Mathematics 140, pp. 19-33, 2004.
43. Sui, H., Wang, J., Chen, J., and Chen, S., ``The cost of becoming anonymous: on the participant payload in Crowds,'' Information Processing Letters 90, pp. 81-86, 2004.
42. Jia, W., Zhang, C., and Chen, J., ``An efficient parameterized algorithm for m-set packing,'' Journal of Algorithms 50, pp. 106-117, 2004.
41. Chen, J. and Kanj, I., ``Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms,'' Journal of Computer and System Sciences 67, pp. 833-847, 2003.
40. Akleman, E., Chen, J., and Srinivasan, V., ``A minimal and complete set of operators for the development of robust manifold mesh modelers,'' Graphical Models 65, pp. 286-304, 2003.
39. Oh, E. and Chen, J., ``On strong Menger-connectivity of star graphs,'' Discrete Applied Mathematics 129, pp. 499-511, 2003.
38. Oh, E. and Chen, J., ``Strong fault-tolerance: parallel routing in star networks with faults,'' Journal of Interconnection Networks 4, pp. 113-126, 2003.
37. Malpani, N. and Chen, J., ``A note on practical construction of maximum bandwidth paths,'' Information Processing Letters 83, pp. 175-180, 2002.
36. Chen, J., Wang, G., and Chen, S., ``Locally subcube-connected hypercube networks: theoretical analysis and experimental results,'' The IEEE Transactions on Computers 51, pp. 530-540, 2002.
35. Akleman, E., Chen, J., Srinivasan, V., and Eryoldas, F., ``A new corner cutting scheme with tension and handle-face reconstruction,'' International Journal of Shape Modeling 7-2, pp. 111-128, 2001.
34. Chen, J., Kanj, I., and Jia, W., ``Vertex cover: further observations and further improvements,'' Journal of Algorithms 41, pp. 280-301, 2001.
33. Chen, J., Wang, G., and Chen, S., ``Routing in hypercube networks with a constant fraction of faulty nodes,'' Journal of Interconnection Networks 2, pp. 283-294, 2001.
32. Chen, J. and Miranda, A., ``A polynomial time approximation scheme for general multiprocessor job scheduling,'' SIAM Journal on Computing 31, pp. 1-17, 2001.
31. Chen, J., Liu, L., and Jia, W., ``Improvement on vertex cover for lower degree graphs,'' Networks 35, pp. 253-259, 2000.
30. Akleman, E. and Chen, J., ``Guaranteeing the 2-manifold property for meshes with doubly linked face list,'' International Journal of Shape Modeling 5, pp. 159-177, 2000.
29. Chen, J., Friesen, D., and Zheng H., ``Tight bound on Johnson's algorithm for maximum satisfiability,'' Journal of Computer and System Sciences 58, pp. 622-640, 1999.
28. Chen, J. and Kanchi, S. P., ``Graph ear decompositions and graph embeddings,'' SIAM Journal on Discrete Mathematics 12, pp. 229-242, 1999.
27. Chen, C. and Chen, J., ``The maximum partition matching problem with applications,'' SIAM Journal on Computing 28, pp. 935-954, 1999.
26. Chen, J. and Lee, C.-Y., ``General multiprocessor task scheduling,'' Naval Research Logistics 46, pp. 57-74, 1999.
25. Cai, L., Chen, J., and Hastad, J., ``Circuit bottom fan-in and computational power,'' SIAM Journal on Computing 27, pp. 341-355, 1998.
24. Chen, C. and Chen, J., ``Optimal parallel routing in star networks,'' The IEEE Transactions on Computers 46, pp. 1293-1303, 1997.
23. Chen, C. and Chen, J., ``Nearly optimal one-to-many parallel routing in star networks,'' The IEEE Transactions on Parallel and Distributed Systems 8, pp. 1196-1202, 1997.
22. Cai, L., Chen, J., Downey, R. G., and Fellows, M. R., ``The parameterized complexity of short computation and factorization,'' Archive for Mathematical Logic 36, pp. 321-338, 1997.
21. Cai, L. and Chen, J., ``On fixed-parameter tractability and approximability of NP-hard optimization problems,'', Journal of Computer and System Sciences 54, pp. 465-474, 1997.
20. Chen, J., ``Algorithmic graph embeddings,'' Theoretical Computer Science 181, pp. 247-266, 1997.
19. Chen, J., Kanchi, S. P., and Kanevsky, A., ``A note on approximating graph genus,'' Information Processing Letters 61, pp. 317-322, 1997.
18. Cai, L. and Chen, J., ``On the amount of nondeterminism and the power of verifying,'' SIAM Journal on Computing 26, pp. 733-750, 1997.
17. Cai, L., Chen, J., Downey, R. G., and Fellows, M. R., ``Advice classes of parameterized tractability,'' Annals of Pure and Applied Logic 84, pp. 119-138, 1997.
16. Chen, J., Kanchi, S., and Gross, J. L., ``Tight lower bound on maximum genus of a simplicial graph,'' Discrete Mathematics 156, pp. 83-102, 1996.
15. Gross, J. L. and Chen, J., ``Algebraic specification of interconnection network relationships by permutation voltage graph mappings,'' Mathematical Systems Theory 29, pp. 451-470, 1996.
14. Chen, J., Archdeacon, D., and Gross, J. L., ``Maximum genus and connectivity,'' Discrete Mathematics 149, pp. 19-29, 1996.
13. Cai, L., Chen, J., Downey, R. G., and Fellows, M. R., ``On the structure of parameterized problems in NP,'' Information and Computation 123, pp. 38-49, 1995.
12. Cai, L. and Chen, J., ``On input read-modes of alternating Turing machines'' Theoretical Computer Science 148, pp. 33-55, 1995.
11. Chen, J., Gross, J. L., and Rieper, R. G., ``Lower bounds for the average genus,'' Journal of Graph Theory 19, pp. 281-296, 1995.
10. Chen, J., ``A linear-time algorithm for isomorphism of graphs of bounded average genus,'' SIAM Journal on Discrete Mathematics 7, pp. 614-631, 1994.
9. Chen, J., Gross, J. L., and Rieper, R. G., ``Overlap matrices and imbedding distributions,'' Discrete Mathematics 128, pp. 73-94, 1994.
8. Chen, J. and Gross, J. L., ``Kuratowski-type theorems for average genus,'' Journal of Combinatorial Theory, Series B 57, pp. 100-121, 1993.
7. Chen, J. and Gross, J. L., ``Limit points for average genus I: 3-connected and 2-connected simplicial graphs,'' Journal of Combinatorial Theory, Series B 55, pp. 83-103, 1992.
6. Chen, J. and Gross, J. L., ``Limit points for average genus II: 2-connected non-simplicial graphs,'' Journal of Combinatorial Theory, Series B 56, pp. 108-129, 1992.
5. Chen, J. and Yap, C. K., ``Reversal complexity,'' SIAM Journal on Computing 20, pp. 622-638, 1991.
4. Chen, J., ``Characterizing parallel hierarchies by reducibilities,'' Information Processing Letters 39, pp. 303-307, 1991.
3. Chen, J., Cox, J., and Mishra, B., ``An NL hierarchy,'' Information Processing Letters 39, pp. 21-26, 1991.
2. Chen, J., ``The difference between one-tape and two-tapes: with respect to reversal complexity,'' Theoretical Computer Science 73, pp. 265-278, 1990.
1. Chen, J., ``A new complete language for DSPACE(log n),'' Discrete Applied Mathematics 25, pp. 19-26, 1989.

Refereed Conference Publications

117. Chen, J., Xu, C., and Wang, J., ``Dealing with 4-variables by resolution: an improved MaxSAT algorithm,'' Proc. 14th International Symposium on Algorithms and Data Structure (WADS 2015), Lecture Notes in Computer Science 9214, pp. 178-188, 2015.
116. Li, W., Wang, J., Chen, J., and Cao, Y., ``A 2k-vertex kernel for maximum internal spanning tree,'' Proc. 14th International Symposium on Algorithms and Data Structure (WADS 2015), Lecture Notes in Computer Science 9214, pp. 495-505, 2015.
115. Li, W., Chen, J., Wang, J., ``Deeper local search for better approximation on maximum internal spanning trees,'' Proc. 22nd Annual European Symposium on Algorithms (ESA 2014), Lecture Notes in Computer Science 8737, pp. 642-653, 2014.
114. Feng, S., Chen, J., Feng, Q., and Wang, J., ``Approximation algorithms for maximum agreement forest on multiple trees,'' Proc. 20th International Conference on Computing and Combinatorics (COCOON 2014), Lecture Notes in Computer Science 8591, pp. 381-392, 2014.
113. Cao, Y., Chen, J., and Fan, J.-H., ``An O*(1.84^k) parameterized algorithm for the multiterminal cut problem,'' Proc. 19th International Symposium on Fundamentals of Computation Theory (FCT 2013), Lecture Notes in Computer Science 8070, pp. 84-94, 2013.
112. Chen, J., Fan, J.-H., and Sze, S.-H., ``Parameterized and approximation algorithms for the MAF problem in multifurcating trees,'' Proc. 39th International Workshop on Graph-Theoretical Concepts in Computer Science (WG 2013), Lecture Notes in Computer Science 8165, pp. 152-164, 2013.
111. Feng, S., Chen, J., Feng, Q., and Wang, J., ``Parameterized algorithms for maximum agreement forest on multiple trees,'' Proc. 19th International Conference on Computing and Combinatorics (COCOON 2013), Lecture Notes in Computer Science 7936, pp. 567-578, 2013.
110.Cao, Y. and Chen, J., ``On parameterized and kernelization algorithms for the hierarchical clustering problem,'' Proc. 10th International Conference on Theory and Applications of Models of Computation (TAMC 2013), Lecture Notes in Computer Science 7876, pp. 319-330, 2013.
109. Chen, J. and Kanj, I. A., ``Parameterized complexity and subexponential-time computability,'' The Multivariate Algorithmic Revolution and Beyond, Lecture Notes in Computer Science 7370, pp. 162-195, 2012.
108. Chen, J., Fernau, H., Shaw, H., Wang, J., and Yang, Z., ``Kernels for packing and covering problems,'' Proc. 6th Intl Frontiers of Algorithmics Workshop and 8th Intl Conference on Algorithmic Aspects of Information and Management (FAW-AAIM 2012), Lecture Notes in Computer Science 7285, pp. 199-211, 2012.
107. Chen, J., Fan, J.-H., Kanj, I., Liu, Y., and Zhang, F., ``Multicut in trees viewed through the eyes of vertex cover,'' Proc. 12th International Symposium on Algorithms and Data Structures (WADS 2011), Lecture Notes in Computer Science 6844, pp. 219-230, 2011.
106. Wang, J., Yang, Y., Guo, J., and Chen, J., ``Linear problem kernels for planar graph problems with small distance property,'' Proc. 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011), Lecture Notes in Computer Science 6907, pp. 592-603, 2011.
105. Liu, Y., Wang, J., Guo, J., Chen, J., ``Cograph editing: complexity and parameterized algorithms,'' Proc. 17th Annual International Conference on Computing and Combinatorics (COCOON 2011), Lecture Notes in Computer Science 6842, pp. 110-121, 2011.
104. Feng, Q., Wang, J., and Chen, J., ``Matching and P2-packing: weighted versions,'' Proc. 17th Annual International Conference on Computing and Combinatorics (COCOON 2011), Lecture Notes in Computer Science 6842, pp. 343-353, 2011.
103.Sastry, S., Radeva, T., Chen, J., and Welch, J., ``Reliable networks with unreliable sensors,'' Proc. 12th International Conference on Distributed and Networking (ICDCN 2011), Lecture Notes in Computer Science 6522, pp. 281-292, 2011.
102. Cao, Y. and Chen, J., ``Cluster editing: kernelization based on edge-cuts,'' Proc. 5th International Symposium on Parameterized and Exact Computation (IPEC 2010), Lecture Notes in Computer Science 6478, pp. 60-71, 2010.
101. Xing, Q., Akleman, E., Chen, J., and Gross, J., ``Single-cycle plain-woven objects,'' Proc. Shape Modeling International 2010 (SMI 2010), pp. 90-99, 2010.
100. Cao, Y., Chen, J., and Liu, Y., ``On feedback vertex set: new measure and new structures,'' Proc. 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010), Lecture Notes in Computer Science 6139, pp. 93-104, 2010.
99. Chen, J. and Meng, J., ``A 2k kernel for the cluster editing problem,'' Proc. 16th Annual International Conference on Computing and Combinatorics (COCOON 2010), Lecture Notes in Computer Science 6196, pp. 459-468, 2010.
98. Akleman, E., Chen, J., Xing, Q., and Gross, J., ``Cyclic plain-weaving on polygonal mesh surfaces with graph rotation system,'' Proc. SIGGRAPH 2009, 2009.
97. Chen, J. and Liu, Y., ``An improved SAT algorithm in terms of formula length,'' Proc. 11th Algorithms and Data Structures Symposium (WADS 2009), Lecture Notes in Computer Science 5664, pp. 144-155, 2009.
96. Wang, J., Chen, B., Feng, Q., and Chen, J., ``An efficient fixed-parameter enumeration algorithm for weighted edge dominating set,'' Proc. 3rd International Workshop on Frontiers in Algorithmics (FAW 2009), Lecture Notes in Computer Science 5598, pp. 237-250, 2009.
95. Wang, J., Wang, J., Chen, J., and Zhang, X., ``An automated signature generation approach for polymorphic worm based on color coding,'' Proc. IEEE International Conference on Communications (ICC 2009), pp. 1-6, 2009.
94. Chen, J., Kanj, I., and Xia, G., ``On parameterized exponential time complexity,'' Proc. 6th Annual Conference on Theory and Applications of Models of Computation (TAMC 2009), Lecture Notes in Computer Science 5532, pp. 168-177, 2009.
93. Chen, J., Liu, Y., Lu, S., O'Sullivan, B., and Razgon, I., ``A fixed-parameter algorithm for the directed feedback vertex set problem,'' Proc. 40th ACM Symposium on theory of Computing (STOC 2008), pp. 177-186, 2008.
92. Chen, J., ``Randomized disposal of unknowns and implicitly enforced bounds on parameters,'' Proc. 3rd International Workshop on Parameterized and Exact Computation (Invited talk at IWPEC 2008), Lecture Notes in Computer Science 5018, pp. 1-8, 2008.
91. Zhang, F., Jiang, A., and Chen, J., ``Robust planarization of unlocalized wireless sensor networks,'' Proc. IEEE INFOCOM 2008, pp. 1472-1480, 2008.
90. Chen, J., Kanj, I., Meng, J., Xia, G., and Zhang, F., ``On the pseudo-achromatic number problem,'' Proc. 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008), Lecture Notes in Computer Science 5344, pp. 78-89, 2008.
89. Wang, J., Ning, D., Feng, Q., and Chen, J., ``An improved parameterized algorithm for a generalized matching problem,'' Proc. 5th Annual Conference on Theory and Applications of Models of Computation (TAMC 2008), Lecture Notes in Computer Science 4978, pp. 212-222, 2008.
88. Xie, M., Wang, J., and Chen, J., ``A practical parameterized algorithm for the individual haplotyping problem MLF,'' Proc. 5th Annual Conference on Theory and Applications of Models of Computation (TAMC 2008), Lecture Notes in Computer Science 4978, pp. 433-444, 2008.
87. Li, M., Wang, J., and Chen, J., ``A graph-theoretic method for mining overlapping functional modules in protein interaction networks,'' Proc. 4th International Symposium on Bioinformatics Research and Applications (ISBRA 2008), Lecture Notes in Bioinformatics 4989, pp. 208-219, 2008.
86. Chen, J., Liu, Y., and Lu, S., ``An improved parameterized algorithm for the minimum node multiway cut problem,'' Proc. 10th Workshop on Algorithms and Data Structures (WADS 2007), Lecture Notes in Computer Science 4619, pp 495-506, 2007.
85. Chen, J., Fomin, F., Liu, Y., Lu, S., and Villanger, Y., ``Improved algorithms for the feedback vertex set problems,'' Proc. 10th Workshop on Algorithms and Data Structures (WADS 2007), Lecture Notes in Computer Science 4619, pp 422-433, 2007.
84. Chen, J. and Lu, S., ``Improved algorithms for weighted and unweighted set splitting problems,'' Proc. 13th Ann. International Computing and Combinatorics Conference (COCOON 2007), Lecture Notes in Computer Science 4598, pp. 537-547, 2007.
83. Liu, Y., Chen, J. and Wang, J., ``A randomized approximation algorithm for parameterized 3-D matching counting problem,'' Proc. 13th Ann. International Computing and Combinatorics Conference (COCOON 2007), Lecture Notes in Computer Science 4598, pp. 349-359, 2007.
82. Wang, J., Xu, X., and Chen, J., ``An approximation algorithm based on chain implication for constrained minimum vertex cover in bipartite graphs,'' Proc. 4th Ann. Conference on Theory and Applications of Models of Computation (TAMC 2007), Lecture Notes in Computer Science 4484, pp. 760-769, 2007.
81. Liu, Y., Chen, J., and Wang, J., ``Parameterized algorithms for weighted matching and packing problems,'' Proc. 4th Ann. Conference on Theory and Applications of Models of Computation (TAMC 2007), Lecture Notes in Computer Science 4484, pp. 692-702, 2007.
80. Chen, J., Jiang, A., Kanj, I., Xia, G., and Zhang, F., ``Separability and topology control of quasi unit disk graphs,'' Proc. IEEE INFOCOM 2007, pp. 2225-2233, 2007.
79. Zhang, F., Li, H., Jiang, A., Chen, J., Luo P., ``Face tracing based geographic routing in nonplanar wireless networks,'' Proc. IEEE INFOCOM 2007, pp. 2243-2251, 2007.
78. Chen, J., Lu, S., Sze, S.-H., and F. Zhang, F., ``Improved algorithms for path, matching, and packing problems,'' Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 298-307, 2007.
77.Chen, J., Kanj, I., and Xia, G., ``Improved parameterized upper bounds for vertex cover,'' Proc. 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), Lecture Notes in Computer Science 4162, pp. 238-249, 2006.
76. Chen, J., Kanj, I., Meng, J., Xia, G., and Zhang, F., ``On the effective enumerability of NP problems,'' Proc. 2nd International Workshop on Parameterized and Exact Computation (IWPEC'06), Lecture Notes in Computer Science 4169, pp. 215-226, 2006.
75. Liu, Y., Lu, S., Chen, J., and Sze, S.-H., ``Greedy localization and color-coding: improved matching and packing algorithms,'' Proc. 2nd International Workshop on Parameterized and Exact Computation (IWPEC'06), Lecture Notes in Computer Science 4169, pp. 84-95, 2006.
74. Akleman, E. and Chen, J., ``Regular mesh construction algorithms using regular handles,'' Proc. IEEE International Conference on Shape Modeling and Applications (SMI'06), pp. 171-181, 2006.
73. Akleman, E. and Chen, J., ``Practical polygonal mesh modeling with discrete Gaussian-Bonnet theorem,'' Proc. Geometric Modeling and Processing 2006 (GMP 2006), Lecture Notes in Computer Science 4077, pp. 287-298, 2006.
72. Chen, J., Huang, X., Kanj, I., and Xia, X., ``The W-hardness under linear FPT-reductions: structural properties and futher applications,'' The 11th International Computing and Combinatorics Conference (COCOON'05), Lecture Notes in Computer Science 3595, pp. 975-984, 2005.
71. Xu, H., Fu, X., Zhu, Y., Bettati, R., Chen, J., and Zhao, W., ``SAS: a scalar anonymous communication system,'' 2005 International Conference on Computer Networks and Mobile Computing (ICCNMC'05), Lecture Notes in Computer Science 3619, pp. 452-461, 2005.
70. Gao, W., Wang, J., Chen, J., and Chen, S., ``PFED: a prediction-based fair active queue management algorithm,'' The 2005 International Conference on Parallel Processing (ICPP-05), pp. 485-491, 2005.
69. Akleman, E. and Chen, J., ``Regular meshes,'' 2005 ACM Sumposium on Solid and Physical Modeling (SPM 05), pp. 213-219, 2005.
68. Chen, J. and Zhang, H., ``On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4],'' The First International Conference on Algorithmic Applications in Management (AAIM'2005), Lecture Notes in Computer Science 3521, pp. 400-410, 2005.
67. Zhang, N., Zhao, W., and Chen, J., ``Performance measurements for privacy preserving data mining,'' The 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-05), Lecture Notes in Computer Science 3518, pp. 43-49, 2005.
66. Chen, J., Fernau, H., Kanj, I., and Xia, G., ``Parameterized duality and kernelization: lower bounds and upper bounds on kernel size,'' The 22nd Symposium on Theoretical Aspects on Computer Science (STACS 2005), Lecture Notes in Computer Science 3404, pp. 269-280, 2005.
65. Zhang, N., Zhao, W., and Chen, J., ``Cardinality-based inference control in OLAP systems: an information theoretic approach,'' The 7th ACM International Workshop on Data Warehousing and OLAP (DOLAP 2004), pp. 59-64, 2004.
64. Xiao, X., Wang, G., and Chen, J., ``Fault tolerant routing algorithm in hypercube networks with load balancing support,'' Proc. 2nd International Symposium on Parallel and Distributed Processing and Applications (ISPA-04), Lecture Notes in Computer Science 3358, pp. 698-704, 2004.
63. Sze, S., Lu, J., and Chen, J., ``Integrating sample-driven and pattern-driven approaches in Motif finding,'' Proc. 4th Workshop on Algorithms in Bioinformatics (WABI 2004), Lecture Notes in Computer Science 3240, pp. 438-449, 2004.
62. Chen, J., Huang, X., Kanj, I., and Xia, G., ``Polynomial time approximation schemes and parameterized complexity,'' Proc. 29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004), Lecture Notes in Computer Science 3153, pp. 500-512, 2004.
61. Chen, J., Huang, X., Kanj, I. A., Xia, G., ``Linear FPT reductions and computational lower bounds,'' Proc. 34th ACM Symposium on theory of Computing (STOC 2004), pp. 212-221, 2004.
60. Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D., Kanj, I., and Xia, G., ``Tight lower bounds for certain parameterized NP-hard problems,'' Proc. 19th Annual IEEE Conference on Computational Complexity (CCC 2004), pp. 150-160, 2004.
59. Wang, G., Li, T., and Chen, J., ``A probabilistic approach to fault-tolerant routing algorithm on mesh networks,'' Proc. 10th International Conference on Parallel and Distributed Systems (ICPADS'04), pp. 577-586, 2004.
58. Wang, G., Chen, J., and Wang, G., ``On fault tolerance of 3-dimensional mesh networks,'' Proc. 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 2004), pp. 149-154, 2004.
57. Chen, J., Kanj, I., and Xia, G., ``Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems,'' Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003), Lecture Notes in Computer Science 2906, pp. 148-157, 2003.
56. Sui, H., Wang, J., Chen, J., and Chen, S., ``An analysis of forwarding mechanism in Crowds,'' Proc. IEEE International Conference on Communications (ICC 2003), pp. 261-265, 2003.
55. Wang, G and Chen, J., ``A new fault-tolerant multicast communication in multicomputers,'' Proc. International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2003), pp. 1251-1254, 2003.
54. Sui, H., Chen, J., Chen, S., and Wang, J., ``Payload analysis of anonymous communication system with host-based rerouting mechanism,'' Proc. 8th IEEE Symposium on Computers and Communication (ISCC 2003), pp. 1259-1266, 2003.
53. Wang, G., Chen, J., and Wang, G., ``Probabilistic analysis of connectivity on mesh networks,'' Proc. 1st IEEE Conference on Information Technology (ITCC 2003), pp. 362-366, 2003.
52. Akleman, E., Srinivasan, V., and Chen, J., ``Interactive rind modeling,'' Proc. International Conference on Shape Modeling and Applications (SMI'03), pp. 23-32, 2003.
51. Wang, G., Chen, J., Wang, G., Chen, S., ``Probability model for faults in large scale multicomputer systems,'' Proc. 12th Asian Test Symposium (ATS'03), pp. 452-457, 2003.
50. Chen, J., Kanj, I., Perkovic, L., Sedgwick, E., and Xia, G., ``Genus charactterizes the complexity of graph problems: some tight results,'' Proc. 30th International Colloquium on Automata, Languages, and Programming (ICALP 2003), Lecture Notes in Computer Science 2719, pp. 845-856, 2003.
49. Chen, J. and Wang, T., ``Probabilistic analysis on mesh network fault tolerance,'' Proceedings of the 14th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS'02), pp. 606-611, 2002.
48. Miranda, A., Torres, L., and Chen, J., ``On the approximability of multiprocessor task scheduling problems,'' Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC'02), Lecture Notes in Computer Science 2518, pp. 403-415, 2002.
47. Chan, C., Akleman, E., and Chen, J., ``Two methods for creating Chinese painting,'' Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (PG'02), pp. 403-412, 2002.
46. Srinivasan, V., Akleman, E., and Chen, J., ``Interactive construction of multi-segment curved handles,'' Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (PG'02), pp. 429-430, 2002.
45. Akleman, E., Chen, J., and Srinivasan, V., ``A prototype system for robust, interactive and user-friendly modeling of orientable 2-manifold meshes,'' Proceedings of International Conference on Shape Modeling and Applications (SM'02), pp. 43-50, 2002.
44. Chen, J., Kanj, I. A., and Wang, G., ``Hypercube network fault tolerance: a probabilistic approach,'' Proceedings of 2002 International Conference on Parallel Processing (ICPP'02), pp. 65-72, 2002.
43. Wang, T. and Chen, J., ``Bandwidth tree - a data structure for routing in networks with advanced reservations,'' The 21st International Performance, Computing, and Communications Conference (IPCCC 2002), pp. 37-44, 2002
42. Chen, J. and Kanj, I., ``Improved exact algorithms for Max-Sat,'' The Latin American Theoretical Informatics (LATIN'2002), Lecture Notes in Computer Science 2286, pp. 341-355, 2002.
41. Chen, J., Friesen, D., Jia, W., and Kanj, I., ``Using Nondeterminism to Design Efficient Deterministic Algorithms,'' The 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'01), Lecture Notes in Computer Science 2245, pp. 120-131, 2001.
40. Chen, J. and Huang, J., ``Semi-normal schedulings: improvement on Goemans' algorithm,'' The 9th Annual International Symposium on Algorithms and Computation (ISAAC'01), Lecture Notes in Computer Science 2223, pp. 48-60, 2001.
39. Chen, J. and Kanj, I., ``On constrained minimum vertex covers of bipartite graphs: improved algorithms,'' Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'2001), Lecture Notes in Computer Science 2204, pp. 55-65, 2001.
38. Oh, E. and Chen, J., ``On strong Menger-connectivity of star graphs,'' Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'2001), Lecture Notes in Computer Science 2204, pp. 272-283, 2001.
37. Oh, E. and Chen, J., ``Parallel routing in hypercube networks with faulty nodes,'' Proc. 8th International Conference on Parallel and Distributed Systems, (ICPADS 2001), pp. 338-345, 2001.
36. Chen, J. and Oh E., ``Strong fault-tolerance: parallel routing in networks with faults,'' Proceedings of 2001 International Conference on Computational Scienc (ICCS 2001), Lecture Notes in Computer Science 2074, pp. 609-618, 2001.
35. Akleman, E., Chen, J., Eryoldas, F., and Srinivasan, V., ``Handle and Hole Improvement by Using New Corner Cutting Subdivision Scheme with Tension,'' Proceedings of International Conference on Shape Modeling and Applications (SM'01), IEEE Computer Society, pp. 32-41, 2001.
34. Akleman, E., Chen, J., and Meric, B., ``Intuitive and effective design of periodic symmetric tiles,'' Proceedings of 19th Annual Conference of the Association for Computer-Aided Design in Architecture (ACADIA 2000), pp. 129-136, 2001.
33. Huang, J., Chen, J., and Chen, S., ``A simple linear time approximation algorithm for multi-processor job scheduling on four processors,'' Proceedings of the 8th Annual International Symposium on Algorithms and Computation (ISAAC'00), Lecture Notes in Computer Science 1969, pp. 60-71, 2000.
32. Chen, J., Wang, G., and Chen, S., ``Routing in hypercube networks with a constant fraction of faulty nodes,'' Proceedings of the 4th International Conference on Algorithms and Architecture for Parallel Processing (ICA3PP'00), World Scientific, pp. 605-616, 2000.
31. Akleman, E., Chen, J., and Meric, B., ``Web-based intuitive and effective design of symmetric tiles,'' Proceedings ACM Multimedia 2000 Workshops, pp. 1-4, 2000
30. Chen, J., Liu, L., Jia, W., and Chen, S., ``An intuitive and effective new representation for interconnection network structures,'' Proceedings of the 8th Annual International Symposium on Algorithms and Computation (ISAAC'00), Lecture Notes in Computer Science 1969, pp. 350-361, 2000.
29. Wang, J., Wang, W., Chen, J., and Chen, S., ``QoS routing algorithms for anycast services ,'' Proceedings of the 4th International Conference on Algorithms and Architecture for Parallel Processing (ICA3PP'00), World Scientific, pp. 364-375, 2000.
28. Chen, J. and Kanj, I., ``On approximating minimum vertex cover for graphs with perfect matching,'' Proceedings of the 8th Annual International Symposium on Algorithms and Computation (ISAAC'00), Lecture Notes in Computer Science 1969, pp. 132-143, 2000.
27. Xuan, D., Li, C., Bettati, R., Chen, J., and Zhao, W., ``Utilization-based admission control for real-time applications,'' Proceedings of the 2000 International Conference on Parallel Processing (ICPP-2000), pp. 251-260, 2000.
26. Huang, J., Chen, J., and Chen, S., ``A simple and improved approximation algorithm for scheduling multiprocessor-jobs on 3-processor systems,'' Proceedings of 2000 International Conference on Software: Theory and Practice (WCC'2000), pp. 801-806, 2000.
25. Wang, J., Wang, W., Chen, J., and Chen, S., ``A randomized QoS routing algorithm on networks with inaccurate line-state information,'' Proceedings of 2000 International Conference on Communication Technology (WCC'2000), IEEE Press, pp. 1617-1622, 2000.
24. Akleman, E., Chen, J., and Srinivasan, V., ``A new paradigm for changing topology during subdivision modeling,'' Proceedings of the Eighth Pacific Conference on Computer Graphics and Applications (PG-2000), pp. 192-201, 2000.
23. Akleman, E. and Chen, J., ``Coupled modeling of solid textures and implicit shapes,'' Proceedings of Implicit Surfaces'99 Conference, pp. 89-96, 1999.
22. Akleman, E. and Chen, J., ``Constant time updateable operations for implicit shape modeling,'' Proceedings of Implicit Surfaces'99 Conference, pp. 73-80, 1999.
21. Chen, J., Kanj, I. A., and Jia, W., ``Vertex cover: further observations and further improvements,'' Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '99), Lecture Notes in Computer Science 1665, pp. 313-324, 1999.
20. Chen, J. and Miranda, A., ``A polynomial time approximation scheme for general multiprocessor job scheduling,'' Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC'99), pp. 418-427, 1999.
19. Akleman, E. and Chen, J., ``Generalized distance functions,'' Proceedings of Shape Modeling International '99 Conference (SMI'99), pp. 72-79, 1999.
18. Akleman, E. and Chen, J., ``Guaranteeing 2-manifold property for meshes,'' Proceedings of Shape Modeling International '99 Conference (SMI'99), pp. 18-25, 1999.
17. Chen, J, Friesen, D., and Zheng, H., ``Tight bound on Johnson's Algorithm for MAXSAT,'' Proceedings of the 12th Annual IEEE Conference on Computational Complexity (CCC'97), pp. 274-281, 1997.
16. Cai, L., Chen, J., and Hastad, J., ``Circuit bottom fan-in and computational power,'' Proceedings of the 12th Annual IEEE Conference on Computational Complexity (CCC'97), pp. 158-164, 1997.
15. Chen, C. C. and Chen, J., ``Nearly optimal one-to-many parallel routing in star networks,'' Proceedings of 11th International Parallel Processing Symposium (IPPS'97), pp. 728-733, 1997.
14. Chen, C. C. and Chen, J., ``Optimal parallel routing in star graphs,'' The 22nd International Workshop on Graph-Theoretical Concepts in Computer Science (WG'97), Lecture Notes in Computer Science 1197, pp. 73-84, 1997.
13. Chen, J., ``Algorithmic graph embeddings,'' First Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science 959, pp. 151-160, 1995.
12. Cai, L. and Chen, J., ``On log-time alternating Turing machines of alternation depth k,'' First Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science 959, pp. 282-291, 1995.
11. Chen, C. and Chen, J., ``Vertex-disjoint routings in star graphs,'' Proceedings of IEEE 1st International Conference on Algorithms and Architectures for Parallel Processing, pp. 460-464, 1995.
10. Chen, C. and Chen, J., ``A homomorphism of the de Bruijn graphs and its applications,'' Proceedings of IEEE 1st International Conference on Algorithms and Architectures for Parallel Processing, pp. 465-470, 1995.
9. Chen, J. and Kanchi, S. P., ``Graph ear decompositions and graph embeddings,'' The 19th International Workshop on Graph-Theoretical Concepts in Computer Science, (WG'93), Lecture Notes in Computer Science 790, pp. 376-387, 1994.
8. Cai, L., Chen, J., Downey, R., and Fellows, M., ``On the structure of parameterized problems in NP,'' 11th Symposium on Theoretical Aspects of Computer Science (STACS'94), Lecture Notes in Computer Science 775, pp. 509-520, 1994.
7. Cai, L. and Chen, J., ``On the amount of nondeterminism and the power of verifying,'' The 18th International Symposium on Mathematical Foundations of Computer Science (MFCS'93), Lecture Notes in Computer Science 711, pp. 311-320, 1993.
6. Chen, J., Kanchi, S. P., and Kanevsky, A., ``On the complexity of graph embeddings,'' The 3rd Workshop on Algorithms and Data Structures (WADS'93), Lecture Notes in Computer Science 709, pp. 234-245, 1993.
5. Cai, L. and Chen, J., ``On fixed-parameter tractability and approximability of NP-hard optimization problems,'' Proc. 2nd Israel Symposium on Theory of Computing and Systems, pp. 118-126, 1993.
4. Chen, J. and Kanevsky, A., ``On assembly of 4-connected graphs,'' The 18th International Workshop on Graph-Theoretical Concepts in Computer Science (WG'92), Lecture Notes in Computer Science 657, pp. 158-169, 1993.
3. Chen, J., ``A linear time algorithm for isomorphism of graphs of bounded average genus,'' The 18th International Workshop on Graph-Theoretical Concepts in Computer Science (WG'92), Lecture Notes in Computer Science 657, pp. 103-113, 1993.
2. Kanevsky, A., Tamassia, R., Battista, G., and Chen, J., ``On-line maintenance of the four-connected components of a graph,'' Proc. 32nd Annual IEEE Symposium on Foundation of Computer Science (FOCS'91), pp. 793-801, 1991.
1. Chen, J. and Yap, C. K., ``Reversal complexity,'' Proc. 2nd Structure in Complexity Theory Conference, pp. 14-19, 1987.

Book Chapters

7. Chen, J. and Xia, G., ``Complexity issues on PTAS,'' Handbook of Combinatorial Optimization, 2nd Ed., P. M. Pardalos, D.-Z. Du, and R. Graham, eds., Springer, pp. 723-746, 2013.
6. Chen, J. and Huang, Y., ``Maximum genus,'' Topics in Topological Graph Theory: Encyclopedia of Mathematics and Its Applications 128, L. Beineke and R. Wilson, eds., Cambridge University Press, pp. 34-44, 2009.
5. Chen, J. and Pike, S., ``Limits of Computation,'' Encyclopedia of Human Geography, B. Warf, ed., SAGE Publications, pp. 277-278, 2006.
4. Chen, J., ``Minimum and maximum imbeddings,'' The Handbook of Graph Theory, J. Gross and J. Yellen, eds., CRC Press, pp. 625-641, 2003.
3. Chen, J., ``Maximum partition matching,'' Encyclopedia of Optimization, Vol. 3, C. Floudas and P. Pardalos, ed., Kluwer Academic Publishers, pp. 260-266, 2001.
2. Chen, J., ``Algorithms and complexity in computational geometry,'' The Handbook of Discrete and Combinatorial Mathematics, K. H. Rosen, ed., CRC Press, Inc., pp. 844-853, 2000.
1. Chen, J., ``Sorting and searching,'' The Handbook of Discrete and Combinatorial Mathematics, K. H. Rosen, ed., CRC Press, Inc., pp. 1125-1139, 2000.

Editorial Publications

11. Chen and J. E., Hopcroft, Guest Eds., Special Issue on Frontiers in Algorithmics, Theoretical Computer Science 607, 2015.
10. Chen, J., Hopcroft, and Wang, Eds., Frontiers in Algorithmics (FAW 2014), Lecture Notes in Computer Science 8497, 2014.
9. Chen, J. and Zelikovsky, A., Guest Eds., Special Issue on Bioinformatics Research and Applications, IEEE/ACM Transactions on Computational Biology and Bioinformatics 9-4, 2012.
8.Chen, J., Wang, J., and Zelikovsky, A., Eds., Bioinformatics Research and Applications (ISBRA 2011), Lecture Notes in Bioinformatics 6674, 2011.
7. Chen, J. and Cooper, S. B., Guest Eds., Special Issue on Algorithms, Complexity and Computational Models, Theoretical Computer Science 412, 2011.
6. Chen, J. and Fomin, F., Eds., Parameterized and Exact Computation (IWPEC 2009), Lecture Notes in Computer Science 5917, 2009.
5. Chen, J. and Cooper S. B., Eds., Theory and Applications of Models of Computation (TAMC 2009), Lecture Notes in Computer Science 5532, 2009.
4. Chen, J. and Kanj, I., Guest Eds., Special Issue on Parameterized and Exact Algorithms, Algorithmica 52, p. 113, 2008.
3. Chen, J., Liu, Y., Chen, H., and Chen, S., Guest Eds., Special Issue on Discrete Mathematics and Theoretical Computer Science by Chinese Researchers, Discrete Applied Mathematics 136, 2004.
2. Chen, J. and Fellows, M., Guest Eds., Special Issue on Parameterized Computation and Complexity, Journal of Computer and System Sciences 67-4, p. 653, 2003.
1. Chen, J. and Fellows, M., ``Report on workshop on complexity and parameters: logic and structure,'' SIGACT News 34-2, pp. 83-84, 2003.