Tour
About Us
Meta
Loading…
Log in
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
Stack Exchange
All Sites
Top Users
Digests
Yixin Cao
Hong Kong
http://www4.comp.polyu.edu.hk/~csycao/
A farmer obsessed with mathematics.
top
accounts
reputation
activity
bookmarks
subscriptions
Top Questions
20
votes
Is it necessary to call matrix multiplication $n$ times to find a claw
graph-theory
graph-algorithms
graph-classes
asked Apr 30 '14 at 15:15
cstheory.stackexchange.com
13
votes
Does this graph class have a name ?
graph-theory
graph-classes
asked Dec 4 '12 at 10:26
cstheory.stackexchange.com
11
votes
An improper planar coloring with monochromatic component size $\leq 2$
cc.complexity-theory
graph-theory
graph-colouring
planar-graphs
asked Nov 8 '12 at 17:56
cstheory.stackexchange.com
9
votes
Tight examples for approximating the feedback vertex set problem
reference-request
graph-algorithms
approximation-algorithms
asked Apr 6 '14 at 1:33
cstheory.stackexchange.com
9
votes
The source of the modular decomposition graph
reference-request
graph-theory
asked Oct 2 '19 at 5:36
cstheory.stackexchange.com
8
votes
3-color a cubic graph such that a MIS receives only two colors
reference-request
graph-theory
co.combinatorics
graph-colouring
asked May 16 '16 at 15:33
cstheory.stackexchange.com
8
votes
Lower bound on the size of maximum interval induced subgraphs of an $n$-vertex graph $G$
reference-request
extremal-combinatorics
interval-graphs
asked Aug 23 '13 at 14:42
cstheory.stackexchange.com
7
votes
Can we achieve a better kernel for the Vertex Cover problem on planar graphs?
ds.algorithms
planar-graphs
parameterized-complexity
vertex-cover
kernelization
asked Mar 27 '12 at 20:42
cstheory.stackexchange.com
6
votes
On the optimal solution of the CKR formulation for MULTIWAY CUT
ds.algorithms
approximation-algorithms
linear-programming
multicommodity-flow
asked Apr 19 '12 at 3:45
cstheory.stackexchange.com
5
votes
Is there a W[1]-hard problem that can be solved in $2^{o(n)}$ time?
reference-request
parameterized-complexity
exp-time-algorithms
asked Feb 5 '17 at 14:05
cstheory.stackexchange.com
Top Answers
21
Any fundamental papers in TCS which were found to be incorrect/wrong later?
cstheory.stackexchange.com
18
Problems with complexity between P and NP that have NP-complete generalizations
cstheory.stackexchange.com
13
Natural complete problems in higher levels of the $\mathsf{W}$-hierarchy
cstheory.stackexchange.com
11
Is feedback vertex set problem is solvable in polynomial time for 3-degree bounded graphs?
cstheory.stackexchange.com
11
Polynomial-time algorithms with huge exponent/constant
cstheory.stackexchange.com
11
Are there applications of modular graph decomposition in TCS/complexity theory?
cstheory.stackexchange.com
9
Graph partitioning, balancing on within subset edge weights
cstheory.stackexchange.com
9
List of TCS conferences along with important dates
cstheory.stackexchange.com
7
The source of the modular decomposition graph
cstheory.stackexchange.com
6
History and status of the graph matching problem
cstheory.stackexchange.com
5
Is this greedy algorithm for vertex cover studied before?
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled