| Publication | Date of Publication | Type |
|---|
An efficient heuristic for a real-life OAS problem
Operations Research and Decisions | 2026-02-23 | Paper |
Seven largest trees pack
Opuscula Mathematica | 2024-09-04 | Paper |
A note on the integrity of grids
Discrete Applied Mathematics | 2023-11-13 | Paper |
Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\)
European Journal of Combinatorics | 2022-12-28 | Paper |
A note on packing of uniform hypergraphs
Discussiones Mathematicae Graph Theory | 2022-07-26 | Paper |
Largest component and node fault tolerance for grids
The Electronic Journal of Combinatorics | 2021-03-17 | Paper |
On the minimum size of Hamilton saturated hypergraphs
The Electronic Journal of Combinatorics | 2020-12-03 | Paper |
Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs
Discrete Applied Mathematics | 2019-02-20 | Paper |
Toward Wojda's conjecture on digraph packing
Opuscula Mathematica | 2018-10-23 | Paper |
Near packings of two graphs
Discrete Mathematics | 2017-02-27 | Paper |
Packing large trees of consecutive orders
Discrete Mathematics | 2016-12-14 | Paper |
Upper bounds on the minimum size of Hamilton saturated hypergraphs
The Electronic Journal of Combinatorics | 2016-12-06 | Paper |
On Erdős-Sós conjecture for trees of large size
The Electronic Journal of Combinatorics | 2016-05-03 | Paper |
On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
General lower bound on the size of \((H; k)\)-stable graphs
Journal of Combinatorial Optimization | 2015-02-16 | Paper |
A generalization of an independent set with application to \((K_q; k)\)-stable graphs
Discrete Applied Mathematics | 2014-09-12 | Paper |
On embedding graphs with bounded sum of size and maximum degree
Discrete Mathematics | 2014-06-25 | Paper |
| scientific article; zbMATH DE number 6273737 (Why is no real title available?) | 2014-03-25 | Paper |
On (\(K_q;k\))-stable graphs
Journal of Graph Theory | 2013-10-21 | Paper |
Near packings of graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Hamilton saturated hypergraphs of essentially minimum size
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Growth order for the size of smallest Hamiltonian chain saturated uniform hypergraphs
European Journal of Combinatorics | 2013-03-06 | Paper |
Sparse graphs of girth at least five are packable
Discrete Mathematics | 2012-11-20 | Paper |
A lower bound on the size of \((H;1)\)-vertex stable graphs
Discrete Mathematics | 2012-10-16 | Paper |
A note on k-placeable graphs
Discrete Mathematics | 2012-04-13 | Paper |
On \((C_n;k)\) stable graphs
The Electronic Journal of Combinatorics | 2011-11-22 | Paper |
On vertex stability with regard to complete bipartite subgraphs
Discussiones Mathematicae Graph Theory | 2011-05-09 | Paper |
On packable digraphs
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Dissections of polygons into convex polygons
International Journal of Computational Geometry & Applications | 2010-05-28 | Paper |
Hamilton-chain saturated hypergraphs
Discrete Mathematics | 2010-04-27 | Paper |
A note on packing graphs without cycles of length up to five
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
A note on packing graphs without cycles of length up to five
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Harmonious order of graphs
Discrete Mathematics | 2009-12-15 | Paper |
| A note on perfect dissections of an equilateral triangle | 2009-07-06 | Paper |
Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree
Discrete Mathematics | 2009-06-17 | Paper |
| Rainbow regular order of graphs | 2009-01-15 | Paper |
Dissection of a triangle into similar triangles
Discrete & Computational Geometry | 2005-11-01 | Paper |
