( en | de | ru )

 

Disambiguation of "Byrka, Jaroslaw"

Author of the publication

copydeleteadd this publication to your clipboard
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability

, , , , , , and . Proc. 16th Int. Sympos. Graph Drawing (GD'08), volume 5417 of Lecture Notes in Computer Science, page 324--335. Springer-Verlag, (2009)
DOI: 10.1007/978-3-642-00219-9_32

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jaroslaw Slusar

Jaroslaw Sotschynskyj

Jaroslaw Tarasiewiecz

Jaroslaw Wodecki

Jaroslaw Malewicz

 

Other publications of authors with the same name

An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization., , , , and . SODA, page 737-756. SIAM, (2015)Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)., , and . Theory Comput. Syst., 58 (1): 19-44 (2016)New Algorithms for Approximate Nash Equilibria in Bimatrix Games., , and . WINE, volume 4858 of Lecture Notes in Computer Science, page 17-29. Springer, (2007)An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.. APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, page 29-43. Springer, (2007)An O(loglog n)-Approximation for Submodular Facility Location., , , , , , and . ICALP, volume 297 of LIPIcs, page 5:1-5:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Better Bounds for Online Line Chasing., , , , , and . MFCS, volume 138 of LIPIcs, page 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Parameterized Approximation Schemes for Clustering with General Norm Objectives., , , , , , , , and . FOCS, page 1377-1399. IEEE, (2023)Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability, , , , , , and . Arxiv report, (June 2008)Available at http://arxiv.org/abs/0806.0920.Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 157-169. Springer, (2012)Approximating Node-Weighted k-MST on Planar Graphs., , and . Theory Comput. Syst., 64 (4): 626-644 (2020)