The following pages link to Dmitriy S. Malyshev (Q1669582):
Displaying 50 items.
- (Q247939) (redirect page) (← links)
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- Efficient algorithms for the recognition of topologically conjugate gradient-like diffeomorhisms (Q294482) (← 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)
- Efficient computation of tolerances in the weighted independent set problem for trees (Q378171) (← links)
- Efficient computation of tolerances in the weighted independent set problem for some classes of graphs (Q461929) (← 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)
- The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices (Q892049) (← links)
- (Q1661169) (redirect page) (← 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)
- New results on weighted independent domination (Q1687938) (← links)
- On the number of maximal independent sets in complete \(q\)-ary trees (Q1744293) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- On 3-colouring of graphs with short faces and bounded maximum vertex degree (Q2030141) (← links)
- Trees with a given number of leaves and the maximal number of maximum independent sets (Q2031165) (← links)
- A new proof of a result concerning a complete description of \((n, n + 2) \)-graphs with maximum value of the Hosoya index (Q2113426) (← links)
- On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
- The number of maximal independent sets in trees with a given number of leaves (Q2127636) (← links)
- Enumeration of matchings in complete \(q\)-ary trees (Q2133819) (← links)
- An intractability result for the vertex 3-colourability problem (Q2136878) (← links)
- Integer conic function minimization based on the comparison oracle (Q2181760) (← links)
- A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977) (← links)
- On topological classification of gradient-like flows on an \(n\)-sphere in the sense of topological conjugacy (Q2235118) (← links)
- A tolerance-based heuristic approach for the weighted independent set problem (Q2253961) (← links)
- On algorithms that effectively distinguish gradient-like dynamics on surfaces (Q2283194) (← links)
- Independent domination versus weighted independent domination (Q2294440) (← links)
- Trees without twin-leaves with smallest number of maximal independent sets (Q2295975) (← links)
- The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
- The clique problem for graphs with a few eigenvalues of the same sign (Q2355311) (← links)
- Polynomial-time approximation algorithms for the coloring problem in some cases (Q2359789) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
- More results on weighted independent domination (Q2410364) (← links)
- Boundary graph classes for some maximum induced subgraph problems (Q2444152) (← links)
- (Q2969538) (← links)
- (Q3115177) (← links)
- (Q3115195) (← links)
- (Q3115202) (← links)
- (Q3115250) (← links)
- (Q3115271) (← links)
- (Q3115286) (← links)
