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