◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

O. Neiman

35 papers hereh-index 231.7k citations68 works total

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

author position
  • first author4
  • middle author5
  • last author26

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

fields
  • cs.DS29
  • math.MG2
  • cs.CG1
  • cs.DC1
  • cs.DM1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20062026
most citedNearly Tight Low Stretch Spanning Trees

25 citations · 49 across the 22 of their papers we have counts for

collaborators
Showing 2016 · math.COShow all

1 paper · 2 filters

math.CO2016

On Vertex Rankings of Graphs and its Relatives

Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky

A vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must conta…

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