( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Treewidth: algorithmic, combinatorial, and practical aspects. (Treewidth: aspects algorithmiques, combinatoires et pratiques).

. University of Montpellier, France, (2017)

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.

Thomas Basten

Hermann Basten

Matthias Basten

Klaus-Dieter Bastendorf

Eva Bastert

 

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

Minimum Reload Cost Graph Factors., , , и . Theory Comput. Syst., 65 (5): 815-838 (2021)Diversity in Combinatorial Optimization., , , , , , и . CoRR, (2019)Towards hybridization of multi-agent simulation and metaheuristics applied to selective deconstruction., , , , и . SSCI, стр. 767-773. IEEE, (2022)Minimum Reload Cost Graph Factors., , , и . SOFSEM, том 11376 из Lecture Notes in Computer Science, стр. 67-80. Springer, (2019)The Role of Planarity in Connectivity Problems Parameterized by Treewidth., и . IPEC, том 8894 из Lecture Notes in Computer Science, стр. 63-74. Springer, (2014)Treewidth: algorithmic, combinatorial, and practical aspects. (Treewidth: aspects algorithmiques, combinatoires et pratiques).. University of Montpellier, France, (2017)Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm., , и . SIAM J. Comput., 52 (4): 865-912 (августа 2023)Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth., , и . IPEC, том 89 из LIPIcs, стр. 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Minimum Reload Cost Graph Factors., , , и . CoRR, (2018)Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms., , и . Theor. Comput. Sci., (2020)