The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Alexander A. Ageev" ( http://dblp.L3S.de/Authors/Alexander_A._Ageev )

URL (Homepage):  http://www.math.nsc.ru/LBRT/k5/AgeevEng.html  Author page on DBLP  Author page in RDF  Community of Alexander A. Ageev in ASPL-2

Publication years (Num. hits)
1990-2002 (16) 2003-2011 (10)
Publication types (Num. hits)
article(12) inproceedings(14)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords

Results
Found 26 publication records. Showing 26 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti An Excluded Minor Characterization of Seymour Graphs. Search on Bibsonomy IPCO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Alexei E. Baburin Approximation algorithms for UET scheduling problems with exact delays. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Artem V. Pyatkin A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. Search on Bibsonomy WAOA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays. Search on Bibsonomy WAOA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov Open block scheduling in optical communication networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Alexander V. Kononov Approximation Algorithms for Scheduling Problems with Exact Delays. Search on Bibsonomy WAOA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Maxim Sviridenko Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF rounding technique, maximum coverage, approximation algorithm, performance guarantee, max cut, linear relaxation
1Alexander A. Ageev, Yinyu Ye, Jiawei Zhang Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Yinyu Ye, Jiawei Zhang Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov Open Block Scheduling in Optical Communication Networks. Search on Bibsonomy WAOA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev Improved approximation algorithms for multilevel facility location problems. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev Improved Approximation Algorithms for Multilevel Facility Location Problems. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Refael Hassin, Maxim Sviridenko A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev Complexity of finding a join of maximum weight. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Alexandr V. Kostochka Vertex Set Partitions Preserving Conservativeness. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Maxim Sviridenko An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts. Search on Bibsonomy ESA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Refael Hassin, Maxim Sviridenko An approximation algorithm for MAX DICUT with given sizes of parts. Search on Bibsonomy APPROX The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev Every circle graph of girth at least 5 is 3-colourable. Search on Bibsonomy Discrete Mathematics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Maxim Sviridenko An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs. Search on Bibsonomy ESA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Maxim Sviridenko Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. Search on Bibsonomy IPCO The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev A triangle-free circle graph with chromatic number 5. Search on Bibsonomy Discrete Mathematics The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti A Characterization of Seymour Graphs. Search on Bibsonomy IPCO The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev On Finding Critical Independent and Vertex Sets. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Alexander A. Ageev A Criterion of Polynomial-Time Solvability for the Network Location Problem. Search on Bibsonomy IPCO The full citation details ... 1992 DBLP  BibTeX  RDF
1Alexander A. Ageev, Vladimir L. Beresnev Polynomially Solvable Cases of the Simple Plant Location Problem. Search on Bibsonomy IPCO The full citation details ... 1990 DBLP  BibTeX  RDF
Displaying result #1 - #26 of 26 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.