| A random walk method for alleviating the sparsity problem in collaborative filtering H Yildirim, MS Krishnamoorthy Proceedings of the 2008 ACM conference on Recommender systems, 131-138, 2008 | 272 | 2008 |
| Grail: Scalable reachability index for large graphs H Yildirim, V Chaoji, MJ Zaki Proceedings of the VLDB Endowment 3 (1-2), 276-284, 2010 | 207 | 2010 |
| Dagger: A scalable index for reachability queries in large dynamic graphs H Yildirim, V Chaoji, MJ Zaki arXiv preprint arXiv:1301.0977, 2013 | 41 | 2013 |
| ABACUS: Mining arbitrary shaped clusters from large datasets based on backbone identification V Chaoji, G Li, H Yildirim, MJ Zaki Proceedings of the 2011 SIAM International Conference on Data Mining, 295-306, 2011 | 27 | 2011 |
| Sonnet: Efficient approximate nearest neighbor using multi-core M Al Hasan, H Yildirim, A Chakraborty 2010 IEEE International Conference on Data Mining, 719-724, 2010 | 7 | 2010 |
| Graph indexing for reachability queries H Yildirim, MJ Zaki 2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW …, 2010 | 6 | 2010 |
| Scalable reachability indexing for very large graphs H Yildirim Rensselaer Polytechnic Institute, 2011 | 5 | 2011 |
| A study of the Sudoku graph family H Yildirim, MS Krishnamoorthy, N Deo Proceedings of the Thirty-Ninth Southeastern International Conference on …, 2008 | 2 | 2008 |
| A random walk method for handling sparse training set in collaborative filtering H Yildirim Rensselaer Theses and Dissertations Online Collection, 2007 | | 2007 |
| Hidden Markov Models and Analysis of PyrococcusHorikoshii Genome H Yildirim | | |
