D. Malyshev

发表

Efficient computation of tolerances in the weighted independent set problem for some classes of graphs

P. Pardalos, D. Malyshev, 2014 .

Critical properties of bipartite permutation graphs

V. Lozin, D. Malyshev, Bogdan Alecu, 2020, J. Graph Theory.

A study of the boundary graph classes for colorability problems

D. Malyshev, 2013, Journal of Applied and Industrial Mathematics.

Classes of graphs critical for the edge list-ranking problem

D. Malyshev, D. S. Malyshev, 2014, Journal of Applied and Industrial Mathematics.

Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs

D. V. Sirotkin, D. Malyshev, 2017 .

Planar graph classes with the independent set problem solvable in polynomial time

V. E. Alekseev, D. Malyshev, 2009 .

Classes of subcubic planar graphs for which the independent set problem is polynomially solvable

D. Malyshev, D. S. Malyshev, 2013 .

The Maximum Independent Set Problem in Planar Graphs

Vadim V. Lozin, Martin Milanic, Dmitriy S. Malyshev, 2008, MFCS.

D M ] 2 1 M ay 2 01 7 More results on weighted independent domination ∗

V. Lozin, R. Mosca, D. Malyshev, 2018 .

König Graphs with Respect to the 4-Path and Its Spanning Supergraphs

D. Malyshev, D. Mokeev, 2019, Journal of Applied and Industrial Mathematics.

Expanding operators for the independent set problem

D. Malyshev, 2013 .

A method of graph reduction and its applications

D. Malyshev, Dmitrii Valer'evich Sirotkin, 2018, Discrete Mathematics and Applications.

Critical elements in combinatorially closed families of graph classes

D. Malyshev, 2017 .

Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs

D. Malyshev, 2012 .

On the infinity of the set of boundary classes for the edge 3-colorability problem

D. Malyshev, 2010 .

On the number of boundary classes in the 3-colouring problem

D. Malyshev, 2009 .

Efficient Solvability of the Weighted Vertex Coloring Problem for Some Hereditary Class of Graphs with $$\boldsymbol {5}$$ -Vertex Prohibitions

D. Malyshev, D. Gribanov, D. Mokeev, 2020 .

Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem

D. Malyshev, 2020, Diskretnyi analiz i issledovanie operatsii.

Structured $(\min,+)$-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems

D. Malyshev, D. Gribanov, I. A. Shumilov, 2022, 2209.04812.

Minimization of Even Conic Functions on the Two-Dimensional Integral Lattice

D. V. Gribanov, D. Malyshev, D. Gribanov, 2020, Diskretnyi analiz i issledovanie operatsii.

Structured (min, +)-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems

D. Malyshev, I. A. Shumilov, Dmitry V. GRathoreribanov, 2022, ArXiv.

Interpretation of postglacial recolonization of Formica aquilonia (Hymenoptera, Formicidae) in Fennoscandia according to workers’ color variation

D. Malyshev, A. Gilev, A. V. Mershchiev, 2015, Entomological Review.

Complexity classification of the edge coloring problem for a family of graph classes

D. Malyshev, 2017 .

On Δ-modular integer linear problems in the canonical form and equivalent problems

P. Pardalos, D. Malyshev, D. Gribanov, 2020, J. Glob. Optim..

Polynomial-time approximation algorithms for the coloring problem in some cases

D. Malyshev, 2016, Journal of Combinatorial Optimization.

The clique problem for graphs with a few eigenvalues of the same sign

D. Malyshev, P. Pardalos, 2014, Optimization Letters.

Critical elements in combinatorially closed families of graph classes

D. Malyshev, 2017, Journal of Applied and Industrial Mathematics.

FPT-Algorithm for Computing the Width of a Simplex Given by a Convex Hull

S. I. Veselov, D. Malyshev, D. Gribanov, 2019, Moscow University Computational Mathematics and Cybernetics.

Efficient Solvability of the Weighted Vertex Coloring Problem for Some Two Hereditary Graph Classes

O. O. Razvenskaya, D. Malyshev, 2021, Journal of Applied and Industrial Mathematics.

Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions

D. Malyshev, D. Gribanov, D. Mokeev, 2020, Diskretnyi analiz i issledovanie operatsii.

A faster algorithm for counting the integer points number in $\Delta$-modular polyhedra

D. Malyshev, D. Gribanov, 2021, 2110.01732.

Minimization of Even Conic Functions on the Two-Dimensional Integral Lattice

D. Malyshev, D. Gribanov, 2020, Journal of Applied and Industrial Mathematics.

Expanding operators for the independent set problem

D. Malyshev, 2013 .

A tolerance-based heuristic approach for the weighted independent set problem

B. Goldengorin, D. Malyshev, P. Pardalos, 2013, Journal of Combinatorial Optimization.

Interpretation of postglacial recolonization of Formica aquilonia (Hymenoptera, Formicidae) in Fennoscandia according to workers’ color variation

D. Malyshev, A. Gilev, A. V. Mershchiev, 2015, Entomological Review.

Two cases of polynomial-time solvability for the coloring problem

Dmitriy S. Malyshev, D. Malyshev, 2016, J. Comb. Optim..

Two cases of polynomial-time solvability for the coloring problem

D. Malyshev, 2014, Journal of combinatorial optimization.

The coloring problem for classes with two small obstructions

Dmitriy S. Malyshev, D. Malyshev, 2013, Optim. Lett..

Boundary properties of graphs for algorithmic graph problems

Vadim V. Lozin, Dmitriy S. Malyshev, Nicholas Korpelainen, 2011, Theor. Comput. Sci..

Boundary graph classes for some maximum induced subgraph problems

Dmitriy S. Malyshev, D. Malyshev, 2014, J. Comb. Optim..

Boundary graph classes for some maximum induced subgraph problems

D. Malyshev, 2012, Journal of Combinatorial Optimization.

A complexity dichotomy and a new boundary class for the dominating set problem

Dmitriy S. Malyshev, D. Malyshev, 2016, J. Comb. Optim..

The computational complexity of three graph problems for instances with bounded minors of constraint matrices

Dmitriy S. Malyshev, Dmitry V. Gribanov, D. Malyshev, 2017, Discret. Appl. Math..

Integer Conic Function Minimization Based on the Comparison Oracle

Dmitriy S. Malyshev, Dmitriy V. Gribanov, D. V. Gribanov, 2019, MOTOR.

On the complexity of quasiconvex integer minimization problem

S. I. Veselov, D. Malyshev, D. Gribanov, 2018, Journal of Global Optimization.

On the complexity of quasiconvex integer minimization problem

Panos M. Pardalos, Dmitriy S. Malyshev, Dmitry V. Gribanov, 2018, Journal of Global Optimization.

Combinatorics and Algorithms for Quasi-Chain Graphs

Aistis Atminas, Vadim Lozin, Bogdan Alecu, 2021, Algorithmica.

A tolerance-based heuristic approach for the weighted independent set problem

Panos M. Pardalos, Boris Goldengorin, Dmitriy S. Malyshev, 2013, Journal of Combinatorial Optimization.

A note on the parametric integer programming in the average case: sparsity, proximity, and FPT-algorithms

D. S. Malyshev, D. V. Gribanov, P. M. Pardalos, 2020 .

FPT-algorithms for some problems related to integer programming

Panos M. Pardalos, Dmitriy S. Malyshev, Dmitry V. Gribanov, 2017, Journal of Combinatorial Optimization.

The weighted coloring problem for two graph classes characterized by small forbidden induced structures

Dmitriy S. Malyshev, D. Malyshev, 2018, Discret. Appl. Math..

Two complexity results for the vertex coloring problem

Dmitriy S. Malyshev, O. O. Lobanova, D. Malyshev, 2017, Discret. Appl. Math..

The coloring problem for {P5, P̅5}-free graphs and {P5, Kp-e}-free graphs is polynomial pdf

Dmitriy S. Malyshev, O. O. Lobanova, D. Malyshev, 2015, ArXiv.

The number of maximal independent sets in trees with a given number of leaves

D. Malyshev, D. S. Taletskii, 2022, Discret. Appl. Math..

A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs

Dmitriy S. Malyshev, D. Malyshev, 2016, Discret. Appl. Math..

Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems

D. Malyshev, D. Gribanov, I. A. Shumilov, 2023, Optim. Lett..

Critical hereditary graph classes: a survey

Panos M. Pardalos, Dmitriy S. Malyshev, P. Pardalos, 2016, Optim. Lett..

Critical hereditary graph classes: a survey

D. Malyshev, P. Pardalos, 2015, Optimization Letters.

Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs

D. V. Sirotkin, D. Malyshev, 2017, Journal of Applied and Industrial Mathematics.

Classes of subcubic planar graphs for which the independent set problem is polynomially solvable

D. Malyshev, 2013, Journal of Applied and Industrial Mathematics.

The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs

Dmitriy S. Malyshev, D. Malyshev, 2015, Discret. Math..

On a Countable Family of Boundary Graph Classes for the Dominating Set Problem

D. Malyshev, G. S. Dakhno, 2023, Journal of Applied and Industrial Mathematics.

A complexity dichotomy for the dominating set problem pdf

Dmitriy S. Malyshev, D. Malyshev, 2015, ArXiv.

A complexity dichotomy and a new boundary class for the dominating set problem

D. Malyshev, 2015, Journal of Combinatorial Optimization.

Vertex coloring of graphs with few obstructions

Vadim V. Lozin, Dmitriy S. Malyshev, V. Lozin, 2017, Discret. Appl. Math..

The coloring problem for classes with two small obstructions

D. Malyshev, 2014, Optimization Letters.