default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJianer Chen
Person information
- affiliation: Texas A&M University, College Station, Texas, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j185]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. Algorithmica 86(8): 2448-2478 (2024)- [j184]Zilin Liang
, Zheng Zheng, Weihai Chen, Zhongcai Pei, Jianhua Wang, Jianer Chen:
Manifold embedded instance selection to suppress negative transfer in motor imagery-based brain-computer interface. Biomed. Signal Process. Control. 88(Part B): 105556 (2024) - [j183]Zilin Liang, Zheng Zheng, Weihai Chen, Zhongcai Pei, Jianhua Wang, Jianer Chen:
A novel deep transfer learning framework integrating general and domain-specific features for EEG-based brain-computer interface. Biomed. Signal Process. Control. 95: 106311 (2024) - [j182]Xinzhi Ma, Weihai Chen, Zhongcai Pei, Yue Zhang, Jianer Chen:
Attention-based convolutional neural network with multi-modal temporal information fusion for motor imagery EEG decoding. Comput. Biol. Medicine 175: 108504 (2024) - [j181]Cheng Shen, Zhongcai Pei, Weihai Chen, Yi Zhou, Jianhua Wang, Xingming Wu, Jianer Chen:
A wearable knee rehabilitation system based on graphene textile composite sensor: Implementation and validation. Eng. Appl. Artif. Intell. 136: 108954 (2024) - [j180]Mingfeng Su, Guojun Wang, Jianer Chen:
Efficient task offloading with swarm intelligence evolution for edge-cloud collaboration in vehicular edge computing. Softw. Pract. Exp. 54(10): 1888-1915 (2024) - [j179]Jianer Chen, Zirui Chu, Ying Guo, Wei Yang:
Space limited linear-time graph algorithms on big data. Theor. Comput. Sci. 993: 114468 (2024) - [i16]Saied Zarrinmehr, Ergun Akleman, Jianer Chen:
A Modified de Casteljau Subdivision that Supports Smooth Stitching with Hierarchically Organized Bicubic Bezier Patches. CoRR abs/2402.04319 (2024) - [i15]Ergun Akleman, Somyung Oh, Youyou Wang, Bekir Tevfik Akgün, Jianer Chen:
Projective Holder-Minkowski Colors: A Generalized Set of Commutative & Associative Operations with Inverse Elements for Representing and Manipulating Colors. CoRR abs/2402.10934 (2024) - 2023
- [j178]Tao Peng, Kejian Guan, Jierong Liu, Jianer Chen, Guojun Wang, Jiawei Zhu:
A blockchain-based mobile crowdsensing scheme with enhanced privacy. Concurr. Comput. Pract. Exp. 35(19) (2023) - [j177]Wen Duan, Weihai Chen, Jianhua Wang, Zhongcai Pei, Jianer Chen, Hongfei Shi:
Novel neuromuscular controller application method to improve the balance recovery ability of lower limb exoskeletons. J. Frankl. Inst. 360(12): 8200-8223 (2023) - [j176]Cheng Shen, Zhongcai Pei, Weihai Chen, Zhongyi Li, Jianhua Wang, Jianbin Zhang, Jianer Chen:
STMI: Stiffness Estimation Method Based on sEMG-Driven Model for Elbow Joint. IEEE Trans. Instrum. Meas. 72: 1-14 (2023) - [c179]Cheng Shen, Zhongcai Pei, Weihai Chen, Wen Duan, Jianhua Wang, Jianer Chen:
Simultaneous Gait Event Intention Detection Using Single sEMG Sensor for Lower Limb Exoskeleton. IECON 2023: 1-6 - [i14]Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia:
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. CoRR abs/2310.10815 (2023) - 2022
- [j175]Wenjun Li, Chao Xu, Yongjie Yang, Jianer Chen, Jianxin Wang:
A Refined Branching Algorithm for the Maximum Satisfiability Problem. Algorithmica 84(4): 982-1006 (2022) - [j174]Wenbin Chen, Jianer Chen:
Approximating Closest Vector Problem in ℓ∞-Norm Revisited. Comput. J. 65(12): 3100-3105 (2022) - [j173]Jianer Chen, Ying Guo, Qin Huang:
Linear-time parameterized algorithms with limited local resources. Inf. Comput. 289(Part): 104951 (2022) - [j172]Muhammad Arif, Shermin Shamsudheen, F. Ajesh, Guojun Wang, Jianer Chen:
AI bot to detect fake COVID-19 vaccine certificate. IET Inf. Secur. 16(5): 362-372 (2022) - [j171]Muhammad Arif, Jianer Chen, Guojun Wang, Hafiz Tayyab Rauf:
Cognitive population initialization for swarm intelligence and evolutionary computing. J. Ambient Intell. Humaniz. Comput. 13(12): 5847-5860 (2022) - [j170]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Near-optimal algorithms for point-line fitting problems. J. Comput. Geom. 13(1): 226-243 (2022) - [j169]Angsheng Li, Jianer Chen, Qilong Feng, Jinhui Xu:
Preface. Math. Struct. Comput. Sci. 32(2): 125-126 (2022) - [j168]Jianer Chen, Minjie Huang, Yin Guo:
Scheduling multiple two-stage flowshops with a deadline. Theor. Comput. Sci. 921: 100-111 (2022) - [c178]Jianer Chen, Zirui Chu, Ying Guo, Wei Yang:
Space Limited Graph Algorithms on Big Data. COCOON 2022: 255-267 - [c177]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Near-Optimal Algorithms for Point-Line Covering Problems. STACS 2022: 21:1-21:18 - 2021
- [j167]Yue Zhang, Weihai Chen, Chun-Liang Lin, Zhongcai Pei, Jianer Chen, Zuobing Chen:
Boosting-LDA algriothm with multi-domain feature fusion for motor imagery EEG decoding. Biomed. Signal Process. Control. 70: 102983 (2021) - [j166]Weimin Gao, Jiawei Huang, Shaojun Zou, Weihe Li, Jianxin Wang, Jianer Chen:
AAC: Adaptively Adjusting Concurrency by Exploiting Path Diversity in Datacenter Networks. J. Netw. Syst. Manag. 29(3): 26 (2021) - [j165]Hafiz ur Rahman, Guojun Wang, Md. Zakirul Alam Bhuiyan, Jianer Chen:
In-network generalized trustworthy data collection for event detection in cyber-physical systems. PeerJ Comput. Sci. 7: e504 (2021) - [c176]Jianer Chen, Minjie Huang, Yin Guo:
Scheduling on Multiple Two-Stage Flowshops with a Deadline. AAIM 2021: 83-95 - [c175]Zilin Liang, Zheng Zheng, Weihai Chen, Jianhua Wang, Jianbin Zhang, Jianer Chen, Zuobing Chen:
Manifold Trial Selection to Reduce Negative Transfer in Motor Imagery-based Brain-Computer Interface. IROS 2021: 4144-4149 - [c174]Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia:
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. ISAAC 2021: 48:1-48:17 - [i13]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Optimal Streaming Algorithms for Graph Matching. CoRR abs/2102.06939 (2021) - 2020
- [j164]Muhammad Arif, Guojun Wang, Tao Peng, Valentina Emilia Balas, Oana Geman, Jianer Chen:
Optimization of communication in VANETs using fuzzy logic and artificial Bee colony. J. Intell. Fuzzy Syst. 38(5): 6145-6157 (2020) - [j163]Haroon Elahi, Guojun Wang, Jianer Chen:
Pleasure or pain? An evaluation of the costs and utilities of bloatware applications in android smartphones. J. Netw. Comput. Appl. 157: 102578 (2020) - [j162]Ergun Akleman, Jianer Chen, Jonathan L. Gross, Shiyu Hu:
A Topologically Complete Theory of Weaving. SIAM J. Discret. Math. 34(4): 2457-2480 (2020) - [j161]Tao Peng, Jierong Liu, Guojun Wang, Qin Liu, Jianer Chen, Jiawei Zhu, Chenxi Huang:
A User-Defined Location-Sharing Scheme with Efficiency and Privacy in Mobile Social Networks. Sci. Program. 2020: 7832875:1-7832875:13 (2020) - [j160]Guangwei Wu, Jianer Chen, Jianxin Wang:
Improved approximation algorithms for two-stage flowshops scheduling problem. Theor. Comput. Sci. 806: 509-515 (2020) - [j159]Guangwei Wu, Jianer Chen, Jianxin Wang:
On scheduling multiple two-stage flowshops. Theor. Comput. Sci. 818: 74-82 (2020) - [j158]Tao Zhang, Jiawei Huang, Kai Chen, Jianxin Wang, Jianer Chen, Yi Pan, Geyong Min:
Rethinking Fast and Friendly Transport in Data Center Networks. IEEE/ACM Trans. Netw. 28(5): 2364-2377 (2020) - [j157]Muhammad Arif, Guojun Wang, Valentina Emilia Balas, Oana Geman, Aniello Castiglione, Jianer Chen:
SDN based communications privacy-preserving architecture for VANETs using fog computing. Veh. Commun. 26: 100265 (2020) - [c173]Hafiz ur Rahman, Guihua Duan, Guojun Wang, Md. Zakirul Alam Bhuiyan, Jianer Chen:
Trustworthy Data Acquisition and Faulty Sensor Detection using Gray Code in Cyber-Physical System. CSE 2020: 58-65 - [c172]Muhammad Arif, Jianer Chen, Pin Liu, Guojun Wang:
Location Based Communication Privacy in Internet of Vehicles Using Fog Computing. SpaCCS Workshops 2020: 77-90 - [c171]Tao Peng, Jierong Liu, Jianer Chen, Guojun Wang:
A Privacy-Preserving Crowdsensing System with Muti-Blockchain. TrustCom 2020: 1944-1949 - [e8]Jianer Chen, Qilong Feng, Jinhui Xu:
Theory and Applications of Models of Computation, 16th International Conference, TAMC 2020, Changsha, China, October 18-20, 2020, Proceedings. Lecture Notes in Computer Science 12337, Springer 2020, ISBN 978-3-030-59266-0 [contents] - [i12]Jianer Chen, Ying Guo, Qin Huang:
Linear-Time Parameterized Algorithms with Limited Local Resources. CoRR abs/2003.02866 (2020) - [i11]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Near-Optimal Algorithms for Point-Line Covering Problems. CoRR abs/2012.02363 (2020)
2010 – 2019
- 2019
- [j156]Yuzhen Niu, Jianer Chen, Xiao Ke, Junhao Chen:
Stereoscopic Image Saliency Detection Optimization: A Multi-Cue-Driven Approach. IEEE Access 7: 19835-19847 (2019) - [j155]Yixin Cao, Jianer Chen:
Preface to the Special Issue on Computing and Combinatorics. Algorithmica 81(11-12): 4165-4166 (2019) - [j154]Jianer Chen, Hans L. Bodlaender, Virginia Vassilevska Williams:
EATCS-IPEC Nerode Prize 2019 - Call for Nominations. Bull. EATCS 127 (2019) - [j153]Yixin Cao, Jianer Chen:
Preface to the special issue on computing and combinatorics. J. Comb. Optim. 37(2): 423 (2019) - [j152]Chao Xu, Jianer Chen, Jianxin Wang:
Resolution and linear CNF formulas: Improved (n, 3)-MaxSAT algorithms. Theor. Comput. Sci. 774: 113-123 (2019) - [j151]Guangwei Wu, Jianer Chen, Jianxin Wang:
Scheduling two-stage jobs on multiple flowshops. Theor. Comput. Sci. 776: 117-124 (2019) - [j150]Guangwei Wu, Jianer Chen, Jianxin Wang:
On scheduling inclined jobs on multiple two-stage flowshops. Theor. Comput. Sci. 786: 67-77 (2019) - [j149]Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang, Zhibiao Yang:
Kernels for packing and covering problems. Theor. Comput. Sci. 790: 152-166 (2019) - [j148]Muhammad Arif, Guojun Wang, Md. Zakirul Alam Bhuiyan, Tian Wang, Jianer Chen:
A survey on security attacks in VANETs: Communication, applications and challenges. Veh. Commun. 19 (2019) - [c170]Wenbin Chen, Jianer Chen:
Approximating Closest Vector Problem in ℓ∞ Norm Revisited. AAIM 2019: 42-50 - [c169]Hafiz ur Rahman, Guojun Wang, Md. Zakirul Alam Bhuiyan, Jianer Chen:
Towards In-Network Generalized Trustworthy Data Collection for Trustworthy Cyber-Physical Systems. DependSys 2019: 54-66 - [c168]Muhammad Arif, Guojun Wang, Oana Geman, Jianer Chen:
Medical Image Segmentation by Combining Adaptive Artificial Bee Colony and Wavelet Packet Decomposition. DependSys 2019: 158-169 - [c167]Haroon Elahi, Guojun Wang, Tao Peng, Jianer Chen:
AI and Its Risks in Android Smartphones: A Case of Google Smart Assistant. DependSys 2019: 341-355 - [c166]Chao Xu, Wenjun Li, Yongjie Yang, Jianer Chen, Jianxin Wang:
Resolution and Domination: An Improved Exact MaxSAT Algorithm. IJCAI 2019: 1191-1197 - [c165]Hafiz ur Rahman, Guojun Wang, Md. Zakirul Alam Bhuiyan, Jianer Chen:
Trustworthy Data Collection for Cyber Systems: A Taxonomy and Future Directions. iSCI 2019: 152-164 - 2018
- [j147]Hui Liu, Jiazhi Xia, Jianer Chen, Jianxin Wang:
Detection of hierarchical intrinsic symmetry structure in 3D models. Comput. Graph. 70: 8-16 (2018) - [j146]Ergun Akleman, Vinod Srinivasan, Jianer Chen:
Response to "On G1 stitched bi-cubic Bézier patches with arbitrary topology". Comput. Graph. 71: 157-158 (2018) - [j145]Mugang Lin, Qilong Feng, Jianxin Wang, Jianer Chen, Bin Fu, Wenjun Li:
An improved FPT algorithm for Almost Forest Deletion problem. Inf. Process. Lett. 136: 30-36 (2018) - [j144]Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:
A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees. J. Comput. Syst. Sci. 97: 28-44 (2018) - [j143]Yuzhen Niu, Jianer Chen, Wenzhong Guo:
Meta-metric for saliency detection evaluation metrics based on application preference. Multim. Tools Appl. 77(20): 26351-26369 (2018) - [c164]Guangwei Wu, Jianer Chen:
Approximation Algorithms on Multiple Two-Stage Flowshops. COCOON 2018: 713-725 - [c163]Tao Zhang, Jiawei Huang, Jianxin Wang, Jianer Chen, Yi Pan, Geyong Min:
Designing Fast and Friendly TCP to Fit High Speed Data Center Networks. ICDCS 2018: 43-53 - [c162]Hafiz ur Rahman, Muhammad Arif, Sadam Al-Azani, Emad Y. Ramadan, Guojun Wang, Jianer Chen, Teodora Olariu, Iustin Olariu:
A Survey of Modern Gene Expression Based Techniques for Cancer Detection and Diagnosis. SOFA (2) 2018: 35-50 - [c161]Syed Qasim Afser Rizvi, Guojun Wang, Jianer Chen:
A Service Oriented Healthcare Architecture (SOHA-CC) Based on Cloud Computing. SpaCCS 2018: 84-97 - [c160]Hafiz ur Rahman, Guojun Wang, Jianer Chen, Hai Jiang:
Performance Evaluation of Hypervisors and the Effect of Virtual CPU on Performance. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2018: 772-779 - [e7]Jianer Chen, Pinyan Lu:
Frontiers in Algorithmics - 12th International Workshop, FAW 2018, Guangzhou, China, May 8-10, 2018, Proceedings. Lecture Notes in Computer Science 10823, Springer 2018, ISBN 978-3-319-78454-0 [contents] - [i10]Guangwei Wu, Jianer Chen, Jianxin Wang:
On Scheduling Two-Stage Jobs on Multiple Two-Stage Flowshops. CoRR abs/1801.09089 (2018) - 2017
- [j142]Ergun Akleman, Vinod Srinivasan, Jianer Chen:
Interactive modeling of smooth manifold meshes with arbitrary topology: G1 stitched bi-cubic Bézier patches. Comput. Graph. 66: 64-73 (2017) - [j141]Yaoxue Zhang, Kehua Guo, Ju Ren, Yuezhi Zhou, Jianxin Wang, Jianer Chen:
Transparent Computing: A Promising Network Computing Paradigm. Comput. Sci. Eng. 19(1): 7-20 (2017) - [j140]Wenjun Li, Yixin Cao, Jianer Chen, Jianxin Wang:
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree. Inf. Comput. 252: 187-200 (2017) - [j139]Mugang Lin, Qilong Feng, Jianer Chen, Wenjun Li:
Partition on trees with supply and demand: Kernelization and algorithms. Theor. Comput. Sci. 657: 11-19 (2017) - [j138]Wenjun Li, Qilong Feng, Jianer Chen, Shuai Hu:
Improved kernel results for some FPT problems based on simple observations. Theor. Comput. Sci. 657: 20-27 (2017) - [j137]Jianer Chen, Chao Xu, Jianxin Wang:
Dealing with 4-variables by resolution: An improved MaxSAT algorithm. Theor. Comput. Sci. 670: 33-44 (2017) - [j136]Md. Zakirul Alam Bhuiyan, Jie Wu, Guojun Wang, Zhigang Chen, Jianer Chen, Tian Wang:
Quality-Guaranteed Event-Sensitive Data Collection and Monitoring in Vibration Sensor Networks. IEEE Trans. Ind. Informatics 13(2): 572-583 (2017) - [j135]Tao Zhang, Jianxin Wang, Jiawei Huang, Jianer Chen, Yi Pan, Geyong Min:
Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Intra-Datacenter. IEEE/ACM Trans. Netw. 25(6): 3808-3822 (2017) - [c159]Guangwei Wu, Jianer Chen, Jianxin Wang:
On Approximation Algorithms for Two-Stage Scheduling Problems. FAW 2017: 241-253 - [c158]Tao Peng, Qin Liu, Guojun Wang, Jianer Chen:
A Lightweight Privacy Aware Friend Locator in Mobile Social Networks. ISPA/IUCC 2017: 17-23 - [e6]Yixin Cao, Jianer Chen:
Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings. Lecture Notes in Computer Science 10392, Springer 2017, ISBN 978-3-319-62388-7 [contents] - [i9]Yixin Cao, Jianer Chen, Jia-Hao Fan:
An O*(1.84sk) Parameterized Algorithm for the Multiterminal Cut Problem. CoRR abs/1711.06397 (2017) - 2016
- [j134]Jianer Chen, Feng Shi, Jianxin Wang:
Approximating Maximum Agreement Forest on Multiple Binary Trees. Algorithmica 76(4): 867-889 (2016) - [j133]Ergun Akleman, Shenyao Ke, You Wu, Negar Kalantar, Alireza Borhani, Jianer Chen:
Construction with physical version of quad-edge data structures. Comput. Graph. 58: 172-183 (2016) - [j132]Feng Shi, Jianxin Wang, Yufei Yang, Qilong Feng, Weilong Li, Jianer Chen:
A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees. Sci. China Inf. Sci. 59(1): 1-14 (2016) - [j131]Jianer Chen, John E. Hopcroft:
Special Issue for FAW 2014. J. Comb. Optim. 32(1): 1-2 (2016) - [j130]Tao Zhang, Jianxin Wang, Jiawei Huang, Yi Huang, Jianer Chen, Yi Pan:
Adaptive marking threshold method for delay-sensitive TCP in data center network. J. Netw. Comput. Appl. 61: 222-234 (2016) - [j129]Ju Ren, Yaoxue Zhang, Kuan Zhang, Anfeng Liu, Jianer Chen, Xuemin Sherman Shen:
Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks. IEEE Trans. Ind. Informatics 12(2): 788-800 (2016) - [c157]Jiawei Huang, Jianxin Wang, Tao Zhang, Jianer Chen, Yi Pan:
Tuning the Aggressive TCP Behavior for Highly Concurrent HTTP Connections in Data Center. ICDCS 2016: 98-107 - [r7]Jianer Chen:
Vertex Cover Kernelization. Encyclopedia of Algorithms 2016: 2327-2330 - [r6]Jianer Chen:
Vertex Cover Search Trees. Encyclopedia of Algorithms 2016: 2330-2333 - [i8]Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:
Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees. CoRR abs/1608.02709 (2016) - 2015
- [j128]Yixin Cao, Jianer Chen, Yang Liu:
On Feedback Vertex Set: New Measure and New Structures. Algorithmica 73(1): 63-86 (2015) - [j127]Ergun Akleman, Jianer Chen, Jonathan L. Gross:
Block meshes: Topologically robust shape modeling with graphs embedded on 3-manifolds. Comput. Graph. 46: 306-326 (2015) - [j126]Ergun Akleman, Jianer Chen, Jonathan L. Gross:
Extended graph rotation systems as a model for cyclic weaving on orientable surfaces. Discret. Appl. Math. 193: 61-79 (2015) - [j125]Qilong Feng, Jianxin Wang, Shaohua Li, Jianer Chen:
Randomized parameterized algorithms for P2-Packing and Co-Path Packing problems. J. Comb. Optim. 29(1): 125-140 (2015) - [j124]Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen:
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs. J. Comb. Optim. 29(1): 257-275 (2015) - [j123]Tao Zhang, Jianxin Wang, Jiawei Huang, Yi Huang, Jianer Chen, Yi Pan:
Adaptive-Acceleration Data Center TCP. IEEE Trans. Computers 64(6): 1522-1533 (2015) - [j122]Jianer Chen, Jia-Hao Fan, Sing-Hoi Sze:
Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees. Theor. Comput. Sci. 562: 496-512 (2015) - [j121]Yunlong Liu, Jianxin Wang, Jie You, Jianer Chen, Yixin Cao:
Edge deletion problems: Branching facilitated by modular decomposition. Theor. Comput. Sci. 573: 63-70 (2015) - [j120]Jianxin Wang, Weimin Su, Min Yang, Jiong Guo, Qilong Feng, Feng Shi, Jianer Chen:
Parameterized complexity of control and bribery for d-approval elections. Theor. Comput. Sci. 595: 82-91 (2015) - [j119]Jianer Chen, John E. Hopcroft:
Frontiers of Algorithmics. Theor. Comput. Sci. 607: 125 (2015) - [c156]Chao Xu, Jianer Chen, Jianxin Wang:
Improved MaxSAT Algorithms for Instances of Degree 3. COCOA 2015: 20-30 - [c155]Jianer Chen, Chao Xu, Jianxin Wang:
Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm. WADS 2015: 178-188 - [c154]Wenjun Li, Jianxin Wang, Jianer Chen, Yixin Cao:
A 2k-vertex Kernel for Maximum Internal Spanning Tree. WADS 2015: 495-505 - [i7]Jianer Chen, Chao Xu:
Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm. CoRR abs/1503.02920 (2015) - 2014
- [j118]Jianxin Wang, Wenjun Li, Shaohua Li, Jianer Chen:
On the parameterized vertex cover problem for graphs with perfect matching. Sci. China Inf. Sci. 57(7): 1-12 (2014) - [j117]Yixin Cao, Jianer Chen, Jia-Hao Fan:
An O(1.84k) parameterized algorithm for the multiterminal cut problem. Inf. Process. Lett. 114(4): 167-173 (2014) - [j116]Jianer Chen, Qilong Feng:
On Unknown Small Subsets and Implicit Measures: New Techniques for Parameterized Algorithms. J. Comput. Sci. Technol. 29(5): 870-878 (2014) - [j115]Jianxin Wang, Peiqiang Tan, Jinyi Yao, Qilong Feng, Jianer Chen:
On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms. IEEE Trans. Computers 63(12): 3092-3100 (2014) - [j114]Weizhong Luo, Jianxin Wang, Jiong Guo, Jianer Chen:
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks. Theor. Comput. Sci. 518: 32-41 (2014) - [j113]Qilong Feng, Jianxin Wang, Jianer Chen:
Matching and Weighted P2-Packing: Algorithms and Kernels. Theor. Comput. Sci. 522: 85-94 (2014) - [j112]Feng Shi, Jianxin Wang, Jianer Chen, Qilong Feng, Jiong Guo:
Algorithms for parameterized maximum agreement forest problem on multiple trees. Theor. Comput. Sci. 554: 207-216 (2014) - [j111]Qilong Feng, Jianxin Wang, Chao Xu, Jinyi Yao, Jianer Chen:
Improved parameterized algorithms for minimum link-length rectilinear spanning path problem. Theor. Comput. Sci. 560: 158-171 (2014) - [c153]Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:
Approximation Algorithms for Maximum Agreement Forest on Multiple Trees. COCOON 2014: 381-392 - [c152]Wenjun Li, Jianer Chen, Jianxin Wang:
Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees. ESA 2014: 642-653 - [c151]Guojun Wang, Qin Liu, Yang Xiang, Jianer Chen:
Security from the transparent computing aspect. ICNC 2014: 216-220 - [e5]Jianer Chen, John E. Hopcroft, Jianxin Wang:
Frontiers in Algorithmics - 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014. Proceedings. Lecture Notes in Computer Science 8497, Springer 2014, ISBN 978-3-319-08015-4 [contents] - [i6]Feng Shi, Jianer Chen, Qilong Feng, Xiaojun Ding, Jianxin Wang:
Algorithms for Maximum Agreement Forest of Multiple General Trees. CoRR abs/1411.0062 (2014) - [i5]Wenjun Li, Jianxin Wang, Jianer Chen, Yixin Cao:
A $2k$-Vertex Kernel for Maximum Internal Spanning Tree. CoRR abs/1412.8296 (2014) - 2013
- [j110]Ergun Akleman, Qing Xing, Pradeep Garigipati, Gabriel Taubin, Jianer Chen, Shiyu Hu:
Hamiltonian cycle art: Surface covering wire sculptures and duotone surfaces. Comput. Graph. 37(5): 316-332 (2013) - [j109]Jingli Wu, Jianxin Wang, Jianer Chen:
A heuristic algorithm for haplotype reconstruction from aligned weighted SNP fragments. Int. J. Bioinform. Res. Appl. 9(1): 13-24 (2013) - [j108]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) - [j107]Srikanth Sastry, Tsvetomira Radeva, Jianer Chen, Jennifer L. Welch:
Reliable networks with unreliable sensors. Pervasive Mob. Comput. 9(2): 311-323 (2013) - [j106]Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
Parameterized top-K algorithms. Theor. Comput. Sci. 470: 105-119 (2013) - [j105]Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen:
Improved linear problem kernel for planar connected dominating set. Theor. Comput. Sci. 511: 2-12 (2013) - [c150]Jianxin Wang, Min Yang, Jiong Guo, Qilong Feng, Jianer Chen:
Parameterized Complexity of Control and Bribery for d-Approval Elections. COCOA 2013: 260-271 - [c149]Qilong Feng, Jianxin Wang, Shaohua Li, Jianer Chen:
Random Methods for Parameterized Problems. COCOON 2013: 89-100 - [c148]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 - [c147]Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:
Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees. COCOON 2013: 567-578 - [c146]Yixin Cao, Jianer Chen, Jia-Hao Fan:
An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem. FCT 2013: 84-94 - [c145]Ju Ren, Yaoxue Zhang, Jianer Chen:
Analysis on the Scheduling Problem in Transparent Computing. HPCC/EUC 2013: 1832-1837 - [c144]Yixin Cao, Jianer Chen:
On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem. TAMC 2013: 319-330 - [c143]Jianer Chen, Jia-Hao Fan, Sing-Hoi Sze:
Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees. WG 2013: 152-164 - [e4]Manish Parashar, Albert Y. Zomaya, Jianer Chen, Jiannong Cao, Pascal Bouvry, Sushil K. Prasad:
Sixth International Conference on Contemporary Computing, IC3 2013, Noida, India, August 8-10, 2013. IEEE 2013, ISBN 978-1-4799-0192-0 [contents] - 2012
- [j104]Yixin Cao, Jianer Chen:
Cluster Editing: Kernelization Based on Edge Cuts. Algorithmica 64(1): 152-169 (2012) - [j103]Jianer Chen, Ion I. Mandoiu, Raj Sunderraman, Jianxin Wang, Alexander Zelikovsky:
Guest Editors' Introduction. BMC Bioinform. 13(S-10): S1 (2012) - [j102]Shiyu Hu, Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L. Gross:
Pattern mapping with quad-pattern-coverable quad-meshes. Comput. Graph. 36(5): 455-465 (2012) - [j101]Jia-Hao Fan, Jianer Chen, Sing-Hoi Sze:
Identifying Complexes from Protein Interaction Networks According to Different Types of Neighborhood Density. J. Comput. Biol. 19(12): 1284-1294 (2012) - [j100]Jianer Chen, Jie Meng:
A 2k kernel for the cluster editing problem. J. Comput. Syst. Sci. 78(1): 211-220 (2012) - [j99]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) - [j98]Jianer Chen, Yang Liu, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang:
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching. ACM Trans. Algorithms 8(1): 6:1-6:22 (2012) - [j97]Jianer Chen, Alexander Zelikovsky:
Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications. IEEE ACM Trans. Comput. Biol. Bioinform. 9(4): 1002-1003 (2012) - [j96]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. CAe@Expressive 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
- [j95]Fenghui Zhang, Anxiao Jiang, Jianer Chen:
On the Planarization of Wireless Sensor Networks. Algorithmica 60(3): 593-608 (2011) - [j94]Ergun Akleman, Jianer Chen, Yen-Lin Chen, Qing Xing, Jonathan L. Gross:
Cyclic twill-woven objects. Comput. Graph. 35(3): 623-631 (2011) - [j93]Jianxin Wang, Qilong Feng, Jianer Chen:
Color-Coding and its Applications: A Survey. Int. J. Softw. Informatics 5(4): 595-606 (2011) - [j92]Shaohua Li, Jianxin Wang, Jianer Chen, Zhijian Wang:
An Algorithm for Minimum Vertex Cover Based on Max-I Share Degree. J. Comput. 6(8): 1781-1788 (2011) - [j91]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. Biol. Bioinform. 8(3): 607-620 (2011) - [j90]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) - [j89]Jianer Chen, S. Barry Cooper:
Algorithms, complexity and computational models. Theor. Comput. Sci. 412(23): 2457-2458 (2011) - [j88]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) - [j87]Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang:
Separability and topology control of quasi unit disk graphs. Wirel. 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:
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 [contents] - 2010
- [j86]Jianxin Wang, Minzhu Xie, Jianer Chen:
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI. Algorithmica 56(3): 283-296 (2010) - [j85]Min Li, Jianxin Wang, Jianer Chen, Zhao Cai, Gang Chen:
Identifying the overlapping complexes in protein interaction networks. Int. J. Data Min. Bioinform. 4(1): 91-108 (2010) - [j84]Jianxin Wang, Dan Ning, Qilong Feng, Jianer Chen:
An improved kernelization for P2-packing. Inf. Process. Lett. 110(5): 188-192 (2010) - [j83]Gaocai Wang, Jianer Chen, Chuang Lin:
A New Fault-Tolerant Broadcast Routing Algorithm on Mesh Networks. J. Interconnect. Networks 11(3-4): 175-187 (2010) - [j82]Minzhu Xie, Jianxin Wang, Jianer Chen:
A practical parameterised algorithm for the individual haplotyping problem MLF. Math. Struct. Comput. Sci. 20(5): 851-863 (2010) - [j81]Jianer Chen, Iyad A. Kanj, Ge Xia:
Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40-42): 3736-3756 (2010) - [j80]Jianxin Wang, Wenjun Li, Jianer Chen:
A parameterized algorithm for the hyperplane-cover problem. Theor. Comput. Sci. 411(44-46): 4005-4009 (2010) - [c125]Jianer Chen, Jie Meng:
A 2k Kernel for the Cluster Editing Problem. COCOON 2010: 459-468 - [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]Yixin Cao, Jianer Chen:
Cluster Editing: Kernelization Based on Edge Cuts. IPEC 2010: 60-71 - [c119]Ergun Akleman, Jianer Chen, Yen-Lin Chen, Qing Xing:
Cyclic twill-woven objects. SIGGRAPH Posters 2010: 106:1 - [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]Yixin Cao, Jianer Chen, Yang Liu:
On Feedback Vertex Set New Measure and New Structures. SWAT 2010: 93-104 - [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)
2000 – 2009
- 2009
- [j79]Jianer Chen, Songjian Lu:
Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach. Algorithmica 54(4): 472-489 (2009) - [j78]Yunlong Liu, Jianer Chen, Jianxin Wang:
On Counting 3-D Matchings of Size k. Algorithmica 54(4): 530-543 (2009) - [j77]Jianer Chen, Yang Liu, Songjian Lu:
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. Algorithmica 55(1): 1-13 (2009) - [j76]Jingli Wu, Jianxin Wang, Jianer Chen:
A practical algorithm based on particle swarm optimization for haplotype reconstruction. Appl. Math. Comput. 208(2): 363-372 (2009) - [j75]Jingli Wu, Jianxin Wang, Jianer Chen:
A parthenogenetic algorithm for single individual SNP haplotyping. Eng. Appl. Artif. Intell. 22(3): 401-406 (2009) - [j74]Jingli Wu, Jianxin Wang, Jianer Chen:
A practical algorithm for multiplex PCR primer set selection. Int. J. Bioinform. Res. Appl. 5(1): 38-49 (2009) - [j73]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) - [j72]Jianer Chen, Iyad A. Kanj, Ge Xia:
On parameterized exponential time complexity. Theor. Comput. Sci. 410(27-29): 2641-2648 (2009) - [j71]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): 78 (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]Jianer Chen, Iyad A. Kanj, Ge Xia:
On Parameterized Exponential Time Complexity. TAMC 2009: 168-177 - [c106]Jianer Chen, Yang Liu:
An Improved SAT Algorithm in Terms of Formula Length. WADS 2009: 144-155 - [e2]Jianer Chen, Fedor V. Fomin:
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 [contents] - [e1]Jianer Chen, S. Barry Cooper:
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 [contents] - [r5]Jianer Chen:
Maximum Partition Matching. Encyclopedia of Optimization 2009: 2029-2035 - 2008
- [j70]Jianer Chen, Iyad A. Kanj:
Foreword from the Guest Editors. Algorithmica 52(2): 113 (2008) - [j69]Min Li, Jianer Chen, Jianxin Wang, Bin Hu, Gang Chen:
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures. BMC Bioinform. 9 (2008) - [j68]Jianer Chen, Jie Meng:
On Parameterized Intractability: Hardness and Completeness. Comput. J. 51(1): 39-59 (2008) - [j67]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) - [j66]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): 21:1-21:19 (2008) - [j65]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) - [j64]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) - [j63]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]Fenghui Zhang, Anxiao Jiang, Jianer Chen:
Sorting Based Data Centric Storage. NCA 2008: 283-286 - [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 - [r4]Jianer Chen:
Vertex Cover Kernelization. Encyclopedia of Algorithms 2008 - [r3]Jianer Chen:
Vertex Cover Search Trees. Encyclopedia of Algorithms 2008 - [i2]Jianer Chen, Henning Fernau, Dan Ning, Daniel Raible, Jianxin Wang:
A Parameterized Perspective on P2-Packings. CoRR abs/0804.0570 (2008) - 2007
- [j62]Songjian Lu, Fenghui Zhang, Jianer Chen, Sing-Hoi Sze:
Finding Pathway Structures in Protein Interaction Networks. Algorithmica 48(4): 363-374 (2007) - [j61]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
Polynomial time approximation schemes and parameterized complexity. Discret. Appl. Math. 155(2): 180-193 (2007) - [j60]Minzhu Xie, Jianer Chen, Jianxin Wang:
Research on Parameterized Algorithms of the Individual Haplotyping Problem. J. Bioinform. Comput. Biol. 5(3): 795-816 (2007) - [j59]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) - [j58]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) - [j57]Jianer Chen, GaoCai Wang, Chuang Lin, Tao Wang, Guojun Wang:
Probabilistic analysis on mesh network fault tolerance. J. Parallel Distributed Comput. 67(1): 100-110 (2007) - [j56]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]Jianxin Wang, Hao Gong, Jianer Chen:
C3P: A Cooperant Congestion Control Protocol in High Bandwidth-Delay Product Networks. ICCCN 2007: 687-692 - [c83]Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang:
Separability and Topology Control of Quasi Unit Disk Graphs. INFOCOM 2007: 2225-2233 - [c82]Fenghui Zhang, Hao Li, Anxiao Jiang, Jianer Chen, Ping Luo:
Face Tracing Based Geographic Routing in Nonplanar Wireless Networks. INFOCOM 2007: 2243-2251 - [c81]Jianer Chen, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang:
Improved algorithms for path, matching, and packing problems. SODA 2007: 298-307 - [c80]Yunlong Liu, Jianer Chen, Jianxin Wang:
Parameterized Algorithms for Weighted Matching and Packing Problems. TAMC 2007: 692-702 - [c79]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 - [c78]Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger:
Improved Algorithms for the Feedback Vertex Set Problems. WADS 2007: 422-433 - [c77]Jianer Chen, Yang Liu, Songjian Lu:
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem. WADS 2007: 495-506 - [i1]Jianer Chen, Yang Liu, Songjian Lu:
Directed Feedback Vertex Set Problem is FPT. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 - 2006
- [j55]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) - [j54]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) - [j53]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) - [c76]Jianxin Wang, Xianman Zhu, Jianer Chen:
Link Availability at Any Time in MANET. ADHOC-NOW 2006: 184-196 - [c75]Hong Li, Rui Zhao, Jianer Chen, Yao Xiang:
Research on Multi-valued and Multi-labeled Decision Trees. ADMA 2006: 247-254 - [c74]Ergun Akleman, Jianer Chen:
Insight for Practical Subdivision Modeling with Discrete Gauss-Bonnet Theorem. GMP 2006: 287-298 - [c73]Jianxin Wang, Donglei Chen, Jianer Chen:
A Prediction-Based AQM Algorithm for DiffServ Networks. ICON 2006: 1-6 - [c72]Xiuzhen Huang, Jianer Chen:
On PTAS for Planar Graph Problems. IFIP TCS 2006: 299-313 - [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
- [j52]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) - [j51]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) - [j50]Jianer Chen, Iyad A. Kanj, Guojun Wang:
Hypercube Network Fault Tolerance: A Probabilistic Approach. J. Interconnect. Networks 6(1): 17-34 (2005) - [j49]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]Ergun Akleman, Jianer Chen:
Regular meshes. Symposium on Solid and Physical Modeling 2005: 213-219 - [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
- [j48]Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj:
Using Nondeterminism to Design Efficient Deterministic Algorithms. Algorithmica 40(2): 83-97 (2004) - [j47]Jianer Chen, Yanpei Liu, Suowang Chen, Songqiao Chen:
Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS). Discret. Appl. Math. 136(1): 1 (2004) - [j46]Hanyuan Deng, Jianer Chen, Qiaoliang Li, Rongheng Li, Qiju Gao:
On the construction of most reliable networks. Discret. Appl. Math. 140(1-3): 19-33 (2004) - [j45]Jianer Chen, Iyad A. Kanj:
Improved exact algorithms for MAX-SAT. Discret. Appl. Math. 142(1-3): 17-27 (2004) - [j44]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) - [j43]Weijia Jia, Chuanlin Zhang, Jianer Chen:
An efficient parameterized algorithm for m-set packing. J. Algorithms 50(1): 106-117 (2004) - [j42]Gao-Cai Wang, Jianer Chen, Guo-Jun Wang:
On Fault Tolerance of 3-Dimensional Mesh Networks. J. Comput. Sci. Technol. 19(2): 183-190 (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. CCC 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
- [j41]Ergun Akleman, Jianer Chen, Vinod Srinivasan:
A minimal and complete set of operators for the development of robust manifold mesh modelers. Graph. Model. 65(5): 286-304 (2003) - [j40]Eunseuk Oh, Jianer Chen:
On strong Menger-connectivity of star graphs. Discret. Appl. Math. 129(2-3): 499-511 (2003) - [j39]Jianer Chen, Michael R. Fellows:
Foreword from the guest editors. J. Comput. Syst. Sci. 67(4): 653 (2003) - [j38]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) - [j37]Eunseuk Oh, Jianer Chen:
Strong Fault-Tolerance: Parallel Routing in Star Networks with Faults. J. Interconnect. 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 - [p1]Tomaz Pisanski, Primoz Potocnik, Jianer Chen, Jonathan L. Gross, Thomas W. Tucker, Andrew Vince, Dan Archdeacon, Seiya Negami, Arthur T. White:
Topological Graph Theory. Handbook of Graph Theory 2003: 610-786 - 2002
- [j36]Navneet Malpani, Jianer Chen:
A note on practical construction of maximum bandwidth paths. Inf. Process. Lett. 83(3): 175-180 (2002) - [j35]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) - [j34]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]Jianer Chen, Iyad A. Kanj:
Improved Exact Algorithms for MAX-SAT. LATIN 2002: 341-355 - [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. PG 2002: 403-412 - [c34]Vinod Srinivasan, Ergun Akleman, Jianer Chen:
Interactive Construction of Multi-Segment Curved Handles . PG 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
- [j33]Ergun Akleman, Jianer Chen, Vinod Srinivasan, Fusun Eryoldas:
A New Corner cutting Scheme with tension and Handle-Face Reconstruction. Int. J. Shape Model. 7(2): 111-128 (2001) - [j32]Jianer Chen, Iyad A. Kanj, Weijia Jia:
Vertex Cover: Further Observations and Further Improvements. J. Algorithms 41(2): 280-301 (2001) - [j31]Jianer Chen, Guojun Wang, Songqiao Chen:
Routing in Hypercube Networks with a Constant Fraction of Faulty Nodes. J. Interconnect. Networks 2(3): 283-294 (2001) - [j30]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]Eunseuk Oh, Jianer Chen:
On Strong Menger-Connectivity of Star Graphs. WG 2001: 272-283 - 2000
- [j29]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-262 - [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. PG 2000: 192-201
1990 – 1999
- 1999
- [j28]Ergun Akleman, Jianer Chen:
Guaranteeing the 2-Manifold Property for Meshes with doubly Linked Face List. Int. J. Shape Model. 5(2): 159-178 (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. Discret. 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 - [r2]Charles H. Goldberg, Jianer Chen, Viera Krnanová Proulx, Joan Feigenbaum, Sampath Kannan:
Information Structures. Handbook of Discrete and Combinatorial Mathematics 1999 - [r1]Ileana Streinu, Károly Bezdek, János Pach, Tamal K. Dey, Jianer Chen, Dina Kravets, Nancy M. Amato, W. Randolph Franklin:
Discrete And Computational Geometry. Handbook of Discrete and Combinatorial Mathematics 1999 - 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. Log. 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]Jianer Chen:
Algorithmic Graph Embeddings. Theor. Comput. Sci. 181(2): 247-266 (1997) - [j16]Chi-Chang Chen, Jianer Chen:
Nearly Optimal One-to-Many Parallel Routing in Star Networks. IEEE Trans. Parallel Distributed Syst. 8(12): 1196-1202 (1997) - [c15]Liming Cai, Jianer Chen, Johan Håstad:
Circuit Bottom Fan-in and Computational Power. CCC 1997: 158-164 - [c14]Jianer Chen, Donald K. Friesen, Hao Zheng:
Tight Bound on Johnson's Algoritihm for Max-SAT. CCC 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. Discret. Math. 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. Discret. Math. 156(1-3): 83-102 (1996) - [j13]Jonathan L. Gross, Jianer Chen:
Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings. Math. Syst. Theory 29(5): 451-470 (1996) - [c12]Chi-Chang Chen, Jianer Chen:
Optimal Parallel Routing in Star Graphs. WG 1996: 73-84 - 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. J. 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]Jianer Chen:
Algorithmic Graph Embeddings (Extended Abstract). COCOON 1995: 151-160 - [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. Discret. Math. 128(1-3): 73-94 (1994) - [j8]Jianer Chen:
A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. SIAM J. Discret. 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 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 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 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]Jianer Chen, Jim Cox, Bud Mishra:
An NL Hierarchy. Inf. Process. Lett. 39(1): 21-26 (1991) - [j3]Jianer Chen:
Characterizing Parallel Hierarchies by Reducibilities. Inf. Process. Lett. 39(6): 303-307 (1991) - [j2]Jianer Chen, Chee-Keng Yap:
Reversal Complexity. SIAM J. Comput. 20(4): 622-638 (1991) - [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)
1980 – 1989
- 1987
- [b1]Jianer Chen:
Tape Reversal and Parallel Time. New York University, USA, 1987 - [c1]Jianer Chen, Chee-Keng Yap:
Reversal complexity. SCT 1987: 14-19
Coauthor Index
Iyad Kanj
aka: Iyad A. Kanj
aka: Iyad A. Kanj
[j175] [j166] [j160] [j159] [j158] [j152] [j151] [j150] [j149] [c166] [j147] [j145] [j144] [c163] [i10] [j141] [j140] [j137] [j135] [c159] [j134] [j132] [j130] [c157] [i8] [j125] [j124] [j123] [j121] [j120] [c156] [c155] [c154] [j118] [j115] [j114] [j113] [j112] [j111] [c153] [c152] [e5] [i6] [i5] [j109] [j108] [j105] [c150] [c149] [c148] [c147] [j103] [j96] [c142] [c139] [c138] [j93] [j92] [j91] [j90] [j88] [c137] [c136] [c135] [c134] [c132] [c128] [e3] [j86] [j85] [j84] [j82] [j80] [c123] [c122] [c121] [j78] [j76] [j75] [j74] [c114] [c113] [c112] [c111] [c110] [c109] [c108] [j69] [j67] [j64] [c105] [c104] [c103] [c102] [c101] [c100] [c99] [c98] [c95] [c94] [c90] [c89] [i2] [j60] [j59] [c87] [c86] [c84] [c80] [c79] [c76] [c73] [c64] [c63] [j44] [c47] [c44] [j35]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
