A simple way to tell a simple polytope from its graph

Reconstructing a simple polytope from its graph

Combinatorial optimization - Eureka, you shrink!

Lattice congruences, fans and Hopf algebras

Journal of Combinatorial Theory Series A

Finding a Polytope from Its Graph in Polynomial Time

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization

The graphicahedron

European Journal of Combinatorics

The brick polytope of a sorting network

European Journal of Combinatorics

Unique sink orientations of grids

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Jumping doesn't help in abstract cubes

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Computing the bounded subcomplex of an unbounded polyhedron

Computational Geometry: Theory and Applications