| Incompleteness and incomparability in preference aggregation: Complexity results | 18 | 0.83 | 2011 |
| Local search algorithms on the Stable Marriage Problem: Experimental Studies | 6 | 0.67 | 2010 |
| Computing possible and necessary winners from incomplete partially-ordered preferences | 4 | 0.78 | 2006 |
| Hard and soft constraints for reasoning about qualitative conditional preferences | 24 | 1.16 | 2006 |
| mCP nets: representing and reasoning with preferences of multiple agents | 64 | 3.69 | 2004 |
| Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques | 30 | 2.57 | 2003 |
| General Properties and Termination Conditions for Soft Constraint Propagation | 2 | 0.53 | 2003 |
| Temporal reasoning with preferences and uncertainty | 12 | 1.01 | 2003 |
| Design and Implementation of Highly Available Linux Clusters | 1 | 0.46 | 2001 |
| Learning Preferences on Temporal Constraints: A Preliminary Report | 3 | 0.50 | 2001 |
| Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison | 163 | 6.96 | 1999 |
| AMUSE: advanced broadband services trials for residential users | 2 | 0.41 | 1999 |
| Partial order and contextual net semantics for atomic and locally atomic CC programs | 15 | 0.61 | 1998 |
| Batch scheduling in a two-machine flow shop with limited buffer | 10 | 1.46 | 1997 |
| Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach | 239 | 17.30 | 1997 |
| Graph processes | 110 | 7.79 | 1996 |
| Concurrent semantics for concurrent constraint programming | 7 | 0.62 | 1993 |
| Hypergraph grammars and networks of constraints versus logic programming and metaprogramming | 3 | 1.36 | 1988 |
