Directed Network Design Problems with Orientation Constraints with S. Khanna, S. Naor, To appear: SIAM Journal for Discrete Mathematics, 2004. (Earlier version in: SODA '99, San Francisco, January 1999, )

Visualizing, Finding and Packing Dijoins, with A. Vetta, Chapter in: Graph Theory and Combinatorial Optimization, GERAD 25th Anniversary Volumes, Springer 2005.

The Demand Matching Problem, with A. Vetta IPCO 2002

Multicommodity Demand Flow in a Tree and Packing Integer Programs, with C. Chekuri, M. Mydlarz, Submitted 2003; (Earlier version in: ICALP 2003 )

The Theta Body and Imperfection, Chapter in: Perfect Graphs: By Ramirez Alfonsion and Bruce Reed, Wiley and Sons Ltd., U.K. 2001

Some strategies for reserving resilient capacity, with G. Brightwell, G. Oriolo. SIAM J. Discrete Math., , Vol. 14, No. 4, 524-539, 2001. A fuller, earlier version describes a number of alternative strategies for different types of restoration architectures.

The graphs with all subgraphs t-perfect, with A.M.H. Gerards. Siam Journal of Discrete Mathematics, Vol. 11, No. 4, 1998, 524-545.

Applying Lehman's theorem to packing problems, Mathematical Programming, vol. 71, 1995, 353-366.

A note on clutter partitions, Operations Research Letters, vol. 15, 1994, 127-131.

Near-perfect matrices, Mathematical Programming, vol. 64, 1994, 295-323.

Formulations for the stable set polytope , with W. Pulleyblank. Proceedings of Integer Programming and Combinatorial Optimization '93, Erice, Italy 1993).

On splitable sets, with W. Pulleyblank, B. Reed. Graph Theory Notes of New York XXIII, Eds. J.W. Kennedy, Louis V. Quintas, New York Academy of Sciences 1992, 11-20.