Skip to main content
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 14 years
  • Last seen more than 5 years ago
Profile Activity

27 Answers

Score Activity Newest
30 votes
Accepted

What is the fastest way to check for set inclusion?

21 votes

Counting the Number of Simple Paths in Undirected Graph

17 votes
Accepted

Fastest known algorithm for finding simple paths through given set of vertices

15 votes
Accepted

Finding good induced subgraph

15 votes

Conditional results implying difficulty of improving upper/lower bounds for permanent

13 votes
Accepted

Algorithms for set packing

11 votes

Complexity reductions to Hamiltonian Path?

11 votes
Accepted

What are the current best upper bounds of #P?

10 votes

Natural NP-complete problems with "large" witnesses

10 votes

Exact algorithm for edge coloring

9 votes
Accepted

Chromatic number of a particular graph

9 votes
Accepted

counting independent sets

9 votes
Accepted

On complexity of permanent ${}\bmod 2^t$?

8 votes

Sub-exponential algorithm for Hamiltonian cycle problem on cubic planar graphs?

8 votes

Finding number of cycles of length $k$ in a graph

8 votes

Best bounds for the longest path optimization problem in cubic Hamiltonian graph?

8 votes

What are the best known upper bounds and lower bounds for computing O(log n)-Clique?

8 votes

Implemented code to compute pathwidth (= Node search number, vertex separation number, interval thickness)

6 votes
Accepted

My exact divide-conquer algorithm for counting antichain in a poset?

6 votes

Sorting "k-tonic" sequences

6 votes
Accepted

Constructing a k-perfect permutations family

5 votes
Accepted

On Zero sum perfect matching

5 votes
Accepted

Solving Superstring Exactly

5 votes

Finding largest subgraph that contains a given edge and admits a cycle cover

4 votes

Special cases of Graphic TSP

4 votes
Accepted

Can the optimal minimum cost two-commodities flow be fractional on this special case?

2 votes
Accepted

What is the algorithmic speed up for Counting Perfect Matchings in Dense Bipartite Graphs (equivalent to Permanent of Dense 0/1 Matrices)?