◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Lazar Milenković

3 papers hereh-index 6126 citations15 works total

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

author position
  • middle author2
  • last author1

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

fields
  • cs.DS2
  • cs.CG1
same name
  • Lazar Milenković — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20232025
most citedShortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More

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

collaborators

3 papers

cs.DS2025

Light Spanners with Small Hop-Diameter

Sujoy Bhore, Lazar Milenkovic

Lightness, sparsity, and hop-diameter are the fundamental parameters of geometric spanners. Arya et al. [STOC'95] showed in their seminal work that there exists a construction of E…

cs.CG2024

Optimal Euclidean Tree Covers

Hsien-Chih Chang, Jonathan Conroy, Hung Le +3

A (1+ε)-stretch tree cover of a metric space is a collection of trees, where every pair of points has a (1+ε)-stretch path in one of the trees. The…

cs.DS2023★ 1 cited

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More

Hsien-Chih Chang, Jonathan Conroy, Hung Le +3

The notion of shortcut partition, introduced recently by Chang, Conroy, Le, Milenković, Solomon, and Than [CCLMST23], is a new type of graph partition into low-diameter clusters. R…

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