Alexander A. Ageev

Orcid: 0000-0002-3369-9650

Affiliations:
  • Sobolev Institute of Mathematics, Novosibirsk, Russia


According to our database1, Alexander A. Ageev authored at least 31 papers between 1990 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs.
Proceedings of the Analysis of Images, Social Networks and Texts, 2021

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

An Improved Approximation Algorithm for the Coupled-Task Scheduling Problem with Equal Exact Delays.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

2016
Approximating Coupled-Task Scheduling Problems with Equal Exact Delays.
Proceedings of the Discrete Optimization and Operations Research, 2016

Approximating Two-Machine Flow Shop Problem with Delays When Processing Times Depend Only on Machines.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

Constant-Factor Approximations for Cycle Cover Problems.
Proceedings of the Discrete Optimization and Operations Research, 2016

2014
Improved Approximations for the Max k-Colored Clustering Problem.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2011
An Excluded Minor Characterization of Seymour Graphs.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2007
Approximation algorithms for UET scheduling problems with exact delays.
Oper. Res. Lett., 2007

A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

2006
Open block scheduling in optical communication networks.
Theor. Comput. Sci., 2006

Approximation Algorithms for Scheduling Problems with Exact Delays.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

2004
Improved Combinatorial Approximation Algorithms for the <i>k</i>-Level Facility Location Problem.
SIAM J. Discret. Math., 2004

Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee.
J. Comb. Optim., 2004

2003
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Improved approximation algorithms for multilevel facility location problems.
Oper. Res. Lett., 2002

2001
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts.
SIAM J. Discret. Math., 2001

Complexity of finding a join of maximum weight.
Discret. Appl. Math., 2001

2000
Vertex Set Partitions Preserving Conservativeness.
J. Comb. Theory B, 2000

An Approximation Algorithm for Hypergraph Max <i>k</i>-Cut with Given Sizes of Parts.
Proceedings of the Algorithms, 2000

An approximation algorithm for MAX DICUT with given sizes of parts.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
Every circle graph of girth at least 5 is 3-colourable.
Discret. Math., 1999

An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem.
Discret. Appl. Math., 1999

Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs.
Proceedings of the Algorithms, 1999

1997
A characterization of Seymour graphs.
J. Graph Theory, 1997

1996
A triangle-free circle graph with chromatic number 5.
Discret. Math., 1996

1994
On Finding Critical Independent and Vertex Sets.
SIAM J. Discret. Math., 1994

1992
A Criterion of Polynomial-Time Solvability for the Network Location Problem.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1990
Polynomially Solvable Cases of the Simple Plant Location Problem.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990


  Loading...