Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman et Shang-Hua Teng, « Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs », Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC, , p. 273-282 (DOI10.1145/1993636.1993674)
Aleksander Madry, « Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back », 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS, , p. 253–262 (DOI10.1109/FOCS.2013.35)
Sébastien Bubeck, Michael B. Cohen, Yin Tat Lee, James R. Lee et Aleksander Mądry, « k-server via multiscale entropic regularization », Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC, , p. 3–16 (DOI10.1145/3188745.3188798)
Arash Asadpour, Michel X. Goemans, Aleksander Mądry, Shayan Oveis Gharan et Amin Saberi, « An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem », Operations Research, vol. 65, no 4, , p. 1043–1061 (ISSN0030-364X, DOI10.1287/opre.2017.1603).
N. Bansal, N. Buchbinder, A. Madry et J. Naor, « A Polylogarithmic-Competitive Algorithm for the k-Server Problem », IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS, , p. 267–276 (DOI10.1109/FOCS.2011.63).
Arash Asadpour, Michel X. Goemans, Aleksander Mądry, Shayan Oveis Gharan et Amin Saberi, « AnO(logn/log logn)-approximation Algorithm for the Asymmetric Traveling Salesman Problem », Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, , p. 379–389 (DOI10.1137/1.9781611973075.32)
Arash Asadpour, Michel X. Goemans, Aleksander Mądry, Shayan Oveis Gharan et Amin Saberi, « An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem », Operations Research, vol. 65, no 4, , p. 1043–1061 (ISSN0030-364X, DOI10.1287/opre.2017.1603).
