The SCEAS System
Navigation Menu

Search the dblp DataBase


Ilya Averbouch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin
    Computing Graph Polynomials on Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:191-204 [Conf]

  2. A Graph Polynomial Arising from Community Structure (Extended Abstract). [Citation Graph (, )][DBLP]

  3. A Most General Edge Elimination Polynomial. [Citation Graph (, )][DBLP]

  4. An extension of the bivariate chromatic polynomial. [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.001secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002