◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Crescenzi

16 papers hereh-index 344.9k citations166 works total

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

author position
  • first author3
  • middle author11
  • last author2

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

fields
  • cs.DS5
  • cs.DM3
  • cs.CC2
  • cs.DC2
  • cs.AI1
  • cs.FL1

identity via Semantic Scholar / OpenAlex

activity
20132023
most citedInto the Square - On the Complexity of Quadratic-Time Solvable Problems

24 citations · 48 across the 15 of their papers we have counts for

collaborators
Showing 2015Show all

1 paper · 1 filter

cs.DS2015★ 8 cited

Fast and Simple Computation of Top-k Closeness Centralities

Michele Borassi, Pierluigi Crescenzi, Andrea Marino

Closeness is an important centrality measure widely used in the analysis of real-world complex networks. In particular, the problem of selecting the k most central nodes with respe…

◍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.