( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On orthogonal symmetric chain decompositions.

, , , и . CoRR, (2018)

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.

Sven Uwe Jager

Oskar Svenson

Axel Svensson

Uwe Svensson

Bjørn Svensvik

 

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

On Orthogonal Symmetric Chain Decompositions., , , и . Electron. J. Comb., 26 (3): 3 (2019)Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling., , , и . CoRR, (2022)Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs., и . CoRR, (2023)Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling., , , и . IPCO, том 13904 из Lecture Notes in Computer Science, стр. 246-260. Springer, (2023)Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling., и . STACS, том 96 из LIPIcs, стр. 43:1-43:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Gray Codes and Symmetric Chains., , , , и . ICALP, том 107 из LIPIcs, стр. 66:1-66:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Gray codes and symmetric chains., , , , и . J. Comb. Theory, Ser. B, (2022)The blockwise coordinate descent method for integer programs., и . Math. Methods Oper. Res., 91 (2): 357-381 (2020)On orthogonal symmetric chain decompositions., , , и . CoRR, (2018)A Quantum Optimization Case Study for a Transport Robot Scheduling Problem., , , , , , , и . CoRR, (2023)