◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jaroslaw Byrka

42 papers hereh-index 222.3k citations69 works total

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

author position
  • first author23
  • middle author16
  • last author2

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

fields
  • cs.DS37
  • cs.GT2
  • cs.CG1
  • cs.DM1
  • q-bio.PE1

identity via Semantic Scholar / OpenAlex

activity
20072026
most citedBi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems

28 citations · 126 across the 29 of their papers we have counts for

collaborators
Showing cs.CGShow all

1 paper · 1 filter

cs.CG2008★ 13 cited

Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability

Kevin Buchin, Maike Buchin, Jaroslaw Byrka +4

A \emph{binary tanglegram} is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For ap…

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