Florent Foucaud
2 indexed papers
Recent (6 mo)
2With code
0Influential cites
0Benchmarked
0Publications per year
226
Top categories
Discrete Math×2Combinatorics×1Algorithms×1
Frequent co-authors
Research Timeline
2026
Algorithms and complexity for geodetic sets on interval and chordal graphs
This paper shows that finding the minimum geodetic set in chordal graphs is fixed parameter tractable, implying a polynomial-time algorithm for k-trees. It also proves that the problem is NP-hard on interval graphs.
Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth
This paper provides bounds on the neighborhood complexity of graphs with bounded treewidth and pathwidth, and constructs reaching these bounds.
Highlighted terms show continued research focus across papers
Papers
cs.DMmath.COTheoreticalRecentJul 18, 2026
Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth
This paper provides bounds on the neighborhood complexity of graphs with bounded treewidth and pathwidth, and constructs reaching these bounds.
View →
cs.DScs.DMTheoretical