Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top Users
Digests
Andreas Björklund
top
accounts
reputation
activity
bookmarks
subscriptions
Top Questions
18
votes
Parametrized Algorithm for Finding Bicliques
ds.algorithms
reference-request
graph-algorithms
parameterized-complexity
asked Mar 31, 2012 at 7:59
cstheory.stackexchange.com
14
votes
Pair of vertex disjoint cycles in a directed graph
reference-request
asked Nov 10, 2016 at 19:15
cstheory.stackexchange.com
10
votes
Parametrized Complexity of Counting Bicliques
cc.complexity-theory
graph-theory
counting-complexity
parameterized-complexity
asked Apr 10, 2012 at 10:13
cstheory.stackexchange.com
Top Answers
29
What is the fastest way to check for set inclusion?
cstheory.stackexchange.com
21
Counting the Number of Simple Paths in Undirected Graph
cstheory.stackexchange.com
17
Fastest known algorithm for finding simple paths through given set of vertices
cstheory.stackexchange.com
15
Finding good induced subgraph
cstheory.stackexchange.com
15
Conditional results implying difficulty of improving upper/lower bounds for permanent
cstheory.stackexchange.com
13
Algorithms for set packing
cstheory.stackexchange.com
11
What are the current best upper bounds of #P?
cstheory.stackexchange.com
11
Complexity reductions to Hamiltonian Path?
cstheory.stackexchange.com
10
Exact algorithm for edge coloring
cstheory.stackexchange.com
10
Natural NP-complete problems with "large" witnesses
cstheory.stackexchange.com
9
counting independent sets
cstheory.stackexchange.com
9
Chromatic number of a particular graph
cstheory.stackexchange.com
8
Implemented code to compute pathwidth (= Node search number, vertex separation number, interval thickness)
cstheory.stackexchange.com
8
Best bounds for the longest path optimization problem in cubic Hamiltonian graph?
cstheory.stackexchange.com
8
What are the best known upper bounds and lower bounds for computing O(log n)-Clique?
cstheory.stackexchange.com
8
Finding number of cycles of length $k$ in a graph
cstheory.stackexchange.com
8
Sub-exponential algorithm for Hamiltonian cycle problem on cubic planar graphs?
cstheory.stackexchange.com
8
On complexity of permanent ${}\bmod 2^t$?
cstheory.stackexchange.com
6
Sorting "k-tonic" sequences
cstheory.stackexchange.com
6
My exact divide-conquer algorithm for counting antichain in a poset?
cstheory.stackexchange.com
6
Constructing a k-perfect permutations family
cstheory.stackexchange.com
6
On Zero sum perfect matching
cstheory.stackexchange.com
5
Solving Superstring Exactly
cstheory.stackexchange.com
5
Finding largest subgraph that contains a given edge and admits a cycle cover
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com