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
Juho
top
accounts
reputation
activity
subscriptions
Top Questions
31
votes
Has there been a computer search for a 5-chromatic unit distance graph?
graph-theory
graph-colorings
asked Apr 16, 2016 at 13:12
mathoverflow.net
29
votes
Is there a reason to spread your research into multiple journals instead of just one?
publishing
journals
asked Aug 5, 2014 at 9:21
academia.stackexchange.com
24
votes
Finding all simple paths between two vertices in a graph
graphs-and-networks
asked May 24, 2013 at 4:50
mathematica.stackexchange.com
22
votes
How can I generate as many parameters as is the arity of a function?
c++
c++11
asked May 14, 2014 at 8:32
stackoverflow.com
20
votes
Supporting data structures for SAT local search
algorithms
data-structures
satisfiability
asked Apr 5, 2012 at 16:08
cs.stackexchange.com
20
votes
Problems for which algorithms based on partition refinement run faster than in loglinear time
algorithms
reference-request
data-structures
partitions
sets
asked Oct 2, 2012 at 17:25
cs.stackexchange.com
19
votes
What separates easy global problems from hard global problems on graphs of bounded treewidth?
graph-theory
graph-algorithms
treewidth
asked Sep 24, 2014 at 11:27
cstheory.stackexchange.com
16
votes
Runtime of the optimal greedy $2$-approximation algorithm for the $k$-clustering problem
algorithms
computational-geometry
asked Apr 25, 2012 at 19:34
cs.stackexchange.com
15
votes
Decision problems in $\mathsf{P}$ without fast algorithms
algorithms
complexity-theory
reference-request
asked Jul 10, 2013 at 15:22
cs.stackexchange.com
14
votes
Research on evaluating the performance of cache-obliviousness in practice
algorithms
data-structures
computer-architecture
reference-request
cpu-cache
asked Mar 24, 2012 at 13:51
cs.stackexchange.com
1
2
3
4
next
Top Answers
74
How to fool the "try some test cases" heuristic: Algorithms that appear correct, but are actually incorrect
cs.stackexchange.com
34
How to deal with last comma, when making comma separated string?
stackoverflow.com
34
How to measure "sortedness"
cs.stackexchange.com
34
Is there a name for the class of algorithms that are the most efficient for a particular task?
cs.stackexchange.com
28
What are GPUs bad at?
cs.stackexchange.com
26
Measuring the difficulty of SAT instances
cs.stackexchange.com
25
NP-hard problems on paths
cstheory.stackexchange.com
25
C++ Calculator for complex numbers
codereview.stackexchange.com
25
What are some real world applications of graphs?
cs.stackexchange.com
21
How can I verify a solution to Travelling Salesman Problem in polynomial time?
cs.stackexchange.com
21
Is there a sometimes-efficient algorithm to solve #SAT?
cs.stackexchange.com
21
$O(n^{k-1}$) algorithm for K-clique problem
cs.stackexchange.com
19
When to use recursion?
cs.stackexchange.com
18
What randomness really is
cs.stackexchange.com
18
Classification of intractable/tractable satisfiability problem variants
cs.stackexchange.com
18
Does a graph always have a minimum spanning tree that is binary?
cs.stackexchange.com
18
What would be the real-world implications of a constructive $P=NP$ proof?
cs.stackexchange.com
17
The time complexity of finding the diameter of a graph
cs.stackexchange.com
17
What does the 2 in a 2-approximation algorithm mean?
cs.stackexchange.com
16
What is an asymptotically tight upper bound?
cs.stackexchange.com
16
What are common techniques for reducing problems to each other?
cs.stackexchange.com
16
Generating inputs for random-testing graph algorithms?
cs.stackexchange.com
15
If all edges are of equal weight, can one use BFS to obtain a minimal spanning tree?
cs.stackexchange.com
15
Check whether a lowercase string has any character repetition
codereview.stackexchange.com
14
What are good approximation algorithms for the subset sum problem so far?
cstheory.stackexchange.com
14
Finding the minimum cut of an undirected graph
cs.stackexchange.com
13
Finding all simple paths between two vertices in a graph
mathematica.stackexchange.com
13
Are there variations of the regular runtimes of the Big-O-Notation?
cs.stackexchange.com
13
Efficient map data structure supporting approximate lookup
cs.stackexchange.com
13
Do you ever "download" a language?
cs.stackexchange.com
1
2
3
4
5
6
next
Stack Exchange works best with JavaScript enabled