Bergougnoux, Benjamin

1. An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width
   2017/02/20 by Benjamin Bergougnoux, Mamadou Moustapha Kanté, Bergougnoux, Benjamin +3 · 3 citations
   Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
2. New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth
   2023/02/21 by Bergougnoux, Benjamin, Korhonen, Tuukka, Razgon, Igor · 3 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
3. Recognition of Linear and Star Variants of Leaf Powers is in P
   2021/05/26 by Bergougnoux, Benjamin, Høgemo, Svein, Telle, Jan Arne +1 · 2 citations
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
4. A logic-based algorithmic meta-theorem for mim-width
   2022/02/27 by Bergougnoux, Benjamin, Dreier, Jan, Jaffke, Lars · 2 citations
   #05C85 #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
5. Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width
   2019/10/02 by Bergougnoux, Benjamin, Papadopoulos, Charis, Telle, Jan Arne · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
6. Enumerating minimal solution sets for metric graph problems
   2023/09/29 by Benjamin Bergougnoux, Oscar Defrain, Bergougnoux, Benjamin +3 · 2 citations
   Computer Science · Engineering · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #graph theory and CDMA systems
7. Tight Lower Bounds for Problems Parameterized by Rank-width
   2022/10/05 by Bergougnoux, Benjamin, Korhonen, Tuukka, Nederlof, Jesper · 1 citation
   #68Q27 #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
8. Sparse Graphs of Twin-width 2 Have Bounded Tree-width
   2023/07/04 by Bergougnoux, Benjamin, Gajarský, Jakub, Guśpiel, Grzegorz +3 · 1 citation
   #05C75 #68R10 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
9. Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
   2023/07/03 by Bergougnoux, Benjamin, Chekan, Vera, Ganian, Robert +5 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
10. Mim-Width is paraNP-complete
    2025/01/10 by Bergougnoux, Benjamin, Bonnet, Édouard, Duron, Julien · 2 citations
    #68Q27 #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics