Ilya Averbouch

According to our database, Ilya Averbouch authored at least 6 papers between 2006 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

The enumeration of vertex induced subgraphs with respect to the number of components.

Peter Tittmann, Ilya Averbouch, Johann A. Makowsky

Eur. J. Comb., 2011

2010

An extension of the bivariate chromatic polynomial.

Ilya Averbouch, Benny Godlin, Johann A. Makowsky

Eur. J. Comb., 2010

2009

A Graph Polynomial Arising from Community Structure (Extended Abstract).

Ilya Averbouch, Johann A. Makowsky, Peter Tittmann

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008

A Most General Edge Elimination Polynomial.

Ilya Averbouch, Benny Godlin, Johann A. Makowsky

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2006

Computing Graph Polynomials on Graphs of Bounded Clique-Width.

Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006