BERGOUGNOUX - Benjamin
Toutes les publications (17)
Date/Type | Titre/URL/journal | Domaines | Notes SJR/Core | Cit. GScholar |
---|---|---|---|---|
2023
ART |
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-Il Oum, Michal Pilipczuk, Erik Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth CoRR - 2023 |
Informatique/Mathématique discrète | ||
2023
COMM |
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-Il Oum, Michal Pilipczuk, Erik Leeuwen
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth 31st Annual European Symposium on Algorithms - 2023 |
Informatique/Mathématique discrète | ||
2020
ART |
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-Joung Kwon
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width Algorithmica - 2020 |
Informatique/Algorithme et structure de données | ||
2019
UNDEFINED |
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More applications of the $d$-neihgbor equivalence: acyclicity and connectivity constraints |
Informatique/Algorithme et structure de données | ||
2019
ART |
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
Counting Minimal Transversals of β-Acyclic Hypergraphs Journal of Computer and System Sciences - 2019 |
Informatique/Algorithme et structure de données | ||
2019
THESE |
Benjamin Bergougnoux
Matrix decompositions and algorithmic applications to (hyper)graphs |
Informatique/Autre | ||
2019
COMM |
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints 27th Annual European Symposium on Algorithms - 2019 |
Informatique/Mathématique discrète | ||
2019
ART |
Benjamin Bergougnoux, Mamadou Moustapha Kanté
Fast exact algorithms for some connectivity problems parameterized by clique-width Theor. Comput. Sci. - 2019 |
Informatique/Mathématique discrète | ||
2018
UNDEFINED |
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-Joung Kwon
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. |
Informatique/Algorithme et structure de données | ||
2018
UNDEFINED |
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
Counting Minimal Transversals of ß-Acyclic Hypergraphs |
Informatique/Algorithme et structure de données | ||
2018
UNDEFINED |
Thomas Bellitto, Benjamin Bergougnoux
On Minimum Connecting Transition Sets in Graphs |
Informatique/Algorithme et structure de données | ||
2018
ART |
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
Counting Minimal Transversals of \\(β\\)-Acyclic Hypergraphs CoRR - 2018 |
Informatique/Mathématique discrète | ||
2018
ART |
Benjamin Bergougnoux, Mamadou Moustapha Kanté
More applications of the d-neighbor equivalence: acyclicity and connectivity constraints CoRR - 2018 |
Informatique/Mathématique discrète | ||
2017
COMM |
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M S Ramanujan
Towards a Polynomial Kernel For Directed Feedback Vertex Set Mathematical Foundations of Computer Science (MFCS) - 2017 |
Informatique/Algorithme et structure de données | ||
2017
COMM |
Benjamin Bergougnoux, O-Joung Kwon, Mamadou Moustapha Kanté
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width WADS 2017 - 2017 |
Informatique/Mathématique discrète | ||
2017
UNDEFINED |
Benjamin Bergougnoux, Mamadou Moustapha Kanté, Mamadou Kanté
Fast exact algorithms for some connectivity problems parametrized by clique-width |
Informatique/Mathématique discrète | ||
2017
ART |
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-Joung Kwon
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width CoRR - 2017 |
Informatique/Mathématique discrète |