- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j107 |      | Ergun Akleman, Qing Xing, Pradeep Garigipati, Gabriel Taubin, Jianer Chen, Shiyu Hu: Hamiltonian cycle art: Surface covering wire sculptures and duotone surfaces. Computers & Graphics 37(5): 316-332 (2013) |
| j106 | | Jingli Wu, Jianxin Wang, Jianer Chen: A heuristic algorithm for haplotype reconstruction from aligned weighted SNP fragments. IJBRA 9(1): 13-24 (2013) |
| j105 | | Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen: Planar graph vertex partition for linear problem kernels. J. Comput. Syst. Sci. 79(5): 609-621 (2013) |
| j104 | | Srikanth Sastry, Tsvetomira Radeva, Jianer Chen, Jennifer L. Welch: Reliable networks with unreliable sensors. Pervasive and Mobile Computing 9(2): 311-323 (2013) |
| j103 | | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: Parameterized top-K algorithms. Theor. Comput. Sci. 470: 105-119 (2013) |
| c146 | | Qilong Feng, Jianxin Wang, Shaohua Li, Jianer Chen: Random Methods for Parameterized Problems. COCOON 2013: 89-100 |
| c145 | | Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen: An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs. COCOON 2013: 555-566 |
| c144 | | Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang: Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees. COCOON 2013: 567-578 |
| c143 | | |
| 2012 | ||
| j102 | | Yixin Cao, Jianer Chen: Cluster Editing: Kernelization Based on Edge Cuts. Algorithmica 64(1): 152-169 (2012) |
| j101 | | Jianer Chen, Ion I. Mandoiu, Raj Sunderraman, Jianxin Wang, Alexander Zelikovsky: Guest Editors' Introduction. BMC Bioinformatics 13(S-10): S1 (2012) |
| j100 | | Shiyu Hu, Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L. Gross: Pattern mapping with quad-pattern-coverable quad-meshes. Computers & Graphics 36(5): 455-465 (2012) |
| j99 | | Jia-Hao Fan, Jianer Chen, Sing-Hoi Sze: Identifying Complexes from Protein Interaction Networks According to Different Types of Neighborhood Density. Journal of Computational Biology 19(12): 1284-1294 (2012) |
| j98 | | Jianer Chen, Jie Meng: A 2k kernel for the cluster editing problem. J. Comput. Syst. Sci. 78(1): 211-220 (2012) |
| j97 | | Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang: Multicut in trees viewed through the eyes of vertex cover. J. Comput. Syst. Sci. 78(5): 1637-1650 (2012) |
| j96 | | Jianer Chen, Yang Liu, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang: Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching. ACM Transactions on Algorithms 8(1): 6 (2012) |
| j95 | | Jianer Chen, Alexander Zelikovsky: Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications. IEEE/ACM Trans. Comput. Biology Bioinform. 9(4): 1002-1003 (2012) |
| j94 | | Yunlong Liu, Jianxin Wang, Jiong Guo, Jianer Chen: Complexity and parameterized algorithms for Cograph Editing. Theor. Comput. Sci. 461: 45-54 (2012) |
| c142 | | Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang, Zhibiao Yang: Kernels for Packing and Covering Problems - (Extended Abstract). FAW-AAIM 2012: 199-211 |
| c141 | | Jianer Chen, Iyad A. Kanj: Parameterized Complexity and Subexponential-Time Computability. The Multivariate Algorithmic Revolution and Beyond 2012: 162-195 |
| c140 | | Qing Xing, Ergun Akleman, Gabriel Taubin, Jianer Chen: Surface Covering Curves. Computational Aesthetics 2012: 107-114 |
| c139 | | Jianxin Wang, Jinyi Yao, Qilong Feng, Jianer Chen: Improved FPT Algorithms for Rectilinear k-Links Spanning Path. TAMC 2012: 560-571 |
| c138 | | Ying Zheng, Jianxin Wang, Qilong Feng, Jianer Chen: FPT Results for Signed Domination. TAMC 2012: 572-583 |
| 2011 | ||
| j93 | | Fenghui Zhang, Anxiao Jiang, Jianer Chen: On the Planarization of Wireless Sensor Networks. Algorithmica 60(3): 593-608 (2011) |
| j92 | | Ergun Akleman, Jianer Chen, Yen-Lin Chen, Qing Xing, Jonathan L. Gross: Cyclic twill-woven objects. Computers & Graphics 35(3): 623-631 (2011) |
| j91 | | Jianxin Wang, Qilong Feng, Jianer Chen: Color-Coding and its Applications: A Survey. Int. J. Software and Informatics 5(4): 595-606 (2011) |
| j90 | | Shaohua Li, Jianxin Wang, Jianer Chen, Zhijian Wang: An Algorithm for Minimum Vertex Cover Based on Max-I Share Degree. JCP 6(8): 1781-1788 (2011) |
| j89 | | Jianxin Wang, Min Li, Jianer Chen, Yi Pan: A Fast Hierarchical Clustering Algorithm for Functional Modules Discovery in Protein Interaction Networks. IEEE/ACM Trans. Comput. Biology Bioinform. 8(3): 607-620 (2011) |
| j88 | | Jianxin Wang, Qilong Feng, Jianer Chen: An O*(3.533k)-time parameterized algorithm for the 3-set packing problem. Theor. Comput. Sci. 412(18): 1745-1753 (2011) |
| j87 | | Jianer Chen, S. Barry Cooper: Algorithms, complexity and computational models. Theor. Comput. Sci. 412(23): 2457-2458 (2011) |
| j86 | | Jianer Chen, Qilong Feng, Yang Liu, Songjian Lu, Jianxin Wang: Improved deterministic algorithms for weighted matching and packing problems. Theor. Comput. Sci. 412(23): 2503-2512 (2011) |
| j85 | | Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang: Separability and topology control of quasi unit disk graphs. Wireless Networks 17(1): 53-67 (2011) |
| c137 | | Gang Chen, Jianxin Wang, Yi Pan, Jianer Chen: Identification of Breast Cancer Gene Signature in Protein Interaction Network Using Graph Centrality. BIBM 2011: 402-405 |
| c136 | | Yunlong Liu, Jianxin Wang, Jiong Guo, Jianer Chen: Cograph Editing: Complexity and Parameterized Algorithms. COCOON 2011: 110-121 |
| c135 | | Qilong Feng, Jianxin Wang, Jianer Chen: Matching and P 2-Packing: Weighted Versions. COCOON 2011: 343-353 |
| c134 | | Junbin Liang, Jianxin Wang, Xi Zhang, Jianer Chen: An Adaptive Probability Broadcast-Based Data Preservation Protocol in Wireless Sensor Networks. ICC 2011: 1-5 |
| c133 | | Srikanth Sastry, Tsvetomira Radeva, Jianer Chen, Jennifer L. Welch: Reliable Networks with Unreliable Sensors. ICDCN 2011: 281-292 |
| c132 | | Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen: Linear Problem Kernels for Planar Graph Problems with Small Distance Property. MFCS 2011: 592-603 |
| c131 | | Qing Xing, Gabriel Esquivel, Ergun Akleman, Jianer Chen, Jonathan L. Gross: Band decomposition of 2-manifold meshes for physical construction of large structures. SIGGRAPH Talks 2011: 25 |
| c130 | | Shi-Yu, Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L. Gross: Pattern mapping with quad-pattern-coverable quad-meshes. SIGGRAPH Talks 2011: 26 |
| c129 | | Qing Xing, Gabriel Esquivel, Ergun Akleman, Jianer Chen, Jonathan L. Gross: Band decomposition of 2-manifold meshes for physical construction of large structures. SIGGRAPH Posters 2011: 58 |
| c128 | | Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen: An Improved Kernel for Planar Connected Dominating Set. TAMC 2011: 70-81 |
| c127 | | Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang: Multicut in Trees Viewed through the Eyes of Vertex Cover. WADS 2011: 219-230 |
| c126 | | Amin Hassanzadeh, Radu Stoleru, Jianer Chen: Efficient flooding in Wireless Sensor Networks secured with neighborhood keys. WiMob 2011: 119-126 |
| e3 | | Jianer Chen, Jianxin Wang, Alexander Zelikovsky (Eds.): Bioinformatics Research and Applications - 7th International Symposium, ISBRA 2011, Changsha, China, May 27-29, 2011. Proceedings. Lecture Notes in Computer Science 6674, Springer 2011, isbn 978-3-642-21259-8 |
| 2010 | ||
| j84 | | Jianxin Wang, Minzhu Xie, Jianer Chen: A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI. Algorithmica 56(3): 283-296 (2010) |
| j83 | | Min Li, Jianxin Wang, Jianer Chen, Zhao Cai, Gang Chen: Identifying the overlapping complexes in protein interaction networks. IJDMB 4(1): 91-108 (2010) |
| j82 | | Jianxin Wang, Dan Ning, Qilong Feng, Jianer Chen: An improved kernelization for P2-packing. Inf. Process. Lett. 110(5): 188-192 (2010) |
| j81 | | Gaocai Wang, Jianer Chen, Chuang Lin: A New Fault-Tolerant Broadcast Routing Algorithm on Mesh Networks. Journal of Interconnection Networks 11(3-4): 175-187 (2010) |
| j80 | | Minzhu Xie, Jianxin Wang, Jianer Chen: A practical parameterised algorithm for the individual haplotyping problem MLF. Mathematical Structures in Computer Science 20(5): 851-863 (2010) |
| j79 | | Jianer Chen, Iyad A. Kanj, Ge Xia: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40-42): 3736-3756 (2010) |
| j78 | | Jianxin Wang, Wenjun Li, Jianer Chen: A parameterized algorithm for the hyperplane-cover problem. Theor. Comput. Sci. 411(44-46): 4005-4009 (2010) |
| c125 | | |
| c124 | | Gaocai Wang, Taoshen Li, Jianer Chen: Probabilistic Analysis on Mesh Network Fault Tolerance: Deterministic vs. Stochastic. EUC 2010: 731-736 |
| c123 | | Junbin Liang, Jianxin Wang, Jianer Chen: An Overhearing-Based Scheme for Improving Data Persistence in Wireless Sensor Networks. ICC 2010: 1-5 |
| c122 | | Junbin Liang, Jianxin Wang, Jiannong Cao, Jianer Chen, Mingming Lu: An Efficient Algorithm for Constructing Maximum lifetime Tree for Data Gathering Without Aggregation in Wireless Sensor Networks. INFOCOM 2010: 506-510 |
| c121 | | Jun Ren, Jianxin Wang, Jianer Chen, Min Li, Gang Chen: An Agglomerate Algorithm for Mining Overlapping and Hierarchical Functional Modules in Protein Interaction Networks. ISBRA 2010: 140-151 |
| c120 | | |
| c119 | | Ergun Akleman, Jianer Chen, Yen-Lin Chen, Qing Xing: Cyclic twill-woven objects. SIGGRAPH Posters 2010 |
| c118 | | Ergun Akleman, Jianer Chen, Yen-Lin Chen, Qing Xing: Cyclic twill-woven objects. SIGGRAPH Talks 2010 |
| c117 | | Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L. Gross: Single-Cycle Plain-Woven Objects. Shape Modeling International 2010: 90-99 |
| c116 | | Ergun Akleman, Jianer Chen, Jonathan L. Gross: Paper-Strip Sculptures. Shape Modeling International 2010: 236-240 |
| c115 | | |
| i4 | | Yixin Cao, Jianer Chen, Yang Liu: On Feedback Vertex Set, New Measure and New Structures. CoRR abs/1004.1672 (2010) |
| i3 | | Yixin Cao, Jianer Chen: Weighted Cluster Editing: Kernelization based on Edge Cuts. CoRR abs/1008.4250 (2010) |
| i2 | | Yixin Cao, Jianer Chen: FAST: Kernelization based on Graph Modular Decomposition. CoRR abs/1009.5143 (2010) |
| 2009 | ||
| j77 | | Jianer Chen, Songjian Lu: Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach. Algorithmica 54(4): 472-489 (2009) |
| j76 | | Yunlong Liu, Jianer Chen, Jianxin Wang: On Counting 3-D Matchings of Size k. Algorithmica 54(4): 530-543 (2009) |
| j75 | | Jianer Chen, Yang Liu, Songjian Lu: An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. Algorithmica 55(1): 1-13 (2009) |
| j74 | | Jingli Wu, Jianxin Wang, Jianer Chen: A practical algorithm based on particle swarm optimization for haplotype reconstruction. Applied Mathematics and Computation 208(2): 363-372 (2009) |
| j73 | | Jingli Wu, Jianxin Wang, Jianer Chen: A parthenogenetic algorithm for single individual SNP haplotyping. Eng. Appl. of AI 22(3): 401-406 (2009) |
| j72 | | Jingli Wu, Jianxin Wang, Jianer Chen: A practical algorithm for multiplex PCR primer set selection. IJBRA 5(1): 38-49 (2009) |
| j71 | | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: On the pseudo-achromatic number problem. Theor. Comput. Sci. 410(8-10): 818-829 (2009) |
| j70 | | Jianer Chen, Iyad A. Kanj, Ge Xia: On parameterized exponential time complexity. Theor. Comput. Sci. 410(27-29): 2641-2648 (2009) |
| j69 | | Ergun Akleman, Jianer Chen, Qing Xing, Jonathan L. Gross: Cyclic plain-weaving on polygonal mesh surfaces with graph rotation systems. ACM Trans. Graph. 28(3) (2009) |
| c114 | | Jianxin Wang, Beiwei Chen, Qilong Feng, Jianer Chen: An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set. FAW 2009: 237-250 |
| c113 | | Weiping Wang, Guihua Duan, Jianxin Wang, Jianer Chen: An Anonymous Communication Mechanism without Key Infrastructure Based on Multi-Paths Network Coding. GLOBECOM 2009: 1-6 |
| c112 | | Jianxin Wang, Liang Rong, Xi Zhang, Jianer Chen: ARROW-TCP: Accelerating Transmission toward Efficiency and Fairness for High-Speed Networks. GLOBECOM 2009: 1-6 |
| c111 | | Jie Wang, Jianxin Wang, Yu Sheng, Jianer Chen: Polymorphic Worm Detection Using Signatures Based on Neighborhood Relation. HPCC 2009: 347-353 |
| c110 | | Jie Wang, Jianxin Wang, Jianer Chen, Xi Zhang: An Automated Signature Generation Approach for Polymorphic Worm Based on Color Coding. ICC 2009: 1-6 |
| c109 | | Min Li, Jianxin Wang, Jianer Chen, Yi Pan: Hierarchical Organization of Functional Modules in Weighted Protein Interaction Networks Using Clustering Coefficient. ISBRA 2009: 75-86 |
| c108 | | Junbin Liang, Jianxin Wang, Jianer Chen: A Delay-Constrained and Maximum Lifetime Data Gathering Algorithm for Wireless Sensor Networks. MSN 2009: 148-155 |
| c107 | | |
| c106 | | |
| r3 | | |
| e2 | | Jianer Chen, Fedor V. Fomin (Eds.): Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5917, Springer 2009, isbn 978-3-642-11268-3 |
| e1 | | Jianer Chen, S. Barry Cooper (Eds.): Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings. Lecture Notes in Computer Science 5532, Springer 2009, isbn 978-3-642-02016-2 |
| 2008 | ||
| j68 | | |
| j67 | | Min Li, Jianer Chen, Jianxin Wang, Bin Hu, Gang Chen: Modifying the DPClus algorithm for identifying protein complexes based on new topological structures. BMC Bioinformatics 9 (2008) |
| j66 | | Jianer Chen, Jie Meng: On Parameterized Intractability: Hardness and Completeness. Comput. J. 51(1): 39-59 (2008) |
| j65 | | Jianxin Wang, Jianer Chen, Min Huang: An improved lower bound on approximation algorithms for the Closest Substring problem. Inf. Process. Lett. 107(1): 24-28 (2008) |
| j64 | | Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, Igor Razgon: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5) (2008) |
| j63 | | Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7): 1188-1198 (2008) |
| j62 | | Jianxin Wang, Xiaoshuang Xu, Jianer Chen: Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. J. Comput. Sci. Technol. 23(5): 763-768 (2008) |
| j61 | | Tian Zhang, Dezhi Xu, Jianer Chen: Application-oriented purely semantic precision and recall for ontology mapping evaluation. Knowl.-Based Syst. 21(8): 794-799 (2008) |
| c105 | | Min Li, Jianxin Wang, Jianer Chen: A Fast Agglomerate Algorithm for Mining Functional Modules in Protein Interaction Networks. BMEI (1) 2008: 3-7 |
| c104 | | Minzhu Xie, Jianxin Wang, Jianer Chen: A Practical Exact Algorithm for the Individual Haplotyping Problem MEC. BMEI (1) 2008: 72-76 |
| c103 | | Jingli Wu, Jianxin Wang, Jianer Chen: A Particle Swarm Optimization Algorithm Based on Optimal Result Set for Haplotyping a Single Individual. BMEI (1) 2008: 395-399 |
| c102 | | Minzhu Xie, Jianxin Wang, Jianer Chen: A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI. COCOON 2008: 342-351 |
| c101 | | Minzhu Xie, Jianxin Wang, Wei Zhou, Jianer Chen: A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem. FAW 2008: 16-27 |
| c100 | | Yu Sheng, Weiping Wang, Jianxin Wang, Jianer Chen: A Virtual Laboratory Platform Based on Integration of Java and Matlab. ICWL 2008: 285-295 |
| c99 | | Jingli Wu, Jianxin Wang, Jianer Chen: A Genetic Algorithm for Single Individual SNP Haplotype Assembly. ICYCS 2008: 1012-1017 |
| c98 | | Min Li, Jianxin Wang, Jianer Chen, Bin Hu: Greedily Mining l-dense Subgraphs in Protein Interaction Networks. ICYCS 2008: 1018-1023 |
| c97 | | Yanhui Wu, Weiping Wang, Jianer Chen: A Novel Anonymous Communication Strategy with Respect to Payment Mechanism. ICYCS 2008: 1527-1531 |
| c96 | | Fenghui Zhang, Anxiao Jiang, Jianer Chen: Robust Planarization of Unlocalized Wireless Sensor Networks. INFOCOM 2008: 798-806 |
| c95 | | Min Li, Jianxin Wang, Jianer Chen: A Graph-Theoretic Method for Mining Overlapping Functional Modules in Protein Interaction Networks. ISBRA 2008: 208-219 |
| c94 | | Minzhu Xie, Jianxin Wang, Jianer Chen: A model of higher accuracy for the individual haplotyping problem based on weighted SNP fragments and genotype with errors. ISMB 2008: 105-113 |
| c93 | | Jianer Chen: Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters. IWPEC 2008: 1-8 |
| c92 | | |
| c91 | | Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, Igor Razgon: A fixed-parameter algorithm for the directed feedback vertex set problem. STOC 2008: 177-186 |
| c90 | | Jianxin Wang, Dan Ning, Qilong Feng, Jianer Chen: An Improved Parameterized Algorithm for a Generalized Matching Problem. TAMC 2008: 212-222 |
| c89 | | Minzhu Xie, Jianxin Wang, Jianer Chen: A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF. TAMC 2008: 433-444 |
| c88 | | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: On the Pseudo-achromatic Number Problem. WG 2008: 78-89 |
| r2 | | |
| r1 | | |
| i1 | | Jianer Chen, Henning Fernau, Dan Ning, Daniel Raible, Jianxin Wang: A Parameterized Perspective on P2-Packings. CoRR abs/0804.0570 (2008) |
| 2007 | ||
| j60 | | Songjian Lu, Fenghui Zhang, Jianer Chen, Sing-Hoi Sze: Finding Pathway Structures in Protein Interaction Networks. Algorithmica 48(4): 363-374 (2007) |
| j59 | | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Polynomial time approximation schemes and parameterized complexity. Discrete Applied Mathematics 155(2): 180-193 (2007) |
| j58 | | Minzhu Xie, Jianer Chen, Jianxin Wang: Research on Parameterized Algorithms of the Individual Haplotyping Problem. J. Bioinformatics and Computational Biology 5(3): 795-816 (2007) |
| j57 | | Jingui Huang, Jianer Chen, Songqiao Chen, Jianxin Wang: A simple linear time approximation algorithm for multi-processor job scheduling on four processors. J. Comb. Optim. 13(1): 33-45 (2007) |
| j56 | | Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia: Genus characterizes the complexity of certain graph problems: Some tight results. J. Comput. Syst. Sci. 73(6): 892-907 (2007) |
| j55 | | Jianer Chen, Gaocai Wang, Chuang Lin, Tao Wang, Guojun Wang: Probabilistic analysis on mesh network fault tolerance. J. Parallel Distrib. Comput. 67(1): 100-110 (2007) |
| j54 | | Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. SIAM J. Comput. 37(4): 1077-1106 (2007) |
| c87 | | Jianxin Wang, Min Huang, Jianer Chen: A Lower Bound on Approximation Algorithms for the Closest Substring Problem. COCOA 2007: 291-300 |
| c86 | | Yunlong Liu, Jianer Chen, Jianxin Wang: A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem. COCOON 2007: 349-359 |
| c85 | | Jianer Chen, Songjian Lu: Improved Algorithms for Weighted and Unweighted Set Splitting Problems. COCOON 2007: 537-547 |
| c84 | | Jianer Chen, Yang Liu, Songjian Lu: Directed Feedback Vertex Set Problem is FPT. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 |
| c83 | | Jianxin Wang, Hao Gong, Jianer Chen: C3P: A Cooperant Congestion Control Protocol in High Bandwidth-Delay Product Networks. ICCCN 2007: 687-692 |
| c82 | | Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang: Separability and Topology Control of Quasi Unit Disk Graphs. INFOCOM 2007: 2225-2233 |
| c81 | | Fenghui Zhang, Hao Li, Anxiao Jiang, Jianer Chen, Ping Luo: Face Tracing Based Geographic Routing in Nonplanar Wireless Networks. INFOCOM 2007: 2243-2251 |
| c80 | | Jianer Chen, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang: Improved algorithms for path, matching, and packing problems. SODA 2007: 298-307 |
| c79 | | Yunlong Liu, Jianer Chen, Jianxin Wang: Parameterized Algorithms for Weighted Matching and Packing Problems. TAMC 2007: 692-702 |
| c78 | | Jianxin Wang, Xiaoshuang Xu, Jianer Chen: An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. TAMC 2007: 760-769 |
| c77 | | Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger: Improved Algorithms for the Feedback Vertex Set Problems. WADS 2007: 422-433 |
| c76 | | Jianer Chen, Yang Liu, Songjian Lu: An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. WADS 2007: 495-506 |
| 2006 | ||
| j53 | | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: On the computational hardness based on linear FPT-reductions. J. Comb. Optim. 11(2): 231-247 (2006) |
| j52 | | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8): 1346-1367 (2006) |
| j51 | | Jianer Chen, Fenghui Zhang: On product covering in 3-tier supply chain models: Natural complete problems for W[3] and W[4]. Theor. Comput. Sci. 363(3): 278-288 (2006) |
| c75 | | Jianxin Wang, Xianman Zhu, Jianer Chen: Link Availability at Any Time in MANET. ADHOC-NOW 2006: 184-196 |
| c74 | | |
| c73 | | Ergun Akleman, Jianer Chen: Insight for Practical Subdivision Modeling with Discrete Gauss-Bonnet Theorem. GMP 2006: 287-298 |
| c72 | | |
| c71 | | Yang Liu, Songjian Lu, Jianer Chen, Sing-Hoi Sze: Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms. IWPEC 2006: 84-95 |
| c70 | | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: On the Effective Enumerability of NP Problems. IWPEC 2006: 215-226 |
| c69 | | Jianer Chen, Iyad A. Kanj, Ge Xia: Improved Parameterized Upper Bounds for Vertex Cover. MFCS 2006: 238-249 |
| c68 | | Ergun Akleman, Jianer Chen: Regular Mesh Construction Algorithms using Regular Handles. SMI 2006: 27 |
| 2005 | ||
| j50 | | Jianer Chen, Iyad A. Kanj, Ge Xia: Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. Algorithmica 43(4): 245-273 (2005) |
| j49 | | 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. Inf. Comput. 201(2): 216-231 (2005) |
| j48 | | Jianer Chen, Iyad A. Kanj, Guojun Wang: Hypercube Network Fault Tolerance: A Probabilistic Approach. Journal of Interconnection Networks 6(1): 17-34 (2005) |
| j47 | | Jianer Chen, Iyad A. Kanj: On approximating minimum vertex cover for graphs with perfect matching. Theor. Comput. Sci. 337(1-3): 305-318 (2005) |
| c67 | | Jianer Chen, Fenghui Zhang: On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4]. AAIM 2005: 400-410 |
| c66 | | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. COCOON 2005: 975-984 |
| c65 | | Hongyun Xu, Xinwen Fu, Ye Zhu, Riccardo Bettati, Jianer Chen, Wei Zhao: SAS: A Scalar Anonymous Communication System. ICCNMC 2005: 452-461 |
| c64 | | Wenyu Gao, Jianxin Wang, Jianer Chen, Songqiao Chen: PFED: A Prediction-Based Fair Active Queue Management Algorithm. ICPP 2005: 485-491 |
| c63 | | 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. LCN 2005: 482-483 |
| c62 | | Nan Zhang, Wei Zhao, Jianer Chen: Performance Measurements for Privacy Preserving Data Mining. PAKDD 2005: 43-49 |
| c61 | | |
| c60 | | 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 |
| 2004 | ||
| j46 | | Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj: Using Nondeterminism to Design Efficient Deterministic Algorithms. Algorithmica 40(2): 83-97 (2004) |
| j45 | | Jianer Chen, Yanpei Liu, Suowang Chen, Songqiao Chen: Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS). Discrete Applied Mathematics 136(1): 1 (2004) |
| j44 | | 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) |
| j43 | | Jianer Chen, Iyad A. Kanj: Improved exact algorithms for MAX-SAT. Discrete Applied Mathematics 142(1-3): 17-27 (2004) |
| j42 | | 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) |
| j41 | | Weijia Jia, Chuanlin Zhang, Jianer Chen: An efficient parameterized algorithm for m-set packing. J. Algorithms 50(1): 106-117 (2004) |
| c59 | | 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 |
| c58 | | Nan Zhang, Wei Zhao, Jianer Chen: Cardinality-based inference control in OLAP systems: an information theoretic approach. DOLAP 2004: 59-64 |
| c57 | | Gaocai Wang, Taoshen Li, Jianer Chen: Performance analysis of distributed adaptive routing algorithm. ICARCV 2004: 1394-1399 |
| c56 | | Gaocai Wang, Taoshen Li, Jianer Chen: A Probabilistic Approach to Fault-Tolerant Routing Algorithm on Mesh Networks. ICPADS 2004: 577- |
| c55 | | Xiaolin Xiao, Guojun Wang, Jianer Chen: Fault Tolerant Routing Algorithm in Hypercube Networks with Load Balancing Support. ISPA 2004: 698-704 |
| c54 | | Gaocai Wang, Jianer Chen, Guojun Wang: On Fault Tolerance of 3-Dimensional Mesh Networks. ISPAN 2004: 149-154 |
| c53 | | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Polynomial Time Approximation Schemes and Parameterized Complexity. MFCS 2004: 500-512 |
| c52 | | Renren Liu, Ting Wang, Jianer Chen, Songqiao Chen: Some results on the simply separable function sets in partial k-valued logic. SMC (2) 2004: 1238-1242 |
| c51 | | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Linear FPT reductions and computational lower bounds. STOC 2004: 212-221 |
| c50 | | Sing-Hoi Sze, Songjian Lu, Jianer Chen: Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding. WABI 2004: 438-449 |
| 2003 | ||
| j40 | | 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) |
| j39 | | Eunseuk Oh, Jianer Chen: On strong Menger-connectivity of star graphs. Discrete Applied Mathematics 129(2-3): 499-511 (2003) |
| j38 | | Jianer Chen, Michael R. Fellows: Foreword from the guest editors. J. Comput. Syst. Sci. 67(4): 653 (2003) |
| j37 | | 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) |
| j36 | | Eunseuk Oh, Jianer Chen: Strong Fault-Tolerance: Parallel Routing in Star Networks with Faults. Journal of Interconnection Networks 4(1): 113-126 (2003) |
| c49 | | Gaocai Wang, Jianer Chen, Guojun Wang, Songqiao Chen: Probability Model for Faults in Large-Scale Multicomputer Systems. Asian Test Symposium 2003: 452-457 |
| c48 | | 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 |
| c47 | | Hongfei Sui, Jianxin Wang, Jianer Chen, Songqiao Chen: An analysis of forwarding mechanism in crowds. ICC 2003: 261-265 |
| c46 | | Gaocai Wang, Jianer Chen, Guojun Wang: A Probabilistic Approach to Fault Tolerant Broadcast Routing Algorithms on Mesh Networks. IPDPS 2003: 216 |
| c45 | | Jianer Chen, Iyad A. Kanj, Ge Xia: Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. ISAAC 2003: 148-157 |
| c44 | | Hongfei Sui, Jianer Chen, Songqiao Chen, Jianxin Wang: Payload analysis of anonymous communication system with host-based rerouting mechanism. ISCC 2003: 1259-1264 |
| c43 | | Gaocai Wang, Jianer Chen, Guojun Wang: Probabilistic Analysis of Connectivity on Mesh Networks. ITCC 2003: 362-366 |
| c42 |  | Gaocai Wang, Jianer Chen: A New Fault-Tolerant Multicast Communication in Multicomputers. PDPTA 2003: 1251-1254 |
| c41 | | Robin Liu, Jianer Chen, Songqiao Chen: Some results on the minimal coverings of precomplete classes in partial K-valued logic functions. SMC 2003: 2645-2650 |
| c40 | | Ergun Akleman, Vinod Srinivasan, Jianer Chen: Interactive Rind Modeling. Shape Modeling International 2003: 23-32 |
| 2002 | ||
| j35 | | Navneet Malpani, Jianer Chen: A note on practical construction of maximum bandwidth paths. Inf. Process. Lett. 83(3): 175-180 (2002) |
| j34 | | 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) |
| j33 | | Jianer Chen, Guojun Wang, Songqiao Chen: Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results. IEEE Trans. Computers 51(5): 530-540 (2002) |
| c39 | | Jianer Chen, Iyad A. Kanj, Guojun Wang: Hypercube Network Fault Tolerance: A Probabilistic Approach. ICPP 2002: 65-72 |
| c38 | | Antonio Miranda, Luz Torres, Jianer Chen: On the Approximability of Multiprocessor Task Scheduling Problems. ISAAC 2002: 403-415 |
| c37 | | |
| c36 | | Jianer Chen, Tao Wang: Probabilistic Analysis on Mesh Network Fault Tolerance. IASTED PDCS 2002: 601-606 |
| c35 | | Ching (Clara) Chan, Ergun Akleman, Jianer Chen: Two Methods for Creating Chinese Painting. Pacific Conference on Computer Graphics and Applications 2002: 403-412 |
| c34 | | Vinod Srinivasan, Ergun Akleman, Jianer Chen: Interactive Construction of Multi-Segment Curved Handles . Pacific Conference on Computer Graphics and Applications 2002: 429-430 |
| c33 | | 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 |
| 2001 | ||
| j32 | | Ergun Akleman, Jianer Chen, Vinod Srinivasan, Fusun Eryoldas: A New Corner cutting Scheme with tension and Handle-Face Reconstruction. International Journal of Shape Modeling 7(2): 111-128 (2001) |
| j31 | | Jianer Chen, Iyad A. Kanj, Weijia Jia: Vertex Cover: Further Observations and Further Improvements. J. Algorithms 41(2): 280-301 (2001) |
| j30 | | 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) |
| j29 | | Jianer Chen, Antonio Miranda: A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling. SIAM J. Comput. 31(1): 1-17 (2001) |
| c32 | | Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj: Using Nondeterminism to Design Deterministic Algorithms. FSTTCS 2001: 120-131 |
| c31 | | Jianer Chen, Eunseuk Oh: Strong Fault-Tolerance: Parallel Routing in Networks with Faults. International Conference on Computational Science (2) 2001: 609-618 |
| c30 | | Eunseuk Oh, Jianer Chen: Parallel Routing in Hypercube Networks with Faulty Nodes. ICPADS 2001: 338-345 |
| c29 | | Jianer Chen, Jingui Huang: Semi-normal Schedulings: Improvement on Goemans' Algorithm. ISAAC 2001: 48-60 |
| c28 | | 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 |
| c27 | | Jianer Chen, Iyad A. Kanj: On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. WG 2001: 55-65 |
| c26 | | |
| 2000 | ||
| j28 | | Jianer Chen, Lihua Liu, Weijia Jia: Improvement on vertex cover for low-degree graphs. Networks 35(4): 253-259 (2000) |
| c25 | | Dong Xuan, Chengzhi Li, Riccardo Bettati, Jianer Chen, Wei Zhao: Utilization-Based Admission Control for Real-Time Applications. ICPP 2000: 251- |
| c24 | | Jingui Huang, Jianer Chen, Songqiao Chen: A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors. ISAAC 2000: 60-71 |
| c23 | | Jianer Chen, Iyad A. Kanj: On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. ISAAC 2000: 132-143 |
| c22 | | Jianer Chen, Lihua Liu, Songqiao Chen, Weijia Jia: An Intuitive and Effective New Representation for Interconnection Network Structures. ISAAC 2000: 350-361 |
| c21 | | Ergun Akleman, Jianer Chen, Burak Meric: Web-based intuitive and effective design of symmetric tiles. ACM Multimedia Workshops 2000: 1-4 |
| c20 | | 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 |
| 1999 | ||
| j27 | | 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) |
| j26 | | Chi-Chang Chen, Jianer Chen: The Maximum Partition Matching Problem with Applications. SIAM J. Comput. 28(3): 935-954 (1999) |
| j25 | | Jianer Chen, Saroja P. Kanchi: Graph Ear Decompositions and Graph Embeddings. SIAM J. Discrete Math. 12(2): 229-242 (1999) |
| c19 | | Ergun Akleman, Jianer Chen: Guaranteeing 2-Manifold Property for Meshes. Shape Modeling International 1999: 18-25 |
| c18 | | Ergun Akleman, Jianer Chen: Generalized Distance Functions. Shape Modeling International 1999: 72-79 |
| c17 | | Jianer Chen, Antonio Miranda: A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (Extended Abstract). STOC 1999: 418-427 |
| c16 | | Jianer Chen, Iyad A. Kanj, Weijia Jia: Vertex Cover: Further Observations and Further Improvements. WG 1999: 313-324 |
| 1998 | ||
| j24 | | Liming Cai, Jianer Chen, Johan Håstad: Circuit Bottom Fan-In and Computational Power. SIAM J. Comput. 27(2): 341-355 (1998) |
| 1997 | ||
| j23 | | Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the parameterized complexity of short computation and factorization. Arch. Math. Log. 36(4-5): 321-337 (1997) |
| j22 | | Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: Advice Classes of Parameterized Tractability. Ann. Pure Appl. Logic 84(1): 119-138 (1997) |
| j21 | | Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky: A Note on Approximating Graph Genus. Inf. Process. Lett. 61(6): 317-322 (1997) |
| j20 | | Liming Cai, Jianer Chen: On Fixed-Parameter Tractability and Approximability of NP Optimization Problems. J. Comput. Syst. Sci. 54(3): 465-474 (1997) |
| j19 | | Liming Cai, Jianer Chen: On the Amount of Nondeterminism and the Power of Verifying. SIAM J. Comput. 26(3): 733-750 (1997) |
| j18 | | Chi-Chang Chen, Jianer Chen: Optimal Parallel Routing in Star Networks. IEEE Trans. Computers 46(12): 1293-1303 (1997) |
| j17 | | |
| j16 | | 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) |
| c15 | | Liming Cai, Jianer Chen, Johan Håstad: Circuit Bottom Fan-in and Computational Power. IEEE Conference on Computational Complexity 1997: 158-164 |
| c14 | | Jianer Chen, Donald K. Friesen, Hao Zheng: Tight Bound on Johnson's Algoritihm for Max-SAT. IEEE Conference on Computational Complexity 1997: 274-281 |
| c13 | | Chi-Chang Chen, Jianer Chen: Nearly Optimal One-To-Many Parallel Routing in Star Networks. IPPS 1997: 728-733 |
| 1996 | ||
| j15 | | Jianer Chen, Dan Archdeacon, Jonathan L. Gross: Maximum genus and connectivity. Discrete Mathematics 149(1-3): 19-29 (1996) |
| j14 | | Jianer Chen, Saroja P. Kanchi, Jonathan L. Gross: A tight lower bound on the maximum genus of a simplicial graph. Discrete Mathematics 156(1-3): 83-102 (1996) |
| j13 | | Jonathan L. Gross, Jianer Chen: Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings. Mathematical Systems Theory 29(5): 451-470 (1996) |
| c12 | | |
| 1995 | ||
| j12 | | 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) |
| j11 | | Jianer Chen, Jonathan L. Gross, Robert G. Rieper: Lower bounds for the average genus. Journal of Graph Theory 19(3): 281-296 (1995) |
| j10 | | Liming Cai, Jianer Chen: On Input Read-Modes of Alternating Turing Machines. Theor. Comput. Sci. 148(1): 33-55 (1995) |
| c11 | | |
| c10 | | Liming Cai, Jianer Chen: On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract). COCOON 1995: 282-291 |
| 1994 | ||
| j9 | | Jianer Chen, Jonathan L. Gross, Robert G. Rieper: Overlap matrices and total imbedding distributions. Discrete Mathematics 128(1-3): 73-94 (1994) |
| j8 | | Jianer Chen: A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. SIAM J. Discrete Math. 7(4): 614-631 (1994) |
| c9 | | Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the Structure of Parameterized Problems in NP (Extended Abstract). STACS 1994: 509-520 |
| 1993 | ||
| j7 | | Jianer Chen, Jonathan L. Gross: Kuratowski-Type Theorems for Average Genus. J. Comb. Theory, Ser. B 57(1): 100-121 (1993) |
| c8 | | Liming Cai, Jianer Chen: On Fixed-Parameter Tractability and Approximability of NP-Hard Optimization Problems. ISTCS 1993: 118-126 |
| c7 | | Liming Cai, Jianer Chen: On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract). MFCS 1993: 311-320 |
| c6 | | Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky: On the Complexity of Graph Embeddings (Extended Abstract). WADS 1993: 234-245 |
| c5 | | Jianer Chen, Saroja P. Kanchi: Graph Ear Decompositions and Graph Embeddings (Extended Abstract). WG 1993: 376-387 |
| 1992 | ||
| j6 | | Jianer Chen, Jonathan L. Gross: Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs. J. Comb. Theory, Ser. B 55(1): 83-103 (1992) |
| j5 | | Jianer Chen, Jonathan L. Gross: Limit points for average genus II. 2-Connected non-simplicial graphs. J. Comb. Theory, Ser. B 56(1): 108-129 (1992) |
| c4 | | Jianer Chen: A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. WG 1992: 103-113 |
| c3 | | Jianer Chen, Arkady Kanevsky: On Assembly of Four-Connected Graphs (Extended Abstract). WG 1992: 158-169 |
| 1991 | ||
| j4 | | |
| j3 | | Jianer Chen: Characterizing Parallel Hierarchies by Reducibilities. Inf. Process. Lett. 39(6): 303-307 (1991) |
| j2 | | |
| c2 | | 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 |
| 1990 | ||
| j1 | | Jianer Chen: The Difference Between one Tape and two Tapes: with Respect to Reversal Complexity. Theor. Comput. Sci. 73(3): 265-278 (1990) |
| 1987 | ||
| c1 | | |
Colors in the list of coauthors
Last update Fri May 24 06:47:30 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page