The following pages link to Dmitriy S. Malyshev (Q1669582):
Displaying 18 items.
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- The coloring problem for classes with two small obstructions (Q479257) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- Topological classification of \(\Omega\)-stable flows on surfaces by means of effectively distinguishable multigraphs (Q1661171) (← links)
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices (Q1662648) (← links)
- A method of graph reduction and its applications (Q1669583) (← links)
- The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
- Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
- On the number of maximal independent sets in complete \(q\)-ary trees (Q1744293) (← links)
- On algorithms that effectively distinguish gradient-like dynamics on surfaces (Q2283194) (← links)
- Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)
- On a Simple Connection Between $\Delta$-modular ILP and LP, and a New Bound on the Number of Integer Vertices (Q6505562) (← links)
- Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems (Q6507712) (← links)
