dblp.uni-trier.dewww.uni-trier.de

Iyad A. Kanj

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
47EEJianer 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)
2008
46EEIyad A. Kanj, Ljubomir Perkovic, Ge Xia: Computing Lightweight Spanners Locally. DISC 2008: 365-378
45EEIyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer: On the Induced Matching Problem. STACS 2008: 397-408
44EEIyad A. Kanj, Ljubomir Perkovic: On Geometric Spanners of Euclidean and Unit Disk Graphs. STACS 2008: 409-420
43EEJianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: On the Pseudo-achromatic Number Problem. WG 2008: 78-89
42EEIyad A. Kanj, Luay Nakhleh, Ge Xia: The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. Algorithmica 51(2): 99-128 (2008)
41EEJianer Chen, Iyad A. Kanj: Foreword from the Guest Editors. Algorithmica 52(2): 113 (2008)
40EEIyad A. Kanj, Ljubomir Perkovic: On Geometric Spanners of Euclidean and Unit Disk Graphs CoRR abs/0802.2864: (2008)
39EEIyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia: Seeing the trees and their branches in the network is hard. Theor. Comput. Sci. 401(1-3): 153-164 (2008)
2007
38 Iyad A. Kanj, Ljubomir Perkovic, Ge Xia: Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. DIALM-POMC 2007
37 Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia: Seeing the Trees and Their Branches in the Forest is Hard. ICTCS 2007: 82-93
36EEJianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang: Separability and Topology Control of Quasi Unit Disk Graphs. INFOCOM 2007: 2225-2233
35EEJianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Polynomial time approximation schemes and parameterized complexity. Discrete Applied Mathematics 155(2): 180-193 (2007)
34EEJianer 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)
33EEJianer 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)
2006
32EEIyad A. Kanj, Ljubomir Perkovic: Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. ALGOSENSORS 2006: 95-106
31EEIyad A. Kanj, Luay Nakhleh, Ge Xia: Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. COCOON 2006: 299-308
30EEJianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: On the Effective Enumerability of NP Problems. IWPEC 2006: 215-226
29EEJianer Chen, Iyad A. Kanj, Ge Xia: Improved Parameterized Upper Bounds for Vertex Cover. MFCS 2006: 238-249
28EEJianer 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)
27EEJianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8): 1346-1367 (2006)
2005
26EEJianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. COCOON 2005: 975-984
25EEJianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. STACS 2005: 269-280
24EEJianer 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)
23EEJianer 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)
22EEJianer Chen, Iyad A. Kanj, Guojun Wang: Hypercube Network Fault Tolerance: A Probabilistic Approach. Journal of Interconnection Networks 6(1): 17-34 (2005)
21EEJianer Chen, Iyad A. Kanj: On approximating minimum vertex cover for graphs with perfect matching. Theor. Comput. Sci. 337(1-3): 305-318 (2005)
2004
20EEJianer 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
19EEIyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer: Parameterized Algorithms for Feedback Vertex Set. IWPEC 2004: 235-247
18EEJianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Polynomial Time Approximation Schemes and Parameterized Complexity. MFCS 2004: 500-512
17EEJianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Linear FPT reductions and computational lower bounds. STOC 2004: 212-221
16EEJianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj: Using Nondeterminism to Design Efficient Deterministic Algorithms. Algorithmica 40(2): 83-97 (2004)
15EEJianer Chen, Iyad A. Kanj: Improved exact algorithms for MAX-SAT. Discrete Applied Mathematics 142(1-3): 17-27 (2004)
2003
14EEJianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia: Genus Characterizes the Complexity of Graph Problems: Some Tight Results. ICALP 2003: 845-856
13EEJianer Chen, Iyad A. Kanj, Ge Xia: Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. ISAAC 2003: 148-157
12EEJianer Chen, Iyad A. Kanj: Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. J. Comput. Syst. Sci. 67(4): 833-847 (2003)
2002
11EEEunseuk Oh, Iyad A. Kanj: Efficient All-to-All Broadcast Schemes in Distributed-Memory Parallel Computers. HPCS 2002: 71-76
10EEJianer Chen, Iyad A. Kanj, Guojun Wang: Hypercube Network Fault Tolerance: A Probabilistic Approach. ICPP 2002: 65-72
9EEJianer Chen, Iyad A. Kanj: Improved Exact Algorithms for MAX-SAT. LATIN 2002: 341-355
8EEIyad A. Kanj, Ljubomir Perkovic: Improved Parameterized Algorithms for Planar Dominating Set. MFCS 2002: 399-410
7 Liming Cai, David W. Juedes, Iyad A. Kanj: The inapproximability of non-NP-hard optimization problems. Theor. Comput. Sci. 289(1): 553-571 (2002)
2001
6EEJianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj: Using Nondeterminism to Design Deterministic Algorithms. FSTTCS 2001: 120-131
5EEJianer Chen, Iyad A. Kanj: On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. WG 2001: 55-65
4EEJianer Chen, Iyad A. Kanj, Weijia Jia: Vertex Cover: Further Observations and Further Improvements. J. Algorithms 41(2): 280-301 (2001)
2000
3EEJianer Chen, Iyad A. Kanj: On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. ISAAC 2000: 132-143
1999
2EEJianer Chen, Iyad A. Kanj, Weijia Jia: Vertex Cover: Further Observations and Further Improvements. WG 1999: 313-324
1998
1EELiming Cai, David W. Juedes, Iyad A. Kanj: The Inapproximability of Non NP-hard Optimization Problems. ISAAC 1998: 437-446

Coauthor Index

1Liming Cai [1] [7]
2Jianer Chen [2] [3] [4] [5] [6] [9] [10] [12] [13] [14] [15] [16] [17] [18] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [33] [34] [35] [36] [41] [43] [47]
3Benny Chor [20] [23]
4Michael R. Fellows (Mike Fellows) [20] [23]
5Henning Fernau [25] [33]
6Donald K. Friesen [6] [16]
7Xiuzhen Huang [17] [18] [20] [23] [26] [27] [28] [35]
8Weijia Jia [2] [4] [6] [16]
9Anxiao Jiang [36]
10David W. Juedes [1] [7] [20] [23]
11Jie Meng [30] [43] [47]
12Luay Nakhleh [31] [37] [39] [42]
13Eunseuk Oh [11]
14Michael J. Pelsmajer [19] [45]
15Ljubomir Perkovic [8] [14] [32] [34] [38] [40] [44] [46]
16Marcus Schaefer [19] [45]
17Eric Sedgwick [14] [34]
18Cuong Than [37] [39]
19Guojun Wang [10] [22]
20Ge Xia [13] [14] [17] [18] [20] [23] [24] [25] [26] [27] [28] [29] [30] [31] [33] [34] [35] [36] [37] [38] [39] [42] [43] [45] [46] [47]
21Fenghui Zhang [30] [36] [43] [47]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)