Alexander A. Ageev

35 papers A* 1A 2B 10Misc 1Journal 15Unranked 6
YearRankTypeTitle / Venue / Authors
2021 Misc conf
How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs.
AIST
Alexander A. Ageev, Edward Gimadi, Alexandr A. Shtepa
2020 — conf
An Improved Approximation Algorithm for the Coupled-Task Scheduling Problem with Equal Exact Delays.
MOTOR
Alexander A. Ageev, Mikhail Ivanov
2020 J jnl
Approximating the 2-machine flow shop problem with exact delays taking two values.
J. Glob. Optim.
Alexander A. Ageev
2017 J jnl
Approximating the 2-Machine Flow Shop Problem with Exact Delays Taking Two Values.
CoRR
Alexander A. Ageev
2016 — conf
Approximating Coupled-Task Scheduling Problems with Equal Exact Delays.
DOOR
Alexander A. Ageev, Mikhail Ivanov
2016 — conf
Approximating Two-Machine Flow Shop Problem with Delays When Processing Times Depend Only on Machines.
DOOR (Supplement)
Alexander A. Ageev, Alexei E. Baburin
2016 — conf
Constant-Factor Approximations for Cycle Cover Problems.
DOOR
Alexander A. Ageev
2014 B conf
Improved Approximations for the Max k-Colored Clustering Problem.
WAOA
Alexander A. Ageev, Alexander V. Kononov
2011 B conf
An Excluded Minor Characterization of Seymour Graphs.
IPCO
Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti
2007 B conf
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem.
WAOA
Alexander A. Ageev, Artem V. Pyatkin
2007 B conf
A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays.
WAOA
Alexander A. Ageev
2007 J jnl
Approximation algorithms for UET scheduling problems with exact delays.
Oper. Res. Lett.
Alexander A. Ageev, Alexei E. Baburin
2006 B conf
Approximation Algorithms for Scheduling Problems with Exact Delays.
WAOA
Alexander A. Ageev, Alexander V. Kononov
2006 J jnl
Open block scheduling in optical communication networks.
Theor. Comput. Sci.
Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov
2004 J jnl
Improved Combinatorial Approximation Algorithms for the
SIAM J. Discret. Math.
Alexander A. Ageev, Yinyu Ye, Jiawei Zhang
2004 J jnl
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee.
J. Comb. Optim.
Alexander A. Ageev, Maxim Sviridenko
2003 A* conf
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.
ICALP
Alexander A. Ageev, Yinyu Ye, Jiawei Zhang
2003 B conf
Open Block Scheduling in Optical Communication Networks.
WAOA
Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov
2002 — conf
Improved Approximation Algorithms for Multilevel Facility Location Problems.
APPROX
Alexander A. Ageev
2002 J jnl
Improved approximation algorithms for multilevel facility location problems.
Oper. Res. Lett.
Alexander A. Ageev
2001 J jnl
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts.
SIAM J. Discret. Math.
Alexander A. Ageev, Refael Hassin, Maxim Sviridenko
2001 J jnl
Complexity of finding a join of maximum weight.
Discret. Appl. Math.
Alexander A. Ageev
2000 A conf
An Approximation Algorithm for Hypergraph Max
ESA
Alexander A. Ageev, Maxim Sviridenko
2000 — conf
An approximation algorithm for MAX DICUT with given sizes of parts.
APPROX
Alexander A. Ageev, Refael Hassin, Maxim Sviridenko
2000 J jnl
Vertex Set Partitions Preserving Conservativeness.
J. Comb. Theory B
Alexander A. Ageev, Alexandr V. Kostochka
1999 J jnl
An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem.
Discret. Appl. Math.
Alexander A. Ageev, Maxim Sviridenko
1999 B conf
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts.
IPCO
Alexander A. Ageev, Maxim Sviridenko
1999 J jnl
Every circle graph of girth at least 5 is 3-colourable.
Discret. Math.
Alexander A. Ageev
1999 A conf
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs.
ESA
Alexander A. Ageev
1997 J jnl
A characterization of Seymour graphs.
J. Graph Theory
Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti
1996 J jnl
A triangle-free circle graph with chromatic number 5.
Discret. Math.
Alexander A. Ageev
1995 B conf
A Characterization of Seymour Graphs.
IPCO
Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti
1994 J jnl
On Finding Critical Independent and Vertex Sets.
SIAM J. Discret. Math.
Alexander A. Ageev
1992 B conf
A Criterion of Polynomial-Time Solvability for the Network Location Problem.
IPCO
Alexander A. Ageev
1990 B conf
Polynomially Solvable Cases of the Simple Plant Location Problem.
IPCO
Alexander A. Ageev, Vladimir L. Beresnev