Dmitriy S. Malyshev

47 papers B 2C 1Journal 42Unranked 2

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