By Dr Ali Shakiba

Preprints

Shakiba A, 2023, Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach, http://arxiv.org/abs/2301.00384v1

Shakiba A, 2022, Online Correlation Clustering for Dynamic Complete Signed Graphs, http://arxiv.org/abs/2211.07000v1

Meybodi MA; Hooshmandasl MR; Shakiba A, 2021, W[1]-hardness of Outer Connected Dominating set in d-degenerate Graphs, http://arxiv.org/abs/2111.02025v1

Shakiba A; Goharshady AK; Hooshmandasl M; Meybodi MA, 2018, A note on belief structures and S-approximation spaces, http://arxiv.org/abs/1805.10672v4

Meybodi MA; Hooshmandasl MR; Sharifani P; Shakiba A, 2018, Domination Cover Number of Graphs, http://arxiv.org/abs/1805.02345v1

Hashemipour M; Hooshmandasl MR; Shakiba A, 2018, On the complexity of the outer-connected bondage and the outer-connected reinforcement problems, http://arxiv.org/abs/1802.00649v1

Rajaati M; Sharifani P; Shakiba A; Hooshmandasl MR; Dinneen MJ, 2017, An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs, http://arxiv.org/abs/1708.00240v1

Hashemipour M; Hooshmandasl MR; Shakiba A, 2017, On outer-connected domination for graph products, http://arxiv.org/abs/1708.00188v1

Rajaati M; Hooshmandasl MR; Dinneen MJ; Shakiba A, 2016, On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width, http://dx.doi.org/10.23638/DMTCS-20-2-2

Hooshmandasl MR; Meybodi MA; Goharshady AK; Shakiba A, 2016, A combinatorial approach to certain topological spaces based on minimum complement S-approximation spaces, http://arxiv.org/abs/1602.00998v1

Back to profile page