Geevarghese Philip

Cited by

	All	Since 2019
Citations	1059	567
h-index	20	14
i10-index	33	19

120

20092010201120122013201420152016201720182019202020212022202320248 13 31 50 63 43 66 54 83 62 77 82 72 108 112 111

Public access

View all

20 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Lars JaffkeNHH Norwegian School of Economics, NorwayVerified email at nhh.no
Fahad PanolanSchool of Computing, University of LeedsVerified email at leeds.ac.uk
Ramanujan M. S.University of Warwick, UKVerified email at warwick.ac.uk
Robert BredereckTU ClausthalVerified email at tu-clausthal.de
André NichterleinTU BerlinVerified email at tu-berlin.de
Rolf NiedermeierTU BerlinVerified email at tu-berlin.de
Matthias MnichTU HamburgVerified email at tuhh.de
Tomáš MasaříkUniversity of WarsawVerified email at mimuw.edu.pl
Henning FernauProfessor für Informatik, Universität TrierVerified email at uni-trier.de
Pranabendu MisraAssistant Professor at Chennai Mathematical InstituteVerified email at cmi.ac.in
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Frances RosamondLebanese American University, Beirut and Western Sydney University, AustraliaVerified email at lau.edu.lb
Mateus de Oliveira OliveiraStockholm UniversityVerified email at uib.no
Christophe PaulCNRS LIRMMVerified email at lirmm.fr
Eun Jung KimKAIST, CNRSVerified email at kaist.ac.kr
Ashutosh RaiDepartment of Mathematics, IIT DelhiVerified email at maths.iitd.ac.in

Geevarghese Philip

Faculty Member at Chennai Mathematical Institute

Verified email at cmi.ac.in - Homepage

Parameterized Complexity Algorithms Data Structures


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	65	2012
Solving dominating set in larger classes of graphs: FPT algorithms and polynomial kernels G Philip, V Raman, S Sikdar Algorithms-ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark …, 2009	58*	2009
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	57	2016
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory J Baste, MR Fellows, L Jaffke, T Masařík, M de Oliveira Oliveira, G Philip, ... Artificial Intelligence 303, 103644, 2022	56	2022
FPT algorithms for connected feedback vertex set N Misra, G Philip, V Raman, S Saurabh, S Sikdar Journal of Combinatorial Optimization 24, 131-146, 2012	54	2012
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	50	2016
On parameterized independent feedback vertex set N Misra, G Philip, V Raman, S Saurabh Theoretical Computer Science 461, 65-75, 2012	48	2012
Hitting forbidden minors: Approximation and kernelization FV Fomin, D Lokshtanov, N Misra, G Philip, S Saurabh arXiv preprint arXiv:1010.1365, 2010	46	2010
Algorithmic aspects of dominator colorings in graphs S Arumugam, KR Chandrasekar, N Misra, G Philip, S Saurabh Combinatorial Algorithms: 22nd International Workshop, IWOCA 2011, Victoria …, 2011	42	2011
On the kernelization complexity of colorful motifs AM Ambalath, R Balasundaram, C Rao H, V Koppula, N Misra, G Philip, ... Parameterized and Exact Computation: 5th International Symposium, IPEC 2010 …, 2010	42	2010
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	41	2016
FPT algorithms for diverse collections of hitting sets J Baste, L Jaffke, T Masařík, G Philip, G Rote Algorithms 12 (12), 254, 2019	30	2019
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	30	2010
Diverse pairs of matchings FV Fomin, PA Golovach, L Jaffke, G Philip, D Sagunov arXiv preprint arXiv:2009.04567, 2020	29	2020
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	27	2011
Hardness of r-dominating set on Graphs of Diameter (r + 1) D Lokshtanov, N Misra, G Philip, MS Ramanujan, S Saurabh Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013	26	2013
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	25	2010
2-approximating feedback vertex set in tournaments D Lokshtanov, P Misra, J Mukherjee, F Panolan, G Philip, S Saurabh ACM Transactions on Algorithms (TALG) 17 (2), 1-14, 2021	22	2021
Generalized pseudoforest deletion: Algorithms and uniform kernel G Philip, A Rai, S Saurabh SIAM Journal on Discrete Mathematics 32 (2), 882-901, 2018	20	2018
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, 65-91, 2014	20	2014

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors