Andreas Björklund

Member for 13 years, 1 month
Last seen more than 4 years ago

Summary

Reputation

3,254

3.3k
3.2k
3.1k

2020
2021
2022
2023

Top tag

ds.algorithms

Next privilege

5,000 Rep.

Approve tag wiki edits

Badges

1

22

23

Newest

Yearling

Next badge

0/1

Excavator

Answers

View all 27 answers

Score Activity Newest

29

What is the fastest way to check for set inclusion?

Jan 25, 2012

21

Counting the Number of Simple Paths in Undirected Graph

Dec 19, 2013

17

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

Jan 10, 2012

15

Finding good induced subgraph

Feb 23, 2012

15

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

Nov 14, 2011

Questions

Score Activity Newest Views

18

Parametrized Algorithm for Finding Bicliques

Mar 31, 2012

13

Pair of vertex disjoint cycles in a directed graph

Nov 10, 2016

10

Parametrized Complexity of Counting Bicliques

Apr 10, 2012

Tags

View all 36 tags

ds.algorithms

173

Score

19

posts

graph-theory

98

Score

11

posts

reference-request

68

Score

8

posts

cc.complexity-theory

61

Score

8

posts

counting-complexity

56

Score

5

posts

Reputation

This user has no recent positive reputation changes.

Badges

View all badges

1

gold badge

Fanatic

Mar 29, 2018

22

silver badges

Constituent

Jan 21, 2014
Enthusiast

Jan 7, 2011
Good Answer

Aug 22, 2013

23

bronze badges

Custodian

Jan 3, 2014
Caucus

× 2

Jun 26, 2018
Critic

Sep 5, 2011

Accounts

Theoretical Computer Science

3,254
1
22
23

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

70

upvotes

2

downvotes

12

question votes

60

answer votes