Author of the publication

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

, , , , , , and . Algorithmica, 62 (1-2): 309-332 (2012)

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.

 

Other publications of authors with the same name

New algorithms for approximate Nash equilibria in bimatrix games., , and . Theor. Comput. Sci., 411 (1): 164-173 (2010)New results on multi-level aggregation., , , , , , , , , and . Theor. Comput. Sci., (2021)An O(loglog n)-Approximation for Submodular Facility Location., , , , , , and . CoRR, (2022)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)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)An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem., and . SIAM J. Comput., 39 (6): 2212-2231 (2010)An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization., , , , and . SODA, page 737-756. SIAM, (2015)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)Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability, , , , , , and . Arxiv report, (June 2008)Available at http://arxiv.org/abs/0806.0920.