| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Jianer Chen Jianer Chen, Fenghui Zhang : On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4]. AAIM 2005 : 400-410 Nan Zhang , Wei Zhao , Jianer Chen: Performance Measurements for Privacy Preserving Data Mining. PAKDD 2005 : 43-49 Jianer Chen, Henning Fernau , Iyad A. Kanj , Ge Xia : Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. STACS 2005 : 269-280 Nan Zhang , Wei Zhao , Jianer Chen: Cardinality-based inference control in OLAP systems: an information theoretic approach. DOLAP 2004 : 59-64 Gaocai Wang , Taoshen Li , Jianer Chen: A Probabilistic Approach to Fault-Tolerant Routing Algorithm on Mesh Networks. ICPADS 2004 : 577- Jianer Chen, Benny Chor , Mike Fellows , Xiuzhen Huang , David W. Juedes , Iyad A. Kanj , Ge Xia : Tight Lower Bounds for Certain Parameterized NP-Hard Problems. IEEE Conference on Computational Complexity 2004 : 150-160 Xiaolin Xiao , Guojun Wang , Jianer Chen: Fault Tolerant Routing Algorithm in Hypercube Networks with Load Balancing Support. ISPA 2004 : 698-704 Gaocai Wang , Jianer Chen, Guojun Wang : On Fault Tolerance of 3-Dimensional Mesh Networks. ISPAN 2004 : 149-154 Jianer Chen, Xiuzhen Huang , Iyad A. Kanj , Ge Xia : Polynomial Time Approximation Schemes and Parameterized Complexity. MFCS 2004 : 500-512 Jianer Chen, Xiuzhen Huang , Iyad A. Kanj , Ge Xia : Linear FPT reductions and computational lower bounds. STOC 2004 : 212-221 Sing-Hoi Sze , Songjian Lu , Jianer Chen: Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding. WABI 2004 : 438-449 Jianer Chen, Donald K. Friesen , Weijia Jia , Iyad A. Kanj : Using Nondeterminism to Design Efficient Deterministic Algorithms. Algorithmica 40 (2): 83-97 (2004) Jianer Chen, Yanpei Liu , Suowang Chen , Songqiao Chen : Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS). Discrete Applied Mathematics 136 (1): 1 (2004) Hanyuan Deng , Jianer Chen, Qiaoliang Li , Rongheng Li , Qiju Gao : On the construction of most reliable networks. Discrete Applied Mathematics 140 (1-3): 19-33 (2004) Hongfei Sui , Jianxin Wang , Jianer Chen, Songqiao Chen : The cost of becoming anonymous: on the participant payload in Crowds. Inf. Process. Lett. 90 (2): 81-86 (2004) Weijia Jia , Chuanlin Zhang , Jianer Chen: An efficient parameterized algorithm for m -set packing. J. Algorithms 50 (1): 106-117 (2004) Gaocai Wang , Jianer Chen, Guojun Wang , Songqiao Chen : Probability Model for Faults in Large-Scale Multicomputer Systems. Asian Test Symposium 2003 : 452-457 Jianer Chen, Iyad A. Kanj , Ljubomir Perkovic , Eric Sedgwick , Ge Xia : Genus Characterizes the Complexity of Graph Problems: Some Tight Results. ICALP 2003 : 845-856 Gaocai Wang , Jianer Chen, Guojun Wang : A Probabilistic Approach to Fault Tolerant Broadcast Routing Algorithms on Mesh Networks. IPDPS 2003 : 216 Jianer Chen, Iyad A. Kanj , Ge Xia : Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. ISAAC 2003 : 148-157 Hongfei Sui , Jianer Chen, Songqiao Chen , Jianxin Wang : Payload analysis of anonymous communication system with host-based rerouting mechanism. ISCC 2003 : 1259-1264 Gaocai Wang , Jianer Chen, Guojun Wang : Probabilistic Analysis of Connectivity on Mesh Networks. ITCC 2003 : 362-366 Gaocai Wang , Jianer Chen: A New Fault-Tolerant Multicast Communication in Multicomputers. PDPTA 2003 : 1251-1254 Ergun Akleman , Vinod Srinivasan , Jianer Chen: Interactive Rind Modeling. Shape Modeling International 2003 : 23-32 Eunseuk Oh , Jianer Chen: On strong Menger-connectivity of star graphs. Discrete Applied Mathematics 129 (2-3): 499-511 (2003) Ergun Akleman , Jianer Chen, Vinod Srinivasan : A minimal and complete set of operators for the development of robust manifold mesh modelers. Graphical Models 65 (5): 286-304 (2003) Jianer Chen, Michael R. Fellows : Foreword from the guest editors. J. Comput. Syst. Sci. 67 (4): 653 (2003) Jianer Chen, Iyad A. Kanj : Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. J. Comput. Syst. Sci. 67 (4): 833-847 (2003) Eunseuk Oh , Jianer Chen: Strong Fault-Tolerance: Parallel Routing in Star Networks with Faults. Journal of Interconnection Networks 4 (1): 113-126 (2003) Jianer Chen, Iyad A. Kanj , Guojun Wang : Hypercube Network Fault Tolerance: A Probabilistic Approach. ICPP 2002 : 65-72 Antonio Miranda , Luz Torres , Jianer Chen: On the Approximability of Multiprocessor Task Scheduling Problems. ISAAC 2002 : 403-415 Jianer Chen, Iyad A. Kanj : Improved Exact Algorithms for MAX-SAT. LATIN 2002 : 341-355 Ching (Clara) Chan , Ergun Akleman , Jianer Chen: Two Methods for Creating Chinese Painting. Pacific Conference on Computer Graphics and Applications 2002 : 403-412 Vinod Srinivasan , Ergun Akleman , Jianer Chen: Interactive Construction of Multi-Segment Curved Handles . Pacific Conference on Computer Graphics and Applications 2002 : 429-430 Ergun Akleman , Jianer Chen, Vinod Srinivasan : A Prototype System for Robust, Interactive and User-Friendly Modeling of Orientable 2-Manifold Meshes. Shape Modeling International 2002 : 43-50 Jianer Chen, Guojun Wang , Songqiao Chen : Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results. IEEE Trans. Computers 51 (5): 530-540 (2002) Navneet Malpani , Jianer Chen: A note on practical construction of maximum bandwidth paths. Inf. Process. Lett. 83 (3): 175-180 (2002) Jianxin Wang , Jianer Chen, Songqiao Chen : An Effective Randomized QoS Routing Algorithm on Networks with Inaccurate Parameters. J. Comput. Sci. Technol. 17 (1): 38-46 (2002) Jianer Chen, Donald K. Friesen , Weijia Jia , Iyad A. Kanj : Using Nondeterminism to Design Deterministic Algorithms. FSTTCS 2001 : 120-131 Eunseuk Oh , Jianer Chen: Parallel Routing in Hypercube Networks with Faulty Nodes. ICPADS 2001 : 338-345 Jianer Chen, Jingui Huang : Semi-normal Schedulings: Improvement on Goemans' Algorithm. ISAAC 2001 : 48-60 Jianer Chen, Eunseuk Oh : Strong Fault-Tolerance: Parallel Routing in Networks with Faults. International Conference on Computational Science (2) 2001 : 609-618 Ergun Akleman , Jianer Chen, Fusun Eryoldas , Vinod Srinivasan : Handle and Hole Improvement by Using New Corner Cutting Subdivision Scheme with Tension. Shape Modeling International 2001 : 32-41 Eunseuk Oh , Jianer Chen: On Strong Menger-Connectivity of Star Graphs. WG 2001 : 272-283 Jianer Chen, Iyad A. Kanj : On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. WG 2001 : 55-65 Jianer Chen, Iyad A. Kanj , Weijia Jia : Vertex Cover: Further Observations and Further Improvements. J. Algorithms 41 (2): 280-301 (2001) Jianer Chen, Guojun Wang , Songqiao Chen : Routing in Hypercube Networks with a Constant Fraction of Faulty Nodes. Journal of Interconnection Networks 2 (3): 283-294 (2001) Jianer Chen, Antonio Miranda : A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling. SIAM J. Comput. 31 (1): 1-17 (2001) Ergun Akleman , Jianer Chen, Burak Meric : Web-based intuitive and effective design of symmetric tiles. ACM Multimedia Workshops 2000 : 1-4 Dong Xuan , Chengzhi Li , Riccardo Bettati , Jianer Chen, Wei Zhao : Utilization-Based Admission Control for Real-Time Applications. ICPP 2000 : 251- Jianer Chen, Iyad A. Kanj : On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. ISAAC 2000 : 132-143 Jianer Chen, Lihua Liu , Songqiao Chen , Weijia Jia : An Intuitive and Effective New Representation for Interconnection Network Structures. ISAAC 2000 : 350-361 Jingui Huang , Jianer Chen, Songqiao Chen : A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors. ISAAC 2000 : 60-71 Ergun Akleman , Vinod Srinivasan , Jianer Chen: A New Paradigm for Changing Topology during Subdivision Modeling. Pacific Conference on Computer Graphics and Applications 2000 : 192-201 Jianer Chen, Lihua Liu , Weijia Jia : Improvement on vertex cover for low-degree graphs. Networks 35 (4): 253-259 (2000) Jianer Chen, Antonio Miranda : A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (Extended Abstract). STOC 1999 : 418-427 Ergun Akleman , Jianer Chen: Guaranteeing 2-Manifold Property for Meshes. Shape Modeling International 1999 : 18-25 Ergun Akleman , Jianer Chen: Generalized Distance Functions. Shape Modeling International 1999 : 72-79 Jianer Chen, Iyad A. Kanj , Weijia Jia : Vertex Cover: Further Observations and Further Improvements. WG 1999 : 313-324 Jianer Chen, Donald K. Friesen , Hao Zheng : Tight Bound on Johnson's Algorithm for Maximum Satisfiability. J. Comput. Syst. Sci. 58 (3): 622-640 (1999) Chi-Chang Chen , Jianer Chen: The Maximum Partition Matching Problem with Applications. SIAM J. Comput. 28 (3): 935-954 (1999) Jianer Chen, Saroja P. Kanchi : Graph Ear Decompositions and Graph Embeddings. SIAM J. Discrete Math. 12 (2): 229-242 (1999) Liming Cai , Jianer Chen, Johan Håstad : Circuit Bottom Fan-In and Computational Power. SIAM J. Comput. 27 (2): 341-355 (1998) Liming Cai , Jianer Chen, Johan Håstad : Circuit Bottom Fan-in and Computational Power. IEEE Conference on Computational Complexity 1997 : 158-164 Jianer Chen, Donald K. Friesen , Hao Zheng : Tight Bound on Johnson's Algoritihm for Max-SAT. IEEE Conference on Computational Complexity 1997 : 274-281 Chi-Chang Chen , Jianer Chen: Nearly Optimal One-To-Many Parallel Routing in Star Networks. IPPS 1997 : 728-733 Liming Cai , Jianer Chen, Rodney G. Downey , Michael R. Fellows : Advice Classes of Parameterized Tractability. Ann. Pure Appl. Logic 84 (1): 119-138 (1997) Chi-Chang Chen , Jianer Chen: Optimal Parallel Routing in Star Networks. IEEE Trans. Computers 46 (12): 1293-1303 (1997) Chi-Chang Chen , Jianer Chen: Nearly Optimal One-to-Many Parallel Routing in Star Networks. IEEE Trans. Parallel Distrib. Syst. 8 (12): 1196-1202 (1997) Jianer Chen, Saroja P. Kanchi , Arkady Kanevsky : A Note on Approximating Graph Genus. Inf. Process. Lett. 61 (6): 317-322 (1997) Liming Cai , Jianer Chen: On Fixed-Parameter Tractability and Approximability of NP Optimization Problems. J. Comput. Syst. Sci. 54 (3): 465-474 (1997) Liming Cai , Jianer Chen: On the Amount of Nondeterminism and the Power of Verifying. SIAM J. Comput. 26 (3): 733-750 (1997) Jianer Chen: Algorithmic Graph Embeddings. Theor. Comput. Sci. 181 (2): 247-266 (1997) Chi-Chang Chen , Jianer Chen: Optimal Parallel Routing in Star Graphs. WG 1996 : 73-84 Jonathan L. Gross , Jianer Chen: Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings. Mathematical Systems Theory 29 (5): 451-470 (1996) Jianer Chen: Algorithmic Graph Embeddings (Extended Abstract). COCOON 1995 : 151-160 Liming Cai , Jianer Chen: On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract). COCOON 1995 : 282-291 Liming Cai , Jianer Chen, Rodney G. Downey , Michael R. Fellows : On the Structure of Parameterized Problems in NP. Inf. Comput. 123 (1): 38-49 (1995) Liming Cai , Jianer Chen: On Input Read-Modes of Alternating Turing Machines. Theor. Comput. Sci. 148 (1): 33-55 (1995) Liming Cai , Jianer Chen, Rodney G. Downey , Michael R. Fellows : On the Structure of Parameterized Problems in NP (Extended Abstract). STACS 1994 : 509-520 Jianer Chen: A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. SIAM J. Discrete Math. 7 (4): 614-631 (1994) Liming Cai , Jianer Chen: On Fixed-Parameter Tractability and Approximability of NP -Hard Optimization Problems. ISTCS 1993 : 118-126 Liming Cai , Jianer Chen: On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract). MFCS 1993 : 311-320 Jianer Chen, Saroja P. Kanchi , Arkady Kanevsky : On the Complexity of Graph Embeddings (Extended Abstract). WADS 1993 : 234-245 Jianer Chen, Saroja P. Kanchi : Graph Ear Decompositions and Graph Embeddings (Extended Abstract). WG 1993 : 376-387 Jianer Chen: A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. WG 1992 : 103-113 Jianer Chen, Arkady Kanevsky : On Assembly of Four-Connected Graphs (Extended Abstract). WG 1992 : 158-169 Arkady Kanevsky , Roberto Tamassia , Giuseppe Di Battista , Jianer Chen: On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract) FOCS 1991 : 793-801 Jianer Chen, Jim Cox , Bud Mishra : An NL Hierarchy. Inf. Process. Lett. 39 (1): 21-26 (1991) Jianer Chen: Characterizing Parallel Hierarchies by Reducibilities. Inf. Process. Lett. 39 (6): 303-307 (1991) Jianer Chen, Chee-Keng Yap : Reversal Complexity. SIAM J. Comput. 20 (4): 622-638 (1991) Jianer Chen: The Difference Between one Tape and two Tapes: with Respect to Reversal Complexity. Theor. Comput. Sci. 73 (3): 265-278 (1990) 1 [ 35 ] [ 36 ] [ 39 ] [ 44 ] [ 50 ] [ 58 ] [ 59 ] [ 60 ] [ 67 ] [ 69 ] 2 [ 5 ] 3 [ 43 ] 4 [ 10 ] [ 11 ] [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 21 ] [ 22 ] [ 26 ] [ 29 ] [ 30 ] 5 [ 60 ] 6 [ 19 ] [ 24 ] [ 25 ] [ 27 ] [ 32 ] 7 [ 40 ] [ 41 ] [ 46 ] [ 55 ] [ 57 ] [ 72 ] [ 76 ] [ 78 ] [ 80 ] 8 [ 80 ] 9 [ 87 ] 10 [ 4 ] 11 [ 79 ] 12 [ 13 ] [ 15 ] [ 26 ] 13 [ 50 ] 14 [ 13 ] [ 15 ] [ 26 ] [ 66 ] 15 [ 87 ] 16 [ 90 ] 17 [ 28 ] [ 33 ] [ 54 ] [ 81 ] 18 [ 79 ] 19 [ 18 ] 20 [ 29 ] [ 30 ] 21 [ 40 ] [ 52 ] 22 [ 83 ] [ 84 ] [ 87 ] 23 [ 34 ] [ 38 ] [ 41 ] [ 47 ] [ 54 ] [ 77 ] [ 81 ] 24 [ 87 ] 25 [ 8 ] [ 9 ] [ 23 ] [ 31 ] 26 [ 5 ] [ 6 ] [ 9 ] [ 23 ] 27 [ 34 ] [ 42 ] [ 47 ] [ 48 ] [ 54 ] [ 61 ] [ 63 ] [ 65 ] [ 73 ] [ 75 ] [ 81 ] [ 83 ] [ 84 ] [ 87 ] [ 90 ] 28 [ 43 ] 29 [ 79 ] 30 [ 79 ] 31 [ 88 ] 32 [ 38 ] [ 41 ] 33 [ 80 ] 34 [ 82 ] 35 [ 56 ] 36 [ 44 ] 37 [ 37 ] [ 45 ] [ 62 ] 38 [ 4 ] 39 [ 49 ] [ 51 ] [ 53 ] [ 64 ] [ 68 ] 40 [ 75 ] 41 [ 75 ] 42 [ 39 ] [ 50 ] [ 58 ] [ 59 ] [ 67 ] [ 69 ] 43 [ 72 ] [ 78 ] 44 [ 82 ] 45 [ 5 ] 46 [ 62 ] 47 [ 70 ] [ 71 ] [ 74 ] [ 76 ] [ 85 ] [ 88 ] 48 [ 46 ] [ 57 ] [ 63 ] [ 71 ] [ 74 ] [ 76 ] [ 85 ] [ 86 ] 49 [ 55 ] [ 72 ] [ 78 ] 50 [ 73 ] [ 75 ] [ 83 ] [ 84 ] [ 87 ] [ 90 ] 51 [ 86 ] 52 [ 43 ] 53 [ 2 ] 54 [ 77 ] 55 [ 92 ] 56 [ 89 ] [ 91 ] 57 [ 43 ] [ 89 ] [ 91 ] 58 [ 28 ] [ 33 ]  ©2005 Association for Computing Machinery |
