- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j33 |      | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: Parameterized top-K algorithms. Theor. Comput. Sci. 470: 105-119 (2013) |
| j32 | | Iyad A. Kanj, Fenghui Zhang: On the independence number of graphs with maximum degree 3. Theor. Comput. Sci. 478: 51-75 (2013) |
| i5 | | Iyad A. Kanj, Stefan Szeider: On the Subexponential Time Complexity of CSP. CoRR abs/1304.1996 (2013) |
| i4 | | Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu: Algorithms for Cut Problems on Trees. CoRR abs/1304.3653 (2013) |
| i3 | | |
| 2012 | ||
| j31 | | 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) |
| j30 | | Iyad A. Kanj, Ge Xia: Improved local algorithms for spanner construction. Theor. Comput. Sci. 453: 54-64 (2012) |
| j29 | | 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) |
| c44 | | Jianer Chen, Iyad A. Kanj: Parameterized Complexity and Subexponential-Time Computability. The Multivariate Algorithmic Revolution and Beyond 2012: 162-195 |
| c43 | | |
| 2011 | ||
| j28 | | Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann: Editing Graphs into Disjoint Unions of Dense Clusters. Algorithmica 61(4): 949-970 (2011) |
| j27 | | 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) |
| j26 | | Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia: On the induced matching problem. J. Comput. Syst. Sci. 77(6): 1058-1070 (2011) |
| j25 | | Iyad A. Kanj, Andreas Wiese, Fenghui Zhang: Local algorithms for edge colorings in UDGs. Theor. Comput. Sci. 412(35): 4704-4714 (2011) |
| j24 | | 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) |
| c42 | | Jiong Guo, Iyad A. Kanj, Stefan Kratsch: Safe Approximation and Its Relation to Kernelization. IPEC 2011: 169-180 |
| c41 | | Iyad A. Kanj, Fenghui Zhang: 3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size. TAPAS 2011: 163-174 |
| c40 | | 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 |
| c39 | | Iyad A. Kanj, Fenghui Zhang: On the Independence Number of Graphs with Maximum Degree 3. WG 2011: 238-249 |
| i2 | | Iyad A. Kanj, Ge Xia: What makes normalized weighted satisfiability tractable. CoRR abs/1112.1040 (2011) |
| 2010 | ||
| j23 | | 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) |
| j22 | | Iyad A. Kanj, Ljubomir Perkovic, Ge Xia: On Spanners and Lightweight Spanners of Geometric Graphs. SIAM J. Comput. 39(6): 2132-2161 (2010) |
| j21 | | Jianer Chen, Iyad A. Kanj, Ge Xia: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40-42): 3736-3756 (2010) |
| c38 | | |
| 2009 | ||
| j20 | | 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) |
| j19 | | Jianer Chen, Iyad A. Kanj, Ge Xia: On parameterized exponential time complexity. Theor. Comput. Sci. 410(27-29): 2641-2648 (2009) |
| j18 | | 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) |
| c37 | | Shiliang Cui, Iyad A. Kanj, Ge Xia: On the Dilation of Delaunay Triangulations of Points in Convex Position. CCCG 2009: 161-164 |
| c36 | | Iyad A. Kanj, Dieter Kratsch: Convex Recoloring Revisited: Complexity and Exact Algorithms. COCOON 2009: 388-397 |
| c35 | | Iyad A. Kanj, Ge Xia, Fenghui Zhang: Local Construction of Spanners in the 3-D Space. DCOSS 2009: 315-328 |
| c34 | | Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann: Editing Graphs into Disjoint Unions of Dense Clusters. ISAAC 2009: 583-593 |
| c33 | | 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 |
| c32 | | |
| c31 | | |
| c30 | | Michael R. Fellows, Jiong Guo, Iyad A. Kanj: The Parameterized Complexity of Some Minimum Label Problems. WG 2009: 88-99 |
| c29 | | Iyad A. Kanj, Andreas Wiese, Fenghui Zhang: Local Algorithms for Edge Colorings in UDGs. WG 2009: 202-213 |
| 2008 | ||
| j17 | | 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) |
| j16 | | |
| j15 | | 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) |
| c28 | | Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer: On the Induced Matching Problem. STACS 2008: 397-408 |
| c27 | | Iyad A. Kanj, Ljubomir Perkovic: On Geometric Spanners of Euclidean and Unit Disk Graphs. STACS 2008: 409-420 |
| c26 | | |
| c25 | | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: On the Pseudo-achromatic Number Problem. WG 2008: 78-89 |
| i1 | | Iyad A. Kanj, Ljubomir Perkovic: On Geometric Spanners of Euclidean and Unit Disk Graphs. CoRR abs/0802.2864 (2008) |
| 2007 | ||
| j14 | | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Polynomial time approximation schemes and parameterized complexity. Discrete Applied Mathematics 155(2): 180-193 (2007) |
| j13 | | 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) |
| j12 | | 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) |
| c24 |  | Iyad A. Kanj, Ljubomir Perkovic, Ge Xia: Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. DIALM-POMC 2007 |
| c23 | | Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia: Seeing the Trees and Their Branches in the Forest is Hard. ICTCS 2007: 82-93 |
| c22 | | Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang: Separability and Topology Control of Quasi Unit Disk Graphs. INFOCOM 2007: 2225-2233 |
| 2006 | ||
| j11 | | 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) |
| j10 | | 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) |
| c21 | | Iyad A. Kanj, Ljubomir Perkovic: Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. ALGOSENSORS 2006: 95-106 |
| c20 | | Iyad A. Kanj, Luay Nakhleh, Ge Xia: Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. COCOON 2006: 299-308 |
| c19 | | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang: On the Effective Enumerability of NP Problems. IWPEC 2006: 215-226 |
| c18 | | Jianer Chen, Iyad A. Kanj, Ge Xia: Improved Parameterized Upper Bounds for Vertex Cover. MFCS 2006: 238-249 |
| 2005 | ||
| j9 | | 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) |
| j8 | | 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) |
| j7 | | Jianer Chen, Iyad A. Kanj, Guojun Wang: Hypercube Network Fault Tolerance: A Probabilistic Approach. Journal of Interconnection Networks 6(1): 17-34 (2005) |
| j6 | | Jianer Chen, Iyad A. Kanj: On approximating minimum vertex cover for graphs with perfect matching. Theor. Comput. Sci. 337(1-3): 305-318 (2005) |
| c17 | | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. COCOON 2005: 975-984 |
| c16 | | 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 | ||
| j5 | | Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj: Using Nondeterminism to Design Efficient Deterministic Algorithms. Algorithmica 40(2): 83-97 (2004) |
| j4 | | Jianer Chen, Iyad A. Kanj: Improved exact algorithms for MAX-SAT. Discrete Applied Mathematics 142(1-3): 17-27 (2004) |
| c15 | | 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 |
| c14 | | Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer: Parameterized Algorithms for Feedback Vertex Set. IWPEC 2004: 235-247 |
| c13 | | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Polynomial Time Approximation Schemes and Parameterized Complexity. MFCS 2004: 500-512 |
| c12 | | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia: Linear FPT reductions and computational lower bounds. STOC 2004: 212-221 |
| 2003 | ||
| j3 | | 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) |
| c11 | | 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 |
| c10 | | Jianer Chen, Iyad A. Kanj, Ge Xia: Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. ISAAC 2003: 148-157 |
| 2002 | ||
| j2 | | Liming Cai, David W. Juedes, Iyad A. Kanj: The inapproximability of non-NP-hard optimization problems. Theor. Comput. Sci. 289(1): 553-571 (2002) |
| c9 | | Eunseuk Oh, Iyad A. Kanj: Efficient All-to-All Broadcast Schemes in Distributed-Memory Parallel Computers. HPCS 2002: 71-76 |
| c8 | | Jianer Chen, Iyad A. Kanj, Guojun Wang: Hypercube Network Fault Tolerance: A Probabilistic Approach. ICPP 2002: 65-72 |
| c7 | | |
| c6 | | Iyad A. Kanj, Ljubomir Perkovic: Improved Parameterized Algorithms for Planar Dominating Set. MFCS 2002: 399-410 |
| 2001 | ||
| j1 | | Jianer Chen, Iyad A. Kanj, Weijia Jia: Vertex Cover: Further Observations and Further Improvements. J. Algorithms 41(2): 280-301 (2001) |
| c5 | | Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj: Using Nondeterminism to Design Deterministic Algorithms. FSTTCS 2001: 120-131 |
| c4 | | Jianer Chen, Iyad A. Kanj: On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. WG 2001: 55-65 |
| 2000 | ||
| c3 | | Jianer Chen, Iyad A. Kanj: On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. ISAAC 2000: 132-143 |
| 1999 | ||
| c2 | | Jianer Chen, Iyad A. Kanj, Weijia Jia: Vertex Cover: Further Observations and Further Improvements. WG 1999: 313-324 |
| 1998 | ||
| c1 | | Liming Cai, David W. Juedes, Iyad A. Kanj: The Inapproximability of Non NP-hard Optimization Problems. ISAAC 1998: 437-446 |
Data released under the ODC-BY 1.0 license — See also our legal information page