user avatar
user avatar
user avatar
Serge Gaspers
  • Member for 12 years
  • Last seen more than a month ago
25 votes
Accepted

What is the maximum number of stable marriages for an instance of the Stable Marriage Problem?

24 votes
Accepted

Concepts in theoretical CS that would be approachable ages 8-14

23 votes
Accepted

How many distinct colors are needed to lower-bound the choosability of a graph?

21 votes
Accepted

Integer programming with a fixed number of variables

20 votes
Accepted

Computational complexity of the 3-partition problem with distinct numbers

17 votes
Accepted

Super-polynomial time approximation algorithms for optimization problems

17 votes

References for Modular Decomposition

16 votes
Accepted

Relation between fixed parameter and approximation algorithm

15 votes
Accepted

Counting the number of vertex covers: when is it hard?

15 votes

What is the correct definition of $k$-tree?

13 votes

What is the complexity class most closely associated with what the human mind can accomplish quickly?

13 votes

Problems with Unknown Single Exponential Time Agorithms

12 votes
Accepted

Is there any triangle-free, star-cutset-free, circle graph, with more than n edges?

11 votes
Accepted

Instance of FPT-reductions that is not a polynomial-time reduction

11 votes

Is parametrized maximum independent clauses problem in FPT?

10 votes
Accepted

Computation of max H-free sets

10 votes

"All-different hypergraph coloring" - known problem?

10 votes

Monitoring PhD positions in TCS

9 votes

Terminology for complete k-partite graph where k is not fixed

9 votes
Accepted

Complexity of the edge-disjoint cycle covers

9 votes

Are there NP-complete problems with polynomial expected time solutions?

9 votes

How large a treewidth can a tree plus half the edges have?

8 votes

Other kinds of running time analysis besides worst-case, average-case, etc?

8 votes
Accepted

SERF-reducibility and subexponential algorithms

7 votes

enumerating all connected induced subgraphs

7 votes
Accepted

Directed NP-hard problems on DAGs

6 votes

Finding the longest path between two nodes in a bidirectional unweighted graph

6 votes

The number of cliques in a graph: the Moon and Moser 1965 result

6 votes
Accepted

Is it known whether hypergraph minimal covers are P-enumerable?

6 votes

Can Lenstra's algorithm output all feasible solutions in O^*(f(k)) time where k is the number of variables and f is a computable function in k?