Tour
About Us
Meta
Loading…
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
Log in
Stack Exchange
All Sites
Top Users
Digests
Yoshio Okamoto
Tokyo, Japan
http://dopal.cs.uec.ac.jp/okamotoy/
At University of Electro-Communications, Japan
top
accounts
reputation
activity
subscriptions
Top Questions
No questions with score of 5 or more
Top Answers
19
Minimum Flip Connectivity Problem
cstheory.stackexchange.com
18
Counting the number of distinct s-t cuts in a oriented graph
cstheory.stackexchange.com
18
Mathematical analysis and computational complexity?
cstheory.stackexchange.com
16
Geometric problems that are NP-complete in $R^3$ but tractable in $R^2$?
cstheory.stackexchange.com
16
Which Integer Linear Programs are easy?
cstheory.stackexchange.com
14
Early references for discrete optimization
cstheory.stackexchange.com
13
Clique Enumeration Algorithm
cstheory.stackexchange.com
13
Approximation algorithms used in exact algorithms
cstheory.stackexchange.com
12
Exact algorithms for non-convex quadratic programming
cstheory.stackexchange.com
11
Surprising algorithms for counting problems
cstheory.stackexchange.com
11
Minimum maximal solutions of LPs
cstheory.stackexchange.com
10
Are edge-vertex graphs of polytopes (decent) expanders?
cstheory.stackexchange.com
10
Partitioning a segmented stick
cstheory.stackexchange.com
10
$NP$-hardness of scheduling problem
cstheory.stackexchange.com
9
Best known algorithm for a common problem.
cstheory.stackexchange.com
9
Gröbner bases in TCS?
cstheory.stackexchange.com
9
Approximation algorithms for dominating set problem
cstheory.stackexchange.com
8
What are the root difficulties in going from graphs to hypergraphs?
cstheory.stackexchange.com
8
How hard is it to count the number of local optima for a problem in PLS?
cstheory.stackexchange.com
8
Path on an edge-colored DAG using exactly $k$ colors
cs.stackexchange.com
8
Sorting sequence with $O(n^{\frac{3}{2}})$ inversions
cstheory.stackexchange.com
7
Counting Metrics
cstheory.stackexchange.com
7
Worst number of questions needed to learn a monotonic predicate over a poset
cstheory.stackexchange.com
6
Is feedback vertex set problem is solvable in polynomial time for some special graph
cstheory.stackexchange.com
6
Explaining input-size of integral arguments to undergraduate CS students
cstheory.stackexchange.com
6
Necessary and sufficient conditions for the existence of a combinatorial algorithm for a given problem.
cstheory.stackexchange.com
5
approximating problems described by multiple parameters
cstheory.stackexchange.com
5
Does faster exact algorithm for counting independent sets in comparability graphs than general graph exisits?
cstheory.stackexchange.com
5
Instance of FPT-reductions that is not a polynomial-time reduction
cstheory.stackexchange.com
5
Formal notion for energy complexity of computational problems
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled