The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Iyad A. Kanj: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Iyad A. Kanj, Ljubomir Perkovic
    Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2006, pp:95-106 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:150-160 [Conf]
  3. Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
    W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:975-984 [Conf]
  4. Iyad A. Kanj, Luay Nakhleh, Ge Xia
    Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:299-308 [Conf]
  5. Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj
    Using Nondeterminism to Design Deterministic Algorithms. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:120-131 [Conf]
  6. Eunseuk Oh, Iyad A. Kanj
    Efficient All-to-All Broadcast Schemes in Distributed-Memory Parallel Computers. [Citation Graph (0, 0)][DBLP]
    HPCS, 2002, pp:71-76 [Conf]
  7. Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
    Genus Characterizes the Complexity of Graph Problems: Some Tight Results. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:845-856 [Conf]
  8. Jianer Chen, Iyad A. Kanj, Guojun Wang
    Hypercube Network Fault Tolerance: A Probabilistic Approach. [Citation Graph (0, 0)][DBLP]
    ICPP, 2002, pp:65-72 [Conf]
  9. Liming Cai, David W. Juedes, Iyad A. Kanj
    The Inapproximability of Non NP-hard Optimization Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:437-446 [Conf]
  10. Jianer Chen, Iyad A. Kanj
    On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:132-143 [Conf]
  11. Jianer Chen, Iyad A. Kanj, Ge Xia
    Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:148-157 [Conf]
  12. Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
    On the Effective Enumerability of NP Problems. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:215-226 [Conf]
  13. Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer
    Parameterized Algorithms for Feedback Vertex Set. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:235-247 [Conf]
  14. Jianer Chen, Iyad A. Kanj
    Improved Exact Algorithms for MAX-SAT. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:341-355 [Conf]
  15. Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
    Polynomial Time Approximation Schemes and Parameterized Complexity. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:500-512 [Conf]
  16. Jianer Chen, Iyad A. Kanj, Ge Xia
    Improved Parameterized Upper Bounds for Vertex Cover. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:238-249 [Conf]
  17. Iyad A. Kanj, Ljubomir Perkovic
    Improved Parameterized Algorithms for Planar Dominating Set. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:399-410 [Conf]
  18. Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
    Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:269-280 [Conf]
  19. Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
    Linear FPT reductions and computational lower bounds. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:212-221 [Conf]
  20. Jianer Chen, Iyad A. Kanj
    On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:55-65 [Conf]
  21. Jianer Chen, Iyad A. Kanj, Weijia Jia
    Vertex Cover: Further Observations and Further Improvements. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:313-324 [Conf]
  22. Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj
    Using Nondeterminism to Design Efficient Deterministic Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:2, pp:83-97 [Journal]
  23. Jianer Chen, Iyad A. Kanj, Ge Xia
    Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:4, pp:245-273 [Journal]
  24. Jianer Chen, Iyad A. Kanj
    Improved exact algorithms for MAX-SAT. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:17-27 [Journal]
  25. Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
    Polynomial time approximation schemes and parameterized complexity. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:180-193 [Journal]
  26. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:201, n:2, pp:216-231 [Journal]
  27. Jianer Chen, Iyad A. Kanj, Weijia Jia
    Vertex Cover: Further Observations and Further Improvements. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:280-301 [Journal]
  28. Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
    On the computational hardness based on linear FPT-reductions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:11, n:2, pp:231-247 [Journal]
  29. Jianer Chen, Iyad A. Kanj
    Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:4, pp:833-847 [Journal]
  30. Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
    Strong computational lower bounds via parameterized complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1346-1367 [Journal]
  31. Jianer Chen, Iyad A. Kanj, Guojun Wang
    Hypercube Network Fault Tolerance: A Probabilistic Approach. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2005, v:6, n:1, pp:17-34 [Journal]
  32. Liming Cai, David W. Juedes, Iyad A. Kanj
    The inapproximability of non-NP-hard optimization problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:553-571 [Journal]
  33. Jianer Chen, Iyad A. Kanj
    On approximating minimum vertex cover for graphs with perfect matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:305-318 [Journal]
  34. Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang
    Separability and Topology Control of Quasi Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:2225-2233 [Conf]
  35. Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
    Genus characterizes the complexity of certain graph problems: Some tight results. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:6, pp:892-907 [Journal]

  36. On the Dilation of Delaunay Triangulations of Points in Convex Position. [Citation Graph (, )][DBLP]


  37. Convex Recoloring Revisited: Complexity and Exact Algorithms. [Citation Graph (, )][DBLP]


  38. Local Construction of Spanners in the 3-D Space. [Citation Graph (, )][DBLP]


  39. Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. [Citation Graph (, )][DBLP]


  40. Seeing the Trees and Their Branches in the Forest is Hard. [Citation Graph (, )][DBLP]


  41. Editing Graphs into Disjoint Unions of Dense Clusters. [Citation Graph (, )][DBLP]


  42. What Makes Equitable Connected Partition Easy. [Citation Graph (, )][DBLP]


  43. On Geometric Spanners of Euclidean and Unit Disk Graphs. [Citation Graph (, )][DBLP]


  44. On the Induced Matching Problem. [Citation Graph (, )][DBLP]


  45. On Spanners of Geometric Graphs. [Citation Graph (, )][DBLP]


  46. On Parameterized Exponential Time Complexity. [Citation Graph (, )][DBLP]


  47. Computing Lightweight Spanners Locally. [Citation Graph (, )][DBLP]


  48. Local Algorithms for Edge Colorings in UDGs. [Citation Graph (, )][DBLP]


  49. On the Pseudo-achromatic Number Problem. [Citation Graph (, )][DBLP]


  50. The Parameterized Complexity of Some Minimum Label Problems. [Citation Graph (, )][DBLP]


  51. The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. [Citation Graph (, )][DBLP]


  52. Foreword from the Guest Editors. [Citation Graph (, )][DBLP]


  53. On Geometric Spanners of Euclidean and Unit Disk Graphs [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002