Iyad A. Kanj

	2012
73		Jonathan P. Jenkins, Iyad A. Kanj, Ge Xia, Fenghui Zhang: Local Construction of Spanners in the 3D Space. IEEE Trans. Mob. Comput. 11(7): 1140-1150 (2012)
	2011
72		Jiong Guo, Iyad A. Kanj, Stefan Kratsch: Safe Approximation and Its Relation to Kernelization. IPEC 2011: 169-180
71		Iyad A. Kanj, Fenghui Zhang: 3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size. TAPAS 2011: 163-174
70		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
69		Iyad A. Kanj, Fenghui Zhang: On the Independence Number of Graphs with Maximum Degree 3. WG 2011: 238-249
68		Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann: Editing Graphs into Disjoint Unions of Dense Clusters. Algorithmica 61(4): 949-970 (2011)
67		Iyad A. Kanj, Ge Xia: What makes normalized weighted satisfiability tractable CoRR abs/1112.1040: (2011)
66		Shiliang Cui, Iyad A. Kanj, Ge Xia: On the stretch factor of Delaunay triangulations of points in convex position. Comput. Geom. 44(2): 104-109 (2011)
65		Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia: On the induced matching problem. J. Comput. Syst. Sci. 77(6): 1058-1070 (2011)
64		Iyad A. Kanj, Andreas Wiese, Fenghui Zhang: Local algorithms for edge colorings in UDGs. Theor. Comput. Sci. 412(35): 4704-4714 (2011)
63		Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang: Separability and topology control of quasi unit disk graphs. Wireless Networks 17(1): 53-67 (2011)
	2010
62		Iyad A. Kanj, Ge Xia: Improved Local Algorithms for Spanner Construction. ALGOSENSORS 2010: 1-15
61		Michael R. Fellows, Jiong Guo, Iyad A. Kanj: The parameterized complexity of some minimum label problems. J. Comput. Syst. Sci. 76(8): 727-740 (2010)
60		Iyad A. Kanj, Ljubomir Perkovic, Ge Xia: On Spanners and Lightweight Spanners of Geometric Graphs. SIAM J. Comput. 39(6): 2132-2161 (2010)
59		Jianer Chen, Iyad A. Kanj, Ge Xia: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40-42): 3736-3756 (2010)
	2009
58		Shiliang Cui, Iyad A. Kanj, Ge Xia: On the Dilation of Delaunay Triangulations of Points in Convex Position. CCCG 2009: 161-164
57		Iyad A. Kanj, Dieter Kratsch: Convex Recoloring Revisited: Complexity and Exact Algorithms. COCOON 2009: 388-397
56		Iyad A. Kanj, Ge Xia, Fenghui Zhang: Local Construction of Spanners in the 3-D Space. DCOSS 2009: 315-328
55		Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann: Editing Graphs into Disjoint Unions of Dense Clusters. ISAAC 2009: 583-593
54		Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý: What Makes Equitable Connected Partition Easy. IWPEC 2009: 122-133
53		Jianer Chen, Iyad A. Kanj, Ge Xia: On Parameterized Exponential Time Complexity. TAMC 2009: 168-177
52		Iyad A. Kanj: On Spanners of Geometric Graphs. TAMC 2009: 49-58
51		Iyad A. Kanj, Andreas Wiese, Fenghui Zhang: Local Algorithms for Edge Colorings in UDGs. WG 2009: 202-213
50		Michael R. Fellows, Jiong Guo, Iyad A. Kanj: The Parameterized Complexity of Some Minimum Label Problems. WG 2009: 88-99
49		Iyad A. Kanj, Ljubomir Perkovic, Ge Xia: Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks. IEEE Trans. Mob. Comput. 8(4): 460-474 (2009)
48		Jianer Chen, Iyad A. Kanj, Ge Xia: On parameterized exponential time complexity. Theor. Comput. Sci. 410(27-29): 2641-2648 (2009)
47		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)
	2008
46		Iyad A. Kanj, Ljubomir Perkovic, Ge Xia: Computing Lightweight Spanners Locally. DISC 2008: 365-378
45		Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer: On the Induced Matching Problem. STACS 2008: 397-408
44		Iyad A. Kanj, Ljubomir Perkovic: On Geometric Spanners of Euclidean and Unit Disk Graphs. STACS 2008: 409-420
43		Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: On the Pseudo-achromatic Number Problem. WG 2008: 78-89
42		Iyad A. Kanj, Luay Nakhleh, Ge Xia: The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. Algorithmica 51(2): 99-128 (2008)
41		Jianer Chen, Iyad A. Kanj: Foreword from the Guest Editors. Algorithmica 52(2): 113 (2008)
40		Iyad A. Kanj, Ljubomir Perkovic: On Geometric Spanners of Euclidean and Unit Disk Graphs CoRR abs/0802.2864: (2008)
39		Iyad 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
36		Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang: Separability and Topology Control of Quasi Unit Disk Graphs. INFOCOM 2007: 2225-2233
35		Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Polynomial time approximation schemes and parameterized complexity. Discrete Applied Mathematics 155(2): 180-193 (2007)
34		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)
33		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)
	2006
32		Iyad A. Kanj, Ljubomir Perkovic: Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. ALGOSENSORS 2006: 95-106
31		Iyad A. Kanj, Luay Nakhleh, Ge Xia: Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. COCOON 2006: 299-308
30		Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: On the Effective Enumerability of NP Problems. IWPEC 2006: 215-226
29		Jianer Chen, Iyad A. Kanj, Ge Xia: Improved Parameterized Upper Bounds for Vertex Cover. MFCS 2006: 238-249
28		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)
27		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)
	2005
26		Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. COCOON 2005: 975-984
25		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
24		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)
23		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)
22		Jianer Chen, Iyad A. Kanj, Guojun Wang: Hypercube Network Fault Tolerance: A Probabilistic Approach. Journal of Interconnection Networks 6(1): 17-34 (2005)
21		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
20		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
19		Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer: Parameterized Algorithms for Feedback Vertex Set. IWPEC 2004: 235-247
18		Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Polynomial Time Approximation Schemes and Parameterized Complexity. MFCS 2004: 500-512
17		Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Linear FPT reductions and computational lower bounds. STOC 2004: 212-221
16		Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj: Using Nondeterminism to Design Efficient Deterministic Algorithms. Algorithmica 40(2): 83-97 (2004)
15		Jianer Chen, Iyad A. Kanj: Improved exact algorithms for MAX-SAT. Discrete Applied Mathematics 142(1-3): 17-27 (2004)
	2003
14		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
13		Jianer Chen, Iyad A. Kanj, Ge Xia: Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. ISAAC 2003: 148-157
12		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)
	2002
11		Eunseuk Oh, Iyad A. Kanj: Efficient All-to-All Broadcast Schemes in Distributed-Memory Parallel Computers. HPCS 2002: 71-76
10		Jianer Chen, Iyad A. Kanj, Guojun Wang: Hypercube Network Fault Tolerance: A Probabilistic Approach. ICPP 2002: 65-72
9		Jianer Chen, Iyad A. Kanj: Improved Exact Algorithms for MAX-SAT. LATIN 2002: 341-355
8		Iyad 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
6		Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj: Using Nondeterminism to Design Deterministic Algorithms. FSTTCS 2001: 120-131
5		Jianer Chen, Iyad A. Kanj: On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. WG 2001: 55-65
4		Jianer Chen, Iyad A. Kanj, Weijia Jia: Vertex Cover: Further Observations and Further Improvements. J. Algorithms 41(2): 280-301 (2001)
	2000
3		Jianer Chen, Iyad A. Kanj: On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. ISAAC 2000: 132-143
	1999
2		Jianer Chen, Iyad A. Kanj, Weijia Jia: Vertex Cover: Further Observations and Further Improvements. WG 1999: 313-324
	1998
1		Liming Cai, David W. Juedes, Iyad A. Kanj: The Inapproximability of Non NP-hard Optimization Problems. ISAAC 1998: 437-446

Coauthor Index

1	Liming Cai	[1] [7]
2	Jianer 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] [48] [53] [59] [63] [70]
3	Benny Chor	[20] [23]
4	Shiliang Cui	[58] [66]
5	Rosa Enciso	[54]
6	Jia-Hao Fan	[70]
7	Michael R. Fellows (Mike Fellows)	[20] [23] [50] [54] [61]
8	Henning Fernau	[25] [33]
9	Donald K. Friesen	[6] [16]
10	Jiong Guo	[50] [54] [55] [61] [68] [72]
11	Xiuzhen Huang	[17] [18] [20] [23] [26] [27] [28] [35]
12	Jonathan P. Jenkins	[73]
13	Weijia Jia	[2] [4] [6] [16]
14	Anxiao Jiang (Anxiao Andrew Jiang)	[36] [63]
15	David W. Juedes	[1] [7] [20] [23]
16	Christian Komusiewicz	[55] [68]
17	Dieter Kratsch	[57]
18	Stefan Kratsch	[72]
19	Yang Liu	[70]
20	Jie Meng	[30] [43] [47]
21	Luay Nakhleh	[31] [37] [39] [42]
22	Eunseuk Oh	[11]
23	Michael J. Pelsmajer	[19] [45] [65]
24	Ljubomir Perkovic	[8] [14] [32] [34] [38] [40] [44] [46] [49] [60]
25	Frances A. Rosamond	[54]
26	Marcus Schaefer	[19] [45] [65]
27	Eric Sedgwick	[14] [34]
28	Ondrej Suchý	[54]
29	Cuong Than	[37] [39]
30	Johannes Uhlmann	[55] [68]
31	Guojun Wang	[10] [22]
32	Andreas Wiese	[51] [64]
33	Ge 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] [48] [49] [53] [56] [58] [59] [60] [62] [63] [65] [66] [67] [73]
34	Fenghui Zhang	[30] [36] [43] [47] [51] [56] [63] [64] [69] [70] [71] [73]

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page