Search the dblp DataBase
Jianer Chen :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Jianer Chen , Fenghui Zhang On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4]. [Citation Graph (0, 0)][DBLP ] AAIM, 2005, pp:400-410 [Conf ] Jianxin Wang , Xianman Zhu , Jianer Chen Link Availability at Any Time in MANET. [Citation Graph (0, 0)][DBLP ] ADHOC-NOW, 2006, pp:184-196 [Conf ] Hong Li , Rui Zhao , Jianer Chen , Yao Xiang Research on Multi-valued and Multi-labeled Decision Trees. [Citation Graph (0, 0)][DBLP ] ADMA, 2006, pp:247-254 [Conf ] Gaocai Wang , Jianer Chen , Guojun Wang , Songqiao Chen Probability Model for Faults in Large-Scale Multicomputer Systems. [Citation Graph (0, 0)][DBLP ] Asian Test Symposium, 2003, pp:452-457 [Conf ] Liming Cai , Jianer Chen , Johan Håstad Circuit Bottom Fan-in and Computational Power. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1997, pp:158-164 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2004, pp:150-160 [Conf ] Jianer Chen , Donald K. Friesen , Hao Zheng Tight Bound on Johnson's Algoritihm for Max-SAT. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1997, pp:274-281 [Conf ] Jianer Chen Algorithmic Graph Embeddings (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:151-160 [Conf ] Liming Cai , Jianer Chen On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:282-291 [Conf ] Jianer Chen , Xiuzhen Huang , Iyad A. Kanj , Ge Xia W -Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. [Citation Graph (0, 0)][DBLP ] COCOON, 2005, pp:975-984 [Conf ] Nan Zhang 0004 , Wei Zhao , Jianer Chen Cardinality-based inference control in OLAP systems: an information theoretic approach. [Citation Graph (0, 0)][DBLP ] DOLAP, 2004, pp:59-64 [Conf ] Arkady Kanevsky , Roberto Tamassia , Giuseppe Di Battista , Jianer Chen On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1991, pp:793-801 [Conf ] Jianer Chen , Donald K. Friesen , Weijia Jia , Iyad A. Kanj Using Nondeterminism to Design Deterministic Algorithms. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2001, pp:120-131 [Conf ] Ergun Akleman , Jianer Chen Insight for Practical Subdivision Modeling with Discrete Gauss-Bonnet Theorem. [Citation Graph (0, 0)][DBLP ] GMP, 2006, pp:287-298 [Conf ] Jianer Chen , Iyad A. Kanj , Ljubomir Perkovic , Eric Sedgwick , Ge Xia Genus Characterizes the Complexity of Graph Problems: Some Tight Results. [Citation Graph (0, 0)][DBLP ] ICALP, 2003, pp:845-856 [Conf ] Jianer Chen , Eunseuk Oh Strong Fault-Tolerance: Parallel Routing in Networks with Faults. [Citation Graph (0, 0)][DBLP ] International Conference on Computational Science (2), 2001, pp:609-618 [Conf ] Hongyun Xu , Xinwen Fu , Ye Zhu , Riccardo Bettati , Jianer Chen , Wei Zhao SAS: A Scalar Anonymous Communication System. [Citation Graph (0, 0)][DBLP ] ICCNMC, 2005, pp:452-461 [Conf ] Eunseuk Oh , Jianer Chen Parallel Routing in Hypercube Networks with Faulty Nodes. [Citation Graph (0, 0)][DBLP ] ICPADS, 2001, pp:338-345 [Conf ] Gaocai Wang , Taoshen Li , Jianer Chen A Probabilistic Approach to Fault-Tolerant Routing Algorithm on Mesh Networks. [Citation Graph (0, 0)][DBLP ] ICPADS, 2004, pp:577-0 [Conf ] Jianer Chen , Iyad A. Kanj , Guojun Wang Hypercube Network Fault Tolerance: A Probabilistic Approach. [Citation Graph (0, 0)][DBLP ] ICPP, 2002, pp:65-72 [Conf ] Wenyu Gao , Jianxin Wang , Jianer Chen , Songqiao Chen PFED: A Prediction-Based Fair Active Queue Management Algorithm. [Citation Graph (0, 0)][DBLP ] ICPP, 2005, pp:485-491 [Conf ] Dong Xuan , Chengzhi Li , Riccardo Bettati , Jianer Chen , Wei Zhao Utilization-Based Admission Control for Real-Time Applications. [Citation Graph (0, 0)][DBLP ] ICPP, 2000, pp:251-0 [Conf ] Chi-Chang Chen , Jianer Chen Nearly Optimal One-To-Many Parallel Routing in Star Networks. [Citation Graph (0, 0)][DBLP ] IPPS, 1997, pp:728-733 [Conf ] Gaocai Wang , Jianer Chen , Guojun Wang A Probabilistic Approach to Fault Tolerant Broadcast Routing Algorithms on Mesh Networks. [Citation Graph (0, 0)][DBLP ] IPDPS, 2003, pp:216- [Conf ] Jianer Chen , Jingui Huang Semi-normal Schedulings: Improvement on Goemans' Algorithm. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:48-60 [Conf ] Jianer Chen , Iyad A. Kanj On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. [Citation Graph (0, 0)][DBLP ] ISAAC, 2000, pp:132-143 [Conf ] Jianer Chen , Iyad A. Kanj , Ge Xia Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. [Citation Graph (0, 0)][DBLP ] ISAAC, 2003, pp:148-157 [Conf ] Jianer Chen , Lihua Liu , Songqiao Chen , Weijia Jia An Intuitive and Effective New Representation for Interconnection Network Structures. [Citation Graph (0, 0)][DBLP ] ISAAC, 2000, pp:350-361 [Conf ] Jingui Huang , Jianer Chen , Songqiao Chen A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors. [Citation Graph (0, 0)][DBLP ] ISAAC, 2000, pp:60-71 [Conf ] Antonio Miranda , Luz Torres , Jianer Chen On the Approximability of Multiprocessor Task Scheduling Problems. [Citation Graph (0, 0)][DBLP ] ISAAC, 2002, pp:403-415 [Conf ] Hongfei Sui , Jianer Chen , Songqiao Chen , Jianxin Wang Payload analysis of anonymous communication system with host-based rerouting mechanism. [Citation Graph (0, 0)][DBLP ] ISCC, 2003, pp:1259-1264 [Conf ] Xiaolin Xiao , Guojun Wang , Jianer Chen Fault Tolerant Routing Algorithm in Hypercube Networks with Load Balancing Support. [Citation Graph (0, 0)][DBLP ] ISPA, 2004, pp:698-704 [Conf ] Gaocai Wang , Jianer Chen , Guojun Wang On Fault Tolerance of 3-Dimensional Mesh Networks. [Citation Graph (0, 0)][DBLP ] ISPAN, 2004, pp:149-154 [Conf ] Liming Cai , Jianer Chen On Fixed-Parameter Tractability and Approximability of NP -Hard Optimization Problems. [Citation Graph (0, 0)][DBLP ] ISTCS, 1993, pp:118-126 [Conf ] Gaocai Wang , Jianer Chen , Guojun Wang Probabilistic Analysis of Connectivity on Mesh Networks. [Citation Graph (0, 0)][DBLP ] ITCC, 2003, pp:362-366 [Conf ] Jianer Chen , Iyad A. Kanj , Jie Meng , Ge Xia , Fenghui Zhang On the Effective Enumerability of NP Problems. [Citation Graph (0, 0)][DBLP ] IWPEC, 2006, pp:215-226 [Conf ] Yang Liu 0002 , Songjian Lu , Jianer Chen , Sing-Hoi Sze Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms. [Citation Graph (0, 0)][DBLP ] IWPEC, 2006, pp:84-95 [Conf ] Jianer Chen , Iyad A. Kanj Improved Exact Algorithms for MAX-SAT. [Citation Graph (0, 0)][DBLP ] LATIN, 2002, pp:341-355 [Conf ] Yuhong Luo , Jianxin Wang , Jianer Chen , Songqiao Chen A Distributed Algorithm based on Probability for Refining Energy-Efficiency of Multicast Trees in Ad Hoc Networks. [Citation Graph (0, 0)][DBLP ] LCN, 2005, pp:482-483 [Conf ] Liming Cai , Jianer Chen On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1993, pp:311-320 [Conf ] Jianer Chen , Xiuzhen Huang , Iyad A. Kanj , Ge Xia Polynomial Time Approximation Schemes and Parameterized Complexity. [Citation Graph (0, 0)][DBLP ] MFCS, 2004, pp:500-512 [Conf ] Jianer Chen , Iyad A. Kanj , Ge Xia Improved Parameterized Upper Bounds for Vertex Cover. [Citation Graph (0, 0)][DBLP ] MFCS, 2006, pp:238-249 [Conf ] Ergun Akleman , Jianer Chen , Burak Meric Web-based intuitive and effective design of symmetric tiles. [Citation Graph (0, 0)][DBLP ] ACM Multimedia Workshops, 2000, pp:1-4 [Conf ] Nan Zhang 0004 , Wei Zhao , Jianer Chen Performance Measurements for Privacy Preserving Data Mining. [Citation Graph (0, 0)][DBLP ] PAKDD, 2005, pp:43-49 [Conf ] Jianer Chen , Tao Wang Probabilistic Analysis on Mesh Network Fault Tolerance. [Citation Graph (0, 0)][DBLP ] IASTED PDCS, 2002, pp:601-606 [Conf ] Gaocai Wang , Jianer Chen A New Fault-Tolerant Multicast Communication in Multicomputers. [Citation Graph (0, 0)][DBLP ] PDPTA, 2003, pp:1251-1254 [Conf ] Ergun Akleman , Vinod Srinivasan , Jianer Chen A New Paradigm for Changing Topology during Subdivision Modeling. [Citation Graph (0, 0)][DBLP ] Pacific Conference on Computer Graphics and Applications, 2000, pp:192-201 [Conf ] Ching (Clara) Chan , Ergun Akleman , Jianer Chen Two Methods for Creating Chinese Painting. [Citation Graph (0, 0)][DBLP ] Pacific Conference on Computer Graphics and Applications, 2002, pp:403-412 [Conf ] Vinod Srinivasan , Ergun Akleman , Jianer Chen Interactive Construction of Multi-Segment Curved Handles . [Citation Graph (0, 0)][DBLP ] Pacific Conference on Computer Graphics and Applications, 2002, pp:429-430 [Conf ] Ergun Akleman , Jianer Chen Regular meshes. [Citation Graph (0, 0)][DBLP ] Symposium on Solid and Physical Modeling, 2005, pp:213-219 [Conf ] Renren Liu , Ting Wang , Chen Jianer , Chen Songqiao Some results on the simply separable function sets in partial k-valued logic. [Citation Graph (0, 0)][DBLP ] SMC (2), 2004, pp:1238-1242 [Conf ] Ergun Akleman , Jianer Chen Guaranteeing 2-Manifold Property for Meshes. [Citation Graph (0, 0)][DBLP ] Shape Modeling International, 1999, pp:18-25 [Conf ] Ergun Akleman , Jianer Chen Generalized Distance Functions. [Citation Graph (0, 0)][DBLP ] Shape Modeling International, 1999, pp:72-79 [Conf ] Ergun Akleman , Jianer Chen , Fusun Eryoldas , Vinod Srinivasan Handle and Hole Improvement by Using New Corner Cutting Subdivision Scheme with Tension. [Citation Graph (0, 0)][DBLP ] Shape Modeling International, 2001, pp:32-41 [Conf ] Ergun Akleman , Jianer Chen , Vinod Srinivasan A Prototype System for Robust, Interactive and User-Friendly Modeling of Orientable 2-Manifold Meshes. [Citation Graph (0, 0)][DBLP ] Shape Modeling International, 2002, pp:43-50 [Conf ] Ergun Akleman , Vinod Srinivasan , Jianer Chen Interactive Rind Modeling. [Citation Graph (0, 0)][DBLP ] Shape Modeling International, 2003, pp:23-32 [Conf ] Ergun Akleman , Jianer Chen Regular Mesh Construction Algorithms using Regular Handles. [Citation Graph (0, 0)][DBLP ] SMI, 2006, pp:27- [Conf ] Liming Cai , Jianer Chen , Rodney G. Downey , Michael R. Fellows On the Structure of Parameterized Problems in NP (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STACS, 1994, pp:509-520 [Conf ] Jianer Chen , Henning Fernau , Iyad A. Kanj , Ge Xia Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. [Citation Graph (0, 0)][DBLP ] STACS, 2005, pp:269-280 [Conf ] Jianer Chen , Xiuzhen Huang , Iyad A. Kanj , Ge Xia Linear FPT reductions and computational lower bounds. [Citation Graph (0, 0)][DBLP ] STOC, 2004, pp:212-221 [Conf ] Jianer Chen , Antonio Miranda A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STOC, 1999, pp:418-427 [Conf ] Sing-Hoi Sze , Songjian Lu , Jianer Chen Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding. [Citation Graph (0, 0)][DBLP ] WABI, 2004, pp:438-449 [Conf ] Jianer Chen , Saroja P. Kanchi , Arkady Kanevsky On the Complexity of Graph Embeddings (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1993, pp:234-245 [Conf ] Jianer Chen A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. [Citation Graph (0, 0)][DBLP ] WG, 1992, pp:103-113 [Conf ] Eunseuk Oh , Jianer Chen On Strong Menger-Connectivity of Star Graphs. [Citation Graph (0, 0)][DBLP ] WG, 2001, pp:272-283 [Conf ] Chi-Chang Chen , Jianer Chen Optimal Parallel Routing in Star Graphs. [Citation Graph (0, 0)][DBLP ] WG, 1996, pp:73-84 [Conf ] Jianer Chen , Iyad A. Kanj On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. [Citation Graph (0, 0)][DBLP ] WG, 2001, pp:55-65 [Conf ] Jianer Chen , Arkady Kanevsky On Assembly of Four-Connected Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WG, 1992, pp:158-169 [Conf ] Jianer Chen , Saroja P. Kanchi Graph Ear Decompositions and Graph Embeddings (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WG, 1993, pp:376-387 [Conf ] Jianer Chen , Iyad A. Kanj , Weijia Jia Vertex Cover: Further Observations and Further Improvements. [Citation Graph (0, 0)][DBLP ] WG, 1999, pp:313-324 [Conf ] Jianer Chen , Donald K. Friesen , Weijia Jia , Iyad A. Kanj Using Nondeterminism to Design Efficient Deterministic Algorithms. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2004, v:40, n:2, pp:83-97 [Journal ] Jianer Chen , Iyad A. Kanj , Ge Xia Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2005, v:43, n:4, pp:245-273 [Journal ] Liming Cai , Jianer Chen , Rodney G. Downey , Michael R. Fellows Advice Classes of Parameterized Tractability. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1997, v:84, n:1, pp:119-138 [Journal ] Ergun Akleman , Jianer Chen , Vinod Srinivasan A minimal and complete set of operators for the development of robust manifold mesh modelers. [Citation Graph (0, 0)][DBLP ] Graphical Models, 2003, v:65, n:5, pp:286-304 [Journal ] Jianer Chen , Iyad A. Kanj Improved exact algorithms for MAX -SAT . [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:17-27 [Journal ] Jianer Chen , Yanpei Liu , Suowang Chen , Songqiao Chen Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS). [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:136, n:1, pp:1- [Journal ] Hanyuan Deng , Jianer Chen , Qiaoliang Li , Rongheng Li , Qiju Gao On the construction of most reliable networks. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:140, n:1-3, pp:19-33 [Journal ] Eunseuk Oh , Jianer Chen On strong Menger-connectivity of star graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:499-511 [Journal ] Jianer Chen , Xiuzhen Huang , Iyad A. Kanj , Ge Xia Polynomial time approximation schemes and parameterized complexity. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:2, pp:180-193 [Journal ] Liming Cai , Jianer Chen , Rodney G. Downey , Michael R. Fellows On the Structure of Parameterized Problems in NP. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1995, v:123, n:1, pp:38-49 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2005, v:201, n:2, pp:216-231 [Journal ] Jianer Chen Characterizing Parallel Hierarchies by Reducibilities. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:39, n:6, pp:303-307 [Journal ] Jianer Chen , Jim Cox , Bud Mishra An NL Hierarchy. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:39, n:1, pp:21-26 [Journal ] Jianer Chen , Saroja P. Kanchi , Arkady Kanevsky A Note on Approximating Graph Genus. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1997, v:61, n:6, pp:317-322 [Journal ] Navneet Malpani , Jianer Chen A note on practical construction of maximum bandwidth paths. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:83, n:3, pp:175-180 [Journal ] Hongfei Sui , Jianxin Wang , Jianer Chen , Songqiao Chen The cost of becoming anonymous: on the participant payload in Crowds. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:90, n:2, pp:81-86 [Journal ] Jianer Chen , Iyad A. Kanj , Weijia Jia Vertex Cover: Further Observations and Further Improvements. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2001, v:41, n:2, pp:280-301 [Journal ] Weijia Jia , Chuanlin Zhang , Jianer Chen An efficient parameterized algorithm for m -set packing. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2004, v:50, n:1, pp:106-117 [Journal ] Jianer Chen , Xiuzhen Huang , Iyad A. Kanj , Ge Xia On the computational hardness based on linear FPT-reductions. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 2006, v:11, n:2, pp:231-247 [Journal ] Jingui Huang , Jianer Chen , Songqiao Chen , Jianxin Wang A simple linear time approximation algorithm for multi-processor job scheduling on four processors. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 2007, v:13, n:1, pp:33-45 [Journal ] Liming Cai , Jianer Chen On Fixed-Parameter Tractability and Approximability of NP Optimization Problems. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1997, v:54, n:3, pp:465-474 [Journal ] Jianer Chen , Michael R. Fellows Foreword from the guest editors. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2003, v:67, n:4, pp:653- [Journal ] Jianer Chen , Donald K. Friesen , Hao Zheng Tight Bound on Johnson's Algorithm for Maximum Satisfiability. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1999, v:58, n:3, pp:622-640 [Journal ] Jianer Chen , Iyad A. Kanj Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2003, v:67, n:4, pp:833-847 [Journal ] Jianer Chen , Xiuzhen Huang , Iyad A. Kanj , Ge Xia Strong computational lower bounds via parameterized complexity. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1346-1367 [Journal ] Jianxin Wang , Jianer Chen , Songqiao Chen An Effective Randomized QoS Routing Algorithm on Networks with Inaccurate Parameters. [Citation Graph (0, 0)][DBLP ] J. Comput. Sci. Technol., 2002, v:17, n:1, pp:38-46 [Journal ] Jianer Chen , Jonathan L. Gross Limit points for average genus II. 2-Connected non-simplicial graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1992, v:56, n:1, pp:108-129 [Journal ] Jianer Chen , Jonathan L. Gross Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1992, v:55, n:1, pp:83-103 [Journal ] Jianer Chen , Jonathan L. Gross Kuratowski-Type Theorems for Average Genus. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1993, v:57, n:1, pp:100-121 [Journal ] Jianer Chen , Iyad A. Kanj , Guojun Wang Hypercube Network Fault Tolerance: A Probabilistic Approach. [Citation Graph (0, 0)][DBLP ] Journal of Interconnection Networks, 2005, v:6, n:1, pp:17-34 [Journal ] Jianer Chen , Guojun Wang , Songqiao Chen Routing in Hypercube Networks with a Constant Fraction of Faulty Nodes. [Citation Graph (0, 0)][DBLP ] Journal of Interconnection Networks, 2001, v:2, n:3, pp:283-294 [Journal ] Eunseuk Oh , Jianer Chen Strong Fault-Tolerance: Parallel Routing in Star Networks with Faults. [Citation Graph (0, 0)][DBLP ] Journal of Interconnection Networks, 2003, v:4, n:1, pp:113-126 [Journal ] Jianer Chen , Gaocai Wang , Chuang Lin , Tao Wang , Guojun Wang Probabilistic analysis on mesh network fault tolerance. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 2007, v:67, n:1, pp:100-110 [Journal ] Jonathan L. Gross , Jianer Chen Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1996, v:29, n:5, pp:451-470 [Journal ] Jianer Chen , Lihua Liu , Weijia Jia Improvement on vertex cover for low-degree graphs. [Citation Graph (0, 0)][DBLP ] Networks, 2000, v:35, n:4, pp:253-259 [Journal ] Liming Cai , Jianer Chen On the Amount of Nondeterminism and the Power of Verifying. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:733-750 [Journal ] Liming Cai , Jianer Chen , Johan Håstad Circuit Bottom Fan-In and Computational Power. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:27, n:2, pp:341-355 [Journal ] Chi-Chang Chen , Jianer Chen The Maximum Partition Matching Problem with Applications. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:28, n:3, pp:935-954 [Journal ] Jianer Chen , Antonio Miranda A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2001, v:31, n:1, pp:1-17 [Journal ] Jianer Chen , Chee-Keng Yap Reversal Complexity. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1991, v:20, n:4, pp:622-638 [Journal ] Jianer Chen A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1994, v:7, n:4, pp:614-631 [Journal ] Jianer Chen , Saroja P. Kanchi Graph Ear Decompositions and Graph Embeddings. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1999, v:12, n:2, pp:229-242 [Journal ] Chi-Chang Chen , Jianer Chen Optimal Parallel Routing in Star Networks. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1997, v:46, n:12, pp:1293-1303 [Journal ] Jianer Chen , Guojun Wang , Songqiao Chen Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 2002, v:51, n:5, pp:530-540 [Journal ] Liming Cai , Jianer Chen On Input Read-Modes of Alternating Turing Machines. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:148, n:1, pp:33-55 [Journal ] Jianer Chen The Difference Between one Tape and two Tapes: with Respect to Reversal Complexity. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1990, v:73, n:3, pp:265-278 [Journal ] Jianer Chen Algorithmic Graph Embeddings. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:181, n:2, pp:247-266 [Journal ] Jianer Chen , Iyad A. Kanj On approximating minimum vertex cover for graphs with perfect matching. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:337, n:1-3, pp:305-318 [Journal ] Jianer Chen , Fenghui Zhang On product covering in 3-tier supply chain models: Natural complete problems for W [3] and W [4]. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:363, n:3, pp:278-288 [Journal ] Chi-Chang Chen , Jianer Chen Nearly Optimal One-to-Many Parallel Routing in Star Networks. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:12, pp:1196-1202 [Journal ] Jianer Chen , Songjian Lu Improved Algorithms for Weighted and Unweighted Set Splitting Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 2007, pp:537-547 [Conf ] Yunlong Liu , Jianer Chen , Jianxin Wang A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 2007, pp:349-359 [Conf ] Jianer Chen , Anxiao Jiang , Iyad A. Kanj , Ge Xia , Fenghui Zhang Separability and Topology Control of Quasi Unit Disk Graphs. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2007, pp:2225-2233 [Conf ] Fenghui Zhang , Hao Li , Anxiao Jiang , Jianer Chen , Ping Luo Face Tracing Based Geographic Routing in Nonplanar Wireless Networks. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2007, pp:2243-2251 [Conf ] Jianer Chen , Songjian Lu , Sing-Hoi Sze , Fenghui Zhang Improved algorithms for path, matching, and packing problems. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:298-307 [Conf ] Jianxin Wang , Xiaoshuang Xu , Jianer Chen An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] TAMC, 2007, pp:760-769 [Conf ] Yunlong Liu , Jianer Chen , Jianxin Wang Parameterized Algorithms for Weighted Matching and Packing Problems. [Citation Graph (0, 0)][DBLP ] TAMC, 2007, pp:692-702 [Conf ] Jianer Chen , Yang Liu 0002 , Songjian Lu An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. [Citation Graph (0, 0)][DBLP ] WADS, 2007, pp:495-506 [Conf ] Jianer Chen , Fedor V. Fomin , Yang Liu 0002 , Songjian Lu , Yngve Villanger Improved Algorithms for the Feedback Vertex Set Problems. [Citation Graph (0, 0)][DBLP ] WADS, 2007, pp:422-433 [Conf ] Jianxin Wang , Min Huang , Jianer Chen A Lower Bound on Approximation Algorithms for the Closest Substring Problem. [Citation Graph (0, 0)][DBLP ] COCOA, 2007, pp:291-300 [Conf ] Songjian Lu , Fenghui Zhang , Jianer Chen , Sing-Hoi Sze Finding Pathway Structures in Protein Interaction Networks. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2007, v:48, n:4, pp:363-374 [Journal ] Jianer Chen , Dan Archdeacon , Jonathan L. Gross Maximum genus and connectivity. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:149, n:1-3, pp:19-29 [Journal ] Jianer Chen , Saroja P. Kanchi , Jonathan L. Gross A tight lower bound on the maximum genus of a simplicial graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:156, n:1-3, pp:83-102 [Journal ] Jianer Chen , Jonathan L. Gross , Robert G. Rieper Overlap matrices and total imbedding distributions. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:128, n:1-3, pp:73-94 [Journal ] Jianer Chen , Iyad A. Kanj , Ljubomir Perkovic , Eric Sedgwick , Ge Xia Genus characterizes the complexity of certain graph problems: Some tight results. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2007, v:73, n:6, pp:892-907 [Journal ] A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI. [Citation Graph (, )][DBLP ] A 2k Kernel for the Cluster Editing Problem. [Citation Graph (, )][DBLP ] Directed Feedback Vertex Set Problem is FPT. [Citation Graph (, )][DBLP ] Polymorphic Worm Detection Using Signatures Based on Neighborhood Relation. [Citation Graph (, )][DBLP ] An Automated Signature Generation Approach for Polymorphic Worm Based on Color Coding. [Citation Graph (, )][DBLP ] C3P: A Cooperant Congestion Control Protocol in High Bandwidth-Delay Product Networks. [Citation Graph (, )][DBLP ] A Virtual Laboratory Platform Based on Integration of Java and Matlab. [Citation Graph (, )][DBLP ] On PTAS for Planar Graph Problems. [Citation Graph (, )][DBLP ] Robust Planarization of Unlocalized Wireless Sensor Networks. [Citation Graph (, )][DBLP ] An Efficient Algorithm for Constructing Maximum lifetime Tree for Data Gathering Without Aggregation in Wireless Sensor Networks. [Citation Graph (, )][DBLP ] A model of higher accuracy for the individual haplotyping problem based on weighted SNP fragments and genotype with errors. [Citation Graph (, )][DBLP ] Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters. [Citation Graph (, )][DBLP ] A Delay-Constrained and Maximum Lifetime Data Gathering Algorithm for Wireless Sensor Networks. [Citation Graph (, )][DBLP ] Sorting Based Data Centric Storage. [Citation Graph (, )][DBLP ] Cyclic twill-woven objects. [Citation Graph (, )][DBLP ] Cyclic twill-woven objects. [Citation Graph (, )][DBLP ] Paper-Strip Sculptures. [Citation Graph (, )][DBLP ] Single-Cycle Plain-Woven Objects. [Citation Graph (, )][DBLP ] A fixed-parameter algorithm for the directed feedback vertex set problem. [Citation Graph (, )][DBLP ] On Feedback Vertex Set New Measure and New Structures. [Citation Graph (, )][DBLP ] A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF. [Citation Graph (, )][DBLP ] An Improved Parameterized Algorithm for a Generalized Matching Problem. [Citation Graph (, )][DBLP ] On Parameterized Exponential Time Complexity. [Citation Graph (, )][DBLP ] An Improved SAT Algorithm in Terms of Formula Length. [Citation Graph (, )][DBLP ] On the Pseudo-achromatic Number Problem. [Citation Graph (, )][DBLP ] Hierarchical Organization of Functional Modules in Weighted Protein Interaction Networks Using Clustering Coefficient. [Citation Graph (, )][DBLP ] A Graph-Theoretic Method for Mining Overlapping Functional Modules in Protein Interaction Networks. [Citation Graph (, )][DBLP ] An Agglomerate Algorithm for Mining Overlapping and Hierarchical Functional Modules in Protein Interaction Networks. [Citation Graph (, )][DBLP ] An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set. [Citation Graph (, )][DBLP ] A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem. [Citation Graph (, )][DBLP ] ARROW-TCP: Accelerating Transmission toward Efficiency and Fairness for High-Speed Networks. [Citation Graph (, )][DBLP ] An Anonymous Communication Mechanism without Key Infrastructure Based on Multi-Paths Network Coding. [Citation Graph (, )][DBLP ] A Practical Exact Algorithm for the Individual Haplotyping Problem MEC. [Citation Graph (, )][DBLP ] A Fast Agglomerate Algorithm for Mining Functional Modules in Protein Interaction Networks. [Citation Graph (, )][DBLP ] A Particle Swarm Optimization Algorithm Based on Optimal Result Set for Haplotyping a Single Individual. [Citation Graph (, )][DBLP ] A Genetic Algorithm for Single Individual SNP Haplotype Assembly. [Citation Graph (, )][DBLP ] Greedily Mining l-dense Subgraphs in Protein Interaction Networks. [Citation Graph (, )][DBLP ] A Novel Anonymous Communication Strategy with Respect to Payment Mechanism. [Citation Graph (, )][DBLP ] Performance analysis of distributed adaptive routing algorithm. [Citation Graph (, )][DBLP ] Foreword from the Guest Editors. [Citation Graph (, )][DBLP ] Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach. [Citation Graph (, )][DBLP ] On Counting 3-D Matchings of Size k . [Citation Graph (, )][DBLP ] An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. [Citation Graph (, )][DBLP ] A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI. [Citation Graph (, )][DBLP ] On the parameterized complexity of short computation and factorization. [Citation Graph (, )][DBLP ] Modifying the DPClus algorithm for identifying protein complexes based on new topological structures. [Citation Graph (, )][DBLP ] On Parameterized Intractability: Hardness and Completeness. [Citation Graph (, )][DBLP ] A Parameterized Perspective on P2 -Packings [Citation Graph (, )][DBLP ] On Feedback Vertex Set, New Measure and New Structures [Citation Graph (, )][DBLP ] Weighted Cluster Editing: Kernelization based on Edge Cuts [Citation Graph (, )][DBLP ] Search in 0.013secs, Finished in 0.704secs