Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. - Andreas Brandstädt; Suhail Mahfud (Inf. Process. Lett., 2002)

P6- and triangle-free graphs revisited: structure and bounded clique-width. - Andreas Brandstädt; Tilo Klembt; Suhail Mahfud (Discret. Math. Theor. Comput. Sci., 2006)

New applications of clique separator decomposition for the Maximum Weight Stable Set problem. - Andreas Brandstädt; Van Bang Le; Suhail Mahfud (Theor. Comput. Sci., 2007)

Bounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs. - Andreas Brandstädt; Suhail Mahfud; Raffaele Mosca (CoRR, 2016)

Irreversible k -Threshold Conversion Number of Circulant Graphs. - Ramy Shaheen; Suhail Mahfud; Ali Kassem 005 (J. Appl. Math., 2022)

Chromatic Schultz and Gutman Polynomials of Jahangir Graphs J 2 , m and J 3 , m. - Ramy Shaheen; Suhail Mahfud; Qays Alhawat (J. Appl. Math., 2023)