The following pages link to Massimo Santini (Q294814):
Displaying 15 items.
- Clique polynomials have a unique root of smallest modulus (Q294815) (← links)
- The number of convex permutominoes (Q948075) (← links)
- Approximation algorithms for a hierarchically structured bin packing problem (Q1029084) (← links)
- A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses (Q1275602) (← links)
- Measuring with jugs (Q1603714) (← links)
- (Q2762513) (← links)
- (Q2768652) (← links)
- Random Generation for Finitely Ambiguous Context-free Languages (Q3147017) (← links)
- Graph fibrations, graph isomorphism, and PageRank (Q3431437) (← links)
- Traps and Pitfalls of Topic-Biased PageRank (Q3520034) (← links)
- Permuting Web Graphs (Q3601174) (← links)
- (Q4501563) (← links)
- Algorithms and Models for the Web-Graph (Q5311168) (← links)
- Permuting Web and Social Graphs (Q5388287) (← links)
- Paradoxical Effects in PageRank Incremental Computations (Q5474655) (← links)