default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander A. Ageev
Person information
- affiliation: Sobolev Institute of Mathematics, Novosibirsk, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c20]Alexander A. Ageev
, Edward Gimadi, Alexandr A. Shtepa:
How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs. AIST 2021: 303-314- 2020
- [j14]Alexander A. Ageev:
Approximating the 2-machine flow shop problem with exact delays taking two values. J. Glob. Optim. 76(3): 491-497 (2020) - [c19]Alexander A. Ageev, Mikhail Ivanov:
An Improved Approximation Algorithm for the Coupled-Task Scheduling Problem with Equal Exact Delays. MOTOR 2020: 265-273
2010 – 2019
- 2017
- [i1]Alexander A. Ageev:
Approximating the 2-Machine Flow Shop Problem with Exact Delays Taking Two Values. CoRR abs/1711.00081 (2017) - 2016
- [c18]Alexander A. Ageev:
Constant-Factor Approximations for Cycle Cover Problems. DOOR 2016: 93-104 - [c17]Alexander A. Ageev, Mikhail Ivanov:
Approximating Coupled-Task Scheduling Problems with Equal Exact Delays. DOOR 2016: 259-271 - [c16]Alexander A. Ageev, Alexei E. Baburin:
Approximating Two-Machine Flow Shop Problem with Delays When Processing Times Depend Only on Machines. DOOR (Supplement) 2016: 325-335 - 2014
- [c15]Alexander A. Ageev, Alexander V. Kononov:
Improved Approximations for the Max k-Colored Clustering Problem. WAOA 2014: 1-10 - 2011
- [c14]Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti:
An Excluded Minor Characterization of Seymour Graphs. IPCO 2011: 1-13
2000 – 2009
- 2007
- [j13]Alexander A. Ageev, Alexei E. Baburin:
Approximation algorithms for UET scheduling problems with exact delays. Oper. Res. Lett. 35(4): 533-540 (2007) - [c13]Alexander A. Ageev:
A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays. WAOA 2007: 55-66 - [c12]Alexander A. Ageev, Artem V. Pyatkin:
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. WAOA 2007: 103-115 - 2006
- [j12]Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov:
Open block scheduling in optical communication networks. Theor. Comput. Sci. 361(2-3): 257-274 (2006) - [c11]Alexander A. Ageev, Alexander V. Kononov:
Approximation Algorithms for Scheduling Problems with Exact Delays. WAOA 2006: 1-14 - 2004
- [j11]Alexander A. Ageev, Maxim Sviridenko:
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. J. Comb. Optim. 8(3): 307-328 (2004) - [j10]Alexander A. Ageev, Yinyu Ye, Jiawei Zhang:
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. SIAM J. Discret. Math. 18(1): 207-217 (2004) - 2003
- [c10]Alexander A. Ageev, Yinyu Ye, Jiawei Zhang:
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. ICALP 2003: 145-156 - [c9]Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov:
Open Block Scheduling in Optical Communication Networks. WAOA 2003: 13-26 - 2002
- [j9]Alexander A. Ageev:
Improved approximation algorithms for multilevel facility location problems. Oper. Res. Lett. 30(5): 327-332 (2002) - [c8]Alexander A. Ageev:
Improved Approximation Algorithms for Multilevel Facility Location Problems. APPROX 2002: 5-13 - 2001
- [j8]Alexander A. Ageev:
Complexity of finding a join of maximum weight. Discret. Appl. Math. 114(1-3): 3-7 (2001) - [j7]Alexander A. Ageev, Refael Hassin, Maxim Sviridenko:
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. SIAM J. Discret. Math. 14(2): 246-255 (2001) - 2000
- [j6]Alexander A. Ageev, Alexandr V. Kostochka:
Vertex Set Partitions Preserving Conservativeness. J. Comb. Theory B 80(2): 202-217 (2000) - [c7]Alexander A. Ageev, Refael Hassin, Maxim Sviridenko:
An approximation algorithm for MAX DICUT with given sizes of parts. APPROX 2000: 34-41 - [c6]Alexander A. Ageev, Maxim Sviridenko:
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts. ESA 2000: 32-41
1990 – 1999
- 1999
- [j5]Alexander A. Ageev, Maxim Sviridenko:
An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem. Discret. Appl. Math. 93(2-3): 149-156 (1999) - [j4]Alexander A. Ageev:
Every circle graph of girth at least 5 is 3-colourable. Discret. Math. 195(1-3): 229-233 (1999) - [c5]Alexander A. Ageev:
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs. ESA 1999: 490-497 - [c4]Alexander A. Ageev, Maxim Sviridenko:
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. IPCO 1999: 17-30 - 1997
- [j3]Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti:
A characterization of Seymour graphs. J. Graph Theory 24(4): 357-364 (1997) - 1996
- [j2]Alexander A. Ageev:
A triangle-free circle graph with chromatic number 5. Discret. Math. 152(1-3): 295-298 (1996) - 1995
- [c3]Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti:
A Characterization of Seymour Graphs. IPCO 1995: 364-372 - 1994
- [j1]Alexander A. Ageev:
On Finding Critical Independent and Vertex Sets. SIAM J. Discret. Math. 7(2): 293-295 (1994) - 1992
- [c2]Alexander A. Ageev:
A Criterion of Polynomial-Time Solvability for the Network Location Problem. IPCO 1992: 237-245 - 1990
- [c1]Alexander A. Ageev, Vladimir L. Beresnev:
Polynomially Solvable Cases of the Simple Plant Location Problem. IPCO 1990: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
