Daniel Vanderpooten

Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten: Complexity of determining the most vital elements for the p-median and p-center location problems. J. Comb. Optim. 25(2): 191-207 (2013)

Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten: Efficient determination of the k most vital edges for the minimum spanning tree problem. Computers & OR 39(11): 2888-2898 (2012)

Rim Kalaï, Claude Lamboray, Daniel Vanderpooten: Lexicographic α-robustness: An alternative to min-max criteria. European Journal of Operational Research 220(3): 722-728 (2012)

Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten: Preference-based English reverse auctions. Artif. Intell. 175(7-8): 1449-1467 (2011)

Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten: Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem. COCOA 2011: 126-140

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. Discrete Optimization 7(3): 136-148 (2010)

Afef Bouzaiene, Najoua Dridi, Mohamed Ali Aloulou, Daniel Vanderpooten: A bicriteria flow-shop scheduling problem with two serial batching machines. Electronic Notes in Discrete Mathematics 36: 1177-1184 (2010)

Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Satisfactory graph partition, variants, and generalizations. European Journal of Operational Research 206(2): 271-280 (2010)

Rim Kalaï, Mohamed Ali Aloulou, Philippe Vallin, Daniel Vanderpooten: Lexicographic α-robustness: an application to the 1-median problem. RAIRO - Operations Research 44(2): 119-138 (2010)

Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten: Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems. COCOA (1) 2010: 237-251

Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten: Solving efficiently the 0-1 multi-objective knapsack problem. Computers & OR 36(1): 260-279 (2009)

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Min-max and min-max regret versions of combinatorial optimization problems: A survey. European Journal of Operational Research 197(2): 427-438 (2009)

Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten: Implementing an efficient fptas for the 0-1 multi-objective knapsack problem. European Journal of Operational Research 198(1): 47-56 (2009)

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Complexity of the min-max (regret) versions of min cut problems. Discrete Optimization 5(1): 66-73 (2008)

Mohamed Farah, Daniel Vanderpooten: An outranking approach for information retrieval. Inf. Retr. 11(4): 315-334 (2008)

Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Approximation of satisfactory bisection problems. J. Comput. Syst. Sci. 74(5): 875-883 (2008)

Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten: A unified framework for multiple criteria auction mechanisms. Web Intelligence and Agent Systems 6(4): 401-419 (2008)

Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Efficient algorithms for decomposing graphs under degree constraints. Discrete Applied Mathematics 155(8): 979-988 (2007)

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Approximation of min-max and min-max regret versions of some combinatorial optimization problems. European Journal of Operational Research 179(2): 281-290 (2007)

Marie-Jo Bellosta, Imène Brigui-Chtioui, Sylvie Kornman, Suzanne Pinson, Daniel Vanderpooten: Système multi-agent pour des enchères multicritères Modèle et expérimentations. Revue d'Intelligence Artificielle 21(5-6): 703-727 (2007)

Mohamed Farah, Daniel Vanderpooten: L'Agrégation en Recherche d'Information. CORIA 2007: 125-136

Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten: A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. ESA 2007: 717-728

Mohamed Farah, Daniel Vanderpooten: An outranking approach for rank aggregation in information retrieval. SIGIR 2007: 591-598

Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten: An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem. WEA 2007: 406-419

Hadrien Hugot, Daniel Vanderpooten, Jean Michel Vanpeperstraete: A bi-criteria approach for the data association problem. Annals OR 147(1): 217-234 (2006)

Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: The satisfactory partition problem. Discrete Applied Mathematics 154(8): 1236-1245 (2006)

Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Degree-constrained decompositions of graphs: Bounded treewidth and planarity. Theor. Comput. Sci. 355(3): 389-395 (2006)

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Approximating Min-Max (Regret) Versions of Some Polynomial Problems. COCOON 2006: 428-438

Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten: An Agent-Based Mechanism for Autonomous Multiple Criteria Auctions. IAT 2006: 587-594

Mohamed Farah, Daniel Vanderpooten: A Multiple Criteria Approach for Information Retrieval. SPIRE 2006: 242-254

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Complexity of the min-max and min-max regret assignment problems. Oper. Res. Lett. 33(6): 634-640 (2005)

Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: Complexity and Approximation of Satisfactory Partition Problems. COCOON 2005: 829-838

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ESA 2005: 862-873

Marie-Jo Bellosta, Sylvie Kornman, Daniel Vanderpooten: A framework for multiple criteria English reverse auctions. IAT 2005: 633-639

Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten: Complexity of the Min-Max (Regret) Versions of Cut Problems. ISAAC 2005: 789-798

Marie-Jo Bellosta, Imène Brigui, Sylvie Kornman, Daniel Vanderpooten: A multi-criteria model for electronic auctions. SAC 2004: 759-765

Mohamed Farah, Daniel Vanderpooten: Novel Approaches in Text Information Retrieval - Experiments in the Web Track of TREC 2004. TREC 2004

R. Azibi, Daniel Vanderpooten: Aggregation of dispersed consequences for constructing criteria: The evaluation of flood risk reduction strategies. European Journal of Operational Research 144(2): 397-411 (2003)

Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten: On the Existence and Determination of Satisfactory Partitions in a Graph. ISAAC 2003: 444-453

R. Azibi, Daniel Vanderpooten: Construction of rule-based assignment models. European Journal of Operational Research 138(2): 274-293 (2002)

Virginie Gabrel, Daniel Vanderpooten: Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite. European Journal of Operational Research 139(3): 533-542 (2002)

Jerzy Stefanowski, Daniel Vanderpooten: Induction of decision rules in classification and discovery-oriented perspectives. Int. J. Intell. Syst. 16(1): 13-27 (2001)

Roman Slowinski, Daniel Vanderpooten: A Generalized Definition of Rough Approximations Based on Similarity. IEEE Trans. Knowl. Data Eng. 12(2): 331-336 (2000)

Jerzy Stefanowski, Daniel Vanderpooten: A General Two-Stage Approach to Inducing Rules from Examples. RSKD 1993: 317-325