◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Michiel Smid

2 papers here

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

author position
  • last author2

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

fields
  • cs.CG1
  • cs.DS1

identity via Semantic Scholar / OpenAlex

most citedOptimal Data Structures for Farthest-Point Queries in Cactus Networks

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

collaborators

2 papers

cs.CG2016

Essential Constraints of Edge-Constrained Proximity Graphs

Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet +1

Given a plane forest F=(V,E) of ∣V∣=n points, we find the minimum set S⊆E of edges such that the edge-constrained minimum spanning tree over the set V of ver…

cs.DS2014★ 3 cited

Optimal Data Structures for Farthest-Point Queries in Cactus Networks

Prosenjit Bose, Jean-Lou De Carufel, Carsten Grimm +2

Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of…

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