Daniel H. Leventhal
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
3
Venues
1
Active years
2006–2008
Best venue rank
B
Where they publish
Papers
3 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2008 | CPAIOR | The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems. | Daniel H. Leventhal, Meinolf Sellmann |
| 2007 | CPAIOR | The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width. | Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal |
| 2006 | CPAIOR | A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming. | Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellmann |