66. Chen, J. and Lu, S.,
``Improved parameterized set splitting algorithms:
a probabilistic approach,''
Algorithmica, accepted, 2008
65. Chen, J., Fomin, F., Liu, Y., Lu, S., and Villanger, Y.,
``Improved algorithms for feedback vertex set problems,''
Journal of Computer and System Sciences, accepted, 2008.
64. Liu, Y., Chen, J., and Wang, J.,
``On counting 3-D matchings of size k,''
Algorithmica, accepted, 2008.
63. Chen, J., Liu, Y., and Lu, S.,
``An improved parameterized algorithm for the minimum
node multiway cut problem,''
Algorithmica, accepted, 2007.
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.
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, accepted.
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, accepted.
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.,
``On efficient FPT 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,
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
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,
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,
41. Chen, J., Friesen, D., Jia, W., and Kanj,
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.
11. Chen, J. and Huang, Y., ``Survey of maximum genus,'' Encyclopedia
of Mathematics, J. Gross and T. Tucker, ed., Cambridge University Press, in
press.
10. Chen, J. and Pike, S., ``Limits of Computation,'' Encyclopedia of
Human Geography, B. Warf, ed., SAGE Publications, pp. 277-278, 2006.
9. Chen, J., ``Minimum and maximum imbeddings,''
The Handbook of Graph Theory, J. Gross and J. Yellen,
ed., CRC Press, pp. 625-641, 2003.
8. Chen, J., ``Maximum partition matching,'' Encyclopedia of
Optimization, Vol. 3, C. Floudas and P. Pardalos, ed., Kluwer Academic
Publishers, pp. 260-266, 2001.
7. 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.
6. Chen, J., ``Sorting and searching,'' The Handbook of Discrete and
Combinatorial Mathematics, K. H. Rosen, ed., CRC Press, Inc., pp.
1125-1139, 2000.
5. Zhou, J., Ying, J., Chen, J., and Yen, J., ``Natural language
processing in multi-agent systems,'' Intelligent Agent Technology: Systems,
Methodologies, and Tools, J. Liu and N. Zhong,
ed., World Scientific, pp. 384-388, 1999.
4. Zhou, J., Ying, J., Chen, J., and Yen, J., ``Learning novel concepts
through natural language,'' Intelligent Agent Technology: Systems,
Methodologies, and Tools, J. Liu and N. Zhong,
ed., World Scientific, pp. 264-268, 1999.
3. Kanchi, S. and Chen, J., ``Maximum genus
and 2-connected graphs,'' Combinatorics,
Graph Theory, and Algorithms, Y. Alavi, D. R.
Lick, and A. Schwenk, ed., Wiley Interscience,
pp. 211-220, 1999.
2. Chen, J. and Gross, J. L., ``No lower limit points for average
genus,'' Graph Theory, Combinatorics, and
Applications, Y. Alavi and A. Schwenk,
ed., Wiley Interscience, pp. 183-194, 1995.
1. Chen, J. and Gross, J. L., ``Voltage graphs for parallel architecture
layouts,'' Graph Theory, Combinatorics, and
Applications, Y. Alavi and A. Schwenk,
ed., Wiley Interscience, pp. 455-466, 1995.
24. Chen, J., Liu, Y., Chen, H., and Chen, S., ``Preface,'' Special
Issue on Discrete Mathematics and Theoretical Computer Science by Chinese
Researchers, Discrete Applied Mathematics 136, p. 1, 2004.
23. Chen, J. and Fellows, M., ``Forwords from
the guest editors,'' Special Issue on Parameterized Computation and Complexity,
Journal of Computer and System Sciences 67-4, p. 653, 2003.
22. Chen, J. and Fellows, M., ``Report on workshop on complexity and
parameters: logic and structure,'' SIGACT News 34-2, pp. 83-84, (2003).
21. Chen, J., ``Some tight optimization results
characterized by graph genus,'' (invited speech), Pre-Conference Workshop on
Complexity and Parameters: Logic and Structures (FST&TCS'02),
20. Chen, J., ``Simpler computation and deeper theory: on development of
efficient parameterized algorithms,'' (invited speech), International
Workshop on Parameterized Complexity,
19. Chen, J., ``Vertex cover in time O(1.271^k
+ kn),'' DIMACS Workshop on Faster Exact Solutions
for NP-Hard Problems,
18. Chen, J., Liu, L., and Jia, W.,
``Improvement on vertex cover for low degree graphs,'' DIMACS Workshop on
Algorithms and Combinatorics, HongKong,
July 5, 1999.
17. Chen, J., ``Network parallel routing and maximum partition
matching,'' DIMACS Workshop on Network Design: Connectivity and Facilities
Location,
16. Chen, J., ``The maximum partition matching
problem with applications,'' Workshop on Algorithmic Research in the Midsouthwest,
15. Chen, J., D. Archdeacon, and J. L. Gross., ``Maximum genus and
connectivity,'' (invited paper), Proc. The AMS/MAA Joint Summer Meeting (MathFest): Special Session on Topological Graph Theory,
pp. 622,
14. Chen, J., S. P. Kanchi, and J. L. Gross.,
``A tight lower bound on the maximum genus of a simplicial
graph,'' Proc. The AMS/MAA Joint Summer Meeting (MathFest):
Special Session on Topological Graph Theory, pp. 624,
13. Chen, J., ``Computational complexity of graph embeddings,'' (invited
paper), VII Vermont Summer Workshop on Combinatorics
and Graph Theory,
12. Cai, L., Chen, J.,
11. Cai, L., Chen,
J.,
10. Chen, J., Kanchi, S. P., Gross, J. L., ``On graph drawings with the smallest number of faces,'' ALCOM
International Workshop PARIS 1993 on Graph Drawing and Topological Graph
Algorithms, Sevres,
9. Chen, J., Kanchi, S. P., Kanevsky, A., and Joshi, S., ``The
complexity of near-optimal graph embeddings,'' The 24th Southeastern
International Conference on Combinatorics, Graph
Theory, and Computing,
8. Cai, L. and Chen,
J., ``Fixed parameter tractability, approximability,
and interactive proof systems,'' Workshop on Algorithmic Research in the Midsouthwest,
7. Chen, J. and A. Kanevsky, ``On minimal four-connected graphs,'' The 5th Annual
Cumberland Conference on Graph Theory and Computing,
6. Chen, J. and Gross, J. L., ``Voltage graphs for parallel architecture
layouts,'' Seventh International Conference on Graph Theory, Combinatorics, Algorithms, and Applications,
5. Chen, J. and Gross, J. L., ``No lower limit points for average
genus,'' Seventh International Conference on Graph Theory, Combinatorics, Algorithms, and Applications,
4. Chen, J., A. Kanevsky,
A., and R. Tamassia, ``A linear time algorithm for triconnected ear decomposition of a graph,'' The 22nd
Southeastern International Conference on Combinatorics,
Graph Theory, and Computing,
3. Chen, J. and Gross, J. L., ``A relationship of average genus to the
graph isomorphism problem,'' The 22nd Southeastern International Conference
on Combinatorics, Graph Theory, and Computing,
2. Chen, J., ``A new approach to the graph isomorphism problem,'' Workshop
on Algorithmic Research in the Midsouthwest,
Austin, March 23, 1990.
1. Chen, J., ``Logarithmic depth reducibility and the NC hierarchy,'' Combinatorics and Complexity Conference,