Paolo Boldi

Proceedings of the Encyclopedia of Big Data Technologies., 2019

Graph Invariants.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Big Data Technologies., 2019

Rank monotonicity in centrality measures - Corrigendum.

[BibT_eX]

[DOI]

Netw. Sci., 2019

The Case for Kendall's Assortativity.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks and Their Applications VIII, 2019

How Network Analysis Can Improve the Reliability of Modern Software Ecosystems.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI), 2019

2018

On the Lattice of Antichains of Finite Intervals.

[BibT_eX]

[DOI]

Order, 2018

Correction to: Evaluating the impact of topological protein features on the negative examples selection.

[BibT_eX]

[DOI]

Marco Frasca

Dario Malchiodi

BMC Bioinform., 2018

Evaluating the impact of topological protein features on the negative examples selection.

[BibT_eX]

[DOI]

Marco Frasca

Dario Malchiodi

BMC Bioinform., 2018

Kings, Name Days, Lazy Servants and Magic.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017

Rank monotonicity in centrality measures.

[BibT_eX]

[DOI]

Alessandro Luongo

Netw. Sci., 2017

Estimating latent feature-feature interactions in large feature-rich graphs.

[BibT_eX]

[DOI]

Katharina Kinder-Kurlanda

Internet Math., 2017

The Ethics of Doing Web Science Research: Panel Abstract.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on Web Science Conference, 2017

2016

Monotone Minimal Perfect Hash Functions.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Minimal Perfect Hash Functions.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Efficient optimally lazy algorithms for minimal-interval semantics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Using graph distances for named-entity linking.

[BibT_eX]

[DOI]

Roi Blanco

Andrea Marino

Sci. Comput. Program., 2016

A network model characterized by a latent attribute structure with competition.

[BibT_eX]

[DOI]

Irene Crimaldi

Inf. Sci., 2016

LlamaFur: Learning Latent Category Matrix to Find Unexpected Relations in Wikipedia (Long version).

[BibT_eX]

[DOI]

CoRR, 2016

Cleansing Wikipedia Categories using Centrality.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on World Wide Web, 2016

LlamaFur: learning latent category matrix to find unexpected relations in Wikipedia.

[BibT_eX]

[DOI]

Proceedings of the 8th ACM Conference on Web Science, 2016

2015

Large-scale Network Analytics: Diffusion-based Computation of Distances and Geometric Centralities.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on World Wide Web Companion, 2015

Essential Web Pages Are Easy to Find.

[BibT_eX]

[DOI]

Ricardo Baeza-Yates

Flavio Chierichetti

Proceedings of the 24th International Conference on World Wide Web, 2015

Local Ranking Problem on the BrowseGraph.

[BibT_eX]

[DOI]

Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015

Minimal and Monotone Minimal Perfect Hash Functions.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Liquid FM: Recommending Music through Viscous Democracy.

[BibT_eX]

[DOI]

Proceedings of the 6th Italian Information Retrieval Workshop, 2015

2014

Web and Social Graph Mining.

[BibT_eX]

[DOI]

Stefano Leonardi

Cecilia Mascolo

Michalis Vazirgiannis

IEEE Internet Comput., 2014

Axioms for Centrality.

[BibT_eX]

[DOI]

Internet Math., 2014

Entity-Linking via Graph-Distance Minimization.

[BibT_eX]

[DOI]

Roi Blanco

Andrea Marino

Proceedings of the Proceedings 3rd Workshop on GRAPH Inspection and Traversal Engineering, 2014

BUbiNG: massive crawling for the masses.

[BibT_eX]

[DOI]

Proceedings of the 23rd International World Wide Web Conference, 2014

Algorithmic Gems in the Data Miner's Cave.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Cache-Oblivious Peeling of Random Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2014

2013

Robustness of social and web graphs to node removal.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2013

In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE International Conference on Data Mining Workshops, 2013

2012

Injecting Uncertainty in Graphs for Identity Obfuscation.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2012

Special Issue on Fun with Algorithms.

[BibT_eX]

[DOI]

Luisa Gargano

Theory Comput. Syst., 2012

Predecessor search with distance-sensitive query time

[BibT_eX]

[DOI]

Djamal Belazzougui

CoRR, 2012

Four degrees of separation.

[BibT_eX]

[DOI]

Proceedings of the Web Science 2012, 2012

Extending BM25 with multiple query operators.

[BibT_eX]

[DOI]

Roi Blanco

Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

Arc-Community Detection via Triangular Random Walks.

[BibT_eX]

[DOI]

Proceedings of the Eighth Latin American Web Congress, 2012

Four Degrees of Separation, Really.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011

Theory and practice of monotone minimal perfect hashing.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2011

Query reformulation mining: models, patterns, and applications.

[BibT_eX]

[DOI]

Inf. Retr., 2011

E=I+T: The internal extent formula for compacted tries.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

The Push Algorithm for Spectral Ranking

[BibT_eX]

[DOI]

CoRR, 2011

Viscous democracy for social networks.

[BibT_eX]

[DOI]

Commun. ACM, 2011

HyperANF: approximating the neighbourhood function of very large graphs on a budget.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on World Wide Web, 2011

Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on World Wide Web, 2011

Robustness of Social Networks: Comparative Results Based on Distance Distributions.

[BibT_eX]

[DOI]

Proceedings of the Social Informatics - Third International Conference, SocInfo 2011, 2011

2010

Efficient algorithms for large-scale local triangle counting.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2010

Dynamic Z-Fast Tries.

[BibT_eX]

[DOI]

Djamal Belazzougui

Proceedings of the String Processing and Information Retrieval, 2010

Trends in Search Interaction.

[BibT_eX]

[DOI]

Proceedings of the Search Computing, 2010

Fast Prefix Search in Little Space, with Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

PageRank: Functional dependencies.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., 2009

Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered Set.

[BibT_eX]

[DOI]

Flavio Chierichetti

Theory Comput. Syst., 2009

Permuting Web and Social Graphs.

[BibT_eX]

[DOI]

Internet Math., 2009

Query suggestions using query-flow graphs.

[BibT_eX]

[DOI]

Proceedings of the 2009 workshop on Web Search Click Data, 2009

From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE/WIC/ACM International Conference on Web Intelligence, 2009

Permuting Web Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

Monotone minimal perfect hashing: searching a sorted table with <i>O</i>(1) accesses.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Voting in social networks.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

Theory and Practise of Monotone Minimal Perfect Hashing.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008

A large time-aware web graph.

[BibT_eX]

[DOI]

SIGIR Forum, 2008

Efficient semi-streaming algorithms for local triangle counting in massive graphs.

[BibT_eX]

[DOI]

Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

Temporal Evolution of the UK Web.

[BibT_eX]

[DOI]

Proceedings of the Workshops Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

The query-flow graph: model and applications.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007

Generic Damping Functions for Propagating Importance in Link-Based Ranking.

[BibT_eX]

[DOI]

Ricardo A. Baeza-Yates

Carlos Castillo

Internet Math., 2007

The Number of Convex Permutominoes.

[BibT_eX]

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Pictures from Mongolia - Partial Sorting in a Partial World.

[BibT_eX]

[DOI]

Flavio Chierichetti

Proceedings of the Fun with Algorithms, 4th International Conference, 2007

A Deeper Investigation of PageRank as a Function of the Damping Factor.

[BibT_eX]

[DOI]

Proceedings of the Web Information Retrieval and Linear Algebra Algorithms, 11.02., 2007

2006

A reference collection for web spam.

[BibT_eX]

[DOI]

SIGIR Forum, 2006

Graph fibrations, graph isomorphism, and PageRank.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2006

Traps and Pitfalls of Topic-Biased PageRank.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

MG4J at TREC 2006.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Text REtrieval Conference, 2006

Efficient Lazy Algorithms for Minimal-Interval Semantics.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2006

Generalizing PageRank: damping functions for link-based ranking algorithms.

[BibT_eX]

[DOI]

Ricardo A. Baeza-Yates

Carlos Castillo

Proceedings of the SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2006

2005

Mutable strings in Java: design, implementation and lightweight text-search algorithms.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2005

Codes for the World Wide Web.

[BibT_eX]

[DOI]

Internet Math., 2005

Paradoxical Effects in PageRank Incremental Computations.

[BibT_eX]

[DOI]

Internet Math., 2005

The language observatory project (LOP).

[BibT_eX]

[DOI]

Proceedings of the 14th international conference on World Wide Web, 2005

PageRank as a function of the damping factor.

[BibT_eX]

[DOI]

Proceedings of the 14th international conference on World Wide Web, 2005

TotalRank: ranking without damping.

[BibT_eX]

[DOI]

Proceedings of the 14th international conference on World Wide Web, 2005

MG4J at TREC 2005.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Text REtrieval Conference, 2005

Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2005

2004

UbiCrawler: a scalable fully distributed Web crawler.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2004

The webgraph framework I: compression techniques.

[BibT_eX]

[DOI]

Proceedings of the 13th international conference on World Wide Web, 2004

Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

WebGraph: things you thought you could not do with Java™.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Symposium on Principles and Practice of Programming in Java, 2004

The WebGraph Framework II: Codes For The World-Wide Web.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

Lower bounds for sense of direction in regular graphs.

[BibT_eX]

[DOI]

Distributed Comput., 2003

Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search

[BibT_eX]

[DOI]

CoRR, 2003

Rethinking Java strings.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Symposium on Principles and Practice of Programming in Java, 2003

2002

Measuring with jugs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Universal Homogeneous Graph-Like Structures And Domains.

[BibT_eX]

[DOI]

Felice Cardone

Manfred Droste

Math. Struct. Comput. Sci., 2002

Fibrations of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Universal dynamic synchronous self-stabilization.

[BibT_eX]

[DOI]

Distributed Comput., 2002

Holographic Trees.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001

Trovatore: Towards a Highly Scalable Distributed Web Crawler.

[BibT_eX]

[DOI]

Proceedings of the Poster Proceedings of the Tenth International World Wide Web Conference, 2001

An Effective Characterization of Computability in Anonymous Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 15th International Conference, 2001

2000

Coverings that preserve sense of direction.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 14th International Conference, 2000

Lower bounds for (weak) sense of direction.

[BibT_eX]

Proceedings of the SIROCCO 7, 2000

delta-Approximable Functions.

[BibT_eX]

[DOI]

Charles Meyssonnier

Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999

Equality is a Jump.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Computing Anonymously with Arbitrary Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998

delta-Uniform BSS Machines.

[BibT_eX]

[DOI]

J. Complex., 1998

The Turing Closure of an Archimedean Field.

[BibT_eX]

Proceedings of the International Colloquium Universal Machines and Computations, 1998

1997

Minimal Sense of Direction and Decision Problems for Cayley Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Self-stabilizing universal algorithms.

[BibT_eX]

Proceedings of the 3rd Workshop on Self-stabilizing Systems, 1997

Computing Vector Functions on Anonymous Networks.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996

Maximal Chains and Antichains in Strongly Noetherian Semiorders.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

Good Fibrations and Other Construction Which Preserve Sense of Direction.

[BibT_eX]

Proceedings of the SIROCCO'96, 1996

Symmetry Breaking in Anonymous Networks: Characterizations.

[BibT_eX]

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995

On the Complexity of Deciding Sense of Direction.

[BibT_eX]