Stack Exchange

Serge Gaspers

Sydney, Australia

cse.unsw.edu.au/~sergeg

Age: 32

top accounts reputation activity favorites subscriptions
Top Questions
Top Answers
21
Concepts in theoretical CS that would be approachable ages 8-14
cstheory.stackexchange.com

19
What is the maximum number of stable marriages for an instance of the Stable Marriage Problem?
cstheory.stackexchange.com

15
How many distinct colors are needed to lower-bound the choosability of a graph?
cstheory.stackexchange.com

15
Relation between fixed parameter and approximation algorithm
cstheory.stackexchange.com

15
Super-polynomial time approximation algorithms for optimization problems
cstheory.stackexchange.com

14
Computational complexity of the 3-partition problem with distinct numbers
cstheory.stackexchange.com

12
Counting the number of vertex covers: when is it hard?
cstheory.stackexchange.com

12
References for Modular Decomposition
cstheory.stackexchange.com

12
Integer programming with a fixed number of variables
cstheory.stackexchange.com

11
Instance of FPT-reductions that is not a polynomial-time reduction
cstheory.stackexchange.com

10
Is parametrized maximum independent clauses problem in FPT?
cstheory.stackexchange.com

10
What is the correct definition of k-tree?
cstheory.stackexchange.com

9
Computation of max H-free sets
cstheory.stackexchange.com

9
What is the complexity class most closely associated with what the human mind can accomplish quickly?
cstheory.stackexchange.com

9
Monitoring PhD positions in TCS
cstheory.stackexchange.com

7
Other kinds of running time analysis besides worst-case, average-case, etc?
cstheory.stackexchange.com

7
SERF-reducibility and subexponential algorithms
cstheory.stackexchange.com

6
How large a treewidth can a tree plus half the edges have?
cstheory.stackexchange.com

6
Are there NP-complete problems with polynomial expected time solutions?
cstheory.stackexchange.com

6
The number of cliques in a graph: the Moon and Moser 1965 result
cstheory.stackexchange.com

5
What is the complexity of computing a compatible 3-coloring of a complete graph?
cstheory.stackexchange.com

5
Directed NP-hard problems on DAGs
cstheory.stackexchange.com

5
Finding the longest path between two nodes in a bidirectional unweighted graph
cstheory.stackexchange.com

5
enumerating all connected induced subgraphs
cstheory.stackexchange.com