Fariba Ranjbar

13 papers A 1C 1Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Cluster deletion and clique partitioning in graphs with bounded clique number.
CoRR
Nicola Galesi, Tony Huynh, Fariba Ranjbar
2025 J jnl
Local Clustering in Hypergraphs through Higher-Order Motifs.
CoRR
Giuseppe F. Italiano, Athanasios L. Konstantinidis, Anna Mpanti, Fariba Ranjbar
2025 J jnl
The complexity of boolean failure identification.
Theor. Comput. Sci.
Nicola Galesi, Fariba Ranjbar
2024 J jnl
Consistent Strong Triadic Closure in Multilayer Networks.
CoRR
Lutz Oettershagen, Athanasios L. Konstantinidis, Fariba Ranjbar, Giuseppe F. Italiano
2024 — conf
The Complexity of Boolean Failure Identification.
ICTCS
Nicola Galesi, Fariba Ranjbar
2024 J jnl
Vertex-connectivity for node failure identification in Boolean Network Tomography.
Inf. Process. Lett.
Nicola Galesi, Fariba Ranjbar, Michele Zito
2022 J jnl
Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography.
Theor. Comput. Sci.
Nicola Galesi, Fariba Ranjbar
2021 — —
Bounds on the maximal number of corrupted nodes via Boolean Network Tomography.
Fariba Ranjbar
2021 J jnl
Counting and localizing defective nodes by Boolean network tomography.
CoRR
Nicola Galesi, Fariba Ranjbar
2019 C conf
Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography.
ALGOSENSORS
Nicola Galesi, Fariba Ranjbar, Michele Zito
2018 A conf
Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography.
ICDCS
Nicola Galesi, Fariba Ranjbar
2018 J jnl
Vertex-Connectivity Measures for Node Failure Identification in Boolean Network Tomography.
CoRR
Nicola Galesi, Fariba Ranjbar, Michele Zito
2017 J jnl
Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography.
CoRR
Nicola Galesi, Fariba Ranjbar