- E-postBenjamin.Bergougnoux@uib.no
- BesøksadresseHIB - Thormøhlens gate 555006 Bergen
- PostadressePostboks 78035020 Bergen
Vitenskapelig artikkel
- (2022). Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. Algorithmica. 1385-1417.
- (2021). On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. Lecture Notes in Computer Science (LNCS). 287-300.
- (2021). More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints. SIAM Journal on Discrete Mathematics. 1881-1926.
- (2020). Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica. 21 sider.
- (2020). Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. Leibniz International Proceedings in Informatics. 3:1-3:17.
- (2019). An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Algorithmica.
Vitenskapelig Kapittel/Artikkel/Konferanseartikkel
- (2020). Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width.