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

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

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

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

Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. - Hassene Aissi (4OR, 2006)

Approximation of min-max and min-max regret versions of some combinatorial optimization problems. - Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten (Eur. J. Oper. Res., 2007)

Complexity of the min-max (regret) versions of min cut problems. - Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten (Discret. Optim., 2008)

Min-max and min-max regret versions of combinatorial optimization problems: A survey. - Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten (Eur. J. Oper. Res., 2009)

Robustness in Multi-criteria Decision Aiding. - Hassene Aissi; Bernard Roy (Trends in Multiple Criteria Decision Analysis, 2010)

General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. - Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten (Discret. Optim., 2010)

Minimizing the number of late jobs on a single machine under due date uncertainty. - Hassene Aissi; Mohamed Ali Aloulou; Mikhail Y. Kovalyov (J. Sched., 2011)

A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts. - Hassene Aissi; Ali Ridha Mahjoub; S. Thomas McCormick; Maurice Queyranne (IPCO, 2014)

Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. - Hassene Aissi; Ali Ridha Mahjoub; S. Thomas McCormick; Maurice Queyranne (Math. Program., 2015)

Robust capacity expansion of a network under demand uncertainty: A bi-objective approach. - Hassene Aissi; Daniel Vanderpooten (Networks, 2016)

Randomized Contractions for Multiobjective Minimum Cuts. - Hassene Aissi; Ali Ridha Mahjoub; R. Ravi 001 (ESA, 2017)

Weighted sum model with partial preference information: Application to multi-objective optimization. - Sami Kaddani; Daniel Vanderpooten; Jean Michel Vanpeperstraete; Hassene Aissi (Eur. J. Oper. Res., 2017)

Downgrading to Minimize Connectivity. - Hassene Aissi; Da Qi Chen; R. Ravi 001 (CoRR, 2019)

Faster Algorithms for Parametric Global Minimum Cut Problems. - Hassene Aissi; S. Thomas McCormick; Maurice Queyranne (CoRR, 2019)

Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts. - Hassene Aissi; S. Thomas McCormick; Maurice Queyranne (IPCO, 2020)

On the Linear Relaxation of the s-t-cut Problem with Budget Constraints. - Hassene Aissi; Ali Ridha Mahjoub (ISCO, 2020)

Unit Perturbations in Budgeted Spanning Tree Problems. - Hassene Aissi; Solal Attias; Da Qi Chen; R. Ravi 001 (CoRR, 2022)

Vertex downgrading to minimize connectivity. - Hassene Aissi; Da Qi Chen; R. Ravi 001 (Math. Program., 2023)

On the minimum s-t cut problem with budget constraints. - Hassene Aissi; Ali Ridha Mahjoub (Math. Program., 2024)

New bounds for the number of lightest cycles in undirected graphs. - Hassene Aissi; Mourad Baïou; Francisco Barahona (Inf. Process. Lett., 2025)