Theoretical Computer Science
Andreas Björklund's user avatar
Andreas Björklund's user avatar
Andreas Björklund's user avatar
Andreas Björklund
  • Member for 13 years, 3 months
  • Last seen more than 4 years ago
Profile Activity
Stats
3,254
reputation
43k
reached
27
answers
3
questions
Communities
Badges
View all badges
1
gold badge
22
silver badges
23
bronze badges
Top tags
View all tags
173
Score
19
Posts
63
Posts %
98
Score
11
Posts
37
Posts %
68
Score
8
Posts
27
Posts %
61
Score
8
Posts
27
Posts %
56
Score
5
Posts
17
Posts %
48
Score
6
Posts
20
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
29
What is the fastest way to check for set inclusion?
Jan 25, 2012
answer
21
Counting the Number of Simple Paths in Undirected Graph
Dec 19, 2013
question
18
Parametrized Algorithm for Finding Bicliques
Mar 31, 2012
answer
17
Fastest known algorithm for finding simple paths through given set of vertices
Jan 10, 2012
answer
15
Conditional results implying difficulty of improving upper/lower bounds for permanent
Nov 14, 2011
answer
15
Finding good induced subgraph
Feb 23, 2012
question
13
Pair of vertex disjoint cycles in a directed graph
Nov 10, 2016
answer
13
Algorithms for set packing
Dec 31, 2010
answer
11
Complexity reductions to Hamiltonian Path?
Apr 12, 2013
answer
11
What are the current best upper bounds of #P?
Jun 19, 2013

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.