Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Ageev, Alexandr - Sobolev Institute of Mathematics, Russian Academy of Sciences, Novosibirsk
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of
A WellBehaved Extension of the Vertex Covering Problem
Vertex Set Partitions Preserving Conservativeness A. A. Ageev
Every Circle Graph of Girth at Least 5 is 3Colourable A. A. Ageev \Lambda
An Approximation Scheme for the Uncapacitated Facility Location Problem on Planar Graphs
Sierpinski's Theorem is Deducible from Euler and Dirichlet
Complexity of the Network Median Problem A. A. Ageev
Complexity of Finding a Join of Maximum A. A. Ageev 1
ON FINDING CRITICAL INDEPENDENT AND VERTEX SETS ALEXANDER A. AGEEV
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs ?
Siberian Mathematical Journal, Vol. 35, No. 3, 1994 DOMINATING SETS AND HAMILTONICITY
A 0.5-APPROXIMATION ALGORITHM FOR MAX DICUT WITH GIVEN SIZES OF PARTS
An 0.828Approximation Algorithm for the Uncapacitated Facility Location Problem \Lambda
A Characterization of Seymour Graphs A. A. Ageev A. V. Kostochka Z. Szigeti y