Theoretical Computer Science
user avatar
user avatar
user avatar
gphilip
  • Member for 11 years, 10 months
  • Last seen more than 8 years ago
Profile Activity
Stats
1,384
reputation
133k
reached
4
answers
5
questions
Communities
View all
About

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.

Badges
View all badges
1
gold badge
11
silver badges
31
bronze badges
Top tags
View all tags
31
Score
2
Posts
22
Posts %
16
Score
1
Posts
11
Posts %
16
Score
1
Posts
11
Posts %
15
Score
2
Posts
22
Posts %
0
Score
4
Posts
44
Posts %
0
Score
3
Posts
33
Posts %
Top posts
All Questions Answers
Score Newest
question
25
Finding twin vertices in graphs
Jan 10, 2011
question
22
How fast can we solve a totally unimodular integer linear program?
Jan 21, 2011
answer
16
Optimal greedy algorithms for NP-hard problems
Sep 14, 2010
answer
15
NP-hard problems on trees
Sep 13, 2010
answer
14
Graph Theory Fun Problem
Sep 12, 2010
question
14
How large a treewidth can a tree plus half the edges have?
Aug 17, 2010
question
13
Which Integer Linear Programs are easy?
Jan 19, 2011
answer
11
Algorithms from the Book.
Sep 13, 2010
question
7
Graph classes in which CLIQUE is known to be NP-hard?
Nov 26, 2010
Top Meta posts
2
0
4
Should we add an encouragement to vote à la MO ?
3
About the closing status of "Binary - How does it work?"
Top network posts
View all network posts
102
LaTeX Editors/IDEs
75
Beamer: Creating a slide with short, centered, prominent text
67
Why is $\pi $ equal to $3.14159...$?
23
What is the right way to use of non-breakable space before math expressions?
13
How do I include a click-to-zoom thumbnail picture in a non-beamer document?

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.