◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

V. Polishchuk

22 papers hereh-index 231.8k citations129 works total

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

author position
  • first author3
  • middle author11
  • last author6

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

fields
  • cs.CG11
  • cs.DS6
  • cs.DC2
  • cs.DM1
  • cs.NI1
  • cs.SI1

identity via Semantic Scholar / OpenAlex

activity
20062022
most citedAlmost stable matchings in constant time

46 citations · 166 across the 16 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.CG2016★ 10 cited

On the complexity of minimum-link path problems

Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk +1

We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings…

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