A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming. - Ionut D. Aron; Daniel H. Leventhal; Meinolf Sellmann (CPAIOR, 2006)

The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width. - Meinolf Sellmann; Luc Mercier; Daniel H. Leventhal (CPAIOR, 2007)

The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems. - Daniel H. Leventhal; Meinolf Sellmann (CPAIOR, 2008)