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

Hamiltonian Paths in Two Classes of Grid Graphs

Haplotype Inference on Pedigrees with Recombinations, Errors, and Missing Genotypes via SAT solvers

Hardness and Approximation of The Asynchronous Border Minimization Problem

Hash sort: A linear time complexity multiple-dimensional sort algorithm

Heapable Sequences and Subsequences

Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration

Heuristic average-case analysis of the backtrack resolution of random 3-Satisfiability instances

Heuristic Contraction Hierarchies with Approximation Guarantee

Heuristic to reduce the complexity of complete bipartite graphs to accelerate the search for maximum weighted matchings with small error

Hierarchical Bin Buffering: Online Local Moments for Dynamic External Memory Arrays