( en | de | ru )

 

Disambiguation of "Bergougnoux, Benjamin"

Author of the publication

copydeleteadd this publication to your clipboard
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width.

, , and . WG, volume 12301 of Lecture Notes in Computer Science, page 388-400. Springer, (2020)

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.

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 Bender

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

Benjamin Braatz

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

Benjamin Marchetti

Benjamin Lindner

 

Other publications of authors with the same name

Counting Minimal Transversals of β-Acyclic Hypergraphs., , and . CoRR, (2018)On Minimum Connecting Transition Sets in Graphs., and . WG, volume 11159 of Lecture Notes in Computer Science, page 40-51. Springer, (2018)Recognition of Linear and Star Variants of Leaf Powers is in P., , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 70-83. Springer, (2022)Fast exact algorithms for some connectivity problems parametrized by clique-width., and . CoRR, (2017)Counting minimal transversals of β-acyclic hypergraphs., , and . J. Comput. Syst. Sci., (2019)An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width., , and . Algorithmica, 82 (6): 1654-1674 (2020)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)Towards a Polynomial Kernel for Directed Feedback Vertex Set., , , , and . Algorithmica, 83 (5): 1201-1221 (2021)More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints., and . ESA, volume 144 of LIPIcs, page 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)More applications of the d-neighbor equivalence: acyclicity and connectivity constraints., and . CoRR, (2018)