Iyad Kanj

Cited by

	All	Since 2019
Citations	3954	1209
h-index	30	17
i10-index	48	27

280

140

210

20012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202418 36 62 95 122 145 141 147 202 186 189 166 252 180 220 196 174 166 167 213 210 239 264 115

Public access

View all

31 articles

1 article

available

not available

Based on funding mandates

Co-authors

Ge XiaLafayette CollegeVerified email at lafayette.edu
Jianer ChenProfessor of Computer Science, Texas A&M UniversityVerified email at cse.tamu.edu
Ljubomir PerkovićProfessor, School of Computing, DePaul UniversityVerified email at cs.depaul.edu
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaVerified email at szeider.net
Fenghui ZhangGoogle Inc.Verified email at google.com
David JuedesAssociate Dean for Academics, Russ College of Engineering and Technology, Ohio UniversityVerified email at ohio.edu
Christian KomusiewiczFriedrich-Schiller-Universität JenaVerified email at uni-jena.de
Benny ChorProfessor of Computer Science, Tel-Aviv UniversityVerified email at cs.tau.ac.il
Ronald de HaanUniversity of AmsterdamVerified email at ronalddehaan.eu
Henning FernauProfessor für Informatik, Universität TrierVerified email at uni-trier.de
Luay NakhlehProfessor of Computer Science, Rice UniversityVerified email at rice.edu
Michael PelsmajerApplied Mathematics, Illinois Institute of TechnologyVerified email at iit.edu
Marcus SchaeferDePaul UniversityVerified email at cdm.depaul.edu
Eric SedgwickProfessor, DePaul UniversityVerified email at cdm.depaul.edu
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Liming CaiProfessor of Computer Science, University of georgiaVerified email at cs.uga.edu

Iyad Kanj

Professor of Computer Science, DePaul University

No verified email

Parameterized complexity graph theory and algorithms combinatorial optimization computational geometry robotics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Vertex cover: further observations and further improvements J Chen, IA Kanj, W Jia Journal of Algorithms 41 (2), 280-301, 2001	681	2001
Improved upper bounds for vertex cover J Chen, IA Kanj, G Xia Theoretical Computer Science 411 (40-42), 3736-3756, 2010	445	2010
Strong computational lower bounds via parameterized complexity J Chen, X Huang, IA Kanj, G Xia Journal of Computer and System Sciences 72 (8), 1346-1367, 2006	314	2006
Tight lower bounds for certain parameterized NP-hard problems J Chen, B Chor, M Fellows, X Huang, D Juedes, IA Kanj, G Xia Information and Computation 201 (2), 216-231, 2005	244	2005
Improved parameterized upper bounds for vertex cover J Chen, IA Kanj, G Xia International Symposium on Mathematical Foundations of Computer Science, 238-249, 2006	198	2006
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size J Chen, H Fernau, IA Kanj, G Xia SIAM Journal on Computing 37 (4), 1077-1106, 2007	136	2007
Linear FPT reductions and computational lower bounds J Chen, X Huang, IA Kanj, G Xia Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004	136	2004
Seeing the trees and their branches in the network is hard IA Kanj, L Nakhleh, C Than, G Xia Theoretical Computer Science 401 (1-3), 153-164, 2008	89	2008
Improved parameterized algorithms for planar dominating set IA Kanj, L Perković Mathematical Foundations of Computer Science 2002: 27th International …, 2002	86	2002
Improved exact algorithms for Max-Sat J Chen, IA Kanj Discrete Applied Mathematics 142 (1-3), 17-27, 2004	84	2004
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms J Chen, IA Kanj Journal of Computer and System Sciences 67 (4), 833-847, 2003	72	2003
Parameterized algorithms for feedback vertex set I Kanj, M Pelsmajer, M Schaefer International Workshop on Parameterized and Exact Computation, 235-247, 2004	66	2004
On spanners and lightweight spanners of geometric graphs IA Kanj, L Perković, G Xia SIAM Journal on Computing 39 (6), 2132-2161, 2010	65*	2010
Simplicity is beauty: Improved upper bounds for vertex cover J Chen, IA Kanj, G Xia Manuscript communicated by email, 2005	61	2005
Hypercube network fault tolerance: A probabilistic approach J Chen, IA Kanj, G Wang Journal of Interconnection Networks 6 (01), 17-34, 2005	61	2005
Using nondeterminism to design efficient deterministic algorithms J Chen, DK Firesen, W Jia, IA Kanj Algorithmica 40, 83-97, 2004	61	2004
On the induced matching problem I Kanj, MJ Pelsmajer, M Schaefer, G Xia Journal of Computer and System Sciences 77 (6), 1058-1070, 2011	59	2011
Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems J Chen, IA Kanj, G Xia Algorithmica 43, 245-273, 2005	55	2005
On the computational hardness based on linear FPT-reductions J Chen, X Huang, IA Kanj, G Xia Journal of Combinatorial Optimization 11, 231-247, 2006	54*	2006
The parameterized complexity of some minimum label problems MR Fellows, J Guo, I Kanj Journal of Computer and System Sciences 76 (8), 727-740, 2010	52	2010

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors