Author of the publication

A New Approximation Algorithm for Labeling Weighted Points with Sliding Labels

, , , , and . Proc. 22nd European Workshop on Computational Geometry (EWCG'06), page 137--140. Delphi, (2006)

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

An EPTAS for Machine Scheduling with Bag-Constraints., , and . SPAA, page 135-144. ACM, (2019)Scheduling on (Un-)Related Machines with Setup Times., , and . IPDPS, page 145-154. IEEE, (2019)The double exponential runtime is tight for 2-stage stochastic ILPs., , and . Math. Program., 197 (2): 1145-1172 (February 2023)Exact and Approximate High-Multiplicity Scheduling on Identical Machines., , and . CoRR, (2024)Total Completion Time Minimization for Scheduling with Incompatibility Cliques., , , and . ICAPS, page 192-200. AAAI Press, (2021)On the Complexity of Scheduling Problems with a Fixed Number of Parallel Identical Machines., and . SOFSEM, volume 13878 of Lecture Notes in Computer Science, page 192-206. Springer, (2023)Inapproximability Results for Scheduling with Interval and Resource Restrictions., and . STACS, volume 154 of LIPIcs, page 5:1-5:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines., , , , and . ISAAC, volume 283 of LIPIcs, page 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Local Search Breaks 1.75 for Graph Balancing., and . ICALP, volume 132 of LIPIcs, page 74:1-74:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Online Bin Covering with Limited Migration., , , , , and . ESA, volume 144 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)