| Computing graph polynomials on graphs of bounded clique-width JA Makowsky, U Rotics, I Averbouch, B Godlin Graph-Theoretic Concepts in Computer Science: 32nd International Workshop …, 2006 | 58 | 2006 |
| An extension of the bivariate chromatic polynomial I Averbouch, B Godlin, JA Makowsky European Journal of Combinatorics 31 (1), 1-17, 2010 | 57 | 2010 |
| The enumeration of vertex induced subgraphs with respect to the number of components P Tittmann, I Averbouch, JA Makowsky European Journal of Combinatorics 32 (7), 954-974, 2011 | 40 | 2011 |
| A most general edge elimination polynomial I Averbouch, B Godlin, JA Makowsky International Workshop on Graph-Theoretic Concepts in Computer Science, 31-42, 2008 | 34 | 2008 |
| Automatic pattern-based operand prefetching I Averbouch, AJ Birnbaum, JT Hsieh, CLK Shum US Patent 8,954,678, 2015 | 23 | 2015 |
| Completeness and universality properties of graph invariants and graph polynomials I Averbouch, JA Makowsky Computer Science Department, Technion, 2011 | 11 | 2011 |
| The complexity of multivariate matching polynomials I Averbouch, JA Makowsky preprint, January, 2007 | 9 | 2007 |
| The universal edge elimination polynomial and the dichromatic polynomial I Averbouch, T Kotek, JA Makowsky, E Ravve Electronic Notes in Discrete Mathematics 38, 77-82, 2011 | 7 | 2011 |
| A graph polynomial arising from community structure I Averbouch, JA Makowsky, P Tittmann International Workshop on Graph-Theoretic Concepts in Computer Science, 33-43, 2009 | 4 | 2009 |
| Solving constraint satisfaction problems using a field programmable gate array I Averbouch, O Margalit, A Nahir, Y Naveh, G Shurek US Patent 9,337,845, 2016 | 2 | 2016 |
| Collision-based alternate hashing KJ Alexander, I Averbouch, AJ Birnbaum, JT Hsieh, CLK Shum US Patent 9,250,913, 2016 | | 2016 |
| Prefetch address translation using prefetch buffer based on availability of address translation logic KJ Alexander, I Averbouch, AJ Birnbaum, JT Hsieh, C Jacobi, S Paycher, ... US Patent 9,152,566, 2015 | | 2015 |
| Facilitating timing debug by logic path correspondence O Adler, E Arbel, I Averbouch, I Beer, I Grijnevitch 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE), 1-6, 2014 | | 2014 |
| A Case Study in Graph Polynomials: The Subgraph Component Polynomial I Averbouch, JA Makowsky, P Tittmann Logical Approaches to Barriers in Computing and Complexity, 6, 0 | | |
