( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms.

, и . ICALP Satellite Workshops, стр. 135-146. Carleton Scientific, Waterloo, Ontario, Canada, (2000)

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.

Klaus Jansen

Klaus Jansen

Klaus Jansen

Klaus Jansen

Klaus Jansen

 

Другие публикации лиц с тем же именем

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