◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Manuel Dubinsky

6 papers hereh-index 213 citations13 works total

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

author position
  • first author4
  • last author2

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

fields
  • cs.DM3
  • math.AG1
  • math.CO1
  • math.OC1

identity via Semantic Scholar / OpenAlex

activity
20162024
most citedMinimum Spanning Tree Cycle Intersection Problem

6 citations · 6 across the 6 of their papers we have counts for

collaborators
Showing 2024Show all

2 papers · 1 filter

cs.DM2024

Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem

Manuel Dubinsky, Kun-Mao Chao, César Massri +1

Minimum spanning trees are important tools in the analysis and design of networks. Many practical applications require their computation, ranging from biology and linguistics to ec…

cs.DM2024

tinygarden -- A java package for testing properties of spanning trees

Manuel Dubinsky, César Massri, Gabriel Taubin

Spanning trees are fundamental objects in graph theory. The spanning tree set size of an arbitrary graph can be very large. This limitation discourages its analysis. However intere…

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