2022 Developer Survey is open! Take survey.
Theoretical Computer Science
user avatar
user avatar
user avatar
Falk Hüffner
  • Member for 11 years, 9 months
  • Last seen more than 1 year ago
Profile Activity
Stats
1,023
reputation
9k
reached
9
answers
2
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
9
silver badges
13
bronze badges
Top tags
View all tags
34
Score
4
Posts
36
Posts %
17
Score
1
Posts
9
Posts %
17
Score
1
Posts
9
Posts %
16
Score
3
Posts
27
Posts %
13
Score
3
Posts
27
Posts %
12
Score
1
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
19
"All-different hypergraph coloring" - known problem?
Aug 20, 2010
answer
17
MAX 1 in 2 SAT Algorithm
Aug 22, 2014
answer
12
Given a graph, decide if its edge connectivity is at least n/2 or not
Jun 20, 2012
answer
10
Complement problems are not in the same class in parametrized complexity hierarchy? If not in $P$
Jan 4, 2012
question
9
Optimal bee swarm plots: NP-hard?
Oct 27, 2019
answer
8
Bipartite vertex cover with a Very Important Vertex
Aug 12, 2011
answer
3
How fast can we solve a totally unimodular integer linear program?
Jan 24, 2011
answer
3
Partition graph into complete disjoint subgraphs while maximising sum of edge weights
Jun 14, 2013
answer
2
How to approximate minimum clique edge cover
Feb 7, 2013
answer
2
Natural graph class with five excluded subgraphs?
Mar 17, 2016
Top network posts
View all network posts
49
How can I find the minimum cut on a graph using a maximum flow algorithm?
23
How to split a string into words. Ex: "stringintowords" -> "String Into Words"?
18
Find out which combinations of numbers in a set add up to a given total
13
minimum connected subgraph containing a given set of nodes
12
Iterating over edges of a graph using range-based for

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.