◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Dzmitry Sledneu

5 papers hereh-index 446 citations15 works total

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

author position
  • last author5

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

fields
  • cs.DS4
  • cs.CG1

identity via Semantic Scholar / OpenAlex

activity
20112021
most citedOptimal Cuts and Bisections on the Real Line in Polynomial Time

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

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.DS2011★ 1 cited

A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs

Andrzej Lingas, Dzmitry Sledneu

We consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. For an n×n 0-1 matrix C, let KC​ be the comp…

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