Citations

In this page we gather (in no particular order) papers that have used our datasets or some piece of our software. The list is not exhaustive, and we will be happy to include works that we missed.

•  Benjamin Piwowarski, Ingo Frommholz, Mounia Lalmas, and Keith van Rijsbergen. What can quantum theory bring to IR? In Jimmy Huang, Nick Koudas, Gareth Jones, Xindong Wu, Kevyn Collins Thompson, and Aijun An, editors, CIKM'10: Proceedings of the nineteenth ACM conference on Conference on information and knowledge management. ACM, 2010.
•  Debora Donato, Stefano Leonardi, Stefano Millozzi, and Panayiotis Tsaparas. Mining the inner structure of the web graph. Journal of Physics A: Mathematical and Theoretical, 41(22):224017, 2008.
•  Xuanhui Wang, Tao Tao, Jian Tao Sun, Azadeh Shakery, and Chengxiang Zhai. DirichletRank: Solving the zero-one gap problem of PageRank. ACM Trans. Inf. Syst, 26(2), 2008.
•  Clémence Magnien, Matthieu Latapy, and Michel Habib. Fast computation of empirically tight bounds for the diameter of massive graphs. J. Exp. Algorithmics, 13:10:1.10−10:1.9, 2009.
•  Robert Geisberger, Peter Sanders, and Dominik Schultes. Better approximation of betweenness centrality. In J. Ian Munro and Dorothea Wagner, editors, ALENEX, pages 90−100. SIAM, 2008.
•  Ilya Safro and Boris Temkin. Multiscale approach for the network compression-friendly ordering. Technical report, Argonne National Laboratory, 2010.
•  Alberto Apostolico and Guido Drovandi. Graph compression by BFS. Algorithms, 2(3):1031−1044, 2009.
•  Francisco Claude and Gonzalo Navarro. Fast and compact web graph representations. ACM Transactions on the Web (TWEB), 4(4):1−31, 2010.
•  Ricardo Baeza Yates and Carlos Castillo. Relationship between web links and trade. In Proceedings of the 15th international conference on World Wide Web, pages 927−928. ACM, 2006.
•  John Wicks and Amy Greenwald. Parallelizing the computation of PageRank. In Proceedings of the 5th international conference on Algorithms and models for the web graph, pages 202−208. Springer-Verlag, 2007.
•  Yana Volkovich, Nelly Litvak, and Debora Donato. Determining factors behind the PageRank log-log plot. In Proceedings of the 5th international conference on Algorithms and models for the web-graph, pages 108−123. Springer-Verlag, 2007.
•  Yana Volkovich, Nelly Litvak, and Bert Zwart. Measuring extremal dependencies in web graphs. In Proceedings of the 17th international conference on World Wide Web, pages 1113−1114. ACM, 2008.
•  Steve Chien, Dennis Fetterly, Mark Manasse, Marc Najork, and Alexandros Ntoulas. Microsoft silicon valley web spam challenge entry. In Proceedings of the 3rd International Workshop on Adversarial Information Retrieval on the Web (AIRWeb’07). Citeseer, 2007.
•  Md. Hijbul Alam, Jong Woo Ha, and Sang Keun Lee. Fractional PageRank crawler: Prioritizing URLs efficiently for crawling important pages early. In Database Systems for Advanced Applications, pages 590−594. Springer, 2009.
•  James B. Bassingthwaighte and Howard Jay Chizeck. The physiome projects and multiscale modeling [life sciences]. Signal Processing Magazine, IEEE, 25(2):121−144, 2008.
•  Carlos Castillo and Yiyu Yao. Evalware: Granular computing for web applications. IEEE Signal Processing Magazine, 25(2):142, 2008.
•  Yana Volkovich, Nelly Litvak, and Debora Donato. Web graph parameters and the pagerank distribution. 2008.
•  Carlos Castillo, Alberto Nelli, and Alessandro Panconesi. Controlling the queue size in web crawling.
•  Ricardo Baeza Yates, Aristides Gionis, Flavio Junqueira, Vanessa Murdock, Vassilis Plachouras, and Fabrizio Silvestri. The impact of caching on search engines. In Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pages 183−190. ACM, 2007.
•  Yana Volkovich, Nelly Litvak, and Bert Zwart. A framework for evaluating statistical dependencies and rank correlations in power law graphs. 2008.
•  Vincent D. Blondel, Jean Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008:P10008, 2008.
•  Santo Fortunato, Marián Boguñá, Alessandro Flammini, and Filippo Menczer. How to make the top ten: Approximating PageRank from in-degree. Arxiv preprint cs/0511016, 2005.
•  Ricardo Baeza Yates and Carlos Castillo. Link analysis in national web domains. OSWIR 2005, 10(3):15, 2005.
•  Barbara Poblete, Carlos Castillo, and Aristides Gionis. Dr. searcher and mr. browser: a unified hyperlink-click graph. In Proceedings of the 17th ACM conference on Information and knowledge management, pages 1123−1132. ACM, 2008.
•  Sheila Kinsella, Adriana Budura, Gleb Skobeltsyn, Sebastian Michel, John G. Breslin, and Karl Aberer. From web 1.0 to web 2.0 and back: how did your grandma use to tag? In Proceedings of the 10th ACM workshop on Web information and data management, pages 79−86. ACM, 2008.
•  Guang Gang Geng, Chun Heng Wang, and Qiu Dan Li. Improving spamdexing detection via a two-stage classification strategy. In Proceedings of the 4th Asia information retrieval conference on Information retrieval technology, pages 356−364. Springer-Verlag, 2008.
•  Guy Melancon. Just how dense are dense graphs in the real world?: a methodological note. In Proceedings of the 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization, pages 1−7. ACM, 2006.
•  Ali Cevahir, Cevdet Aykanat, Ata Turk, and Barla Cambazoglu. A web-site-based partitioning technique for reducing preprocessing overhead of parallel pagerank computation. Applied Parallel Computing. State of the Art in Scientific Computing, pages 908−918, 2010.
•  Ilaria Bordino, Debora Donato, Aristides Gionis, and Stefano Leonardi. Mining large networks with subgraph counting. In Data Mining, 2008. ICDM'08. Eighth IEEE International Conference on, pages 737−742. IEEE, 2009.
•  Ricardo Baeza Yates, Vanessa Murdock, and Claudia Hauff. Efficiency trade-offs in two-tier web search systems. In Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, pages 163−170. ACM, 2009.
•  Reid Andersen and Kumar Chellapilla. Finding dense subgraphs with size bounds. Algorithms and Models for the Web-Graph, pages 25−37, 2009.
•  Paolo Ferragina and Johannes Fischer. Suffix arrays on words. In Combinatorial Pattern Matching, pages 328−339. Springer, 2007.
•  Daniel Delling, Robert Görke, Christian Schulz, and Dorothea Wagner. Orca reduction and contraction graph clustering. Algorithmic Aspects in Information and Management, pages 152−165, 2009.
•  Farida Ridzuan, Vidyasagar Potdar, and Alex Talevski. Factors involved in estimating cost of email spam. Computational Science and Its Applications−ICCSA 2010, pages 383−399, 2010.
•  Paolo Ferragina and Rossano Venturini. Compressed permuterm index. In Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pages 535−542. ACM, 2007.
•  Xianchao Zhang, Bo Han, and Wenxin Liang. Automatic seed set expansion for trust propagation based anti-spamming algorithms. In Proceedings of the eleventh international workshop on Web information and data management, pages 31−38. ACM, 2009.