| Publication | Date of Publication | Type |
|---|
Computing a 3-role assignment is polynomial-time solvable on complementary prisms
(available as arXiv preprint) | N/A | Paper |
Computing a 3-role assignment is polynomial-time solvable on complementary prisms
International Journal of Foundations of Computer Science | 2026-02-24 | Paper |
Carathéodory Number in Cycle Convexity
(available as arXiv preprint) | 2026-01-01 | Paper |
Computing the Exchange Number in Graphs with respect to Cycle Convexity
(available as arXiv preprint) | 2026-01-01 | Paper |
Computing the Helly Number, Radon Number and Rank in Cycle Convexity
(available as arXiv preprint) | 2026-01-01 | Paper |
Complexity and structural results for the hull and convexity numbers in cycle convexity for graph products
Discrete Applied Mathematics | 2025-09-17 | Paper |
Perfect matching cuts partitioning a graph into complementary subgraphs
Ars Mathematica Contemporanea | 2025-04-16 | Paper |
Complexity results on \(k\)-independence in some graph products
RAIRO. Operations Research | 2024-08-27 | Paper |
Distinct sizes of maximal independent sets on graphs with restricted girth
RAIRO. Operations Research | 2024-08-27 | Paper |
Study on (r+1)-role assignments of complementary prisms, with r 3
Matemática Contemporânea | 2024-05-24 | Paper |
On the monophonic convexity in complementary prisms
Discrete Applied Mathematics | 2024-01-02 | Paper |
Complexity and Structural Results for the Hull and Convexity Numbers in Cycle Convexity for Graph Products
(available as arXiv preprint) | 2024-01-01 | Paper |
Linear‐time algorithms for eliminating claws in graphs
International Transactions in Operational Research | 2023-11-29 | Paper |
On the complexity of coloring ‐graphs
International Transactions in Operational Research | 2023-11-23 | Paper |
Computing role assignments of Cartesian product of graphs
RAIRO - Operations Research | 2023-09-19 | Paper |
Perfect matching cuts partitioning a graph into complementary subgraphs
(available as arXiv preprint) | 2022-10-13 | Paper |
Perfect matching cuts partitioning a graph into complementary subgraphs
(available as arXiv preprint) | 2022-08-30 | Paper |
A polynomial time algorithm for geodetic hull number for complementary prisms
RAIRO - Theoretical Informatics and Applications | 2022-02-28 | Paper |
Computing some role assignments of Cartesian product of graphs
RAIRO - Operations Research | 2022-02-21 | Paper |
Partitioning a graph into complementary subgraphs
Graphs and Combinatorics | 2021-07-28 | Paper |
On the geodetic hull number for complementary prisms. II.
RAIRO - Operations Research | 2021-07-27 | Paper |
Linear-time algorithms for eliminating claws in graphs
(available as arXiv preprint) | 2021-04-21 | Paper |
Remarks on k-clique, k-independent set and 2-contamination in complementary prisms
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Partitioning a graph into complementary subgraphs
WALCOM: Algorithms and Computation | 2020-07-22 | 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 |
| On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs | 2017-02-14 | Paper |
