| Publication | Date of Publication | Type |
|---|
| A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs | 2024-11-27 | Paper |
| A faster algorithm for counting the integer points number in \(\Delta \)-modular polyhedra | 2024-11-25 | Paper |
| Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems | 2024-08-27 | Paper |
| On 5- and 6-leaved trees with the largest number of matchings | 2024-07-09 | Paper |
| On efficient algorithms for bottleneck path problems with many sources | 2024-05-22 | Paper |
| On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems | 2024-03-22 | Paper |
| A complete classification of the complexity of the vertex 3-colourability problem for quadruples of induced 5-vertex prohibitions | 2024-01-24 | Paper |
| Critical properties of bipartite permutation graphs | 2024-01-04 | Paper |
| Faster Integer Points Counting in Parametric Polyhedra | 2023-10-20 | Paper |
| On the 80th anniversary of the birth of Vladislav Sergeevich Medvedev | 2023-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6054225 | 2023-09-27 | Paper |
| On diameter $5$ trees with the maximum number of matchings | 2023-09-02 | Paper |
| On linear algebraic algorithms for the subgraph matching problem and its variants | 2023-07-28 | Paper |
| A constructive existence theorem related to local transformations of graphs for the independent set problem | 2023-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5884517 | 2023-03-23 | Paper |
| Combinatorics and algorithms for quasi-chain graphs | 2023-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5878618 | 2023-02-21 | Paper |
| Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes | 2022-08-29 | Paper |
| Minimization of even conic functions on the two-dimensional integral lattice | 2022-07-15 | Paper |
| On the König graphs for a 5-path and its spanning supergraphs | 2022-07-15 | Paper |
| Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions | 2022-07-15 | Paper |
| Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem | 2022-07-15 | Paper |
| An intractability result for the vertex 3-colourability problem | 2022-05-16 | Paper |
| Enumeration of matchings in complete \(q\)-ary trees | 2022-05-05 | Paper |
| The number of maximal independent sets in trees with a given number of leaves | 2022-04-20 | Paper |
| Vyacheslav Zigmundovich Grines To his 75th birthday | 2022-03-28 | Paper |
| Combinatorics and algorithms for quasi-chain graphs | 2022-03-22 | Paper |
| On partial descriptions of König graphs for odd paths and all their spanning supergraphs | 2022-03-15 | Paper |
| A new proof of a result concerning a complete description of \((n, n + 2) \)-graphs with maximum value of the Hosoya index | 2022-03-14 | Paper |
| On topological classification of gradient-like flows on an \(n\)-sphere in the sense of topological conjugacy | 2021-10-20 | Paper |
| A faster algorithm for counting the integer points number in $\Delta$-modular polyhedra (corrected version) | 2021-10-04 | Paper |
| Trees with a given number of leaves and the maximal number of maximum independent sets | 2021-06-08 | Paper |
| On 3-colouring of graphs with short faces and bounded maximum vertex degree | 2021-06-07 | Paper |
| The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable | 2021-05-05 | Paper |
| The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs | 2021-02-26 | Paper |
| On topological classification of Morse–Smale diffeomorphisms on the sphere S n (n > 3) | 2020-11-26 | Paper |
| A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs | 2020-08-24 | Paper |
| Integer conic function minimization based on the comparison oracle | 2020-05-19 | Paper |
| Trees without twin-leaves with smallest number of maximal independent sets | 2020-02-17 | Paper |
| Independent domination versus weighted independent domination | 2020-02-11 | Paper |
| On algorithms that effectively distinguish gradient-like dynamics on surfaces | 2019-12-30 | Paper |
| All 2-neighborly d-polytopes with at most d + 9 facets | 2019-12-09 | Paper |
| On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size | 2019-12-02 | Paper |
| König Graphs with Respect to the 4-Path and Its Spanning Supergraphs | 2019-12-02 | Paper |
| On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets | 2018-11-21 | Paper |
| The weighted coloring problem for two graph classes characterized by small forbidden induced structures | 2018-09-06 | Paper |
| A method of graph reduction and its applications | 2018-09-03 | Paper |
| The computational complexity of dominating set problems for instances with bounded minors of constraint matrices | 2018-08-20 | Paper |
| Topological classification of \(\Omega\)-stable flows on surfaces by means of effectively distinguishable multigraphs | 2018-08-16 | Paper |
| A multicolour graph as a complete topological invariant for $ \Omega$-stable flows without periodic trajectories on surfaces | 2018-06-22 | Paper |
| On the number of maximal independent sets in complete \(q\)-ary trees | 2018-04-23 | Paper |
| Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs | 2018-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4602245 | 2018-01-09 | Paper |
| New results on weighted independent domination | 2018-01-04 | Paper |
| Complexity classification of the edge coloring problem for a family of graph classes | 2017-11-02 | Paper |
| More results on weighted independent domination | 2017-10-17 | Paper |
| The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs | 2017-10-11 | Paper |
| The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems | 2017-08-24 | Paper |
| Polynomial-time approximation algorithms for the coloring problem in some cases | 2017-06-22 | Paper |
| Critical elements in combinatorially closed families of graph classes | 2017-06-15 | Paper |
| Critical hereditary graph classes: a survey | 2017-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969538 | 2017-03-15 | Paper |
| Two complexity results for the vertex coloring problem | 2017-01-23 | Paper |
| Vertex coloring of graphs with few obstructions | 2016-11-24 | Paper |
| A complexity dichotomy and a new boundary class for the dominating set problem | 2016-10-20 | Paper |
| Efficient algorithms for the recognition of topologically conjugate gradient-like diffeomorhisms | 2016-06-16 | Paper |
| A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs | 2016-03-18 | Paper |
| Two cases of polynomial-time solvability for the coloring problem | 2016-02-23 | Paper |
| The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices | 2015-11-18 | Paper |
| Classes of graphs critical for the edge list-ranking problem | 2015-07-27 | Paper |
| The clique problem for graphs with a few eigenvalues of the same sign | 2015-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5263762 | 2015-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5263774 | 2015-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5263782 | 2015-07-17 | Paper |
| A study of the boundary graph classes for colorability problems | 2015-07-17 | Paper |
| Expanding operators for the independent set problem | 2015-07-17 | Paper |
| Classes of subcubic planar graphs for which the independent set problem is polynomially solvable | 2015-07-17 | Paper |
| The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs | 2015-06-29 | Paper |
| The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem | 2015-05-12 | Paper |
| A tolerance-based heuristic approach for the weighted independent set problem | 2015-02-16 | Paper |
| The coloring problem for classes with two small obstructions | 2014-12-05 | Paper |
| Efficient computation of tolerances in the weighted independent set problem for some classes of graphs | 2014-10-15 | Paper |
| Boundary graph classes for some maximum induced subgraph problems | 2014-04-08 | Paper |
| Efficient computation of tolerances in the weighted independent set problem for trees | 2013-11-11 | Paper |
| Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs | 2013-06-24 | Paper |
| On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number | 2013-04-29 | Paper |
| On the number of boundary classes in the 3-colouring problem | 2012-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115177 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115195 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115202 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115250 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115271 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115286 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115672 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115709 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115719 | 2012-02-10 | Paper |
| Boundary properties of graphs for algorithmic graph problems | 2011-07-14 | Paper |
| The Maximum Independent Set Problem in Planar Graphs | 2009-02-03 | Paper |
| Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems | N/A | Paper |
