◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Leonardi

2 papers hereh-index 5210.3k citations360 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author2

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.DS1
  • physics.soc-ph1

identity via Semantic Scholar / OpenAlex

most citedPreferential attachment in the growth of social networks: the case of Wikipedia

327 citations · 327 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2011

Approximation Algorithms for Union and Intersection Covering Problems

Marek Cygan, Fabrizio Grandoni, Stefano Leonardi +3

In a classical covering problem, we are given a set of requests that we need to satisfy (fully or partially), by buying a subset of items at minimum cost. For example, in the k-MST…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.