Stack Exchange

Serge Gaspers

Sydney, Australia

http://www.cse.unsw.edu.au/~sergeg/

top accounts reputation activity subscriptions
Top Questions
Top Answers
25
What is the maximum number of stable marriages for an instance of the Stable Marriage Problem?
cstheory.stackexchange.com

24
Concepts in theoretical CS that would be approachable ages 8-14
cstheory.stackexchange.com

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

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

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

17
References for Modular Decomposition
cstheory.stackexchange.com

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

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

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

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

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

13
Problems with Unknown Single Exponential Time Agorithms
cstheory.stackexchange.com

12
Is there any triangle-free, star-cutset-free, circle graph, with more than n edges?
cstheory.stackexchange.com

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

11
"All-different hypergraph coloring" - known problem?
cstheory.stackexchange.com

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

10
Monitoring PhD positions in TCS
cstheory.stackexchange.com

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

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

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

9
Terminology for complete k-partite graph where k is not fixed
cstheory.stackexchange.com

9
Complexity of the edge-disjoint cycle covers
cstheory.stackexchange.com

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

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

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

7
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?
cstheory.stackexchange.com

7
enumerating all connected induced subgraphs
cstheory.stackexchange.com

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

6
Is it known whether hypergraph minimal covers are P-enumerable?
cstheory.stackexchange.com

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

1 2