List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Completely independent spanning trees in split graphs: structural properties and complexity Discrete Applied Mathematics | 2026-07-02 | Paper |
| The k-way vertex cut problem on bipartite graphs: complexity results and algorithms Discrete Optimization | 2025-07-08 | Paper |
| Eternal feedback vertex sets: a new graph protection model using guards Discrete Mathematics, Algorithms and Applications | 2024-06-24 | Paper |
| Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items Computers & Operations Research | 2023-07-03 | Paper |
| A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs Optimization Letters | 2019-10-18 | Paper |
| The critical node detection problem in networks: a survey Computer Science Review | 2018-05-18 | Paper |
| Component-cardinality-constrained critical node problem in graphs Discrete Applied Mathematics | 2016-06-22 | Paper |
Research outcomes over time
This page was built for person: M. Lalou
