◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Paolo Codenotti

3 papers hereh-index 9272 citations15 works total

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

author position
  • middle author2
  • last author1

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

fields
  • math.CO2
  • cs.CC1

identity via Semantic Scholar / OpenAlex

activity
20112014
most citedOn the minimum order of k-cop-win graphs

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

collaborators
Showing 2011Show all

1 paper · 1 filter

math.CO2011★ 2 cited

The Petersen graph is the smallest 3-cop-win graph

Andrew Beveridge, Paolo Codenotti, Aaron Maurer +2

In the game of \emph{cops and robbers} on a graph G=(V,E), k cops try to catch a robber. On the cop turn, each cop may move to a neighboring vertex or remain in place. On the…

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