( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Pre-coloring Extension and List Coloring Problems.

, , , и . CoRR, (2019)

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.

Magnus Wahlström

Niklas Wahlström

Lothar Magnus

Magnus Nenninger

Ulrich Magnus

 

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

Parameterized Pre-Coloring Extension and List Coloring Problems., , , и . SIAM J. Discret. Math., 35 (1): 575-596 (2021)On Weighted Graph Separation Problems and Flow Augmentation., , , , и . SIAM J. Discret. Math., 38 (1): 170-189 (марта 2024)Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems.. ACM Trans. Algorithms, 18 (2): 15:1-15:19 (2022)p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms., , , , и . J. Comput. Syst. Sci., (мая 2023)Euler Digraphs.. Classes of Directed Graphs, Springer, (2018)The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems., и . ACM Trans. Comput. Theory, 14 (1): 2:1-2:54 (2022)Parameterized Pre-Coloring Extension and List Coloring Problems., , , и . STACS, том 154 из LIPIcs, стр. 19:1-19:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Solving hard cut problems via flow-augmentation., , , и . SODA, стр. 149-168. SIAM, (2021)Many Visits TSP Revisited., , , , и . ESA, том 173 из LIPIcs, стр. 66:1-66:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Preference swaps for the stable matching problem., , , , , и . Theor. Comput. Sci., 940 (Part): 222-230 (2023)