Graph Expansion and Communication Costs of Fast Matrix Multiplication

Graph Iterators: Decoupling Graph Structures from Algorithms

Graph Operations on Clique-Width Bounded Graphs

Graph Sparsification by Edge-Connectivity and Random Spanning Trees

Graph Sparsification by Effective Resistances

Graph Sparsification via Refinement Sampling

Greedy algorithm for stochastic matching is a 2-approximation

Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP

Greedy Sequential Maximal Independent Set and Matching are Parallel on Average

Grothendieck-type inequalities in combinatorial optimization

Group Testing with Random Pools: optimal two-stage algorithms

Grover search algorithm

Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners