9 citations · 12 across the 9 of their papers we have counts for
10 papers
Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach
Ali Shakiba
In this paper, we reduce the complexity of approximating the correlation clustering problem from to for any given value of $\varepsilo…
Online Correlation Clustering for Dynamic Complete Signed Graphs
Ali Shakiba
In the correlation clustering problem for complete signed graphs, the input is a complete signed graph with edges weighted as (denote recommendation to put this pair in the sa…
W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs
Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Ali Shakiba
A set of a graph is called an outer-connected dominating set of if every vertex not in is adjacent to at least one vertex in , and the in…
Domination Cover Number of Graphs
M. Alambardar Meybodi, M. R. Hooshmandasl, P. Sharifani +1
A set for the graph is called a dominating set if any vertex has at least one neighbor in . Fomin et al.[9] gave an algorithm for…
A note on belief structures and S-approximation spaces
Ali Shakiba, Amir Kafshdar Goharshady, MohammadReza Hooshmandasl +1
We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempster's multivalued mappings and lower and upper probabi…
On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
M. Hashemipour, M. R. Hooshmandasl, A. Shakiba
Let be a graph. A subset is a dominating set of if every vertex not in is adjacent to a vertex in . A set of a graph $G…
An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs
M. Rajaati, P. Sharifani, A. Shakiba +2
A mixed dominating set of a graph is a subset such that each element is adjacent or incident to at least one ele…
On outer-connected domination for graph products
M. Hashemipour, M. R. Hooshmandasl, A. Shakiba
An outer-connected dominating set for an arbitrary graph is a set such that is a dominating set and the induced subgraph $G [V \setminus \ti…
On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
M. Rajaati, M. R. Hooshmandasl, M. J. Dinneen +1
A mixed dominating set for a graph is a set such that every element is either adjacent or incident to an element o…
A combinatorial approach to certain topological spaces based on minimum complement S-approximation spaces
M. R. Hooshmandasl, M. Alambardar Meybodi, A. K. Goharshady +1
An S-approximation space is a novel approach to study systems with uncertainty that are not expressible in terms of inclusion relations. In this work, we further examined these spa…