Theoretical Computer Science
Arman's user avatar
Arman's user avatar
Arman's user avatar
Arman
  • Member for 12 years, 6 months
  • Last seen more than 1 year ago
Profile Activity
Stats
934
reputation
12k
reached
2
answers
8
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
7
silver badges
14
bronze badges
Top tags
View all tags
21
Score
4
Posts
40
Posts %
16
Score
4
Posts
40
Posts %
16
Score
4
Posts
40
Posts %
16
Score
2
Posts
20
Posts %
16
Score
1
Posts
10
Posts %
5
Score
2
Posts
20
Posts %
Top posts
All Questions Answers
Score Newest
answer
16
Generalization of the Hungarian algorithm to general undirected graphs?
Dec 25, 2010
question
14
Application of Ramsey Numbers
Dec 26, 2011
question
10
Is there any other algorithm whose worst-case running time is exponential meanwhile it works very well in practice other than Simplex Algorithm?
Nov 18, 2010
question
9
How can I randomly generate bounded height spanning trees?
Dec 21, 2010
question
9
Clique Enumeration Algorithm
Dec 3, 2011
question
6
Decomposition by Clique Separators
Jun 30, 2012
answer
5
graphs from real-life problems
Nov 30, 2010
question
5
Hardness of finding a graph coloring given the optimal number of colors
Jan 19, 2011
question
5
Resources for complexity results for optimization problems in restricted graph classes
Dec 12, 2010
question
2
Necessary and sufficient conditions for the existence of a combinatorial algorithm for a given problem.
Jan 21, 2011

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.