Papers by subject

Sparsest Cut
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem

Compositions of Graphs and Polyhedra
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs
Compositions of Graphs and Polyhedra II: Stable Sets
Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs

Extended formulations, Polynomial size linear programming
On cuts and matchings in planar graphs
Reducing Matching to Polynomial Size Linear Programming

Spanning trees
Separating from the dominant of the spanning tree polytope
Packing spanning trees
Network Reinforcement
A Linear Programming Approach to Increasing the Weight of All Minimum Spanning Trees

Separation of partition inequalities
Separating from the dominant of the spanning tree polytope
Separation of partition inequalities
Partition Inequalities: Separation, Extensions and Network Design

Volume Algorithm
The volume algorithm: producing primal solutions with a subgradient method
On some difficult linear programs coming from set partitioning

Algorithmic Game Theory