| Publication | Date of Publication | Type |
|---|
Complexity results on \(k\)-independence in some graph products RAIRO. Operations Research | 2024-08-27 | Paper |
Induced-paired dominating sets in lexicographic product of graphs Matemática Contemporânea | 2024-05-06 | Paper |
Interval number \(P_3\) of prisms complementary of acyclic graphs Matemática Contemporânea | 2024-04-25 | Paper |
On the \(l\)-neighborhood convexity Matemática Contemporânea | 2024-04-22 | Paper |
On the oriented coloring of the disjoint union of graphs RAIRO - Operations Research | 2024-04-14 | Paper |
Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs Discrete Applied Mathematics | 2022-11-02 | Paper |
Perfect matching cuts partitioning a graph into complementary subgraphs (available as arXiv preprint) | 2022-10-13 | Paper |
\(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers Discrete Applied Mathematics | 2022-09-15 | Paper |
Perfect matching cuts partitioning a graph into complementary subgraphs (available as arXiv preprint) | 2022-08-30 | Paper |
Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs Discrete Mathematics & Theoretical Computer Science | 2022-06-08 | Paper |
| \(P_3\)-hull number of graphs with diameter two | 2022-04-27 | Paper |
| Open-independent, open-locating-dominating sets in complementary prism graphs | 2022-04-27 | Paper |
Identifying codes in the complementary prism of cycles (available as arXiv preprint) | 2022-04-27 | Paper |
| On the oriented coloring of the disjoint union of graphs | 2022-03-22 | Paper |
A polynomial time algorithm for geodetic hull number for complementary prisms RAIRO - Theoretical Informatics and Applications | 2022-02-28 | Paper |
On the geodetic hull number for complementary prisms. II. RAIRO - Operations Research | 2021-07-27 | Paper |
A note on the convexity number for complementary prisms (available as arXiv preprint) | 2019-08-01 | Paper |
| A note on the convexity number for complementary prisms | 2019-08-01 | Paper |
On the geodetic number of complementary prisms Information Processing Letters | 2019-02-13 | Paper |
On the \(P_3\)-hull number of some products of graphs Discrete Applied Mathematics | 2018-12-18 | Paper |
| Maximal independent sets in complementary prism graphs. | 2018-06-15 | Paper |
| On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs | 2017-02-14 | Paper |
Inapproximability results for graph convexity parameters Theoretical Computer Science | 2015-09-16 | Paper |
Identifying Codes in the Complementary Prism of Cycles (available as arXiv preprint) | 2015-07-17 | Paper |
Inapproximability results for graph convexity parameters Approximation and Online Algorithms | 2014-09-02 | Paper |
| scientific article; zbMATH DE number 6302989 (Why is no real title available?) | 2014-06-11 | Paper |
The Carathéodory number of the \(P_3\) convexity of chordal graphs Discrete Applied Mathematics | 2014-05-06 | Paper |
| On the Carathéodory number for the convexity of paths of order three | 2013-11-01 | Paper |
On the Carathéodory number for the convexity of paths of order three SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
The colorful Helly theorem and general hypergraphs European Journal of Combinatorics | 2012-05-04 | Paper |