( en | de | ru )

 

Disambiguation of "Baste, Julien"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion.

, , , and . Theory Comput. Syst., 61 (3): 777-794 (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. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Basten

Hermann Basten

Matthias Basten

Klaus-Dieter Bastendorf

Eva Bastert

 

Other publications of authors with the same name

Minimum Reload Cost Graph Factors., , , and . SOFSEM, volume 11376 of Lecture Notes in Computer Science, page 67-80. Springer, (2019)Minimum Reload Cost Graph Factors., , , and . Theory Comput. Syst., 65 (5): 815-838 (2021)Diversity in Combinatorial Optimization., , , , , , and . CoRR, (2019)The Role of Planarity in Connectivity Problems Parameterized by Treewidth., and . IPEC, volume 8894 of Lecture Notes in Computer Science, page 63-74. Springer, (2014)Towards hybridization of multi-agent simulation and metaheuristics applied to selective deconstruction., , , , and . SSCI, page 767-773. IEEE, (2022)Treewidth: algorithmic, combinatorial, and practical aspects. (Treewidth: aspects algorithmiques, combinatoires et pratiques).. University of Montpellier, France, (2017)Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth., , and . IPEC, volume 89 of LIPIcs, page 4:1-4:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm., , and . SIAM J. Comput., 52 (4): 865-912 (August 2023)Minimum Reload Cost Graph Factors., , , and . CoRR, (2018)A Hybrid Genetic Approach for Bi-Level Flexible Job Shops Arising from Selective Deconstruction., , , , and . CEC, page 1-8. IEEE, (2023)