Geevarghese Philip
Geevarghese Philip
Assistant Professor, Chennai Mathematical Institute
Verified email at cmi.ac.in - Homepage
Title
Cited by
Cited by
Year
Hitting forbidden minors: Approximation and kernelization
FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh
arXiv preprint arXiv:1010.1365, 2010
472010
Solving dominating set in larger classes of graphs: FPT algorithms and polynomial kernels
G Philip, V Raman, S Sikdar
European Symposium on Algorithms, 694-705, 2009
442009
On the kernelization complexity of colorful motifs
AM Ambalath, R Balasundaram, C Rao, V Koppula, N Misra, G Philip, ...
International Symposium on Parameterized and Exact Computation, 14-25, 2010
392010
Point line cover: The easy kernel is essentially tight
S Kratsch, G Philip, S Ray
ACM Transactions on Algorithms (TALG) 12 (3), 1-16, 2016
382016
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
G Philip, V Raman, S Sikdar
ACM Transactions on Algorithms (TALG) 9 (1), 1-23, 2012
382012
FPT algorithms for connected feedback vertex set
N Misra, G Philip, V Raman, S Saurabh, S Sikdar
Journal of Combinatorial Optimization 24 (2), 131-146, 2012
352012
On parameterized independent feedback vertex set
N Misra, G Philip, V Raman, S Saurabh
Theoretical Computer Science 461, 65-75, 2012
272012
Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee
S Garg, G Philip
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
232016
FPT algorithms for connected feedback vertex set
N Misra, G Philip, V Raman, S Saurabh, S Sikdar
International Workshop on Algorithms and Computation, 269-280, 2010
212010
Dominating set is fixed parameter tractable in claw-free graphs
M Cygan, G Philip, M Pilipczuk, M Pilipczuk, JO Wojtaszczyk
Theoretical Computer Science 412 (50), 6982-7000, 2011
202011
Hitting forbidden minors: Approximation and kernelization
FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh
SIAM Journal on Discrete Mathematics 30 (1), 383-410, 2016
192016
The effect of homogeneity on the computational complexity of combinatorial data anonymization
R Bredereck, A Nichterlein, R Niedermeier, G Philip
Data Mining and Knowledge Discovery 28 (1), 65-91, 2014
182014
Algorithmic aspects of dominator colorings in graphs
S Arumugam, KR Chandrasekar, N Misra, G Philip, S Saurabh
International Workshop on Combinatorial Algorithms, 19-30, 2011
182011
Ranking and drawing in subexponential time
H Fernau, FV Fomin, D Lokshtanov, M Mnich, G Philip, S Saurabh
International Workshop on Combinatorial Algorithms, 337-348, 2010
182010
Hardness of r-dominating set on graphs of diameter (r+ 1)
D Lokshtanov, N Misra, G Philip, MS Ramanujan, S Saurabh
International Symposium on Parameterized and Exact Computation, 255-267, 2013
172013
A single-exponential FPT algorithm for the K4-minor cover problem
EJ Kim, C Paul, G Philip
Journal of Computer and System Sciences 81 (1), 186-207, 2015
162015
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak–Turzík bound
M Mnich, G Philip, S Saurabh, O Suchý
Journal of Computer and System Sciences 80 (7), 1384-1403, 2014
162014
A quartic kernel for pathwidth-one vertex deletion
G Philip, V Raman, Y Villanger
International Workshop on Graph-Theoretic Concepts in Computer Science, 196-207, 2010
162010
Using patterns to form homogeneous teams
R Bredereck, T Köhler, A Nichterlein, R Niedermeier, G Philip
Algorithmica 71 (2), 517-538, 2015
122015
The kernelization complexity of some domination and covering problems
G Philip
Homi Bhabha National Institute India, 2011
122011
The system can't perform the operation now. Try again later.
Articles 1–20