Polynomially Solvable Cases of the Simple Plant Location Problem. - Alexander A. Ageev; Vladimir L. Beresnev (IPCO, 1990)

A Criterion of Polynomial-Time Solvability for the Network Location Problem. - Alexander A. Ageev (IPCO, 1992)

On Finding Critical Independent and Vertex Sets. - Alexander A. Ageev (SIAM J. Discret. Math., 1994)

A triangle-free circle graph with chromatic number 5. - Alexander A. Ageev (Discret. Math., 1996)

A characterization of Seymour graphs. - Alexander A. Ageev; Alexandr V. Kostochka; Zoltán Szigeti (J. Graph Theory, 1997)

On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs. - Alexander A. Ageev (ESA, 1999)

Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. - Alexander A. Ageev; Maxim Sviridenko (IPCO, 1999)

An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem. - Alexander A. Ageev; Maxim Sviridenko (Discret. Appl. Math., 1999)

Every circle graph of girth at least 5 is 3-colourable. - Alexander A. Ageev (Discret. Math., 1999)

An approximation algorithm for MAX DICUT with given sizes of parts. - Alexander A. Ageev; Refael Hassin; Maxim Sviridenko (APPROX, 2000)

An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts. - Alexander A. Ageev; Maxim Sviridenko (ESA, 2000)

Vertex Set Partitions Preserving Conservativeness. - Alexander A. Ageev; Alexandr V. Kostochka (J. Comb. Theory B, 2000)

Complexity of finding a join of maximum weight. - Alexander A. Ageev (Discret. Appl. Math., 2001)

A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. - Alexander A. Ageev; Refael Hassin; Maxim Sviridenko (SIAM J. Discret. Math., 2001)

Improved approximation algorithms for multilevel facility location problems. - Alexander A. Ageev (Oper. Res. Lett., 2002)

Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. - Alexander A. Ageev; Yinyu Ye 001; Jiawei Zhang 006 (ICALP, 2003)

Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. - Alexander A. Ageev; Maxim Sviridenko (J. Comb. Optim., 2004)

Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. - Alexander A. Ageev; Yinyu Ye 001; Jiawei Zhang 006 (SIAM J. Discret. Math., 2004)

Approximation Algorithms for Scheduling Problems with Exact Delays. - Alexander A. Ageev; Alexander V. Kononov (WAOA, 2006)

Open block scheduling in optical communication networks. - Alexander A. Ageev; Aleksei V. Fishkin; Alexander V. Kononov; Sergey V. Sevastianov (Theor. Comput. Sci., 2006)

A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays. - Alexander A. Ageev (WAOA, 2007)

A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. - Alexander A. Ageev; Artem V. Pyatkin (WAOA, 2007)

Approximation algorithms for UET scheduling problems with exact delays. - Alexander A. Ageev; Alexei E. Baburin (Oper. Res. Lett., 2007)

An Excluded Minor Characterization of Seymour Graphs. - Alexander A. Ageev; Yohann Benchetrit; András Sebö; Zoltán Szigeti (IPCO, 2011)

Improved Approximations for the Max k-Colored Clustering Problem. - Alexander A. Ageev; Alexander V. Kononov (WAOA, 2014)

Constant-Factor Approximations for Cycle Cover Problems. - Alexander A. Ageev (DOOR, 2016)

Approximating Two-Machine Flow Shop Problem with Delays When Processing Times Depend Only on Machines. - Alexander A. Ageev; Alexei E. Baburin (DOOR (Supplement), 2016)

Approximating Coupled-Task Scheduling Problems with Equal Exact Delays. - Alexander A. Ageev; Mikhail Ivanov (DOOR, 2016)

An Improved Approximation Algorithm for the Coupled-Task Scheduling Problem with Equal Exact Delays. - Alexander A. Ageev; Mikhail Ivanov (MOTOR, 2020)

Approximating the 2-machine flow shop problem with exact delays taking two values. - Alexander A. Ageev (J. Glob. Optim., 2020)

How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs. - Alexander A. Ageev; Edward Gimadi; Alexandr A. Shtepa (AIST, 2021)