Dmitriy S. Malyshev

Ivan A. Shumilov

Oper. Res. Forum, June, 2024

On efficient algorithms for bottleneck path problems with many sources.

[BibT_eX]

[DOI]

Kirill V. Kaymakov

Optim. Lett., June, 2024

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

[BibT_eX]

[DOI]

J. Glob. Optim., March, 2024

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

[BibT_eX]

[DOI]

Ivan A. Shumilov

Optim. Lett., January, 2024

Critical properties of bipartite permutation graphs.

[BibT_eX]

[DOI]

Bogdan Alecu

Vadim V. Lozin

J. Graph Theory, January, 2024

Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem.

[BibT_eX]

[DOI]

Kirill V. Kaymakov

CoRR, 2024

Delta-modular ILP Problems of Bounded Co-dimension, Discrepancy, and Convolution.

[BibT_eX]

[DOI]

CoRR, 2024

2023

On linear algebraic algorithms for the subgraph matching problem and its variants.

[BibT_eX]

[DOI]

Optim. Lett., September, 2023

Combinatorics and Algorithms for Quasi-Chain Graphs.

[BibT_eX]

[DOI]

Algorithmica, March, 2023

Faster Integer Points Counting in Parametric Polyhedra.

[BibT_eX]

[DOI]

CoRR, 2023

2022

On partial descriptions of König graphs for odd paths and all their spanning supergraphs.

[BibT_eX]

[DOI]

Dmitry B. Mokeev

Optim. Lett., 2022

An intractability result for the vertex 3-colourability problem.

[BibT_eX]

[DOI]

O. V. Pristavchenko

Optim. Lett., 2022

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

[BibT_eX]

[DOI]

Dmitrii S. Taletskii

Dmitry V. GRathoreribanov

Discret. Appl. Math., 2022

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

[BibT_eX]

[DOI]

Ivan A. Shumilov

CoRR, 2022

Faster ILP Algorithms for Problems with Sparse Matrices and Their Applications to Multipacking and Multicover Problems in Graphs and Hypergraphs.

[BibT_eX]

[DOI]

CoRR, 2022

Faster Exploration of Some Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

2021

The computational complexity of weighted vertex coloring for P5, K2, 3, K+2, 3-free graphs.

[BibT_eX]

[DOI]

Olga O. Razvenskaya

Optim. Lett., 2021

The vertex colourability problem for claw, butterfly-free graphs is polynomial-time solvable.

[BibT_eX]

[DOI]

Optim. Lett., 2021

Faster algorithm for counting of the integer points number in Δ-modular polyhedra.

[BibT_eX]

[DOI]

CoRR, 2021

2020

A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs.

[BibT_eX]

[DOI]

Dmitry B. Mokeev

Optim. Lett., 2020

Independent domination versus weighted independent domination.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

2019

On the complexity of quasiconvex integer minimization problem.

[BibT_eX]

[DOI]

Aleksandr Yu. Chirkov

J. Glob. Optim., 2019

Integer Conic Function Minimization Based on the Comparison Oracle.

[BibT_eX]

[DOI]

Dmitriy V. Gribanov

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

2018

FPT-algorithms for some problems related to integer programming.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

The computational complexity of dominating set problems for instances with bounded minors of constraint matrices.

[BibT_eX]

[DOI]

Discret. Optim., 2018

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

More results on weighted independent domination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems.

[BibT_eX]

[DOI]

J. Glob. Optim., 2017

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

The Complexity of the Vertex 3-Colorability Problem for Some Hereditary Classes Defined By 5-Vertex Forbidden Induced Subgraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Two complexity results for the vertex coloring problem.

[BibT_eX]

[DOI]

O. O. Lobanova

Discret. Appl. Math., 2017

Vertex coloring of graphs with few obstructions.

[BibT_eX]

[DOI]

Vadim V. Lozin

Discret. Appl. Math., 2017

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

New Results on Weighted Independent Domination.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

Critical hereditary graph classes: a survey.

[BibT_eX]

[DOI]

Optim. Lett., 2016

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Two cases of polynomial-time solvability for the coloring problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

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

[BibT_eX]

[DOI]

Optim. Lett., 2015

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

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

[BibT_eX]

[DOI]

Discret. Math., 2015

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

[BibT_eX]

[DOI]

O. O. Lobanova

CoRR, 2015

A complexity dichotomy for the dominating set problem.

[BibT_eX]

[DOI]

CoRR, 2015

2014

The coloring problem for classes with two small obstructions.

[BibT_eX]

[DOI]

Optim. Lett., 2014

Boundary graph classes for some maximum induced subgraph problems.

[BibT_eX]

[DOI]