| 2008 |
|---|
| 146 | EE | Min Li,
Jianxin Wang,
Jianer Chen:
A Fast Agglomerate Algorithm for Mining Functional Modules in Protein Interaction Networks.
BMEI (1) 2008: 3-7 |
| 145 | EE | 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 |
| 144 | EE | Minzhu Xie,
Jianxin Wang,
Jianer Chen:
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC.
BMEI (1) 2008: 72-76 |
| 143 | EE | Min Li,
Jianxin Wang,
Jianer Chen:
A Graph-Theoretic Method for Mining Overlapping Functional Modules in Protein Interaction Networks.
ISBRA 2008: 208-219 |
| 142 | EE | Jianer Chen:
Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters.
IWPEC 2008: 1-8 |
| 141 | EE | 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 |
| 140 | EE | Jianxin Wang,
Dan Ning,
Qilong Feng,
Jianer Chen:
An Improved Parameterized Algorithm for a Generalized Matching Problem.
TAMC 2008: 212-222 |
| 139 | EE | Minzhu Xie,
Jianxin Wang,
Jianer Chen:
A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF.
TAMC 2008: 433-444 |
| 138 | EE | Jianer Chen,
Henning Fernau,
Dan Ning,
Daniel Raible,
Jianxin Wang:
A Parameterized Perspective on P2-Packings
CoRR abs/0804.0570: (2008) |
| 137 | EE | Jianer Chen,
Jie Meng:
On Parameterized Intractability: Hardness and Completeness.
Comput. J. 51(1): 39-59 (2008) |
| 2007 |
|---|
| 136 | EE | Jianxin Wang,
Min Huang,
Jianer Chen:
A Lower Bound on Approximation Algorithms for the Closest Substring Problem.
COCOA 2007: 291-300 |
| 135 | EE | Yunlong Liu,
Jianer Chen,
Jianxin Wang:
A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem.
COCOON 2007: 349-359 |
| 134 | EE | Jianer Chen,
Songjian Lu:
Improved Algorithms for Weighted and Unweighted Set Splitting Problems.
COCOON 2007: 537-547 |
| 133 | EE | Jianxin Wang,
Hao Gong,
Jianer Chen:
C3P: A Cooperant Congestion Control Protocol in High Bandwidth-Delay Product Networks.
ICCCN 2007: 687-692 |
| 132 | EE | Jianer Chen,
Anxiao Jiang,
Iyad A. Kanj,
Ge Xia,
Fenghui Zhang:
Separability and Topology Control of Quasi Unit Disk Graphs.
INFOCOM 2007: 2225-2233 |
| 131 | EE | Fenghui Zhang,
Hao Li,
Anxiao Jiang,
Jianer Chen,
Ping Luo:
Face Tracing Based Geographic Routing in Nonplanar Wireless Networks.
INFOCOM 2007: 2243-2251 |
| 130 | EE | Jianer Chen,
Songjian Lu,
Sing-Hoi Sze,
Fenghui Zhang:
Improved algorithms for path, matching, and packing problems.
SODA 2007: 298-307 |
| 129 | EE | Jianer Chen,
Yang Liu,
Songjian Lu:
Directed Feedback Vertex Set Problem is FPT.
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 |
| 128 | EE | Yunlong Liu,
Jianer Chen,
Jianxin Wang:
Parameterized Algorithms for Weighted Matching and Packing Problems.
TAMC 2007: 692-702 |
| 127 | EE | 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 |
| 126 | EE | Jianer Chen,
Fedor V. Fomin,
Yang Liu,
Songjian Lu,
Yngve Villanger:
Improved Algorithms for the Feedback Vertex Set Problems.
WADS 2007: 422-433 |
| 125 | EE | Jianer Chen,
Yang Liu,
Songjian Lu:
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem.
WADS 2007: 495-506 |
| 124 | EE | Songjian Lu,
Fenghui Zhang,
Jianer Chen,
Sing-Hoi Sze:
Finding Pathway Structures in Protein Interaction Networks.
Algorithmica 48(4): 363-374 (2007) |
| 123 | EE | Jianer Chen,
Xiuzhen Huang,
Iyad A. Kanj,
Ge Xia:
Polynomial time approximation schemes and parameterized complexity.
Discrete Applied Mathematics 155(2): 180-193 (2007) |
| 122 | EE | 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) |
| 121 | EE | 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) |
| 120 | EE | 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) |
| 2006 |
|---|
| 119 | EE | Jianxin Wang,
Xianman Zhu,
Jianer Chen:
Link Availability at Any Time in MANET.
ADHOC-NOW 2006: 184-196 |
| 118 | EE | Hong Li,
Rui Zhao,
Jianer Chen,
Yao Xiang:
Research on Multi-valued and Multi-labeled Decision Trees.
ADMA 2006: 247-254 |
| 117 | EE | Ergun Akleman,
Jianer Chen:
Insight for Practical Subdivision Modeling with Discrete Gauss-Bonnet Theorem.
GMP 2006: 287-298 |
| 116 | EE | Jianer Chen,
Iyad A. Kanj,
Jie Meng,
Ge Xia,
Fenghui Zhang:
On the Effective Enumerability of NP Problems.
IWPEC 2006: 215-226 |
| 115 | EE | Yang Liu,
Songjian Lu,
Jianer Chen,
Sing-Hoi Sze:
Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms.
IWPEC 2006: 84-95 |
| 114 | EE | Jianer Chen,
Iyad A. Kanj,
Ge Xia:
Improved Parameterized Upper Bounds for Vertex Cover.
MFCS 2006: 238-249 |
| 113 | EE | Ergun Akleman,
Jianer Chen:
Regular Mesh Construction Algorithms using Regular Handles.
SMI 2006: 27 |
| 112 | EE | 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) |
| 111 | EE | 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) |
| 110 | EE | 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) |
| 2005 |
|---|
| 109 | EE | Jianer Chen,
Fenghui Zhang:
On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4].
AAIM 2005: 400-410 |
| 108 | EE | Jianer Chen,
Xiuzhen Huang,
Iyad A. Kanj,
Ge Xia:
W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications.
COCOON 2005: 975-984 |
| 107 | EE | Hongyun Xu,
Xinwen Fu,
Ye Zhu,
Riccardo Bettati,
Jianer Chen,
Wei Zhao:
SAS: A Scalar Anonymous Communication System.
ICCNMC 2005: 452-461 |
| 106 | EE | Wenyu Gao,
Jianxin Wang,
Jianer Chen,
Songqiao Chen:
PFED: A Prediction-Based Fair Active Queue Management Algorithm.
ICPP 2005: 485-491 |
| 105 | EE | 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 |
| 104 | EE | Nan Zhang,
Wei Zhao,
Jianer Chen:
Performance Measurements for Privacy Preserving Data Mining.
PAKDD 2005: 43-49 |
| 103 | EE | 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 |
| 102 | EE | Ergun Akleman,
Jianer Chen:
Regular meshes.
Symposium on Solid and Physical Modeling 2005: 213-219 |
| 101 | EE | 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) |
| 100 | EE | 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) |
| 99 | EE | Jianer Chen,
Iyad A. Kanj,
Guojun Wang:
Hypercube Network Fault Tolerance: A Probabilistic Approach.
Journal of Interconnection Networks 6(1): 17-34 (2005) |
| 98 | EE | Jianer Chen,
Iyad A. Kanj:
On approximating minimum vertex cover for graphs with perfect matching.
Theor. Comput. Sci. 337(1-3): 305-318 (2005) |
| 2004 |
|---|
| 97 | EE | Nan Zhang,
Wei Zhao,
Jianer Chen:
Cardinality-based inference control in OLAP systems: an information theoretic approach.
DOLAP 2004: 59-64 |
| 96 | EE | Gaocai Wang,
Taoshen Li,
Jianer Chen:
A Probabilistic Approach to Fault-Tolerant Routing Algorithm on Mesh Networks.
ICPADS 2004: 577- |
| 95 | EE | 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 |
| 94 | EE | Xiaolin Xiao,
Guojun Wang,
Jianer Chen:
Fault Tolerant Routing Algorithm in Hypercube Networks with Load Balancing Support.
ISPA 2004: 698-704 |
| 93 | EE | Gaocai Wang,
Jianer Chen,
Guojun Wang:
On Fault Tolerance of 3-Dimensional Mesh Networks.
ISPAN 2004: 149-154 |
| 92 | EE | Jianer Chen,
Xiuzhen Huang,
Iyad A. Kanj,
Ge Xia:
Polynomial Time Approximation Schemes and Parameterized Complexity.
MFCS 2004: 500-512 |
| 91 | EE | Jianer Chen,
Xiuzhen Huang,
Iyad A. Kanj,
Ge Xia:
Linear FPT reductions and computational lower bounds.
STOC 2004: 212-221 |
| 90 | EE | Sing-Hoi Sze,
Songjian Lu,
Jianer Chen:
Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding.
WABI 2004: 438-449 |
| 89 | EE | Jianer Chen,
Donald K. Friesen,
Weijia Jia,
Iyad A. Kanj:
Using Nondeterminism to Design Efficient Deterministic Algorithms.
Algorithmica 40(2): 83-97 (2004) |
| 88 | EE | Jianer Chen,
Yanpei Liu,
Suowang Chen,
Songqiao Chen:
Preface: Discrete Mathematics and Theoretical Computer Science (DMTCS).
Discrete Applied Mathematics 136(1): 1 (2004) |
| 87 | EE | 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) |
| 86 | EE | Jianer Chen,
Iyad A. Kanj:
Improved exact algorithms for MAX-SAT.
Discrete Applied Mathematics 142(1-3): 17-27 (2004) |
| 85 | EE | 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) |
| 84 | EE | Weijia Jia,
Chuanlin Zhang,
Jianer Chen:
An efficient parameterized algorithm for m-set packing.
J. Algorithms 50(1): 106-117 (2004) |
| 2003 |
|---|
| 83 | EE | Gaocai Wang,
Jianer Chen,
Guojun Wang,
Songqiao Chen:
Probability Model for Faults in Large-Scale Multicomputer Systems.
Asian Test Symposium 2003: 452-457 |
| 82 | EE | 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 |
| 81 | EE | Gaocai Wang,
Jianer Chen,
Guojun Wang:
A Probabilistic Approach to Fault Tolerant Broadcast Routing Algorithms on Mesh Networks.
IPDPS 2003: 216 |
| 80 | EE | Jianer Chen,
Iyad A. Kanj,
Ge Xia:
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.
ISAAC 2003: 148-157 |
| 79 | EE | Hongfei Sui,
Jianer Chen,
Songqiao Chen,
Jianxin Wang:
Payload analysis of anonymous communication system with host-based rerouting mechanism.
ISCC 2003: 1259-1264 |
| 78 | EE | Gaocai Wang,
Jianer Chen,
Guojun Wang:
Probabilistic Analysis of Connectivity on Mesh Networks.
ITCC 2003: 362-366 |
| 77 | | Gaocai Wang,
Jianer Chen:
A New Fault-Tolerant Multicast Communication in Multicomputers.
PDPTA 2003: 1251-1254 |
| 76 | EE | Ergun Akleman,
Vinod Srinivasan,
Jianer Chen:
Interactive Rind Modeling.
Shape Modeling International 2003: 23-32 |
| 75 | EE | Eunseuk Oh,
Jianer Chen:
On strong Menger-connectivity of star graphs.
Discrete Applied Mathematics 129(2-3): 499-511 (2003) |
| 74 | EE | 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) |
| 73 | EE | Jianer Chen,
Michael R. Fellows:
Foreword from the guest editors.
J. Comput. Syst. Sci. 67(4): 653 (2003) |
| 72 | EE | 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) |
| 71 | EE | Eunseuk Oh,
Jianer Chen:
Strong Fault-Tolerance: Parallel Routing in Star Networks with Faults.
Journal of Interconnection Networks 4(1): 113-126 (2003) |
| 2002 |
|---|
| 70 | | Jianer Chen,
Tao Wang:
Probabilistic Analysis on Mesh Network Fault Tolerance.
IASTED PDCS 2002: 601-606 |
| 69 | EE | Jianer Chen,
Iyad A. Kanj,
Guojun Wang:
Hypercube Network Fault Tolerance: A Probabilistic Approach.
ICPP 2002: 65-72 |
| 68 | EE | Antonio Miranda,
Luz Torres,
Jianer Chen:
On the Approximability of Multiprocessor Task Scheduling Problems.
ISAAC 2002: 403-415 |
| 67 | EE | Jianer Chen,
Iyad A. Kanj:
Improved Exact Algorithms for MAX-SAT.
LATIN 2002: 341-355 |
| 66 | EE | Ching (Clara) Chan,
Ergun Akleman,
Jianer Chen:
Two Methods for Creating Chinese Painting.
Pacific Conference on Computer Graphics and Applications 2002: 403-412 |
| 65 | EE | Vinod Srinivasan,
Ergun Akleman,
Jianer Chen:
Interactive Construction of Multi-Segment Curved Handles .
Pacific Conference on Computer Graphics and Applications 2002: 429-430 |
| 64 | EE | 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 |
| 63 | EE | Jianer Chen,
Guojun Wang,
Songqiao Chen:
Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results.
IEEE Trans. Computers 51(5): 530-540 (2002) |
| 62 | EE | Navneet Malpani,
Jianer Chen:
A note on practical construction of maximum bandwidth paths.
Inf. Process. Lett. 83(3): 175-180 (2002) |
| 61 | EE | 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) |
| 2001 |
|---|
| 60 | EE | Jianer Chen,
Donald K. Friesen,
Weijia Jia,
Iyad A. Kanj:
Using Nondeterminism to Design Deterministic Algorithms.
FSTTCS 2001: 120-131 |
| 59 | | Eunseuk Oh,
Jianer Chen:
Parallel Routing in Hypercube Networks with Faulty Nodes.
ICPADS 2001: 338-345 |
| 58 | EE | Jianer Chen,
Jingui Huang:
Semi-normal Schedulings: Improvement on Goemans' Algorithm.
ISAAC 2001: 48-60 |
| 57 | EE | Jianer Chen,
Eunseuk Oh:
Strong Fault-Tolerance: Parallel Routing in Networks with Faults.
International Conference on Computational Science (2) 2001: 609-618 |
| 56 | EE | 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 |
| 55 | EE | Eunseuk Oh,
Jianer Chen:
On Strong Menger-Connectivity of Star Graphs.
WG 2001: 272-283 |
| 54 | EE | Jianer Chen,
Iyad A. Kanj:
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms.
WG 2001: 55-65 |
| 53 | EE | Jianer Chen,
Iyad A. Kanj,
Weijia Jia:
Vertex Cover: Further Observations and Further Improvements.
J. Algorithms 41(2): 280-301 (2001) |
| 52 | | 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) |
| 51 | EE | Jianer Chen,
Antonio Miranda:
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling.
SIAM J. Comput. 31(1): 1-17 (2001) |
| 2000 |
|---|
| 50 | EE | Ergun Akleman,
Jianer Chen,
Burak Meric:
Web-based intuitive and effective design of symmetric tiles.
ACM Multimedia Workshops 2000: 1-4 |
| 49 | EE | Dong Xuan,
Chengzhi Li,
Riccardo Bettati,
Jianer Chen,
Wei Zhao:
Utilization-Based Admission Control for Real-Time Applications.
ICPP 2000: 251- |
| 48 | EE | Jianer Chen,
Iyad A. Kanj:
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching.
ISAAC 2000: 132-143 |
| 47 | EE | Jianer Chen,
Lihua Liu,
Songqiao Chen,
Weijia Jia:
An Intuitive and Effective New Representation for Interconnection Network Structures.
ISAAC 2000: 350-361 |
| 46 | EE | Jingui Huang,
Jianer Chen,
Songqiao Chen:
A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors.
ISAAC 2000: 60-71 |
| 45 | EE | 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 |
| 44 | EE | Jianer Chen,
Lihua Liu,
Weijia Jia:
Improvement on vertex cover for low-degree graphs.
Networks 35(4): 253-259 (2000) |
| 1999 |
|---|
| 43 | EE | Jianer Chen,
Antonio Miranda:
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (Extended Abstract).
STOC 1999: 418-427 |
| 42 | EE | Ergun Akleman,
Jianer Chen:
Guaranteeing 2-Manifold Property for Meshes.
Shape Modeling International 1999: 18-25 |
| 41 | EE | Ergun Akleman,
Jianer Chen:
Generalized Distance Functions.
Shape Modeling International 1999: 72-79 |
| 40 | EE | Jianer Chen,
Iyad A. Kanj,
Weijia Jia:
Vertex Cover: Further Observations and Further Improvements.
WG 1999: 313-324 |
| 39 | | 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) |
| 38 | | Chi-Chang Chen,
Jianer Chen:
The Maximum Partition Matching Problem with Applications.
SIAM J. Comput. 28(3): 935-954 (1999) |
| 37 | EE | Jianer Chen,
Saroja P. Kanchi:
Graph Ear Decompositions and Graph Embeddings.
SIAM J. Discrete Math. 12(2): 229-242 (1999) |
| 1998 |
|---|
| 36 | | Liming Cai,
Jianer Chen,
Johan Håstad:
Circuit Bottom Fan-In and Computational Power.
SIAM J. Comput. 27(2): 341-355 (1998) |
| 1997 |
|---|
| 35 | EE | Liming Cai,
Jianer Chen,
Johan Håstad:
Circuit Bottom Fan-in and Computational Power.
IEEE Conference on Computational Complexity 1997: 158-164 |
| 34 | EE | Jianer Chen,
Donald K. Friesen,
Hao Zheng:
Tight Bound on Johnson's Algoritihm for Max-SAT.
IEEE Conference on Computational Complexity 1997: 274-281 |
| 33 | EE | Chi-Chang Chen,
Jianer Chen:
Nearly Optimal One-To-Many Parallel Routing in Star Networks.
IPPS 1997: 728-733 |
| 32 | | Liming Cai,
Jianer Chen,
Rodney G. Downey,
Michael R. Fellows:
Advice Classes of Parameterized Tractability.
Ann. Pure Appl. Logic 84(1): 119-138 (1997) |
| 31 | | Chi-Chang Chen,
Jianer Chen:
Optimal Parallel Routing in Star Networks.
IEEE Trans. Computers 46(12): 1293-1303 (1997) |
| 30 | EE | 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) |
| 29 | EE | Jianer Chen,
Saroja P. Kanchi,
Arkady Kanevsky:
A Note on Approximating Graph Genus.
Inf. Process. Lett. 61(6): 317-322 (1997) |
| 28 | | Liming Cai,
Jianer Chen:
On Fixed-Parameter Tractability and Approximability of NP Optimization Problems.
J. Comput. Syst. Sci. 54(3): 465-474 (1997) |
| 27 | | Liming Cai,
Jianer Chen:
On the Amount of Nondeterminism and the Power of Verifying.
SIAM J. Comput. 26(3): 733-750 (1997) |
| 26 | EE | Jianer Chen:
Algorithmic Graph Embeddings.
Theor. Comput. Sci. 181(2): 247-266 (1997) |
| 1996 |
|---|
| 25 | | Chi-Chang Chen,
Jianer Chen:
Optimal Parallel Routing in Star Graphs.
WG 1996: 73-84 |
| 24 | EE | Jianer Chen,
Dan Archdeacon,
Jonathan L. Gross:
Maximum genus and connectivity.
Discrete Mathematics 149(1-3): 19-29 (1996) |
| 23 | EE | 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) |
| 22 | | Jonathan L. Gross,
Jianer Chen:
Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings.
Mathematical Systems Theory 29(5): 451-470 (1996) |
| 1995 |
|---|
| 21 | | Jianer Chen:
Algorithmic Graph Embeddings (Extended Abstract).
COCOON 1995: 151-160 |
| 20 | | Liming Cai,
Jianer Chen:
On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract).
COCOON 1995: 282-291 |
| 19 | | 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) |
| 18 | EE | Liming Cai,
Jianer Chen:
On Input Read-Modes of Alternating Turing Machines.
Theor. Comput. Sci. 148(1): 33-55 (1995) |
| 1994 |
|---|
| 17 | | Liming Cai,
Jianer Chen,
Rodney G. Downey,
Michael R. Fellows:
On the Structure of Parameterized Problems in NP (Extended Abstract).
STACS 1994: 509-520 |
| 16 | EE | Jianer Chen,
Jonathan L. Gross,
Robert G. Rieper:
Overlap matrices and total imbedding distributions.
Discrete Mathematics 128(1-3): 73-94 (1994) |
| 15 | EE | Jianer Chen:
A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus.
SIAM J. Discrete Math. 7(4): 614-631 (1994) |
| 1993 |
|---|
| 14 | | Liming Cai,
Jianer Chen:
On Fixed-Parameter Tractability and Approximability of NP-Hard Optimization Problems.
ISTCS 1993: 118-126 |
| 13 | | Liming Cai,
Jianer Chen:
On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract).
MFCS 1993: 311-320 |
| 12 | | Jianer Chen,
Saroja P. Kanchi,
Arkady Kanevsky:
On the Complexity of Graph Embeddings (Extended Abstract).
WADS 1993: 234-245 |
| 11 | | Jianer Chen,
Saroja P. Kanchi:
Graph Ear Decompositions and Graph Embeddings (Extended Abstract).
WG 1993: 376-387 |
| 10 | EE | Jianer Chen,
Jonathan L. Gross:
Kuratowski-Type Theorems for Average Genus.
J. Comb. Theory, Ser. B 57(1): 100-121 (1993) |
| 1992 |
|---|
| 9 | | Jianer Chen:
A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus.
WG 1992: 103-113 |
| 8 | | Jianer Chen,
Arkady Kanevsky:
On Assembly of Four-Connected Graphs (Extended Abstract).
WG 1992: 158-169 |
| 7 | EE | 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) |
| 6 | EE | 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) |
| 1991 |
|---|
| 5 | | 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 |
| 4 | | Jianer Chen,
Jim Cox,
Bud Mishra:
An NL Hierarchy.
Inf. Process. Lett. 39(1): 21-26 (1991) |
| 3 | | Jianer Chen:
Characterizing Parallel Hierarchies by Reducibilities.
Inf. Process. Lett. 39(6): 303-307 (1991) |
| 2 | | Jianer Chen,
Chee-Keng Yap:
Reversal Complexity.
SIAM J. Comput. 20(4): 622-638 (1991) |
| 1990 |
|---|
| 1 | | Jianer Chen:
The Difference Between one Tape and two Tapes: with Respect to Reversal Complexity.
Theor. Comput. Sci. 73(3): 265-278 (1990) |
