Theoretical Computer Science
Neeldhara's user avatar
Neeldhara's user avatar
Neeldhara's user avatar
Neeldhara
  • Member for 13 years, 3 months
  • Last seen more than 3 years ago
Profile Activity
Stats
599
reputation
26k
reached
7
answers
3
questions
Communities
View all
About

I spend most of my time between a keyboard and chair at the Insitute of Mathematical Sciences, Chennai. I am pursuing graduate studies in Theoretical Computer Science. I have developed some interest in counting, graph theory, algorithms, logic, and parameterized complexity.

Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
15
bronze badges
Top tags
View all tags
9
Score
3
Posts
30
Posts %
7
Score
4
Posts
40
Posts %
6
Score
1
Posts
10
Posts %
6
Score
1
Posts
10
Posts %
6
Score
1
Posts
10
Posts %
4
Score
6
Posts
60
Posts %
Top posts
All Questions Answers
Score Newest
question
23
Reductions from the book.
Aug 31, 2010
question
19
Construction of graphs where every pair of vertices have an unique common neighbor
Aug 29, 2010
question
13
H-free partition
Sep 2, 2010
answer
13
Everyday encounters with NP-complete problems
Aug 29, 2010
answer
6
Is parametrized maximum independent clauses problem in FPT?
Sep 4, 2010
answer
6
How hard is unshuffling a string?
Aug 29, 2010
answer
4
Which algorithms are used most often in practice?
Sep 4, 2010
answer
2
H-free cut problem
Aug 29, 2010
answer
1
Is it hard to find optimal addition chains?
Sep 4, 2010
answer
1
Is "meeting/room planning" NP-complete?
Sep 6, 2012
Top Meta posts
0
1
3
On using actual names

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.