The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Alexander A. Ageev: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  23. A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. [Citation Graph (, )][DBLP]


  24. A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.303secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002