Invitation to Algorithmic Uses of Inclusion-Exclusion
Irreducible Frequent Patterns in Transactional Databases
Is it possible to find the maximum clique in general graphs?
Is submodularity testable?
Isomorphism of graph classes related to the circular-ones property
Isomorphism of graphs-a polynomial test
Iterative Constructions and Private Data Release
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
Iterative Rounding for the Closest String Problem