Nombre de documents

7

Publications


Communication dans un congrès2 documents

  • Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M Ramanujan. Towards a Polynomial Kernel For Directed Feedback Vertex Set. Mathematical Foundations of Computer Science (MFCS), Aug 2017, Aalborg, Denmark. 〈10.4230/LIPIcs.MFCS.2017.36〉. 〈hal-01759637〉
  • Benjamin Bergougnoux, O-Joung Kwon, Mamadou Moustapha Kanté. An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. WADS 2017, Jul 2017, St. John’s, Canada. 2017. 〈hal-01590820〉

Pré-publication, Document de travail5 documents

  • Thomas Bellitto, Benjamin Bergougnoux. On Minimum Connecting Transition Sets in Graphs. 2018. 〈hal-01846961v2〉
  • Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté. Counting Minimal Transversals of ß-Acyclic Hypergraphs . 2018. 〈hal-01610959v2〉
  • Benjamin Bergougnoux, Moustapha Kanté, O-Joung Kwon. An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.. 2018. 〈hal-01858180〉
  • Benjamin Bergougnoux, Mamadou Moustapha Kanté, Mamadou Kanté. Rank Based Approach on Graphs with Structured Neighborhood. 2018. 〈hal-01799573v2〉
  • Benjamin Bergougnoux, Mamadou Moustapha Kanté, Mamadou Kanté. Fast exact algorithms for some connectivity problems parametrized by clique-width. 2017. 〈hal-01560555v2〉