| 2019 | COCOON | An FPTAS for a General Class of Parametric Optimization Problems. | Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten |
| 2011 | COCOA | Efficient Algorithms for Finding the | Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten |
| 2010 | COCOA | Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems. | Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten |
| 2007 | ESA | A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. | Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten |
| 2007 | SIGIR | An outranking approach for rank aggregation in information retrieval. | Mohamed Farah, Daniel Vanderpooten |
| 2006 | COCOON | Approximating Min-Max (Regret) Versions of Some Polynomial Problems. | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
| 2006 | SPIRE | A Multiple Criteria Approach for Information Retrieval. | Mohamed Farah, Daniel Vanderpooten |
| 2005 | COCOON | Complexity and Approximation of Satisfactory Partition Problems. | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
| 2005 | ESA | Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
| 2005 | ISAAC | Complexity of the Min-Max (Regret) Versions of Cut Problems. | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
| 2004 | SAC | A multi-criteria model for electronic auctions. | Marie-Jo Bellosta, Imne Brigui, Sylvie Kornman, Daniel Vanderpooten |
| 2003 | ISAAC | On the Existence and Determination of Satisfactory Partitions in a Graph. | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |