| 2008 |
|---|
| 22 | EE | Mohamed Farah,
Daniel Vanderpooten:
An outranking approach for information retrieval.
Inf. Retr. 11(4): 315-334 (2008) |
| 2007 |
|---|
| 21 | EE | Cristina Bazgan,
Hadrien Hugot,
Daniel Vanderpooten:
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem.
ESA 2007: 717-728 |
| 20 | EE | Mohamed Farah,
Daniel Vanderpooten:
An outranking approach for rank aggregation in information retrieval.
SIGIR 2007: 591-598 |
| 19 | EE | Cristina Bazgan,
Hadrien Hugot,
Daniel Vanderpooten:
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem.
WEA 2007: 406-419 |
| 18 | EE | Cristina Bazgan,
Zsolt Tuza,
Daniel Vanderpooten:
Efficient algorithms for decomposing graphs under degree constraints.
Discrete Applied Mathematics 155(8): 979-988 (2007) |
| 17 | EE | 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) |
| 2006 |
|---|
| 16 | EE | Hassene Aissi,
Cristina Bazgan,
Daniel Vanderpooten:
Approximating Min-Max (Regret) Versions of Some Polynomial Problems.
COCOON 2006: 428-438 |
| 15 | EE | Marie-Jo Bellosta,
Sylvie Kornman,
Daniel Vanderpooten:
An Agent-Based Mechanism for Autonomous Multiple Criteria Auctions.
IAT 2006: 587-594 |
| 14 | EE | Mohamed Farah,
Daniel Vanderpooten:
A Multiple Criteria Approach for Information Retrieval.
SPIRE 2006: 242-254 |
| 13 | EE | Cristina Bazgan,
Zsolt Tuza,
Daniel Vanderpooten:
The satisfactory partition problem.
Discrete Applied Mathematics 154(8): 1236-1245 (2006) |
| 12 | EE | Cristina Bazgan,
Zsolt Tuza,
Daniel Vanderpooten:
Degree-constrained decompositions of graphs: Bounded treewidth and planarity.
Theor. Comput. Sci. 355(3): 389-395 (2006) |
| 2005 |
|---|
| 11 | EE | Cristina Bazgan,
Zsolt Tuza,
Daniel Vanderpooten:
Complexity and Approximation of Satisfactory Partition Problems.
COCOON 2005: 829-838 |
| 10 | EE | Hassene Aissi,
Cristina Bazgan,
Daniel Vanderpooten:
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.
ESA 2005: 862-873 |
| 9 | EE | Marie-Jo Bellosta,
Sylvie Kornman,
Daniel Vanderpooten:
A framework for multiple criteria English reverse auctions.
IAT 2005: 633-639 |
| 8 | EE | Hassene Aissi,
Cristina Bazgan,
Daniel Vanderpooten:
Complexity of the Min-Max (Regret) Versions of Cut Problems.
ISAAC 2005: 789-798 |
| 7 | EE | 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) |
| 2004 |
|---|
| 6 | EE | Marie-Jo Bellosta,
Imène Brigui,
Sylvie Kornman,
Daniel Vanderpooten:
A multi-criteria model for electronic auctions.
SAC 2004: 759-765 |
| 2003 |
|---|
| 5 | EE | Cristina Bazgan,
Zsolt Tuza,
Daniel Vanderpooten:
On the Existence and Determination of Satisfactory Partitions in a Graph.
ISAAC 2003: 444-453 |
| 4 | EE | 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) |
| 2001 |
|---|
| 3 | | Jerzy Stefanowski,
Daniel Vanderpooten:
Induction of decision rules in classification and discovery-oriented perspectives.
Int. J. Intell. Syst. 16(1): 13-27 (2001) |
| 2000 |
|---|
| 2 | EE | Roman Slowinski,
Daniel Vanderpooten:
A Generalized Definition of Rough Approximations Based on Similarity.
IEEE Trans. Knowl. Data Eng. 12(2): 331-336 (2000) |
| 1993 |
|---|
| 1 | | Jerzy Stefanowski,
Daniel Vanderpooten:
A General Two-Stage Approach to Inducing Rules from Examples.
RSKD 1993: 317-325 |
