Experimental Algorithm for the Maximum Independent Set Problem

Experiments on Density-Constrained Graph Clustering

Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash

Explicit Non-Adaptive Combinatorial Group Testing Schemes

Exploration of Periodically Varying Graphs

Exponential Lower Bounds For Policy Iteration

Exponential-Time Approximation of Hard Problems

Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics

Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem

Extending Karger's randomized min-cut Algorithm for a Synchronous Distributed setting

External Memory Orthogonal Range Reporting with Fast Updates

External-Memory Multimaps

External-Memory Network Analysis Algorithms for Naturally Sparse Graphs

Extremal Properties of Three Dimensional Sensor Networks with Applications