( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.

, , , , , , , и . ESA, том 274 из LIPIcs, стр. 18:1-18:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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.

Benjamin Bender

Cerebrospinal fluid and interstitial fluid volume measurement in the human brain at 3T with EPI. Uni Tübingen, (2009)

Benjamin Köckemann

Abundance, niche breadth and stress in the centre and at the border of the distribution range: a macroecological study on abundant and rare tree specie. Uni Göttingen, (2008)

Benjamin Braatz

Formal modelling and application of graph transformations in the resource description framework. TU Berlin, (2009)

Benjamin Klaus

Benjamin Bajon

 

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

On Alternative Models for Leaf Powers., , , и . CoRR, (2021)New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth., , и . WG, том 14093 из Lecture Notes in Computer Science, стр. 72-85. Springer, (2023)Recognition of Linear and Star Variants of Leaf Powers is in P., , , и . WG, том 13453 из Lecture Notes in Computer Science, стр. 70-83. Springer, (2022)On Minimum Connecting Transition Sets in Graphs., и . WG, том 11159 из Lecture Notes in Computer Science, стр. 40-51. Springer, (2018)An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width., , и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 121-132. Springer, (2017)Matrix decompositions and algorithmic applications to (hyper)graphs. (Décomposition de matrices et applications algorithmiques aux (hyper)graphes).. University of Clermont Auvergne, Clermont-Ferrand, France, (2019)More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints., и . ESA, том 144 из LIPIcs, стр. 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves., , , и . FCT, том 14292 из Lecture Notes in Computer Science, стр. 392-405. Springer, (2023)Towards a Polynomial Kernel for Directed Feedback Vertex Set., , , , и . MFCS, том 83 из LIPIcs, стр. 36:1-36:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth., , , и . IPEC, том 180 из LIPIcs, стр. 3:1-3:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)