Benjamin Bergougnoux
I am a postdoc at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw.
11
Documents
Identifiants chercheurs
- benjamin-bergougnoux
- 0000-0002-6270-3663
- Arxiv : bergougnoux_b_1
Publications
|
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-WidthAlgorithmica, 2020, 82 (6), pp.1654-1674. ⟨10.1007/s00453-019-00663-9⟩
Article dans une revue
hal-04056459v1
|
Counting Minimal Transversals of β-Acyclic HypergraphsJournal of Computer and System Sciences, 2019, ⟨10.1016/j.jcss.2018.10.002⟩
Article dans une revue
hal-01923090v1
|
On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph ParametersFCT 2021 - 23rd International Symposium on Fundamentals of Computation Theory, Sep 2021, Athens, Greece. pp.287-300, ⟨10.1007/978-3-030-86593-1_20⟩
Communication dans un congrès
lirmm-03867040v1
|
|
|
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidthIPEC 2020, Dec 2020, Hong Kong, China
Communication dans un congrès
hal-03430381v1
|
Towards a Polynomial Kernel For Directed Feedback Vertex SetMathematical Foundations of Computer Science (MFCS), Aug 2017, Aalborg, Denmark. ⟨10.4230/LIPIcs.MFCS.2017.36⟩
Communication dans un congrès
hal-01759637v1
|
|
|
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-WidthWADS 2017, Jul 2017, St. John’s, Canada
Communication dans un congrès
hal-01590820v1
|
|
More applications of the $d$-neihgbor equivalence: acyclicity and connectivity constraints2019
Pré-publication, Document de travail
hal-01799573v5
|
|
On Minimum Connecting Transition Sets in Graphs2018
Pré-publication, Document de travail
hal-01846961v2
|
|
Counting Minimal Transversals of ß-Acyclic Hypergraphs2018
Pré-publication, Document de travail
hal-01610959v2
|
|
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.2018
Pré-publication, Document de travail
hal-01858180v1
|
|
Fast exact algorithms for some connectivity problems parametrized by clique-width2017
Pré-publication, Document de travail
hal-01560555v2
|