default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitriy S. Malyshev
Person information
- affiliation: Nizhny Novgorod University, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j36]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): 591-651 (2024)- [j35]Dmitry V. Gribanov, Ivan A. Shumilov, Dmitry S. Malyshev, Nikolai Yu. Zolotykh:
Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems. J. Glob. Optim. 89(4): 1033-1067 (2024) - [j34]Bogdan Alecu, Vadim V. Lozin, Dmitriy S. Malyshev:
Critical properties of bipartite permutation graphs. J. Graph Theory 105(1): 34-60 (2024) - [j33]Dmitry V. Gribanov, Ivan A. Shumilov, Dmitriy S. Malyshev:
Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems. Optim. Lett. 18(1): 73-103 (2024) - [j32]Kirill V. Kaymakov, Dmitry S. Malyshev:
On efficient algorithms for bottleneck path problems with many sources. Optim. Lett. 18(5): 1273-1283 (2024) - [j31]Dmitry V. Gribanov, Dmitry S. Malyshev, Ivan A. Shumilov:
On a Simple Connection Between Δ-Modular ILP and LP, and a New Bound on the Number of Integer Vertices. Oper. Res. Forum 5(2): 32 (2024) - [i13]Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos:
Delta-modular ILP Problems of Bounded Co-dimension, Discrepancy, and Convolution. CoRR abs/2405.17001 (2024) - [i12]Kirill V. Kaymakov, Dmitry S. Malyshev:
Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem. CoRR abs/2408.09443 (2024) - [i11]Kirill V. Kaymakov, Dmitry S. Malyshev:
Efficient search of a minimum tree on points in a space with the l1-norm. CoRR abs/2412.08584 (2024) - 2023
- [j30]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev:
Combinatorics and Algorithms for Quasi-Chain Graphs. Algorithmica 85(3): 642-664 (2023) - [j29]Maxim D. Emelin, Ilya A. Khlystov, Dmitry S. Malyshev, Olga O. Razvenskaya:
On linear algebraic algorithms for the subgraph matching problem and its variants. Optim. Lett. 17(7): 1533-1549 (2023) - [i10]Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Nikolai Yu. Zolotykh:
Faster Integer Points Counting in Parametric Polyhedra. CoRR abs/2310.13788 (2023) - 2022
- [j28]Dmitrii S. Taletskii, Dmitriy S. Malyshev:
The number of maximal independent sets in trees with a given number of leaves. Discret. Appl. Math. 314: 321-330 (2022) - [j27]Dmitry B. Mokeev, Dmitry S. Malyshev:
On partial descriptions of König graphs for odd paths and all their spanning supergraphs. Optim. Lett. 16(2): 481-496 (2022) - [j26]Dmitriy S. Malyshev, O. V. Pristavchenko:
An intractability result for the vertex 3-colourability problem. Optim. Lett. 16(5): 1403-1409 (2022) - [c5]Duncan Adamson, Vladimir V. Gusev, Dmitriy S. Malyshev, Viktor Zamaraev:
Faster Exploration of Some Temporal Graphs. SAND 2022: 5:1-5:10 - [i9]Dmitry V. Gribanov, Dmitry S. Malyshev:
Faster ILP Algorithms for Problems with Sparse Matrices and Their Applications to Multipacking and Multicover Problems in Graphs and Hypergraphs. CoRR abs/2201.08988 (2022) - [i8]Dmitry V. Gribanov, Dmitriy S. Malyshev, Ivan A. Shumilov:
On a Simple Connection Between Δ-modular ILP and LP, and a New Bound on the Number of Integer Vertices. CoRR abs/2203.03907 (2022) - [i7]Dmitry V. GRathoreribanov, Dmitriy S. Malyshev, Ivan A. Shumilov:
Structured (min, +)-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems. CoRR abs/2209.04812 (2022) - 2021
- [j25]Dmitriy S. Malyshev, Olga O. Razvenskaya, Panos M. Pardalos:
The computational complexity of weighted vertex coloring for P5, K2, 3, K+2, 3-free graphs. Optim. Lett. 15(1): 137-152 (2021) - [j24]Dmitriy S. Malyshev:
The vertex colourability problem for claw, butterfly-free graphs is polynomial-time solvable. Optim. Lett. 15(2): 311-326 (2021) - [c4]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev:
Combinatorics and Algorithms for Quasi-chain Graphs. IWOCA 2021: 49-62 - [i6]Dmitry V. Gribanov, Dmitriy S. Malyshev:
Faster algorithm for counting of the integer points number in Δ-modular polyhedra. CoRR abs/2110.01732 (2021) - 2020
- [j23]Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev:
Independent domination versus weighted independent domination. Inf. Process. Lett. 156: 105914 (2020) - [j22]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): 1317-1322 (2020)
2010 – 2019
- 2019
- [j21]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): 761-788 (2019) - [c3]Dmitriy V. Gribanov, Dmitriy S. Malyshev:
Integer Conic Function Minimization Based on the Comparison Oracle. MOTOR 2019: 218-231 - 2018
- [j20]Dmitriy S. Malyshev:
The weighted coloring problem for two graph classes characterized by small forbidden induced structures. Discret. Appl. Math. 247: 423-432 (2018) - [j19]Dmitriy S. Malyshev, Dmitry V. Gribanov:
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices. Discret. Optim. 29: 103-110 (2018) - [j18]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): 1128-1146 (2018) - [i5]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 abs/1807.02790 (2018) - 2017
- [j17]Vadim V. Lozin, Dmitriy S. Malyshev:
Vertex coloring of graphs with few obstructions. Discret. Appl. Math. 216: 273-280 (2017) - [j16]Dmitriy S. Malyshev, O. O. Lobanova:
Two complexity results for the vertex coloring problem. Discret. Appl. Math. 219: 158-166 (2017) - [j15]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: 13-20 (2017) - [j14]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): 1009-1022 (2017) - [j13]Dmitriy S. Malyshev:
Polynomial-time approximation algorithms for the coloring problem in some cases. J. Comb. Optim. 33(3): 809-813 (2017) - [j12]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): 601-622 (2017) - [j11]Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev:
More results on weighted independent domination. Theor. Comput. Sci. 700: 63-74 (2017) - [c2]Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev:
New Results on Weighted Independent Domination. WG 2017: 399-411 - [i4]Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov:
FPT-algorithms for some problems related to integer programming. CoRR abs/1712.06309 (2017) - 2016
- [j10]Dmitriy S. Malyshev:
A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs. Discret. Appl. Math. 203: 117-126 (2016) - [j9]Dmitriy S. Malyshev:
Two cases of polynomial-time solvability for the coloring problem. J. Comb. Optim. 31(2): 833-845 (2016) - [j8]Dmitriy S. Malyshev:
A complexity dichotomy and a new boundary class for the dominating set problem. J. Comb. Optim. 32(1): 226-243 (2016) - [j7]Dmitriy S. Malyshev, Panos M. Pardalos:
Critical hereditary graph classes: a survey. Optim. Lett. 10(8): 1593-1612 (2016) - 2015
- [j6]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): 1860-1865 (2015) - [j5]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): 433-450 (2015) - [j4]Dmitriy S. Malyshev, Panos M. Pardalos:
The clique problem for graphs with a few eigenvalues of the same sign. Optim. Lett. 9(5): 839-843 (2015) - [i3]Dmitriy S. Malyshev, O. O. Lobanova:
The coloring problem for {P5, P̅5}-free graphs and {P5, Kp-e}-free graphs is polynomial. CoRR abs/1503.02550 (2015) - [i2]Dmitriy S. Malyshev:
A complexity dichotomy for the dominating set problem. CoRR abs/1506.00202 (2015) - 2014
- [j3]Dmitriy S. Malyshev:
Boundary graph classes for some maximum induced subgraph problems. J. Comb. Optim. 27(2): 345-354 (2014) - [j2]Dmitriy S. Malyshev:
The coloring problem for classes with two small obstructions. Optim. Lett. 8(8): 2261-2270 (2014) - 2013
- [i1]Dmitriy S. Malyshev:
The coloring problem for classes with two small obstructions. CoRR abs/1307.0278 (2013) - 2011
- [j1]Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin:
Boundary properties of graphs for algorithmic graph problems. Theor. Comput. Sci. 412(29): 3545-3554 (2011)
2000 – 2009
- 2008
- [c1]Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic:
The Maximum Independent Set Problem in Planar Graphs. MFCS 2008: 96-107
Coauthor Index
aka: Dmitriy V. Gribanov
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
