user avatar
user avatar
user avatar
Hsien-Chih Chang 張顯之
  • Member for 11 years, 10 months
  • Last seen more than a week ago
63 votes
Accepted

Are there any open problems left about DFAs?

46 votes

Common false beliefs in theoretical computer science

22 votes

Common false beliefs in theoretical computer science

21 votes

Conditions for NFA universality

19 votes

Open problems on the frontiers of TCS

19 votes
Accepted

Lower Bounds for Data Structures

18 votes

Does LOGLOG = NLOGLOG?

16 votes

What Books Should Everyone Read?

15 votes
Accepted

What's the approximation factor of this Max k-Cut approximation?

15 votes
Accepted

Logspace algorithms on graphs with bounded tree width

15 votes

what is easy for minor-excluded graphs?

15 votes

Subexponentially solvable hard graph problems

14 votes

Hardness jumps in computational complexity?

14 votes

Finding a prime greater than a given bound

14 votes
Accepted

Circle graph visualisation

13 votes
Accepted

Ramsey's theorem for collections of sets

13 votes

Tree decomposition for planar graphs

13 votes
Accepted

“Overflow” in Extended Euclidean Algorithm

12 votes

Reference for (odd-hole,antihole)-free graphs?

12 votes

Common false beliefs in theoretical computer science

12 votes

How do you get a "Physical Intuition" for results in TCS?

12 votes

Drawing graphs of bounded crossing number

11 votes
Accepted

Venues for short research articles

11 votes

Classes of graphs with easy Hamiltonian cycle but NP-hard TSP

11 votes

Max-cut with negative weight edges

10 votes

Criteria to determine if a complement of a graph has odd-holes

9 votes
Accepted

What is the Complexity Status of Arbitarily Weighted Planar Max Cut?

9 votes

Is this graph transformation unique up to isomorphism? [Answer:NO]

8 votes

Finding twin vertices in graphs

8 votes

Relation between hardness of recognition of a graph class and forbidden subgraph characterization