| 2021 | AIST | How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs. | Alexander A. Ageev, Edward Gimadi, Alexandr A. Shtepa |
| 2014 | WAOA | Improved Approximations for the Max k-Colored Clustering Problem. | Alexander A. Ageev, Alexander V. Kononov |
| 2011 | IPCO | An Excluded Minor Characterization of Seymour Graphs. | Alexander A. Ageev, Yohann Benchetrit, Andrs Seb, Zoltn Szigeti |
| 2007 | WAOA | A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays. | Alexander A. Ageev |
| 2007 | WAOA | A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. | Alexander A. Ageev, Artem V. Pyatkin |
| 2006 | WAOA | Approximation Algorithms for Scheduling Problems with Exact Delays. | Alexander A. Ageev, Alexander V. Kononov |
| 2003 | ICALP | Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. | Alexander A. Ageev, Yinyu Ye, Jiawei Zhang |
| 2003 | WAOA | Open Block Scheduling in Optical Communication Networks. | Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov |
| 2000 | ESA | An Approximation Algorithm for Hypergraph Max | Alexander A. Ageev, Maxim Sviridenko |
| 1999 | ESA | On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs. | Alexander A. Ageev |
| 1999 | IPCO | Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. | Alexander A. Ageev, Maxim Sviridenko |
| 1995 | IPCO | A Characterization of Seymour Graphs. | Alexander A. Ageev, Alexandr V. Kostochka, Zoltn Szigeti |
| 1992 | IPCO | A Criterion of Polynomial-Time Solvability for the Network Location Problem. | Alexander A. Ageev |
| 1990 | IPCO | Polynomially Solvable Cases of the Simple Plant Location Problem. | Alexander A. Ageev, Vladimir L. Beresnev |