| Approximating s-t minimum cuts in Ő(n2) time AA Benczúr, DR Karger Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996 | 364 | 1996 |
| Spamrank–fully automatic link spam detection work in progress AA Benczur, K Csalogany, T Sarlos, M Uher Proceedings of the first international workshop on adversarial information …, 2005 | 296 | 2005 |
| Methods for large scale SVD with missing values M Kurucz, AA Benczúr, K Csalogány Proceedings of KDD cup and workshop 12, 31-38, 2007 | 194 | 2007 |
| Latent dirichlet allocation in web spam filtering I Bíró, J Szabó, AA Benczúr Proceedings of the 4th international workshop on Adversarial information …, 2008 | 154 | 2008 |
| Linked latent dirichlet allocation in web spam filtering I Bíró, D Siklósi, J Szabó, AA Benczúr Proceedings of the 5th International Workshop on Adversarial Information …, 2009 | 106 | 2009 |
| Web spam classification: a few features worth more M Erdélyi, A Garzó, AA Benczúr Proceedings of the 2011 Joint WICOW/AIRWeb Workshop on Web Quality, 27-34, 2011 | 105 | 2011 |
| Crowdsending based public transport information service in smart cities K Farkas, G Feher, A Benczur, C Sidlo IEEE Communications Magazine 53 (8), 158-165, 2015 | 95 | 2015 |
| To randomize or not to randomize: space optimal summaries for hyperlink analysis T Sarlós, AA Benczúr, K Csalogány, D Fogaras, B Rácz Proceedings of the 15th international conference on World Wide Web, 297-306, 2006 | 87 | 2006 |
| Framework for smart city applications based on participatory sensing R Szabó, K Farkas, M Ispány, AA Benczúr, N Bátfai, P Jeszenszky, S Laki, ... 2013 IEEE 4th International Conference on Cognitive Infocommunications …, 2013 | 84 | 2013 |
| Link-based similarity search to fight web spam AA Benczúr, K Csalogány, T Sarlós In AIRWEB, 2006 | 81 | 2006 |
| Randomized approximation schemes for cuts and flows in capacitated graphs AA Benczúr, DR Karger SIAM Journal on Computing 44 (2), 290-319, 2015 | 73 | 2015 |
| Longitudinal analytics on web archive data: It's about time! G Weikum, N Ntarmos, M Spaniol, P Triantafillou, AA Benczúr, ... CIDR, 199-202, 2011 | 70 | 2011 |
| Exploiting temporal influence in online recommendation R Pálovics, AA Benczúr, L Kocsis, T Kiss, E Frigó Proceedings of the 8th ACM Conference on Recommender systems, 273-280, 2014 | 62 | 2014 |
| Spectral clustering in telephone call graphs M Kurucz, A Benczúr, K Csalogány, L Lukács Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining …, 2007 | 59 | 2007 |
| Web spam detection via commercial intent analysis A Benczúr, I Bíró, K Csalogány, T Sarlós Proceedings of the 3rd international workshop on Adversarial information …, 2007 | 46 | 2007 |
| Covering symmetric supermodular functions by graphs AA Benczúr, A Frank Mathematical Programming 84 (3), 483-503, 1999 | 45 | 1999 |
| Detecting nepotistic links by language model disagreement AA Benczúr, I Bíró, K Csalogány, M Uher Proceedings of the 15th international conference on World Wide Web, 939-940, 2006 | 44 | 2006 |
| Counterexamples for directed and node capacitated cut-trees AA Benczúr SIAM Journal on Computing 24 (3), 505-510, 1995 | 44 | 1995 |
| Recsys challenge 2016: Job recommendations F Abel, A Benczúr, D Kohlsdorf, M Larson, R Pálovics Proceedings of the 10th ACM conference on recommender systems, 425-426, 2016 | 43 | 2016 |
| Augmenting undirected edge connectivity in O (n2) time AA Benczúr, DR Karger Journal of Algorithms 37 (1), 2-36, 2000 | 40 | 2000 |
Bálint DaróczyPostdoc. at Université catholique de Louvain & SZTAKIVerified email at uclouvain.be
