◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Patrick J. Andersen

3 papers hereh-index 321 citations5 works total

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

author position
  • first author3

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

fields
  • math.CO2
  • cs.CG1

identity via Semantic Scholar / OpenAlex

activity
20142019
most citedMinimum Weight Resolving Sets of Grid Graphs

3 citations · 3 across the 1 of their papers we have counts for

collaborators
Showing 2018Show all

1 paper · 1 filter

math.CO2018

Algorithms for Euclidean Degree Bounded Spanning Tree Problems

Patrick J. Andersen, Charl J. Ras

Given a set of points in the Euclidean plane, the Euclidean \textit{δ-minimum spanning tree} (δ-MST) problem is the problem of finding a spanning tree with maximum degree no mo…

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