Science activity
Articles (73) More info
| 1 |
Chernykh I.
, Kononov A.
, Sevastyanov S.
An exact solution with an improved running time for the routing flow shop problem with two machines Journal of Scheduling. 2024. V.27. N4. P.329–340. DOI: 10.1007/s10951-023-00784-8 WOS Scopus РИНЦ OpenAlex |
| 2 |
Kharchenko Y.
, Kononov A.
A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types In compilation Mathematical Optimization Theory and Operations Research : 23rd International Conference, MOTOR 2024, Omsk, Russia, June 30–July 6, 2024, Proceedings. – Springer Cham., 2024. – C.116-126. – ISBN 978-3-031-62792-7. DOI: 10.1007/978-3-031-62792-7_8 Scopus OpenAlex |
| 3 |
Kononov A.
, Pakulich M.
An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements Journal of Combinatorial Optimization. 2024. V.47. N3. 45 :1-15. DOI: 10.1007/s10878-024-01121-1 WOS Scopus РИНЦ OpenAlex |
| 4 |
Erzin A.I.
, Kononov A.V.
, Melidi G.E.
, Nazarenko S.A.
4/3 OPT+2/3 Approximation for Big Two-Bar Charts Packing Problem Journal of Mathematical Sciences (United States). 2023. V.269. N6. P.813-822. DOI: 10.1007/s10958-023-06319-y Scopus РИНЦ OpenAlex |
| 5 |
Kononov A.
, Il’ev V.P.
On Cluster Editing Problem with Clusters of Small Sizes In compilation Optimization and Applications : 14th International Conference, OPTIMA 2023, Petrovac, Montenegro, September 18–22, 2023, Revised Selected Papers. – Springer., 2023. – C.316-328. – ISBN 9783031478598. DOI: 10.1007/978-3-031-47859-8_23 Scopus OpenAlex |
| 6 |
Erzin A.
, Kononov A.
, Nazarenko S.
, Sharankhaev K.
An O(n\log n)-Time Algorithm for Linearly Ordered Packing of 2-Bar Charts into OPT+1 Bins In compilation Mathematical Optimization Theory and Operations Research: Recent Trends. – Springer., 2023. – Т.1881. – C.122-133. DOI: 10.1007/978-3-031-43257-6_10 Scopus OpenAlex |
| 7 |
Kononov A.
, Zakharova Y.
Speed Scaling Scheduling of Multiprocessor Jobs with Energy Constraint and Total Completion Time Criterion International Journal of Artificial Intelligence. 2023. V.21. N2. P.109 - 129. Scopus |
| 8 |
Kononov A.
, Zakharova Y.
Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion Journal of Global Optimization. 2022. V.83. N3. P.539-564. DOI: 10.1007/s10898-021-01115-x WOS Scopus РИНЦ OpenAlex |
| 9 |
Kononov A.
, Memar J.
, Zinder Y.
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements Journal of Global Optimization. 2022. V.83. N3. P.445-456. DOI: 10.1007/s10898-021-01097-w WOS Scopus РИНЦ OpenAlex |
| 10 |
Kononov A.
, Lushchakova I.
Cost-aware scheduling on uniform parallel machines Computers and Industrial Engineering. 2022. V.167. 107845 . DOI: 10.1016/j.cie.2021.107845 WOS Scopus РИНЦ OpenAlex |
| 11 |
Kononov A.
, Memar J.
, Zinder Y.
Algorithms for Flow Shop with Job–Dependent Buffer Requirements Lecture Notes in Networks and Systems. 2022. V.363 LNNS. P.63-74. DOI: 10.1007/978-3-030-92666-3_6 Scopus РИНЦ OpenAlex |
| 12 |
Bampis E.
, Dogeas K.
, Kononov A.
, Lucarelli G.
, Pascual F.
Scheduling with Untrusted Predictions In compilation Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22), Vienna, 23-29 July 2022. 2022. – C.4581-4587. – ISBN 9781956792003. DOI: 10.24963/ijcai.2022/636 Scopus OpenAlex |
| 13 |
Kononov A.
, Zakharova Y.
Minimizing makespan for parallelizable jobs with energy constraint Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2022. V.19. N2. P.586-600. DOI: 10.33048/semi.2022.19.049 WOS Scopus РИНЦ |
| 14 |
Bampis E.
, Christou D.
, Escoffier B.
, Kononov A.
, Nguyen K.T.
A simple rounding scheme for multistage optimization Theoretical Computer Science. 2022. V.907. P.1-10. DOI: 10.1016/j.tcs.2022.01.009 WOS Scopus РИНЦ OpenAlex |
| 15 |
Berlinska J.
, Kononov A.
, Zinder Y.
Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations Optimization Letters. 2021. N15. P.2433–2454. DOI: 10.1007/s11590-020-01645-5 WOS Scopus OpenAlex |
| 16 |
Zinder Y.
, Kononov A.
, Fung J.
A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements Journal of Combinatorial Optimization. 2021. V.42. N2. P.276-309. DOI: 10.1007/s10878-021-00706-4 WOS Scopus OpenAlex |
| 17 |
Bampis E.
, Dogeas K.
, Kononov A.
, Lucarelli G.
, Pascual F.
Speed scaling with explorable uncertainty In compilation SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. 2021. – C.83-93. DOI: 10.1145/3409964.3461812 Scopus OpenAlex |
| 18 |
Kononov A.
, Kovalenko Y.
Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint In compilation Lecture Notes in Computer Science. 2021. – Т.12755. – C.267-279. – ISBN 9783030778750. DOI: 10.1007/978-3-030-77876-7_18 Scopus OpenAlex |
| 19 |
Bampis E.
, Escoffier B.
, Kononov A.
LP-Based Algorithms for Multistage Minimization Problems In compilation Approximation and Online Algorithms. WAOA 2020. Lecture Notes in Computer Science. – Springer., 2021. – Т.12806. – C.1-15. – ISBN 9783030808785. DOI: 10.1007/978-3-030-80879-2_1 OpenAlex |
| 20 |
Chernykh I.
, Kononov A.
, Sevastyanov S.
A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes Lecture Notes in Computer Science. 2020. P.301-312. DOI: 10.1007/978-3-030-49988-4_21 Scopus OpenAlex |
| 21 |
Kononov A.
, Strekalovsky A.
, Posypkin M.
, Pyatkin A.
Preface Journal of Global Optimization. 2020. V.76. N3. P.453-454. DOI: 10.1007/s10898-020-00887-y WOS Scopus OpenAlex |
| 22 |
Ageev A.A.
, Kononov A.V.
A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem Communications in Computer and Information Science. 2020. V.1275. P.3-15. DOI: 10.1007/978-3-030-58657-7_1 Scopus OpenAlex |
| 23 |
Kononov A.V.
, Kovalenko Y.
Approximation algorithms for energy-efficient scheduling of parallel jobs Journal of Scheduling. 2020. N23. P.693 - 709. DOI: 10.1007/s10951-020-00653-8 WOS Scopus OpenAlex |
| 24 |
Kononov A.
, Kononova P.
, Gordeev A.
Branch-and-bound approach for optima localization in scheduling multiprocessor jobs International Transactions in Operational Research. 2020. N27. P.381 - 393. DOI: 10.1111/itor.12503 WOS Scopus OpenAlex |
| 25 |
Bampis E.
, Dogeas K.
, Kononov A.
, Lucarelli G.
, Pascual F.
Scheduling Malleable Jobs Under Topological Constraints In compilation Proceedings - 2020 IEEE 34th International Parallel and Distributed Processing Symposium, IPDPS 2020. – Institute of Electrical and Electronics Engineers Inc.., 2020. – C.316 - 325. – ISBN 9781728168760. DOI: 10.1109/ipdps47924.2020.00041 Scopus OpenAlex |
| 26 |
Kononov A.
, Kovalenko Y.
Makespan Minimization for Parallel Jobs with Energy Constraint In compilation Mathematical Optimization Theory and Operations Research. MOTOR 2020. Lecture Notes in Computer Science. – Springer Nature Switzerland AG 2020., 2020. – Т.12095. – C.289-300. – ISBN 9783030499877. DOI: 10.1007/978-3-030-49988-4_20 Scopus OpenAlex |
| 27 |
Kononov A.V.
, Kovalyov M.Y.
, Lin B.M.T.
Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax Theoretical Computer Science. 2019. N793. P.70 - 78. DOI: 10.1016/j.tcs.2019.05.02 |
| 28 |
Kononov A.V.
, Panin A.A.
, Plyasunov A.V.
A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand Journal of Applied and Industrial Mathematics. 2019. V.13. P.500-510. DOI: 10.1134/S1990478919030104 Scopus OpenAlex |
| 29 |
Kononov A.
, Kovalenko Y.
Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2019. N16. P.249 - 257. |
| 30 |
Kononov A.
, Memar J.
, Zinder Y.
Flow Shop with Job–Dependent Buffer Requirements—a Polynomial–Time Algorithm and Efficient Heuristics In compilation Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings. – Springer., 2019. – Т.Lecture Notes in Computer Science. Vol. 11548.. – C.342-357. – ISBN 978-3-030-22628-2. DOI: 10.1007/978-3-030-22629-9_24 Scopus OpenAlex |
| 31 |
Eremeev A.
, Kononov A.
, Ziegler I.
On Complexity and Exact Solution of Production Groups Formation Problem In compilation Optimization and Applications. OPTIMA 2018. Communications in Computer and Information Science. – Springer., 2019. – Т.974. – C.111-122. – ISBN 978-3-030-10933-2. DOI: 10.1007/978-3-030-10934-9_8 Scopus OpenAlex |
| 32 |
Berlińska J.
, Kononov A.
, Zinder Y.
Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations Advances in Intelligent Systems and Computing. 2019. V.991. N2. P.1139-1148. DOI: 10.1007/978-3-030-21803-4_112 Scopus OpenAlex |
| 33 |
Alhamdan Y.M.
, Kononov A.
Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem Lecture Notes in Computer Science. 2019. V.11532. P.1-12. DOI: 10.1007/978-3-030-19955-5_1 Scopus OpenAlex |
| 34 |
Kononov A.V.
, Panin A.A.
, Plyasunov A.V.
A New Model of Competitive Location and Pricing with the Uniform Split of the Demand Communications in Computer and Information Science. 2018. V.871. P.16-28. DOI: 10.1007/978-3-319-93800-4_2 Scopus OpenAlex |
| 35 |
Gu H.
, Kononov A.V.
, Memar J.
, Zinder Y.
Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements Journal of Discrete Algorithms. 2018. N52-53. P.143-155. DOI: 10.1016/j.jda.2018.11.011. |
| 36 |
Bampis E.
, Kononov A.V.
, Letsios D.
, Lucarelli G.
, Sviridenko M.
Energy-efficient scheduling and routing via randomized rounding Journal of Scheduling. 2018. N21. P.35–51. DOI: 10.1007/s10951-016-0500-2 WOS Scopus OpenAlex |
| 37 |
Arantes L.
, Bampis E.
, Kononov A.
, Letsios M.
, Lucarelli G.
, Sens P.
Scheduling under Uncertainty: A Query-based Approach In compilation Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, 13-19 July 2018. – International Joint Conferences on Artificial Intelligence., 2018. – C.4646-4652. – ISBN 978-0-9992411-2-7. DOI: 10.24963/ijcai.2018/646 Scopus OpenAlex |
| 38 |
Memar J.
, Zinder Y.
, Kononov A.V.
Worst-Case Analysis of a Modification of the Brucker-Garey-Johnson Algorithm In compilation Optimization Problems and Their Applications. OPTA 2018. Communications in Computer and Information Science. – Springer International Publishing AG., 2018. – Т.871. – C.78-92. – ISBN 9783319937991. DOI: 10.1007/978-3-319-93800-4_7 Scopus OpenAlex |
| 39 |
Kononov A.
, Kovalenko Y.
An Approximation Algorithm for Preemptive Speed Scaling Scheduling of Parallel Jobs with Migration In compilation Lecture Notes in Computer Science. – Springer International Publishing AG 2017., 2017. – Т.10556. – C.351-357. – ISBN 9783319694030. DOI: 10.1007/978-3-319-69404-7_30 OpenAlex |
| 40 |
Kononov A.V.
, Kononova P.A.
On minimizing dataset transfer time in an acyclic network with four servers Journal of Applied and Industrial Mathematics. 2016. V.10. N4. P.494-504. DOI: 10.1134/s1990478916040050 Scopus OpenAlex |
| 41 |
Angel E.
, Bampis E.
, Kononov A.
, Paparas D.
, Pountourakis E.
, Zissimopoulos V.
Clustering on k-Edge-Colored graphs Discrete Applied Mathematics. 2016. V.211. P.15-22. DOI: 10.1016/j.dam.2016.04.017 WOS Scopus OpenAlex |
| 42 |
Kononov A.
, Kovalenko Y.
On Speed Scaling Scheduling of Parallel Jobs with Preemption In compilation Lecture Notes in Computer Science Discrete Optimization and Operations Research 9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings. – Springer International Publishing., 2016. – Т.9869. – C.309-321. – ISBN 9783319449135. DOI: 10.1007/978-3-319-44914-2_25 Scopus РИНЦ OpenAlex |
| 43 |
Lin B.M.T.
, Hwang F.J.
, Kononov A.V.
Relocation scheduling subject to fixed processing sequences Journal of Scheduling. 2015. V.19. N2. P.153-163. DOI: 10.1007/s10951-015-0455-8 WOS Scopus OpenAlex |
| 44 |
Dugarzhapov A.
, Kononov A.
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job Journal of Scheduling. 2015. V.19. N1. P.61-72. DOI: 10.1007/s10951-015-0454-9 WOS Scopus OpenAlex |
| 45 |
Kononov A.V.
, Lin B.M.T.
, Fang K-T.
Single-machine scheduling with supporting tasks Discrete Optimization. 2015. V.17. P.69-79. DOI: 10.1016/j.disopt.2015.05.001 WOS Scopus OpenAlex |
| 46 |
Kononov A.
O(log m)-approximation for the routing open shop problem RAIRO - Operations Research. 2015. V.49. N2. 9 :1-9. DOI: 10.1051/ro/2014051 WOS Scopus OpenAlex |
| 47 |
Ageev A.
, Kononov A.
Improved Approximations for the Max k-Colored Clustering Problem Lecture Notes in Computer Science. 2015. P.1-10. DOI: 10.1007/978-3-319-18263-6_1 WOS Scopus OpenAlex |
| 48 |
Angel E.
, Bampis E.
, Chau V.
, Kononov A.
Min-Power Covering Problems In compilation Elbassioni, K., Makino, K. (eds) Algorithms and Computation. ISAAC 2015. Lecture Notes in Computer Science.. – Springer., 2015. – Т.9472. – C.367-377. DOI: 10.1007/978-3-662-48971-0_32 Scopus РИНЦ OpenAlex |
| 49 |
Bampis E.
, Kononov A.
, Letsios D.
, Lucarelli G.
, Nemparis I.
From preemptive to non-preemptive speed-scaling scheduling Discrete Applied Mathematics. 2014. V.181. P.11-20. DOI: 10.1016/j.dam.2014.10.007 WOS Scopus OpenAlex |
| 50 |
Bampis E.
, Kononov A.
, Lucarelli G.
, Milis I.
Bounded max-colorings of graphs Journal of Discrete Algorithms. 2014. V.26. P.56-68. DOI: 10.1016/j.jda.2013.11.003 Scopus OpenAlex |
Conference attendances (20) More info
| 1 |
Kharchenko Y.
, Kononov A.V.
THE PRIMAL-DUAL LEARNING AUGMENTED ALGORITHM FOR PARKING PERMIT PROBLEM WITH THREE PERMIT TYPES INTERNATIONAL CONFERENCE ON COMPUTATIONAL OPTIMIZATION 10-12 Oct 2024 |
| 2 |
Kharchenko Y.
, Kononov A.
A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types XXIII International Conference Mathematical Optimization Theory and Operations Research 30 Jun - 6 Jul 2024 |
| 3 |
Bampis E.
, Kononov A.V.
, Lucarelli G.
, Pascual F.
Non-Clairvoyant Makespan Minimization Scheduling with Predictions 34th International Symposium on Algorithms and Computation 03-06 Dec 2023 |
| 4 |
Kononov A.V.
, Ильев В.П.
On cluster editing problem with clusters of small sizes XIV International Conference Optimization and Applications 18-22 Sep 2023 |
| 5 |
Erzin A.
, Kononov A.
, Nazarenko A.
, Sharankhaev K.
An O(n log n)-time algorithm for linearly ordered packing of 2-bar charts into OPT + 1 bins 22nd International conference "Mathematical Optimization Theory and Operations Research" 02-08 Jul 2023 |
| 6 |
Kharchenko Y.A.
, Kononov
Prediction-augmented algorithms for parking permit problem 22nd International conference "Mathematical Optimization Theory and Operations Research" 02-08 Jul 2023 |
| 7 |
Bampis E.
, Dogeas K.
, Kononov A.V.
, Lucarelli G.
, Pascual F.
Scheduling with Untrusted Predictions The 31ST international joint conference on artificial intelligence 23-29 Jul 2022 |
| 8 |
Kononov A.
, Pakulich M.
On Flow Shop Scheduling with Job-Dependent Storage Requirements International Conference Mathematical Optimization Theory and Operations Research Petrozavodsk, Karelia, Russia, July 2-6, 2022 02-08 Jul 2022 |
| 9 |
Kharchenko Y.
, Kononov A.
On the restricted parking permit problem International Conference Mathematical Optimization Theory and Operations Research Petrozavodsk, Karelia, Russia, July 2-6, 2022 02-08 Jul 2022 |
| 10 |
Zaharova Y.
, Kononov A.
Minimizing Makespan for Parallelizable Jobs with Energy Constraint International Conference Mathematical Optimization Theory and Operations Research Petrozavodsk, Karelia, Russia, July 2-6, 2022 02-08 Jul 2022 |
| 11 |
Kononov A.
, Pakulich M.
On Flow Shop Scheduling with Job-Dependent Storage Requirements The 15th Workshop on Models and Algorithms for Planning and Scheduling 2022 12-17 Jun 2022 |
| 12 |
Bampis E.
, Dogeas K.
, Kononov A.V.
, Lucarelli G.
, Pascual F.
Speed Scaling with Explorable Uncertainty The 15th Workshop on Models and Algorithms for Planning and Scheduling 2022 12-17 Jun 2022 |
| 13 |
Zakharova Y.
, Kononov A.
Scheduling Parallel Jobs in Two-processor Systems with Energy Constraint The 15th Workshop on Models and Algorithms for Planning and Scheduling 2022 12-17 Jun 2022 |
| 14 |
Kononov A.V.
On the Complexity of Flow Shop Scheduling with Job-Dependent Storage Requirements ECCO XXXV - CO 2022 Joint Conference 09-11 Jun 2022 |
| 15 |
Kononov A.V.
, Memar J.
, Zinder Y.
Algorithms for Flow Shop with Job–Dependent Buffer Requirements 4th international conference on “Modelling, Computation and Optimization in Information Systems and Management Sciences” 13-14 Dec 2021 |
| 16 |
Dogeas K.
, Bampis E.
, Pascual F.
, Lucarelli G.
, Kononov A.V.
Speed scaling with explorable uncertainty ACM Symposium on Parallelism in Algorithms and Architectures 06-08 Jul 2021 |
| 17 |
Ageev A.
, Kononov A.
A 0.3622-Approximation Algoritm for the Maximum K-Edge-Colored Clustering Problem Mathematical Optimization Theory and Operations Research 06-10 Jul 2020 |
| 18 |
Chernykh I.
, Kononov A.
, Sevastyanov S.
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes Mathematical Optimization Theory and Operations Research 06-10 Jul 2020 |
| 19 |
Chernykh I.
, Kononov A.
, Sevastyanov S.
On the complexity of the two-machine routing flow shop 14th Workshop on Models and Algorithms for Planning and Scheduling Problems 02-07 Jun 2019 |
| 20 |
Chernykh I.
, Kononov A.
, Sevastyanov S.
Exact polynomial-time algorithm for the two-machine routing flow shop with a restricted transportation network Проблемы оптимизации и их приложения Optimization Problems and Their Applications 08-14 Jul 2018 |
Identifiers
ORCID:
ResearcherID:
Scopus ID:
Degrees
2015 - Dr.Sc.
1999 - Ph.D.