Instant recognition of polynominal time solvability, half integrality and 2-approximations

A new approach to the maximum-flow problem

Journal of the ACM (JACM)

A faster strongly polynomial minimum cost flow algorithm

Operations Research

Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality

Mathematical Programming: Series A and B

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)

Approximating clique and biclique problems

Journal of Algorithms

Approximating a generalization of MAX 2SAT and MIN 2SAT

Discrete Applied Mathematics - Special issue on Boolean functions and related problems

Free bits, PCPs and non-approximability-towards tight results

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine

Operations Research Letters