Iyad A. Kanj
- Strong computational lower bounds via parameterized complexity
2006/05/25 by Jianer Chen, Xiuzhen Huang, Iyad Kanj +2 · 6 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Optimization and Search Problems
- Improved Parameterized Upper Bounds for Vertex Cover
2006/01/01 by Jianer Chen, Iyad A. Kanj, Iyad Kanj +1 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Bounded function #Combinatorics #Complexity and Algorithms in Graphs #Computational complexity theory #Computer science #Cover (algebra) #Discrete mathematics #Exponential function #Graph #Mathematical analysis #Mathematics #PSPACE #Parameterized complexity #Polynomial #Polynomial and algebraic computation #Space (punctuation) #Time complexity #Upper and lower bounds #Vertex (graph theory) #Vertex cover