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 |
|---|---|---|
| The complexity of Boolean failure identification Theoretical Computer Science | 2025-11-10 | Paper |
| Cluster deletion and clique partitioning in graphs with bounded clique number (available as arXiv preprint) | 2025-01-01 | Paper |
| Vertex-connectivity for node failure identification in Boolean network tomography | 2024-04-05 | Paper |
| Vertex-connectivity for node failure identification in Boolean network tomography Information Processing Letters | 2024-03-26 | Paper |
| Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography Theoretical Computer Science | 2022-05-10 | Paper |
| Inverse Galois Problem and Significant Methods | 2015-12-25 | Paper |
| Inverse Galois Problem and Significant Methods (available as arXiv preprint) | 2015-01-01 | Paper |
Research outcomes over time
This page was built for person: Fariba Ranjbar
