◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Paul D. Manuel

14 papers hereh-index 272.1k citations106 works total

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

author position
  • sole author3
  • first author8
  • last author3

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

fields
  • math.CO14
same name
  • Paul D. Manuel — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20172026
most citedStrong geodetic problem in networks: computational complexity and solution for Apollonian networks

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

collaborators
Showing 2018Show all

2 papers · 1 filter

math.CO2018

On the isometric path partition problem

Paul Manuel

The isometric path cover (partition) problem of a graph is to find a minimum set of isometric paths which cover (partition) the vertex set of the graph. The isometric path cover (p…

math.CO2018

Revisiting path-type covering and partitioning problems

Paul Manuel

Covering problems belong to the foundation of graph theory. There are several types of covering problems in graph theory such as covering the vertex set by stars (domination proble…

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