Christophe Paul

1. Parameterized Domination in Circle Graphs
   2012/05/16 by Nicolás Bousquet, Bousquet, Nicolas, Daniel Gonçalves +9 · 1 citation
   Computer Science · #05C10 #05C85 #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #G.2.2 #Interconnection Networks and Systems
2. Explicit linear kernels for packing problems
   2016/10/19 by Valentin Garnero, Garnero, Valentin, Christophe Paul +5 · 1 citation
   Computer Science · Mathematics · #05C85 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory
3. A linear fixed parameter tractable algorithm for connected pathwidth
   2020/04/24 by Mamadou Moustapha Kanté, Kanté, Mamadou Moustapha, Christophe Paul +3 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Computational Geometry and Mesh Generation #Complexity and Algorithms in Graphs