1. Adjiashvili, D.: Structural Robustness in Combinatorial Optimization. Ph.D. thesis, Zürich, Switzerland (2012)
2. Adjiashvili, D.: Fault-tolerant shortest paths-beyond the uniform failure model. arXiv:1301.6299 (2013, preprint)
3. Adjiashvili, D., Zenklusen, R.: An s-t connection problem with adaptability. Discret. Appl. Math. 159, 695–705 (2011)
4. Aissi, H., Bazgan, C., Vanderpooten, D.: Minmax and minmax regret versions of combinatorial optimization problems: a survey. Eur. J. Oper. Res. 197(2), 427–438 (2009)
5. Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, Giancarlo, Bovet, Daniel, Di Battista, Giuseppe (eds.) Algorithms and Complexity, Lecture Notes in Computer Science, vol. 1203, pp. 288–298. Springer, Berlin/Heidelberg (1997)