Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography. - Nicola Galesi; Fariba Ranjbar (ICDCS, 2018)

Vertex-Connectivity Measures for Node Failure Identification in Boolean Network Tomography. - Nicola Galesi; Fariba Ranjbar; Michele Zito 001 (CoRR, 2018)

Counting and localizing defective nodes by Boolean network tomography. - Nicola Galesi; Fariba Ranjbar (CoRR, 2021)

Bounds on the maximal number of corrupted nodes via Boolean Network Tomography. - Fariba Ranjbar (2021)

Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography. - Nicola Galesi; Fariba Ranjbar (Theor. Comput. Sci., 2022)

The Complexity of Boolean Failure Identification. - Nicola Galesi; Fariba Ranjbar (ICTCS, 2024)

Consistent Strong Triadic Closure in Multilayer Networks. - Lutz Oettershagen; Athanasios L. Konstantinidis; Fariba Ranjbar; Giuseppe F. Italiano (CoRR, 2024)

Vertex-connectivity for node failure identification in Boolean Network Tomography. - Nicola Galesi; Fariba Ranjbar; Michele Zito 001 (Inf. Process. Lett., 2024)

Cluster deletion and clique partitioning in graphs with bounded clique number. - Nicola Galesi; Tony Huynh; Fariba Ranjbar (CoRR, 2025)

Local Clustering in Hypergraphs through Higher-Order Motifs. - Giuseppe F. Italiano; Athanasios L. Konstantinidis; Anna Mpanti; Fariba Ranjbar (CoRR, 2025)