Dmitriy S. Malyshev

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 36

Top Topics

Top Venues

J. Comb. Optim.

Discret. Appl. Math.

Publications

Dmitry V. Gribanov, Ivan A. Shumilov, Dmitriy S. Malyshev, Panos M. Pardalos
On Δ-modular integer linear problems in the canonical form and equivalent problems. J. Glob. Optim. 88 (3) (2024)
Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos
Delta-modular ILP Problems of Bounded Co-dimension, Discrepancy, and Convolution. CoRR (2024)
Bogdan Alecu, Vadim V. Lozin, Dmitriy S. Malyshev
Critical properties of bipartite permutation graphs. J. Graph Theory 105 (1) (2024)
Dmitry V. Gribanov, I. A. Shumilov, Dmitriy S. Malyshev
Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems. Optim. Lett. 18 (1) (2024)
Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Nikolai Yu. Zolotykh
Faster Integer Points Counting in Parametric Polyhedra. CoRR (2023)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev
Combinatorics and Algorithms for Quasi-Chain Graphs. Algorithmica 85 (3) (2023)
Dmitry V. Gribanov, Dmitriy S. Malyshev, I. A. Shumilov
On a Simple Connection Between Δ-modular ILP and LP, and a New Bound on the Number of Integer Vertices. CoRR (2022)
Dmitrii S. Taletskii, Dmitriy S. Malyshev
The number of maximal independent sets in trees with a given number of leaves. Discret. Appl. Math. 314 (2022)
Dmitry V. GRathoreribanov, Dmitriy S. Malyshev, I. A. Shumilov
Structured (min, +)-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems. CoRR (2022)
Dmitriy S. Malyshev, O. V. Pristavchenko
An intractability result for the vertex 3-colourability problem. Optim. Lett. 16 (5) (2022)
Duncan Adamson, Vladimir V. Gusev, Dmitriy S. Malyshev, Viktor Zamaraev
Faster Exploration of Some Temporal Graphs. SAND (2022)
Dmitriy S. Malyshev, O. O. Razvenskaya, Panos M. Pardalos
-free graphs. Optim. Lett. 15 (1) (2021)
Dmitriy S. Malyshev
The vertex colourability problem for claw, butterfly-free graphs is polynomial-time solvable. Optim. Lett. 15 (2) (2021)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev
Combinatorics and Algorithms for Quasi-chain Graphs. IWOCA (2021)
Dmitry V. Gribanov, Dmitriy S. Malyshev
Faster algorithm for counting of the integer points number in Δ-modular polyhedra. CoRR (2021)
Dmitry B. Mokeev, Dmitriy S. Malyshev
A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs. Optim. Lett. 14 (6) (2020)
Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
Independent domination versus weighted independent domination. Inf. Process. Lett. 156 (2020)
Dmitriy V. Gribanov, Dmitriy S. Malyshev
Integer Conic Function Minimization Based on the Comparison Oracle. MOTOR (2019)
Aleksandr Yu. Chirkov, Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov, Nikolai Yu. Zolotykh
On the complexity of quasiconvex integer minimization problem. J. Glob. Optim. 73 (4) (2019)
Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov
FPT-algorithms for some problems related to integer programming. J. Comb. Optim. 35 (4) (2018)
Dmitriy S. Malyshev
The weighted coloring problem for two graph classes characterized by small forbidden induced structures. Discret. Appl. Math. 247 (2018)
Aleksandr Yu. Chirkov, Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov, Nikolai Yu. Zolotykh
On the complexity of quasiconvex integer minimization problem. CoRR (2018)
Dmitriy S. Malyshev, Dmitry V. Gribanov
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices. Discret. Optim. 29 (2018)
Dmitriy S. Malyshev
The Complexity of the Vertex 3-Colorability Problem for Some Hereditary Classes Defined By 5-Vertex Forbidden Induced Subgraphs. Graphs Comb. 33 (4) (2017)
Vadim V. Lozin, Dmitriy S. Malyshev
Vertex coloring of graphs with few obstructions. Discret. Appl. Math. 216 (2017)
Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov
FPT-algorithms for some problems related to integer programming. CoRR (2017)
Dmitry V. Gribanov, Dmitriy S. Malyshev
The computational complexity of three graph problems for instances with bounded minors of constraint matrices. Discret. Appl. Math. 227 (2017)
Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
More results on weighted independent domination. Theor. Comput. Sci. 700 (2017)
Dmitriy S. Malyshev
Polynomial-time approximation algorithms for the coloring problem in some cases. J. Comb. Optim. 33 (3) (2017)
Marcel Turkensteen, Dmitriy S. Malyshev, Boris Goldengorin, Panos M. Pardalos
The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems. J. Glob. Optim. 68 (3) (2017)
Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
New Results on Weighted Independent Domination. WG (2017)
Dmitriy S. Malyshev, O. O. Lobanova
Two complexity results for the vertex coloring problem. Discret. Appl. Math. 219 (2017)
Dmitriy S. Malyshev
A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs. Discret. Appl. Math. 203 (2016)
Dmitriy S. Malyshev
Two cases of polynomial-time solvability for the coloring problem. J. Comb. Optim. 31 (2) (2016)
Dmitriy S. Malyshev, Panos M. Pardalos
Critical hereditary graph classes: a survey. Optim. Lett. 10 (8) (2016)
Dmitriy S. Malyshev
A complexity dichotomy and a new boundary class for the dominating set problem. J. Comb. Optim. 32 (1) (2016)
Dmitriy S. Malyshev
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs. Discret. Math. 338 (11) (2015)
Dmitriy S. Malyshev, Panos M. Pardalos
The clique problem for graphs with a few eigenvalues of the same sign. Optim. Lett. 9 (5) (2015)
Dmitriy S. Malyshev
A complexity dichotomy for the dominating set problem. CoRR (2015)
Dmitriy S. Malyshev, O. O. Lobanova
-e}-free graphs is polynomial. CoRR (2015)
Boris I. Goldengorin, Dmitriy S. Malyshev, Panos M. Pardalos, Victor Zamaraev
A tolerance-based heuristic approach for the weighted independent set problem. J. Comb. Optim. 29 (2) (2015)
Dmitriy S. Malyshev
Boundary graph classes for some maximum induced subgraph problems. J. Comb. Optim. 27 (2) (2014)
Dmitriy S. Malyshev
The coloring problem for classes with two small obstructions. Optim. Lett. 8 (8) (2014)
Dmitriy S. Malyshev
The coloring problem for classes with two small obstructions. CoRR (2013)
Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin
Boundary properties of graphs for algorithmic graph problems. Theor. Comput. Sci. 412 (29) (2011)
Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic
The Maximum Independent Set Problem in Planar Graphs. MFCS (2008)