Skip to main content
Theoretical Computer Science
Florent Foucaud's user avatar
Florent Foucaud's user avatar
Florent Foucaud's user avatar
Florent Foucaud
  • Member for 14 years, 1 month
  • Last seen more than a month ago
Profile Activity
Stats
2,153
reputation
18k
reached
10
answers
14
questions
Communities
View all
About

I'm an associate professor in graph theory and algorithms.

Badges
View all badges
This user doesn’t have any gold badges yet.
12
silver badges
27
bronze badges
Top tags
View all tags
46
Score
14
Posts
58
Posts %
27
Score
8
Posts
33
Posts %
18
Score
4
Posts
17
Posts %
16
Score
4
Posts
17
Posts %
5
Score
13
Posts
54
Posts %
5
Score
3
Posts
12
Posts %
Top posts
View all questions and answers
question
24
For which k is PLANAR NAE k-SAT in P?
Apr 11, 2011
question
24
What is the complexity of this covering problem?
May 31, 2012
question
19
Is the dominating set problem restricted to planar bipartite graphs of maximum degree 3 NP-complete?
Oct 27, 2010
answer
16
Does this graph problem have a formal name?
Apr 29, 2011
question
13
Parameterized complexity of inclusion of regular languages
Feb 22, 2018
question
13
Relation between tree-width and clique number
May 9, 2014
question
13
The complexity of the dominating set problem in specific subclasses of chordal graphs
Jan 19, 2012
question
10
Complexity of digraph homomorphism to an oriented cycle
Feb 16, 2016
answer
10
Relation between tree-width and clique number
May 11, 2014
question
8
Nonstandard dual parametrization of graph problems
Dec 1, 2016
Top network posts
View all network posts
13
What is the smallest 4-chromatic graph of girth 5?
8
Edge-colorings of plane graphs: do you know references where the following questions are studied?
7
The smallest order of a 4-chromatic graph of given girth
7
What is known about the non-existence of strongly regular graphs srg(n,k,0,2)?