Dmitriy S. Malyshev

From MaRDI portal
Person:1669582

Available identifiers

zbMath Open malyshev.dmitrii-sergeevichMaRDI QIDQ1669582

List of research outcomes

PublicationDate of PublicationType
On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems2024-03-22Paper
A complete classification of the complexity of the vertex 3-colourability problem for quadruples of induced 5-vertex prohibitions2024-01-24Paper
Critical properties of bipartite permutation graphs2024-01-04Paper
Faster Integer Points Counting in Parametric Polyhedra2023-10-20Paper
On the 80th anniversary of the birth of Vladislav Sergeevich Medvedev2023-10-06Paper
https://portal.mardi4nfdi.de/entity/Q60542252023-09-27Paper
On diameter $5$ trees with the maximum number of matchings2023-09-02Paper
On linear algebraic algorithms for the subgraph matching problem and its variants2023-07-28Paper
A constructive existence theorem related to local transformations of graphs for the independent set problem2023-03-24Paper
https://portal.mardi4nfdi.de/entity/Q58845172023-03-23Paper
Combinatorics and algorithms for quasi-chain graphs2023-03-09Paper
https://portal.mardi4nfdi.de/entity/Q58786182023-02-21Paper
Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes2022-08-29Paper
Minimization of even conic functions on the two-dimensional integral lattice2022-07-15Paper
On the König graphs for a 5-path and its spanning supergraphs2022-07-15Paper
Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions2022-07-15Paper
Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem2022-07-15Paper
An intractability result for the vertex 3-colourability problem2022-05-16Paper
Enumeration of matchings in complete \(q\)-ary trees2022-05-05Paper
The number of maximal independent sets in trees with a given number of leaves2022-04-20Paper
Vyacheslav Zigmundovich Grines To his 75th birthday2022-03-28Paper
Combinatorics and algorithms for quasi-chain graphs2022-03-22Paper
On partial descriptions of König graphs for odd paths and all their spanning supergraphs2022-03-15Paper
A new proof of a result concerning a complete description of \((n, n + 2) \)-graphs with maximum value of the Hosoya index2022-03-14Paper
On topological classification of gradient-like flows on an \(n\)-sphere in the sense of topological conjugacy2021-10-20Paper
A faster algorithm for counting the integer points number in $\Delta$-modular polyhedra (corrected version)2021-10-04Paper
Trees with a given number of leaves and the maximal number of maximum independent sets2021-06-08Paper
On 3-colouring of graphs with short faces and bounded maximum vertex degree2021-06-07Paper
The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable2021-05-05Paper
The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs2021-02-26Paper
On topological classification of Morse–Smale diffeomorphisms on the sphere S n (n > 3)2020-11-26Paper
A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs2020-08-24Paper
Integer conic function minimization based on the comparison oracle2020-05-19Paper
Trees without twin-leaves with smallest number of maximal independent sets2020-02-17Paper
Independent domination versus weighted independent domination2020-02-11Paper
On algorithms that effectively distinguish gradient-like dynamics on surfaces2019-12-30Paper
All 2-neighborly d-polytopes with at most d + 9 facets2019-12-09Paper
On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size2019-12-02Paper
König Graphs with Respect to the 4-Path and Its Spanning Supergraphs2019-12-02Paper
On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets2018-11-21Paper
The weighted coloring problem for two graph classes characterized by small forbidden induced structures2018-09-06Paper
A method of graph reduction and its applications2018-09-03Paper
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices2018-08-20Paper
Topological classification of \(\Omega\)-stable flows on surfaces by means of effectively distinguishable multigraphs2018-08-16Paper
A multicolour graph as a complete topological invariant for $ \Omega$-stable flows without periodic trajectories on surfaces2018-06-22Paper
On the number of maximal independent sets in complete \(q\)-ary trees2018-04-23Paper
Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs2018-04-06Paper
https://portal.mardi4nfdi.de/entity/Q46022452018-01-09Paper
New results on weighted independent domination2018-01-04Paper
Complexity classification of the edge coloring problem for a family of graph classes2017-11-02Paper
More results on weighted independent domination2017-10-17Paper
The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs2017-10-11Paper
The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems2017-08-24Paper
Polynomial-time approximation algorithms for the coloring problem in some cases2017-06-22Paper
Critical elements in combinatorially closed families of graph classes2017-06-15Paper
Critical hereditary graph classes: a survey2017-03-28Paper
https://portal.mardi4nfdi.de/entity/Q29695382017-03-15Paper
Two complexity results for the vertex coloring problem2017-01-23Paper
Vertex coloring of graphs with few obstructions2016-11-24Paper
A complexity dichotomy and a new boundary class for the dominating set problem2016-10-20Paper
Efficient algorithms for the recognition of topologically conjugate gradient-like diffeomorhisms2016-06-16Paper
A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs2016-03-18Paper
Two cases of polynomial-time solvability for the coloring problem2016-02-23Paper
The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices2015-11-18Paper
Classes of graphs critical for the edge list-ranking problem2015-07-27Paper
The clique problem for graphs with a few eigenvalues of the same sign2015-07-22Paper
https://portal.mardi4nfdi.de/entity/Q52637622015-07-17Paper
https://portal.mardi4nfdi.de/entity/Q52637742015-07-17Paper
https://portal.mardi4nfdi.de/entity/Q52637822015-07-17Paper
A study of the boundary graph classes for colorability problems2015-07-17Paper
Expanding operators for the independent set problem2015-07-17Paper
Classes of subcubic planar graphs for which the independent set problem is polynomially solvable2015-07-17Paper
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs2015-06-29Paper
The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem2015-05-12Paper
A tolerance-based heuristic approach for the weighted independent set problem2015-02-16Paper
The coloring problem for classes with two small obstructions2014-12-05Paper
Efficient computation of tolerances in the weighted independent set problem for some classes of graphs2014-10-15Paper
Boundary graph classes for some maximum induced subgraph problems2014-04-08Paper
Efficient computation of tolerances in the weighted independent set problem for trees2013-11-11Paper
Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs2013-06-24Paper
On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number2013-04-29Paper
On the number of boundary classes in the 3-colouring problem2012-03-23Paper
https://portal.mardi4nfdi.de/entity/Q31151772012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31151952012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152022012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152502012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152712012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152862012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31156722012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31157092012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31157192012-02-10Paper
Boundary properties of graphs for algorithmic graph problems2011-07-14Paper
The Maximum Independent Set Problem in Planar Graphs2009-02-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Dmitriy S. Malyshev