| Publication | Date of Publication | Type |
|---|
Minimization of the diameters of edges in the packing of a hypergraph into a \(d\)-dimensional lattice
Vestsi Natsyyanal'naĭ Akadèmii Navuk Belarusi. Seryya Fizika-Matèmatychnykh Navuk | 2025-01-17 | Paper |
A linear algorithm for determining the minimum-weight vertex cover of a \(k\)-terminal recursively generated hypergraph
Vestsi Natsyyanal'naĭ Akadèmii Navuk Belarusi. Seryya Fizika-Matèmatychnykh Navuk | 2025-01-17 | Paper |
| A linear algorithm for computing of a minimum weight maximal induced matching in an edge-weighted tree | 2022-09-28 | Paper |
| A polynomial time algorithm for checking 2-chromaticity for recursively constructed \(k\)-terminal hypergraphs | 2022-09-28 | Paper |
| The weighted \(k\)-path vertex cover problem on series-parallel graphs | 2019-07-19 | Paper |
| Solving the weighted \(k\)-separator problem in graphs with specific modules | 2018-10-25 | Paper |
| Algorithms for solving problems on graphs of bounded pathwidth | 2018-10-24 | Paper |
| Problems and invariants connected with bicliques and multicliques of graphs | 2018-10-24 | Paper |
| On biclique covering number of the Cartesian product of graphs | 2018-10-24 | Paper |
| Computation of the biclique partition number for graphs with specific blocks | 2018-10-24 | Paper |
| Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph | 2018-10-24 | Paper |
| Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth | 2018-10-24 | Paper |
| Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs with special blocks | 2018-10-24 | Paper |
| On the biclique partition of the corona and joins of graphs | 2017-07-14 | Paper |
| Algorithms for solving the \(k\)-star hub problem for trees and series-parallel graphs | 2015-11-02 | Paper |
| On cycle covers of graphs with bounded pathwidth | 2012-12-08 | Paper |
Algorithms for finding biclique covers of graphs with bounded pathwidth
Trudy Instituta Matematiki | 2012-09-05 | Paper |
| scientific article; zbMATH DE number 5863491 (Why is no real title available?) | 2011-03-09 | Paper |
| The profile of the corona \(G\wedge H\), where \(G\) is a Halin graph, whose tree is a caterpillar | 2011-03-09 | Paper |
| Minimization of the half-perimeters of edges in the arrangement of a hypergraph on a lattice | 2010-11-25 | Paper |
| On minimal cuts of recursively generated hypergraphs | 2010-11-25 | Paper |
| A linear algorithm for computing the multiclique cover number of a series-parallel graph | 2010-01-07 | Paper |
| scientific article; zbMATH DE number 5654614 (Why is no real title available?) | 2010-01-07 | Paper |
| Capacity complexity of the accessibility problem for frontally bounded digraphs | 2009-12-11 | Paper |
| An algorithm for finding the independence number of a recursively generated hypergraph | 2009-04-14 | Paper |
| scientific article; zbMATH DE number 5543290 (Why is no real title available?) | 2009-04-14 | Paper |
| The tree profile problem and optimal edge labeling. | 2009-03-29 | Paper |
A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| scientific article; zbMATH DE number 2107118 (Why is no real title available?) | 2004-10-11 | Paper |
| scientific article; zbMATH DE number 2107051 (Why is no real title available?) | 2004-10-11 | Paper |
| scientific article; zbMATH DE number 2073575 (Why is no real title available?) | 2004-06-11 | Paper |
| scientific article; zbMATH DE number 992954 (Why is no real title available?) | 1997-05-04 | Paper |
| scientific article; zbMATH DE number 781195 (Why is no real title available?) | 1995-12-13 | Paper |
| scientific article; zbMATH DE number 3924793 (Why is no real title available?) | 1985-01-01 | Paper |
