When difference in machine loads leadsto efficient scheduling in open shops. - Alexander V. Kononov; Sergey V. Sevastianov; I. D. Tchernykh (Ann. Oper. Res., 1999)

A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. - Eric Angel; Evripidis Bampis; Alexander V. Kononov (ESA, 2001)

On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements. - Evripidis Bampis; Alexander V. Kononov (IPDPS, 2001)

NP-hard cases in scheduling deteriorating jobs on dedicated machines. - Alexander V. Kononov; Stanislaw Gawiejnowicz (J. Oper. Res. Soc., 2001)

A linear time approximation scheme for makespan minimization in an open shop with release dates. - Alexander V. Kononov; Maxim Sviridenko (Oper. Res. Lett., 2002)

Bicriteria approximation algorithms for scheduling problems with communications. - Evripidis Bampis; Alexander V. Kononov (SPAA, 2003)

On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. - Eric Angel; Evripidis Bampis; Alexander V. Kononov (Theor. Comput. Sci., 2003)

Scheduling Tasks with Small Communication Delays for Clusters of Processors. - Evripidis Bampis; Rodolphe Giroudeau; Alexander V. Kononov (Ann. Oper. Res., 2004)

Bicriteria approximation algorithms for scheduling problems with communications delays. - Evripidis Bampis; Alexander V. Kononov (J. Sched., 2005)

Approximation Algorithms for Scheduling Problems with Exact Delays. - Alexander A. Ageev; Alexander V. Kononov (WAOA, 2006)

On relocation problems with multiple identical working crews. - Alexander V. Kononov; Bertrand M. T. Lin (Discret. Optim., 2006)

Open block scheduling in optical communication networks. - Alexander A. Ageev; Aleksei V. Fishkin; Alexander V. Kononov; Sergey V. Sevastianov (Theor. Comput. Sci., 2006)

Approximation Algorithms for the Black and White Traveling Salesman Problem. - Binay K. Bhattacharya; Yuzhuang Hu; Alexander V. Kononov (COCOON, 2007)

Customer order scheduling to minimize the number of late jobs. - Bertrand M. T. Lin; Alexander V. Kononov (Eur. J. Oper. Res., 2007)

Integrality Property in Preemptive Parallel Machine Scheduling. - Philippe Baptiste; Jacques Carlier; Alexander V. Kononov; Maurice Queyranne; Sergey Sevastyanov; Maxim Sviridenko (CSR, 2009)

Complete Complexity Classification of Short Shop Scheduling. - Alexander V. Kononov; Sergey Sevastyanov; Maxim Sviridenko (CSR, 2009)

The Routing Open Shop Problem: New Approximation Algorithms. - Ilya Chernykh; Nikita Dryuck; Alexander V. Kononov; Sergey Sevastyanov (WAOA, 2009)

Complexity and approximability of scheduling resumable proportionally deteriorating jobs. - Stanislaw Gawiejnowicz; Alexander V. Kononov (Eur. J. Oper. Res., 2010)

Minimizing the total weighted completion time in the relocation problem. - Alexander V. Kononov; Bertrand M. T. Lin (J. Sched., 2010)

Properties of optimal schedules in preemptive shop scheduling. - Philippe Baptiste; Jacques Carlier; Alexander V. Kononov; Maurice Queyranne; Sergey Sevastyanov; Maxim Sviridenko (Discret. Appl. Math., 2011)

Integer preemptive scheduling on parallel machines. - Philippe Baptiste; Jacques Carlier; Alexander V. Kononov; Maurice Queyranne; Sergey Sevastyanov; Maxim Sviridenko (Oper. Res. Lett., 2012)

Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications. - Alexander V. Kononov; Jen-Shin Hong; Polina A. Kononova; Feng-Cheng Lin (J. Sched., 2012)

A Complete 4-parametric complexity classification of short shop scheduling problems. - Alexander V. Kononov; Sergey Sevastyanov; Maxim Sviridenko (J. Sched., 2012)

Efficient approximation algorithms for the routing open shop problem. - Ilya Chernykh; Alexander V. Kononov; Sergey Sevastyanov (Comput. Oper. Res., 2013)

Improved Approximations for the Max k-Colored Clustering Problem. - Alexander A. Ageev; Alexander V. Kononov (WAOA, 2014)

Isomorphic scheduling problems. - Stanislaw Gawiejnowicz; Alexander V. Kononov (Ann. Oper. Res., 2014)

Bounded max-colorings of graphs. - Evripidis Bampis; Alexander V. Kononov; Giorgio Lucarelli; Ioannis Milis (J. Discrete Algorithms, 2014)

Min-Power Covering Problems. - Eric Angel; Evripidis Bampis; Vincent Chau; Alexander V. Kononov (ISAAC, 2015)

From preemptive to non-preemptive speed-scaling scheduling. - Evripidis Bampis; Alexander V. Kononov; Dimitrios Letsios; Giorgio Lucarelli; Ioannis Nemparis (Discret. Appl. Math., 2015)

Single-machine scheduling with supporting tasks. - Alexander V. Kononov; Bertrand M. T. Lin; Kuei-Tang Fang (Discret. Optim., 2015)

O(log m)-approximation for the routing open shop problem. - Alexander V. Kononov (RAIRO Oper. Res., 2015)

Optima Localization in Scheduling Multi-Processor Jobs. - Alexander Gordeev; Alexander V. Kononov; Polina A. Kononova (DOOR (Supplement), 2016)

Short Survey on Graph Correlation Clustering with Minimization Criteria. - Victor P. Il'ev; Svetlana Il'eva; Alexander V. Kononov (DOOR, 2016)

On Speed Scaling Scheduling of Parallel Jobs with Preemption. - Alexander V. Kononov; Yulia V. Kovalenko (DOOR, 2016)

Scheduling of Two Parallel Machines with Linear Decreasing Time Slot Costs to Minimize Total Weighted Completion Time. - Alexander V. Kononov; Irina N. Lushchakova (DOOR (Supplement), 2016)

Clustering on k-edge-colored graphs. - Eric Angel; Evripidis Bampis; Alexander V. Kononov; Dimitris Paparas; Emmanouil Pountourakis; Vassilis Zissimopoulos (Discret. Appl. Math., 2016)

A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job. - Aldar Dugarzhapov; Alexander V. Kononov (J. Sched., 2016)

Relocation scheduling subject to fixed processing sequences. - Bertrand M. T. Lin; F. J. Hwang; Alexander V. Kononov (J. Sched., 2016)

An Approximation Algorithm for Preemptive Speed Scaling Scheduling of Parallel Jobs with Migration. - Alexander V. Kononov; Yulia V. Kovalenko (LION, 2017)

Scheduling under Uncertainty: A Query-based Approach. - Luciana Arantes; Evripidis Bampis; Alexander V. Kononov; Manthos Letsios; Giorgio Lucarelli; Pierre Sens 001 (IJCAI, 2018)

Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems. - Alexander V. Kononov; Yulia V. Kovalenko (CoRR, 2018)

Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. - Hanyu Gu; Alexander V. Kononov; Julia Memar; Yakov Zinder (J. Discrete Algorithms, 2018)

Energy-efficient scheduling and routing via randomized rounding. - Evripidis Bampis; Alexander V. Kononov; Dimitrios Letsios; Giorgio Lucarelli; Maxim Sviridenko (J. Sched., 2018)

Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem. - Yousef M. Alhamdan; Alexander V. Kononov (CSR, 2019)

Flow Shop with Job-Dependent Buffer Requirements - a Polynomial-Time Algorithm and Efficient Heuristics. - Alexander V. Kononov; Julia Memar; Yakov Zinder (MOTOR, 2019)

Two-Machine Flow Shop with a Dynamic Storage Space and UET Operations. - Joanna Berlinska; Alexander V. Kononov; Yakov Zinder (WCGO, 2019)

Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax. - Alexander V. Kononov; Mikhail Y. Kovalyov; Bertrand M. T. Lin (Theor. Comput. Sci., 2019)

Scheduling Malleable Jobs Under Topological Constraints. - Evripidis Bampis; Konstantinos Dogeas; Alexander V. Kononov; Giorgio Lucarelli; Fanny Pascual (IPDPS, 2020)

A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes. - Ilya Chernykh; Alexander V. Kononov; Sergey Sevastyanov (MOTOR, 2020)

Makespan Minimization for Parallel Jobs with Energy Constraint. - Alexander V. Kononov; Yulia V. Kovalenko (MOTOR, 2020)

LP-Based Algorithms for Multistage Minimization Problems. - Evripidis Bampis; Bruno Escoffier; Alexander V. Kononov (WAOA, 2020)

Branch-and-bound approach for optima localization in scheduling multiprocessor jobs. - Alexander V. Kononov; Polina A. Kononova; Alexander Gordeev (Int. Trans. Oper. Res., 2020)

Preface. - Alexander V. Kononov; Alexander S. Strekalovsky; Mikhail Posypkin; Artem V. Pyatkin (J. Glob. Optim., 2020)

Approximation algorithms for energy-efficient scheduling of parallel jobs. - Alexander V. Kononov; Yulia V. Kovalenko (J. Sched., 2020)

Algorithms for Flow Shop with Job-Dependent Buffer Requirements. - Alexander V. Kononov; Julia Memar; Yakov Zinder (MCO, 2021)

Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint. - Alexander V. Kononov; Yulia V. Kovalenko (MOTOR, 2021)

Speed Scaling with Explorable Uncertainty. - Evripidis Bampis; Konstantinos Dogeas; Alexander V. Kononov; Giorgio Lucarelli; Fanny Pascual (SPAA, 2021)

A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements. - Yakov Zinder; Alexandr V. Kononov; Joey Fung (J. Comb. Optim., 2021)

Two-machine flow shop with dynamic storage space. - Joanna Berlinska; Alexander V. Kononov; Yakov Zinder (Optim. Lett., 2021)

Scheduling with Untrusted Predictions. - Evripidis Bampis; Konstantinos Dogeas; Alexander V. Kononov; Giorgio Lucarelli; Fanny Pascual (IJCAI, 2022)

Cost-aware scheduling on uniform parallel machines. - Alexander V. Kononov; Irina N. Lushchakova (Comput. Ind. Eng., 2022)

On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements. - Alexander V. Kononov; Julia Memar; Yakov Zinder (J. Glob. Optim., 2022)

Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion. - Alexander V. Kononov; Yulia V. Zakharova (J. Glob. Optim., 2022)

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. - Panos M. Pardalos; Alexander V. Kononov; Vladimir V. Mazalov (Optim. Lett., 2022)

A simple rounding scheme for multistage optimization. - Evripidis Bampis; Dimitris Christou; Bruno Escoffier; Alexander V. Kononov; Kim Thang Nguyen (Theor. Comput. Sci., 2022)

Non-Clairvoyant Makespan Minimization Scheduling with Predictions. - Evripidis Bampis; Alexander V. Kononov; Giorgio Lucarelli; Fanny Pascual (ISAAC, 2023)

On Cluster Editing Problem with Clusters of Small Sizes. - Alexander V. Kononov; Victor P. Il'ev (OPTIMA, 2023)

An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements. - Alexander V. Kononov; Marina Pakulich (J. Comb. Optim., 2024)

An exact solution with an improved running time for the routing flow shop problem with two machines. - Ilya Chernykh; Alexander V. Kononov; Sergey Sevastyanov (J. Sched., 2024)

Approximation algorithms for the cluster editing problem with small clusters. - Alexander V. Kononov; Victor P. Il'ev (Discret. Optim., 2025)