Interchanging distance and capacity in probabilistic mappings
Interference minimization in physical model of wireless networks
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
Interval Routing Schemes for Circular-Arc Graphs
Intrinsic Dimensionality
Invertible Bloom Lookup Tables
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
Join-Reachability Problems in Directed Graphs
Jungles, bundles, and fixed parameter tractability
k-Gap Interval Graphs
k-Means has Polynomial Smoothed Complexity
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance