gphilip

less info

network profile

699 reputation

1321

bio	website	imsc.res.in/~gphilip
	location	Chennai, India
	age
visits	member for	1 year, 9 months
	seen	May 8 at 12:24
stats	profile views	175

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.

summary answers questions tags badges favorites bounties reputation activity

5 Questions

votes activity newest

15	Finding twin vertices in graphs
14	How fast can we solve a totally unimodular integer linear program?
13	How large a treewidth can a tree plus half the edges have?
7	Graph classes in which CLIQUE is known to be NP-hard?
6	Which Integer Linear Programs are easy?

699 Reputation

+50	Optimal greedy algorithms for NP-hard problems
+20	How fast can we solve a totally unimodular integer linear program?
+5	Finding twin vertices in graphs
+10	Graph Theory Fun Problem

view more

4 Answers

votes activity newest

14	Graph Theory Fun Problem
10	Optimal greedy algorithms for NP-hard problems
6	Algorithms from the Book.
6	NP-hard problems on trees

21 Tags

14 graph-theory	10 cc.complexity-theory
14 co.combinatorics	10 greedy-algorithms
10 approximation-algorithms	6 np-hardness × 2
10 lower-bounds	6 tree
10 approximation-hardness	0 reference-request × 4

view more

13 Accounts

	Theoretical Computer Science	699 rep	1321
	Area 51	366 rep	15
$TeX - LaTeX$	TeX - LaTeX	285 rep	17
	Stack Overflow	237 rep	18
$Mathematics$	Mathematics	198 rep	17

25 Badges

recent class name

Nice Answer × 2	Citizen Patrol
Booster	Enlightened
Announcer × 6	Nice Question × 3
Publicist	Quorum
Yearling	Organizer

view more

0 Active bounties

active offered earned

This user has no active bounties

155 Votes Cast

all time			by type
149	up		58	question
6	down		97	answer

view more

Theoretical Computer Science - Stack Exchange works best with JavaScript enabled