Serge Gaspers
  • Member for 11 years, 5 months
  • Last seen more than a month ago
42 answers
82 votes
17k views
75 bookmarks
Funny TCS-related papers etc?
6 answers
57 votes
3k views
27 bookmarks
Theoretical explanations for practical success of SAT solvers?
1 answers
40 votes
2k views
11 bookmarks
Importance of single author papers?
2 answers
39 votes
969 views
11 bookmarks
How many distinct colors are needed to lower-bound the choosability of a graph?
3 answers
37 votes
2k views
5 bookmarks
Parameterized complexity of Hitting Set in finite VC-dimension
3 answers
34 votes
962 views
21 bookmarks
An Anthology of Complexity Assumptions
11 answers
32 votes
2k views
18 bookmarks
What is the quantum computational model?
2 answers
27 votes
1k views
11 bookmarks
Is it possible to find if a sequence exists in polynomial time in the following problem?
2 answers
24 votes
1k views
5 bookmarks
What is the best exact algorithm to compute the core of a graph?
1 answers
23 votes
818 views
7 bookmarks
Required delta between proceedings and journal versions
2 answers
21 votes
1k views
6 bookmarks
Is feedback vertex set problem solvable in polynomial time for 3-degree bounded graphs?
1 answers
21 votes
360 views
8 bookmarks
Consensus clustering using set union
2 answers
17 votes
404 views
2 bookmarks
Generalization of locally bounded treewidth graphs
2 answers
13 votes
378 views
4 bookmarks
H-free partition
1 answers
11 votes
229 views
3 bookmarks
A survey on separators?
0 answers
9 votes
468 views
2 bookmarks
When is CSP faster than SMT/SAT?
1 answers
7 votes
946 views
2 bookmarks
K-Clustering of a Graph maximizing intra-cluster weights?
0 answers
7 votes
386 views
2 bookmarks
Embedded dynamic programming (and planar subgraph isomorphism)
3 answers
5 votes
459 views
2 bookmarks
Partitioning a segmented stick
0 answers
5 votes
91 views
3 bookmarks
Reference request for a $\Delta_2^P$ satisfiability problem
0 answers
2 votes
61 views
1 bookmarks
Parameterized Complexity of Minimum Type Selection
0 answers
1 votes
207 views
1 bookmarks
Upper bound for set cover with respect to m that is better than trivial when $n \ge 3m$