| Faster algorithms for computing longest common increasing subsequences | 6 | 0.54 | 2011 |
| Simultaneous matchings: Hardness and approximation | 9 | 0.52 | 2008 |
| Commitment under uncertainty: Two-stage stochastic matching problems | 23 | 1.16 | 2008 |
| An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree | 15 | 0.87 | 2008 |
| Matchings in Node-Weighted Convex Bipartite Graphs | 8 | 0.59 | 2008 |
| Dynamic matchings in convex bipartite graphs | 8 | 0.59 | 2007 |
| Propagating knapsack constraints in sublinear time | 6 | 0.50 | 2007 |
| The "Not-Too-Heavy Spanning Tree" Constraint | 6 | 0.54 | 2007 |
| Canonical density control | 3 | 0.37 | 2007 |
| Faster algorithms for computing longest common increasing subsequences | 9 | 0.70 | 2006 |
| The minimum spanning tree constraint | 9 | 0.59 | 2006 |
| Online topological ordering | 8 | 0.57 | 2006 |
| Undirected Forest Constraints | 5 | 0.47 | 2006 |
| Expected-Case analysis for delayed filtering | 6 | 0.51 | 2006 |
| Multiconsistency and Robustness with Global Constraints | 1 | 0.37 | 2006 |
| Sub-optimality Approximations | 4 | 0.50 | 2005 |
| Complete Bound Consistency for the Global Cardinality Constraint | 10 | 0.60 | 2005 |
| Maintaining Longest Paths in Cyclic Graphs | 1 | 0.37 | 2005 |
| Maintaining Longest Paths Incrementally | 5 | 0.48 | 2005 |
| GCC-like restrictions on the same constraint | 1 | 0.37 | 2004 |
| On the algebraic complexity of set equality and inclusion | 2 | 0.41 | 2004 |
| Dynamic Heaviest Paths In Dags With Arbitrary Edge Weights | 2 | 0.40 | 2004 |
| A Practical Minimum Spanning Tree Algorithm Using the Cycle Property | 12 | 0.80 | 2003 |
| Elementary Graph Algorithms in External Memory | 17 | 0.91 | 2002 |
