( en | de | ru )

 

Disambiguation of "Bergougnoux, Benjamin"

Author of the publication

copydeleteadd this publication to your clipboard
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.

, , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 121-132. Springer, (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.

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 Ellert

Hans Benjamin

 

Other publications of authors with the same name

On Alternative Models for Leaf Powers., , , and . CoRR, (2021)New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth., , and . WG, volume 14093 of Lecture Notes in Computer Science, page 72-85. Springer, (2023)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)On Minimum Connecting Transition Sets in Graphs., and . WG, volume 11159 of Lecture Notes in Computer Science, page 40-51. Springer, (2018)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., and . ESA, volume 144 of LIPIcs, page 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width., , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 121-132. Springer, (2017)Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves., , , and . FCT, volume 14292 of Lecture Notes in Computer Science, page 392-405. Springer, (2023)Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth., , , and . IPEC, volume 180 of LIPIcs, page 3:1-3:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Tight Lower Bounds for Problems Parameterized by Rank-Width., , and . STACS, volume 254 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)