Theoretical Computer Science
Andrew D. King's user avatar
Andrew D. King's user avatar
Andrew D. King's user avatar
Andrew D. King
  • Member for 12 years, 11 months
  • Last seen more than a month ago
Profile Activity
Stats
1,573
reputation
34k
reached
16
answers
2
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
10
silver badges
19
bronze badges
Top tags
View all tags
51
Score
10
Posts
56
Posts %
32
Score
4
Posts
22
Posts %
31
Score
8
Posts
44
Posts %
27
Score
3
Posts
17
Posts %
25
Score
5
Posts
28
Posts %
22
Score
2
Posts
11
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
21
Finding a 5-cycle in a sparse graph efficiently.
Dec 14, 2010
question
15
Random 3-SAT: What is the consensus experimental range of the threshold?
Dec 4, 2013
answer
15
NP-hard problems on trees
Nov 9, 2012
answer
11
Any relation between the size of maximum independent set and the chromatic number on graph of bounded degree?
Jun 13, 2011
answer
11
Conjectures implying Four Color Theorem
Mar 26, 2011
answer
10
Is feedback vertex set problem is solvable in polynomial time for some special graph
Mar 14, 2011
answer
8
Is it enough to sort for polynomially many 0-1 sequences for a sorting network?
Mar 3, 2015
answer
6
Decomposition by Clique Separators
Jul 6, 2012
answer
5
Approximate graph colouring with a promised upper bound on maximum independent set
Oct 19, 2011
answer
5
How to find the first $k$ points of high enough level using a priority search tree?
Apr 6, 2013
Top network posts
View all network posts
101
When should a result be made into a paper?
48
Does every triangle-free graph with maximum degree at most 6 have a 5-colouring?
20
When your paper makes a borderline case for a top journal
10
Does the cubic planar graph with 6 3-faces and 6 7-faces have a name?
9
Most memorable titles

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.