A message from our CEO about the future of Stack Overflow and Stack Exchange. Read now.
Theoretical Computer Science
Meta user
Network profile
1,344
reputation
1
9
30

gphilip

I am currently doing my Ph.D in Theoretical Computer Science at The Institute of Mathematical Sciences, Chennai, India. My advisor is Venkatesh Raman, and our main area of research interest is Parameterized Algorithms and Complexity.

4
answers
5
questions
~126k
people reached
  • Chennai, India
  • imsc.res.in/~gphilip
  • Member for 9 years, 5 months
  • 268 profile views
  • Last seen Feb 12 '14 at 11:13

Communities (14)

Top Meta Posts
2
0

Top network posts

Top tags (22)

Score 31
Posts 2
Posts % 22
Score 16
Posts 1
Score 16
Posts 1
Score 15
Posts 2
Score 0
Posts 4
Score 0
Posts 3
View all tags →

Top posts (9) All Questions Answers | Votes Newest

22 Finding twin vertices in graphs Jan 10 '11
21 How fast can we solve a totally unimodular integer linear program? Jan 21 '11
16 Optimal greedy algorithms for NP-hard problems Sep 14 '10
15 NP-hard problems on trees Sep 13 '10
14 Graph Theory Fun Problem Sep 12 '10
14 How large a treewidth can a tree plus half the edges have? Aug 17 '10
13 Which Integer Linear Programs are easy? Jan 19 '11
11 Algorithms from the Book. Sep 13 '10
7 Graph classes in which CLIQUE is known to be NP-hard? Nov 26 '10

Badges (40)

Gold

1

Rarest

Silver

9

Rarest

Bronze

30

Rarest

View all badges →