Geevarghese Philip

Citata da

	Tutte	Dal 2019
Citazioni	1073	580
Indice H	20	14
i10-index	34	19

140

105

20092010201120122013201420152016201720182019202020212022202320248 13 31 50 63 43 66 54 83 62 77 87 72 111 109 122

Accesso pubblico

Visualizza tutto

20 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Saket SaurabhProfessor at Institute of Mathematical SciencesEmail verificata su imsc.res.in
Neeldhara MisraIndian Institute of Technology, GandhinagarEmail verificata su iitgn.ac.in
Fedor V. FominProfessor of Computer Science, University of BergenEmail verificata su uib.no
Daniel LokshtanovProfessor of Computer Science, UCSBEmail verificata su ucsb.edu
Lars JaffkeNHH Norwegian School of Economics, NorwayEmail verificata su nhh.no
Fahad PanolanSchool of Computing, University of LeedsEmail verificata su leeds.ac.uk
Ramanujan M. S.University of Warwick, UKEmail verificata su warwick.ac.uk
Robert BredereckTU ClausthalEmail verificata su tu-clausthal.de
André NichterleinTU BerlinEmail verificata su tu-berlin.de
Rolf NiedermeierTU BerlinEmail verificata su tu-berlin.de
Tomáš MasaříkUniversity of WarsawEmail verificata su mimuw.edu.pl
Matthias MnichTU HamburgEmail verificata su tuhh.de
Henning FernauProfessor für Informatik, Universität TrierEmail verificata su uni-trier.de
Pranabendu MisraAssistant Professor at Chennai Mathematical InstituteEmail verificata su cmi.ac.in
Petr GolovachUniversity of BergenEmail verificata su ii.uib.no
Frances RosamondLebanese American University, Beirut and Western Sydney University, AustraliaEmail verificata su lau.edu.lb
Mateus de Oliveira OliveiraStockholm UniversityEmail verificata su dsv.su.se
Christophe PaulCNRS LIRMMEmail verificata su lirmm.fr
Eun Jung KimKAIST, CNRSEmail verificata su kaist.ac.kr
Ashutosh RaiDepartment of Mathematics, IIT DelhiEmail verificata su maths.iitd.ac.in

Segui

Geevarghese Philip

Faculty Member at Chennai Mathematical Institute

Email verificata su cmi.ac.in - Home page

Parameterized Complexity Algorithms Data Structures


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	66	2012
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	59	2022
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
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	32	2019
Diverse pairs of matchings FV Fomin, PA Golovach, L Jaffke, G Philip, D Sagunov arXiv preprint arXiv:2009.04567, 2020	31	2020
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	31	2010
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	21	2021
Generalized pseudoforest deletion: Algorithms and uniform kernel G Philip, A Rai, S Saurabh SIAM Journal on Discrete Mathematics 32 (2), 882-901, 2018	21	2018
Diverse collections in matroids and graphs FV Fomin, PA Golovach, F Panolan, G Philip, S Saurabh Mathematical Programming 204 (1), 415-447, 2024	20	2024

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori