( en | de | ru )

 

Disambiguation of "Aissi, Hassene"

Author of the publication

copydeleteadd this publication to your clipboard
Vertex Downgrading to Minimize Connectivity.

, , and . SWAT, volume 162 of LIPIcs, page 5:1-5:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anass Aïssi

 

Other publications of authors with the same name

Min-max and min-max regret versions of combinatorial optimization problems: A survey., , and . Eur. J. Oper. Res., 197 (2): 427-438 (2009)Complexity of the Min-Max (Regret) Versions of Cut Problems., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 789-798. Springer, (2005)Vertex Downgrading to Minimize Connectivity., , and . SWAT, volume 162 of LIPIcs, page 5:1-5:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Approximation of min-max and min-max regret versions of some combinatorial optimization problems., , and . Eur. J. Oper. Res., 179 (2): 281-290 (2007)Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack., , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 862-873. Springer, (2005)Robustness in Multi-criteria Decision Aiding., and . Trends in Multiple Criteria Decision Analysis, Springer, (2010)Randomized Contractions for Multiobjective Minimum Cuts., , and . ESA, volume 87 of LIPIcs, page 6:1-6:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts., , and . IPCO, volume 12125 of Lecture Notes in Computer Science, page 27-39. Springer, (2020)Approximating Min-Max (Regret) Versions of Some Polynomial Problems., , and . COCOON, volume 4112 of Lecture Notes in Computer Science, page 428-438. Springer, (2006)On the Linear Relaxation of the s-t-cut Problem with Budget Constraints., and . ISCO, volume 12176 of Lecture Notes in Computer Science, page 81-88. Springer, (2020)