1. An s-t connection problem with adaptability;Adjiashvili;Discrete Appl Math,2011
2. Bulk-robust combinatorial optimization;Adjiashvili;Math Program,2015
3. Adjiashvili D, Bindewald V, Michaels D (2016) Robust assignments via ear decompositions and randomized rounding. In: Chatzigiannakis I, Mitzenmacher M, Rabani Y, Sangiorgi D (eds) 43rd international colloquium on automata, languages, and programming (ICALP 2016). Leibniz international proceedings in informatics (LIPIcs), vol 55. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 71:1–71:14. 10.4230/LIPIcs.ICALP.2016.71
4. Adjiashvili D, Bindewald V, Michaels D (2017) Robust assignments with vulnerable nodes. Technical report. http://arxiv.org/abs/1703.06074
5. Aissi H, Bazgan C, Vanderpooten D (2005a) Approximation complexity of min–max (regret) versions of shortest path, spanning tree, and knapsack. In: Algorithms—ESA 2005. Lecture notes in computer science, vol 3669. Springer, Berlin, pp 862–873