Stack Exchange

Oleksandr Bondarenko

Kiev, Ukraine

top accounts reputation activity subscriptions
Top Questions
29 votes

How to set LaTeX so that PDF reader opens PDF file in a prespecified view?

pdf viewers asked Apr 23, 2011 at 19:55
tex.stackexchange.com

22 votes

Polynomial time approximation algorithms for machine scheduling: how many open problems are left?

ds.algorithms approximation-algorithms open-problem approximation-hardness scheduling asked Sep 13, 2010 at 17:50
cstheory.stackexchange.com

19 votes

Are there known NP-complete problems, neither NP-hard in the strong sense nor having pseudopolynomial algorithm?

ds.algorithms np-hardness np asked Jul 14, 2011 at 18:11
cstheory.stackexchange.com

18 votes

Degree sets for linear extension graphs

graph-theory co.combinatorics asked Nov 12, 2010 at 0:52
cstheory.stackexchange.com

17 votes

Why differential approximation ratios are not well-studied comparing to standard ones despite of their claimed benefits?

ds.algorithms approximation-algorithms approximation-hardness asked Jan 27, 2011 at 20:49
cstheory.stackexchange.com

15 votes

Theories which characterize classes of computational complexity

cc.complexity-theory reference-request complexity-classes lo.logic proof-complexity asked Jan 31, 2011 at 13:17
cstheory.stackexchange.com

14 votes

"Answer to my question" or "answer on my question"?

word-choice grammaticality prepositions asked Dec 23, 2010 at 1:38
english.stackexchange.com

12 votes

What are the problems with the best approximation ratio achieved by algorithm returning uniformly random solution?

ds.algorithms reference-request approximation-algorithms asked Dec 8, 2010 at 22:39
cstheory.stackexchange.com

10 votes

Is there known any complexity class containing online counterparts of optimization problems?

cc.complexity-theory complexity-classes asked Sep 25, 2010 at 12:37
cstheory.stackexchange.com

9 votes

Why would definition not be proposition?

logic terminology asked Aug 17, 2011 at 22:46
philosophy.stackexchange.com

1 2

Top Answers
31
Conjectures implying Four Color Theorem
cstheory.stackexchange.com

26
Collection contains with @Query
stackoverflow.com

26
Using a prepared statement and variable bind Order By in Java with JDBC driver
stackoverflow.com

23
Ways for a mathematician to stay informed of current research in complexity theory
cstheory.stackexchange.com

22
Collatz Conjecture & Grammars / Automata
cstheory.stackexchange.com

22
Funny TCS-related papers etc?
cstheory.stackexchange.com

21
Spring data CrudRepository exists
stackoverflow.com

18
What are the recent TCS books whose drafts are available online?
cstheory.stackexchange.com

18
Parameterized complexity from P to NP-hard and back again
cstheory.stackexchange.com

17
CriteriaBuilder boolean comparison
stackoverflow.com

17
Polynomial time approximation algorithms for machine scheduling: how many open problems are left?
cstheory.stackexchange.com

15
Which problems in computational geometry or graph theory are believed to be $\Omega(n^3)$?
cstheory.stackexchange.com

15
What is the tradeoff between population size and the number of generations in genetic algorithms
cstheory.stackexchange.com

15
What are the recent TCS books whose drafts are available online?
cstheory.stackexchange.com

13
Examples of hard instances for Goemans and Williamson algorithm
cstheory.stackexchange.com

13
Lovasz theta function and regular graphs (odd cycles in particular) - connections to spectral theory
cstheory.stackexchange.com

13
What Books Should Everyone Read?
cstheory.stackexchange.com

11
Graph planar drawing, with each edge's length is known
cstheory.stackexchange.com

11
Degree sets for linear extension graphs
cstheory.stackexchange.com

10
Mapping jsp for a url in Spring 3 without using controller
stackoverflow.com

10
Problems that are NP-complete under randomized or P/poly reductions.
cstheory.stackexchange.com

10
Is it possible to prove that, for a given problem, no optimal greedy algorithms exist?
cstheory.stackexchange.com

10
What are the problems with the best approximation ratio achieved by algorithm returning uniformly random solution?
cstheory.stackexchange.com

9
Problems Between P and NPC
cstheory.stackexchange.com

9
What Lecture Notes Should Everyone Read?
cstheory.stackexchange.com

8
Poly-time approximation scheme for problems with pseudo-polynomial time algorithms
cstheory.stackexchange.com

8
Time complexity of Bellman-Held-Karp algorithm for TSP, take 2
cstheory.stackexchange.com

8
Problems Between P and NPC
cstheory.stackexchange.com

7
JPQL : multiple join. How to do my namedquery?
stackoverflow.com

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

1 2