| 2007 |
|---|
| 25 | EE | Alexander A. Ageev,
Artem V. Pyatkin:
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem.
WAOA 2007: 103-115 |
| 24 | EE | Alexander A. Ageev:
A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays.
WAOA 2007: 55-66 |
| 23 | EE | Alexander A. Ageev,
Alexei E. Baburin:
Approximation algorithms for UET scheduling problems with exact delays.
Oper. Res. Lett. 35(4): 533-540 (2007) |
| 2006 |
|---|
| 22 | EE | Alexander A. Ageev,
Alexander V. Kononov:
Approximation Algorithms for Scheduling Problems with Exact Delays.
WAOA 2006: 1-14 |
| 21 | EE | Alexander A. Ageev,
Aleksei V. Fishkin,
Alexander V. Kononov,
Sergey V. Sevastianov:
Open block scheduling in optical communication networks.
Theor. Comput. Sci. 361(2-3): 257-274 (2006) |
| 2004 |
|---|
| 20 | EE | Alexander A. Ageev,
Maxim Sviridenko:
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee.
J. Comb. Optim. 8(3): 307-328 (2004) |
| 19 | EE | Alexander A. Ageev,
Yinyu Ye,
Jiawei Zhang:
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.
SIAM J. Discrete Math. 18(1): 207-217 (2004) |
| 2003 |
|---|
| 18 | EE | Alexander A. Ageev,
Yinyu Ye,
Jiawei Zhang:
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.
ICALP 2003: 145-156 |
| 17 | EE | Alexander A. Ageev,
Aleksei V. Fishkin,
Alexander V. Kononov,
Sergey V. Sevastianov:
Open Block Scheduling in Optical Communication Networks.
WAOA 2003: 13-26 |
| 2002 |
|---|
| 16 | EE | Alexander A. Ageev:
Improved Approximation Algorithms for Multilevel Facility Location Problems.
APPROX 2002: 5-13 |
| 15 | EE | Alexander A. Ageev:
Improved approximation algorithms for multilevel facility location problems.
Oper. Res. Lett. 30(5): 327-332 (2002) |
| 2001 |
|---|
| 14 | | Alexander A. Ageev:
Complexity of finding a join of maximum weight.
Discrete Applied Mathematics 114(1-3): 3-7 (2001) |
| 13 | EE | Alexander A. Ageev,
Refael Hassin,
Maxim Sviridenko:
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts.
SIAM J. Discrete Math. 14(2): 246-255 (2001) |
| 2000 |
|---|
| 12 | EE | Alexander A. Ageev,
Refael Hassin,
Maxim Sviridenko:
An approximation algorithm for MAX DICUT with given sizes of parts.
APPROX 2000: 34-41 |
| 11 | | Alexander A. Ageev,
Maxim Sviridenko:
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts.
ESA 2000: 32-41 |
| 10 | EE | Alexander A. Ageev,
Alexandr V. Kostochka:
Vertex Set Partitions Preserving Conservativeness.
J. Comb. Theory, Ser. B 80(2): 202-217 (2000) |
| 1999 |
|---|
| 9 | EE | Alexander A. Ageev:
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs.
ESA 1999: 490-497 |
| 8 | EE | Alexander A. Ageev,
Maxim Sviridenko:
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts.
IPCO 1999: 17-30 |
| 7 | EE | Alexander A. Ageev,
Maxim Sviridenko:
An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem.
Discrete Applied Mathematics 93(2-3): 149-156 (1999) |
| 6 | EE | Alexander A. Ageev:
Every circle graph of girth at least 5 is 3-colourable.
Discrete Mathematics 195(1-3): 229-233 (1999) |
| 1996 |
|---|
| 5 | EE | Alexander A. Ageev:
A triangle-free circle graph with chromatic number 5.
Discrete Mathematics 152(1-3): 295-298 (1996) |
| 1995 |
|---|
| 4 | | Alexander A. Ageev,
Alexandr V. Kostochka,
Zoltán Szigeti:
A Characterization of Seymour Graphs.
IPCO 1995: 364-372 |
| 1994 |
|---|
| 3 | EE | Alexander A. Ageev:
On Finding Critical Independent and Vertex Sets.
SIAM J. Discrete Math. 7(2): 293-295 (1994) |
| 1992 |
|---|
| 2 | | Alexander A. Ageev:
A Criterion of Polynomial-Time Solvability for the Network Location Problem.
IPCO 1992: 237-245 |
| 1990 |
|---|
| 1 | | Alexander A. Ageev,
Vladimir L. Beresnev:
Polynomially Solvable Cases of the Simple Plant Location Problem.
IPCO 1990: 1-6 |
