default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander V. Kononov
Alexandr V. Kononov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j39]Alexander V. Kononov
, Marina Pakulich:
An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements. J. Comb. Optim. 47(3): 45 (2024)- [j38]Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
An exact solution with an improved running time for the routing flow shop problem with two machines. J. Sched. 27(4): 329-340 (2024) - 2023
- [c35]Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Non-Clairvoyant Makespan Minimization Scheduling with Predictions. ISAAC 2023: 9:1-9:15 - [c34]Alexander V. Kononov, Victor P. Il'ev:
On Cluster Editing Problem with Clusters of Small Sizes. OPTIMA 2023: 316-328 - 2022
- [j37]Alexander V. Kononov, Irina N. Lushchakova:
Cost-aware scheduling on uniform parallel machines. Comput. Ind. Eng. 167: 107845 (2022) - [j36]Alexander V. Kononov, Julia Memar, Yakov Zinder:
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements. J. Glob. Optim. 83(3): 445-456 (2022) - [j35]Alexander V. Kononov, Yulia V. Zakharova:
Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion. J. Glob. Optim. 83(3): 539-564 (2022) - [j34]Panos M. Pardalos, Alexander V. Kononov, Vladimir V. Mazalov:
Preface to the special issue dedicated to the International Conference "Mathematical optimization theory and Operations Research" (MOTOR 2020) held online from July 6 to July 10, 2020. Optim. Lett. 16(7): 1969-1970 (2022) - [j33]Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Alexander V. Kononov, Kim Thang Nguyen:
A simple rounding scheme for multistage optimization. Theor. Comput. Sci. 907: 1-10 (2022) - [c33]Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Scheduling with Untrusted Predictions. IJCAI 2022: 4581-4587 - 2021
- [j32]Yakov Zinder, Alexandr V. Kononov, Joey Fung:
A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements. J. Comb. Optim. 42(2): 276-309 (2021) - [j31]Joanna Berlinska, Alexander V. Kononov, Yakov Zinder:
Two-machine flow shop with dynamic storage space. Optim. Lett. 15(7): 2433-2454 (2021) - [c32]Alexander V. Kononov, Julia Memar, Yakov Zinder:
Algorithms for Flow Shop with Job-Dependent Buffer Requirements. MCO 2021: 63-74 - [c31]Alexander V. Kononov, Yulia V. Kovalenko:
Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint. MOTOR 2021: 267-279 - [c30]Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Speed Scaling with Explorable Uncertainty. SPAA 2021: 83-93 - 2020
- [j30]Alexander V. Kononov, Polina A. Kononova, Alexander Gordeev:
Branch-and-bound approach for optima localization in scheduling multiprocessor jobs. Int. Trans. Oper. Res. 27(1): 381-393 (2020) - [j29]Alexander V. Kononov, Alexander S. Strekalovsky, Mikhail Posypkin, Artem V. Pyatkin:
Preface. J. Glob. Optim. 76(3): 453-454 (2020) - [j28]Alexander V. Kononov, Yulia V. Kovalenko:
Approximation algorithms for energy-efficient scheduling of parallel jobs. J. Sched. 23(6): 693-709 (2020) - [c29]Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Scheduling Malleable Jobs Under Topological Constraints. IPDPS 2020: 316-325 - [c28]Alexander V. Kononov, Yulia V. Kovalenko:
Makespan Minimization for Parallel Jobs with Energy Constraint. MOTOR 2020: 289-300 - [c27]Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes. MOTOR 2020: 301-312 - [c26]Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov:
LP-Based Algorithms for Multistage Minimization Problems. WAOA 2020: 1-15 - [e2]Alexander V. Kononov, Michael Yu. Khachay, Valeriy A. Kalyagin, Panos M. Pardalos:
Mathematical Optimization Theory and Operations Research - 19th International Conference, MOTOR 2020, Novosibirsk, Russia, July 6-10, 2020, Proceedings. Lecture Notes in Computer Science 12095, Springer 2020, ISBN 978-3-030-49987-7 [contents] - [i5]Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes. CoRR abs/2004.03942 (2020)
2010 – 2019
- 2019
- [j27]Alexander V. Kononov, Mikhail Y. Kovalyov, Bertrand M. T. Lin:
Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax. Theor. Comput. Sci. 793: 70-78 (2019) - [c25]Yousef M. Alhamdan, Alexander V. Kononov:
Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem. CSR 2019: 1-12 - [c24]Alexander V. Kononov, Julia Memar, Yakov Zinder:
Flow Shop with Job-Dependent Buffer Requirements - a Polynomial-Time Algorithm and Efficient Heuristics. MOTOR 2019: 342-357 - [c23]Joanna Berlinska, Alexander V. Kononov, Yakov Zinder:
Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations. WCGO 2019: 1139-1148 - [i4]Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov:
LP-based algorithms for multistage minimization problems. CoRR abs/1909.10354 (2019) - 2018
- [j26]Hanyu Gu, Alexander V. Kononov, Julia Memar, Yakov Zinder:
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J. Discrete Algorithms 52-53: 143-155 (2018) - [j25]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy-efficient scheduling and routing via randomized rounding. J. Sched. 21(1): 35-51 (2018) - [c22]Luciana Arantes, Evripidis Bampis, Alexander V. Kononov, Manthos Letsios, Giorgio Lucarelli, Pierre Sens:
Scheduling under Uncertainty: A Query-based Approach. IJCAI 2018: 4646-4652 - [i3]Alexander V. Kononov, Yulia V. Kovalenko:
Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems. CoRR abs/1811.11595 (2018) - 2017
- [c21]Alexander V. Kononov, Yulia V. Kovalenko:
An Approximation Algorithm for Preemptive Speed Scaling Scheduling of Parallel Jobs with Migration. LION 2017: 351-357 - 2016
- [j24]Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos:
Clustering on k-edge-colored graphs. Discret. Appl. Math. 211: 15-22 (2016) - [j23]Aldar Dugarzhapov, Alexander V. Kononov:
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job. J. Sched. 19(1): 61-72 (2016) - [j22]Bertrand M. T. Lin, F. J. Hwang, Alexander V. Kononov:
Relocation scheduling subject to fixed processing sequences. J. Sched. 19(2): 153-163 (2016) - [c20]Victor P. Il'ev, Svetlana Il'eva, Alexander V. Kononov:
Short Survey on Graph Correlation Clustering with Minimization Criteria. DOOR 2016: 25-36 - [c19]Alexander V. Kononov, Yulia V. Kovalenko:
On Speed Scaling Scheduling of Parallel Jobs with Preemption. DOOR 2016: 309-321 - [c18]Alexander V. Kononov, Irina N. Lushchakova:
Scheduling of Two Parallel Machines with Linear Decreasing Time Slot Costs to Minimize Total Weighted Completion Time. DOOR (Supplement) 2016: 344-349 - [c17]Alexander Gordeev, Alexander V. Kononov, Polina A. Kononova:
Optima Localization in Scheduling Multi-Processor Jobs. DOOR (Supplement) 2016: 350-357 - [e1]Alexander V. Kononov, Igor A. Bykadorov, Oleg V. Khamisov, Ivan A. Davydov, Polina A. Kononova:
Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19 - 23, 2016. CEUR Workshop Proceedings 1623, CEUR-WS.org 2016 [contents] - 2015
- [j21]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Nemparis:
From preemptive to non-preemptive speed-scaling scheduling. Discret. Appl. Math. 181: 11-20 (2015) - [j20]Alexander V. Kononov, Bertrand M. T. Lin, Kuei-Tang Fang:
Single-machine scheduling with supporting tasks. Discret. Optim. 17: 69-79 (2015) - [j19]Alexander V. Kononov:
O(log m)-approximation for the routing open shop problem. RAIRO Oper. Res. 49(2): 383-391 (2015) - [c16]Eric Angel, Evripidis Bampis, Vincent Chau, Alexander V. Kononov:
Min-Power Covering Problems. ISAAC 2015: 367-377 - 2014
- [j18]Stanislaw Gawiejnowicz, Alexander V. Kononov:
Isomorphic scheduling problems. Ann. Oper. Res. 213(1): 131-145 (2014) - [j17]Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis:
Bounded max-colorings of graphs. J. Discrete Algorithms 26: 56-68 (2014) - [c15]Alexander A. Ageev, Alexander V. Kononov:
Improved Approximations for the Max k-Colored Clustering Problem. WAOA 2014: 1-10 - [i2]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy Efficient Scheduling and Routing via Randomized Rounding. CoRR abs/1403.4991 (2014) - 2013
- [j16]Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
Efficient approximation algorithms for the routing open shop problem. Comput. Oper. Res. 40(3): 841-847 (2013) - [c14]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Nemparis:
From Preemptive to Non-preemptive Speed-Scaling Scheduling. COCOON 2013: 134-146 - [c13]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy Efficient Scheduling and Routing via Randomized Rounding. FSTTCS 2013: 449-460 - [c12]Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos:
Clustering on k-Edge-Colored Graphs. MFCS 2013: 50-61 - 2012
- [j15]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40(6): 440-444 (2012) - [j14]Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko:
A Complete 4-parametric complexity classification of short shop scheduling problems. J. Sched. 15(4): 427-446 (2012) - [j13]Alexander V. Kononov, Jen-Shin Hong, Polina A. Kononova, Feng-Cheng Lin:
Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications. J. Sched. 15(4): 487-497 (2012) - 2011
- [j12]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Properties of optimal schedules in preemptive shop scheduling. Discret. Appl. Math. 159(5): 272-280 (2011) - 2010
- [j11]Stanislaw Gawiejnowicz, Alexander V. Kononov:
Complexity and approximability of scheduling resumable proportionally deteriorating jobs. Eur. J. Oper. Res. 200(1): 305-308 (2010) - [j10]Alexander V. Kononov, Bertrand M. T. Lin:
Minimizing the total weighted completion time in the relocation problem. J. Sched. 13(2): 123-129 (2010) - [c11]Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis:
Bounded Max-colorings of Graphs. ISAAC (1) 2010: 353-365
2000 – 2009
- 2009
- [c10]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Integrality Property in Preemptive Parallel Machine Scheduling. CSR 2009: 38-46 - [c9]Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko:
Complete Complexity Classification of Short Shop Scheduling. CSR 2009: 227-236 - [c8]Ilya Chernykh, Nikita Dryuck, Alexander V. Kononov, Sergey Sevastyanov:
The Routing Open Shop Problem: New Approximation Algorithms. WAOA 2009: 75-85 - [i1]Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis:
Bounded Max-Colorings of Graphs. CoRR abs/0904.1705 (2009) - 2007
- [j9]Bertrand M. T. Lin, Alexander V. Kononov:
Customer order scheduling to minimize the number of late jobs. Eur. J. Oper. Res. 183(2): 944-948 (2007) - [c7]Binay K. Bhattacharya, Yuzhuang Hu, Alexander V. Kononov:
Approximation Algorithms for the Black and White Traveling Salesman Problem. COCOON 2007: 559-567 - 2006
- [j8]Alexander V. Kononov, Bertrand M. T. Lin:
On relocation problems with multiple identical working crews. Discret. Optim. 3(4): 366-381 (2006) - [j7]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) - [c6]Alexander A. Ageev, Alexander V. Kononov:
Approximation Algorithms for Scheduling Problems with Exact Delays. WAOA 2006: 1-14 - 2005
- [j6]Evripidis Bampis, Alexander V. Kononov:
Bicriteria approximation algorithms for scheduling problems with communications delays. J. Sched. 8(4): 281-294 (2005) - 2004
- [j5]Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov:
Scheduling Tasks with Small Communication Delays for Clusters of Processors. Ann. Oper. Res. 129(1-4): 47-63 (2004) - 2003
- [j4]Eric Angel, Evripidis Bampis, Alexander V. Kononov:
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theor. Comput. Sci. 306(1-3): 319-338 (2003) - [c5]Evripidis Bampis, Alexander V. Kononov:
Bicriteria approximation algorithms for scheduling problems with communications. SPAA 2003: 252-253 - [c4]Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov:
Open Block Scheduling in Optical Communication Networks. WAOA 2003: 13-26 - 2002
- [j3]Alexander V. Kononov, Maxim Sviridenko:
A linear time approximation scheme for makespan minimization in an open shop with release dates. Oper. Res. Lett. 30(4): 276-280 (2002) - 2001
- [j2]Alexander V. Kononov, Stanislaw Gawiejnowicz:
NP-hard cases in scheduling deteriorating jobs on dedicated machines. J. Oper. Res. Soc. 52(6): 708-717 (2001) - [c3]Eric Angel, Evripidis Bampis, Alexander V. Kononov:
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. ESA 2001: 194-205 - [c2]Evripidis Bampis, Alexander V. Kononov:
On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements. IPDPS 2001: 200 - [c1]Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov:
Scheduling tasks with small communication delays for clusters of processors. SPAA 2001: 314-315
1990 – 1999
- 1999
- [j1]Alexander V. Kononov, Sergey V. Sevastianov, I. D. Tchernykh:
When difference in machine loads leadsto efficient scheduling in open shops. Ann. Oper. Res. 92: 211-239 (1999)
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 2024-08-23 19:28 CEST 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:
