Computing Graph Polynomials on Graphs of Bounded Clique-Width. - Johann A. Makowsky; Udi Rotics; Ilya Averbouch; Benny Godlin (WG, 2006)

A Most General Edge Elimination Polynomial. - Ilya Averbouch; Benny Godlin; Johann A. Makowsky (WG, 2008)

A Graph Polynomial Arising from Community Structure (Extended Abstract). - Ilya Averbouch; Johann A. Makowsky; Peter Tittmann 001 (WG, 2009)

An extension of the bivariate chromatic polynomial. - Ilya Averbouch; Benny Godlin; Johann A. Makowsky (Eur. J. Comb., 2010)

The enumeration of vertex induced subgraphs with respect to the number of components. - Peter Tittmann 001; Ilya Averbouch; Johann A. Makowsky (Eur. J. Comb., 2011)

The Universal Edge Elimination Polynomial and the Dichromatic Polynomial. - Ilya Averbouch; Tomer Kotek; Johann A. Makowsky; Elena V. Ravve (Electron. Notes Discret. Math., 2011)